default search action
M. Paul Laiu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j14]M. Paul Laiu, Eirik Endeve
, James Austin Harris
DG-IMEX method for a two-moment model for radiation transport in the O(v/c) limit. J. Comput. Phys. 520: 113477 (2025) - [j13]Benjamin P. Russo, M. Paul Laiu, Richard Archibald
Streaming Compression of Scientific Data via Weak-SINDy. SIAM J. Sci. Comput. 47(1): 207- (2025) - [i13]Joseph Hunter, Eirik Endeve, M. Paul Laiu, Yulong Xing:
Realizability-Preserving Discontinuous Galerkin Method for Spectral Two-Moment Radiation Transport in Special Relativity. CoRR abs/2501.06388 (2025) - [i12]Xue Feng, M. Paul Laiu, Thomas Strohmer:
FedOSAA: Improving Federated Learning with One-Step Anderson Acceleration. CoRR abs/2503.10961 (2025) - 2024
- [j12]Massimiliano Lupo Pasini, M. Paul Laiu:
Anderson acceleration with approximate calculations: Applications to scientific computing. Numer. Linear Algebra Appl. 31(5) (2024) - [j11]Benjamin P. Russo
Convergence of Weak-SINDy Surrogate Models. SIAM J. Appl. Dyn. Syst. 23(2): 1017-1051 (2024) - [c1]Rick Archibald, Addi Malviya-Thakur, Marshall T. McDonnell, Gregory Cage, Cody Stiner, Lance Drane, M. Paul Laiu, Michael J. Brim, Mathieu Doucet, William T. Heller, Ryan Coffee:
Privacy Preserving Federated Learning for Advanced Scientific Ecosystems. IEEE Big Data 2024: 4132-4138 - [i11]Steffen Schotthöfer, M. Paul Laiu, Martin Frank, Cory D. Hauck:
Structure-preserving neural networks for the regularized entropy-based closure of the Boltzmann moment system. CoRR abs/2404.14312 (2024) - [i10]Steffen Schotthöfer, M. Paul Laiu:
Federated Dynamical Low-Rank Training with Global Loss Convergence Guarantees. CoRR abs/2406.17887 (2024) - [i9]Xue Feng, M. Paul Laiu, Thomas Strohmer:
Convergence Analysis of the Alternating Anderson-Picard Method for Nonlinear Fixed-point Problems. CoRR abs/2407.10472 (2024) - [i8]Cory D. Hauck, M. Paul Laiu, Stefan Schnake:
On high-order/low-order and micro-macro methods for implicit time-stepping of the BGK model. CoRR abs/2410.00678 (2024) - [i7]Pei Zhang, M. Paul Laiu, Matthew Norman, Doug Stefanski, John Gounley:
MATEY: multiscale adaptive foundation models for spatiotemporal physical systems. CoRR abs/2412.20601 (2024) - 2023
- [i6]Benjamin P. Russo, M. Paul Laiu, Richard Archibald
Streaming Compression of Scientific Data via weak-SINDy. CoRR abs/2308.14962 (2023) - [i5]M. Paul Laiu, Eirik Endeve, James Austin Harris, Zachary Elledge, Anthony Mezzacappa:
DG-IMEX Method for a Two-Moment Model for Radiation Transport in the O(v/c) Limit. CoRR abs/2309.04429 (2023) - 2022
- [j10]James Austin Harris
Exascale models of stellar explosions: Quintessential multi-physics simulation. Int. J. High Perform. Comput. Appl. 36(1): 59-77 (2022) - [j9]M. Paul Laiu
An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods. Math. Program. 195(1): 327-366 (2022) - [i4]Massimiliano Lupo Pasini, M. Paul Laiu:
Anderson acceleration with approximate calculations: applications to scientific computing. CoRR abs/2206.03915 (2022) - [i3]Benjamin Russo, M. Paul Laiu:
Convergence of weak-SINDy Surrogate Models. CoRR abs/2209.15573 (2022) - 2021
- [j8]Sandeep Madireddy
In situ compression artifact removal in scientific data using deep transfer learning and experience replay. Mach. Learn. Sci. Technol. 2(2): 25010 (2021) - [j7]Victor P. DeCaria, Cory D. Hauck, Ming Tse P. Laiu:
Analysis of a New Implicit Solver for a Semiconductor Model. SIAM J. Sci. Comput. 43(3): B733-B758 (2021) - [i2]William A. Porteous, M. Paul Laiu, Cory D. Hauck:
Data-driven, structure-preserving approximations to entropy-based moment closures for kinetic equations. CoRR abs/2106.08973 (2021) - 2020
- [j6]M. Paul Laiu
A fast implicit solver for semiconductor models in one space dimension. J. Comput. Phys. 417: 109567 (2020) - [i1]Victor P. DeCaria, Cory D. Hauck, M. Paul Laiu:
Analysis of a new implicit solver for a semiconductor model. CoRR abs/2009.05626 (2020)
2010 – 2019
- 2019
- [j5]M. Paul Laiu
A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme. Comput. Optim. Appl. 72(3): 727-768 (2019) - [j4]M. Paul Laiu
Positivity Limiters for Filtered Spectral Approximations of Linear Kinetic Transport Equations. J. Sci. Comput. 78(2): 918-950 (2019) - [j3]James M. Scott, M. Paul Laiu, Cory D. Hauck:
Analysis of the Zero Relaxation Limit of Hyperbolic Balance Laws with Random Initial Data. SIAM/ASA J. Uncertain. Quantification 7(3): 806-837 (2019) - [j2]M. Paul Laiu
A Positive Asymptotic-Preserving Scheme for Linear Kinetic Transport Equations. SIAM J. Sci. Comput. 41(3): A1500-A1526 (2019) - 2016
- [b1]Ming Tse Paul Laiu:
Positive filtered P_n method for linear transport equations and the associated Optimization Algorithm. University of Maryland, College Park, MD, USA, 2016 - [j1]M. Paul Laiu
Positive Filtered PN Moment Closures for Linear Kinetic Equations. SIAM J. Numer. Anal. 54(6): 3214-3238 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-30 22:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: