Search:
Match:
4 results
Research Paper#Numerical Analysis, Optimization, Uncertainty Quantification🔬 ResearchAnalyzed: Jan 3, 2026 16:59

Efficient Preconditioners for PDE-Constrained Optimization with Uncertainty

Published:Dec 29, 2025 19:03
1 min read
ArXiv

Analysis

This paper addresses the computational challenges of solving optimal control problems governed by PDEs with uncertain coefficients. The authors propose hierarchical preconditioners to accelerate iterative solvers, improving efficiency for large-scale problems arising from uncertainty quantification. The focus on both steady-state and time-dependent applications highlights the broad applicability of the method.
Reference

“The proposed preconditioners significantly accelerate the convergence of iterative solvers compared to existing methods.”

PermalinkArXiv
Research Paper#Computational Acoustics, Stochastic Methods, Domain Decomposition🔬 ResearchAnalyzed: Jan 3, 2026 16:17

Domain Decomposition for Acoustic Wave Propagation in Random Media

Published:Dec 28, 2025 18:02
1 min read
ArXiv

Analysis

This paper addresses the computationally expensive problem of simulating acoustic wave propagation in complex, random media. It leverages a sampling-free stochastic Galerkin method combined with domain decomposition techniques to improve scalability. The use of polynomial chaos expansion (PCE) and iterative solvers with preconditioners suggests an efficient approach to handle the high dimensionality and computational cost associated with the problem. The focus on scalability with increasing mesh size, time steps, and random parameters is a key aspect.
Reference

“The paper utilizes a sampling-free intrusive stochastic Galerkin approach and domain decomposition (DD)-based solvers.”

PermalinkArXiv
Research Paper#Numerical Linear Algebra, Preconditioning, M-matrices🔬 ResearchAnalyzed: Jan 4, 2026 00:10

FSAI Preconditioning for Singular M-Matrices

Published:Dec 25, 2025 17:29
1 min read
ArXiv

Analysis

This paper investigates the application of the Factorized Sparse Approximate Inverse (FSAI) preconditioner to singular irreducible M-matrices, which are common in Markov chain modeling and graph Laplacian problems. The authors identify restrictions on the nonzero pattern necessary for stable FSAI construction and demonstrate that the resulting preconditioner preserves key properties of the original system, such as non-negativity and the M-matrix structure. This is significant because it provides a method for efficiently solving linear systems arising from these types of matrices, which are often large and sparse, by improving the convergence rate of iterative solvers.
Reference

“The lower triangular matrix $L_G$ and the upper triangular matrix $U_G$, generated by FSAI, are non-singular and non-negative. The diagonal entries of $L_GAU_G$ are positive and $L_GAU_G$, the preconditioned matrix, is a singular M-matrix.”

PermalinkArXiv
Research#PDE Solver🔬 ResearchAnalyzed: Jan 10, 2026 10:41

AI-Enhanced Solvers Improve Parametric PDE Solutions

Published:Dec 16, 2025 17:06
1 min read
ArXiv

Analysis

This research explores a novel approach to solving Parametric Partial Differential Equations (PDEs) using hybrid iterative solvers and geometry-aware neural preconditioners. The use of AI in this context suggests potential for significant advancements in computational efficiency and accuracy for various scientific and engineering applications.
Reference

“The paper focuses on Hybrid Iterative Solvers with Geometry-Aware Neural Preconditioners for Parametric PDEs.”

PermalinkArXiv