Improved seed methods for symmetric positive definite linear equations with multiple right‐hand sides
From MaRDI portal
Publication:5502423
DOI10.1002/nla.1892zbMath1340.65041arXiv0810.0330OpenAlexW3125280967MaRDI QIDQ5502423
Walter Wilcox, Abdou Abdel-Rehim, Ronald B. Morgan
Publication date: 26 August 2015
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0810.0330
convergencepreconditioningquantum chromodynamicslinear equationHermitian matrixQCDroundoff errorconjugate gradientKrylov subspacemultiple right-hand sidesLanczossymmetric linear systemsseed method
Iterative numerical methods for linear systems (65F10) Strong interaction, including quantum chromodynamics (81V05) Preconditioners for iterative methods (65F08)
Related Items
On the computation of a truncated SVD of a large linear discrete ill-posed problem ⋮ Polynomial Preconditioned GMRES and GMRES-DR ⋮ Application of block Krylov subspace algorithms to the Wilson-Dirac equation with multiple right-hand sides in lattice QCD ⋮ Application of preconditioned block BiCGGR to the Wilson-Dirac equation with multiple right-hand sides in lattice QCD ⋮ Accelerating data uncertainty quantification by solving linear systems with multiple right-hand sides ⋮ The block CMRH method for solving nonsymmetric linear systems with multiple right-hand sides ⋮ Unnamed Item ⋮ Flexible global generalized Hessenberg methods for linear systems with multiple right-hand sides ⋮ A block IDR\((s)\) method for nonsymmetric linear systems with multiple right-hand sides ⋮ An augmented wavelet reconstructor for atmospheric tomography ⋮ A distributed and parallel unite and conquer method to solve sequences of non-Hermitian linear systems ⋮ Global LSMR(Gl-LSMR) method for solving general linear systems with several right-hand sides
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Restarted block-GMRES with deflation of eigenvalues
- A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
- On conjugate gradient type methods and polynomial preconditioners for a class of complex non-Hermitian matrices
- Analysis of the symmetric Lanczos algorithm with reorthogonalization methods
- The rate of convergence of conjugate gradients
- An iterative solution method for solving \(f(A)x=b\), using Krylov subspace information obtained for the symmetric positive definite matrix A
- A stable Richardson iteration method for complex linear systems
- The block conjugate gradient algorithm and related methods
- A new look at the Lanczos algorithm for solving symmetric systems of linear equations
- Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems
- Matrix Algorithms
- QMR-Based Projection Techniques for the Solution of Non-Hermitian Systems with Multiple Right-Hand Sides
- Deflated and Restarted Symmetric Lanczos Methods for Eigenvalues and Linear Equations with Multiple Right-Hand Sides
- Computing and Deflating Eigenvalues While Solving Multiple Right-Hand Side Linear Systems with an Application to Quantum Chromodynamics
- Restarting the Nonsymmetric Lanczos Algorithm for Eigenvalues and Linear Equations Including Multiple Right-Hand Sides
- Practical Use of Some Krylov Subspace Methods for Solving Indefinite and Nonsymmetric Linear Systems
- The Lanczos Algorithm With Partial Reorthogonalization
- The Lanczos and conjugate gradient algorithms in finite precision arithmetic
- Recycling Krylov Subspaces for Sequences of Linear Systems
- Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
- Predicting the Behavior of Finite Precision Lanczos and Conjugate Gradient Computations
- Solution of Sparse Indefinite Systems of Linear Equations
- The Lanczos Algorithm with Selective Orthogonalization
- Analysis of Projection Methods for Solving Linear Systems with Multiple Right-Hand Sides
- An Augmented Conjugate Gradient Method for Solving Consecutive Symmetric Positive Definite Linear Systems
- On the Lanczos Method for Solving Symmetric Linear Systems with Several Right-Hand Sides
- GMRES with Deflated Restarting
- An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides
- Approximate solutions and eigenvalue bounds from Krylov subspaces
- A Restarted GMRES Method Augmented with Eigenvectors
- The Lanczos and Conjugate Gradient Algorithms
- Extending the eigCG algorithm to nonsymmetric Lanczos for linear systems with multiple right-hand sides
- Methods of conjugate gradients for solving linear systems