Generalized least-squares polynomial preconditioners for symmetric indefinite linear equations
From MaRDI portal
Publication:5958218
DOI10.1016/S0167-8191(01)00142-9zbMath0984.68207OpenAlexW1967430404MaRDI QIDQ5958218
Marek Szularz, Y. Liang, J. S. Weston
Publication date: 3 March 2002
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-8191(01)00142-9
Symbolic computation and algebraic computation (68W30) Parallel algorithms in computer science (68W10)
Related Items (3)
Matrix-free polynomial-based nonlinear least squares optimized preconditioning and its application to discontinuous Galerkin discretizations of the Euler equations ⋮ Finite-element-wise domain decomposition iterative solvers with polynomial preconditioning ⋮ A Hessian-free Newton-Raphson method for the configuration of physics systems featured by numerically asymmetric force field
This page was built for publication: Generalized least-squares polynomial preconditioners for symmetric indefinite linear equations
