BiLQ: An Iterative Method for Nonsymmetric Linear Systems with a Quasi-Minimum Error Property
From MaRDI portal
Publication:5146613
DOI10.1137/19M1290991zbMath1458.65032arXiv1910.02598MaRDI QIDQ5146613
Alexis Montoison, Dominique Orban
Publication date: 26 January 2021
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.02598
iterative methodsintegral functionaladjoint systemsLanczos biorthogonalization processleast-norm subproblemsquasi-minimum error methodtridiagonalization process
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Orthogonalization in numerical linear algebra (65F25)
Related Items
GPMR: An Iterative Method for Unsymmetric Partitioned Linear Systems, Properties of semi-conjugate gradient methods for solving unsymmetric positive definite linear systems, <scp>TriCG</scp> and <scp>TriMR</scp>: Two Iterative Methods for Symmetric Quasi-definite Systems
Uses Software
Cites Work
- Unnamed Item
- Approximation of the scattering amplitude and linear systems
- A Jacobian-free Newton-Krylov algorithm for compressible turbulent fluid flows
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- An augmented analysis of the perturbed two-sided Lanczos tridiagonalization process
- A note on finite difference discretizations for Poisson equation on a disk
- Sparse Matrix Methods for Circuit Simulation Problems
- Julia: A Fresh Approach to Numerical Computing
- The university of Florida sparse matrix collection
- MINRES-QLP: A Krylov Subspace Method for Indefinite or Singular Symmetric Systems
- Euclidean-Norm Error Bounds for SYMMLQ and CG
- LSLQ: An Iterative Method for Linear Least-Squares with an Error Minimization Property
- A generalized LSQR algorithm
- A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- Two Conjugate-Gradient-Type Methods for Unsymmetric Linear Equations
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Solution of Sparse Indefinite Systems of Linear Equations
- Error-Minimizing Krylov Subspace Methods
- A Quasi-Minimal Residual Method for Simultaneous Primal-Dual Solutions and Superconvergent Functional Estimates
- Adjoint Recovery of Superconvergent Functionals from PDE Approximations
- A Modified Implementation of MINRES to Monitor Residual Subvector Norms for Block Systems
- LNLQ: An Iterative Method for Least-Norm Problems with an Error Minimization Property
- A Tridiagonalization Method for Symmetric Saddle-Point Systems
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- Methods of conjugate gradients for solving linear systems
