A Seed Method for Solving Nonsymmetric Linear Systems with Multiple Right-hand Sides
From MaRDI portal
Publication:4531349
DOI10.1080/00207160211931zbMath0995.65031OpenAlexW2058143366MaRDI QIDQ4531349
Publication date: 9 October 2002
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160211931
linear systemsnumerical experimentsGMRESblock methodKrylov subspacemultiple right-hand sidesefficiency of methodsseed method
Iterative numerical methods for linear systems (65F10) Complexity and performance of numerical algorithms (65Y20)
Related Items
On global randomized block Kaczmarz method for image reconstruction ⋮ MINRES seed projection methods for solving symmetric linear systems with multiple right-hand sides ⋮ Unnamed Item ⋮ Restarted GMRES augmented with harmonic Ritz vectors for shifted linear systems ⋮ Restarted Gmres Augmented With Eigenvectors For Shifted Linear Systems * Supported by the National Natural Science Foundation of China and the Science and Technology Developing Foundation of University in Shanghai of China ⋮ A distributed and parallel unite and conquer method to solve sequences of non-Hermitian linear systems
Cites Work
- Unnamed Item
- A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
- Computing interior eigenvalues of large matrices
- The block conjugate gradient algorithm and related methods
- The linear algebra of block quasi-Newton algorithms
- A hybrid block GMRES method for nonsymmetric systems with multiple right-hand sides
- A block EN algorithm for nonsymmetric linear systems with multiple right-hand sides
- Convergence properties of block GMRES and matrix polynomials
- Analysis of Augmented Krylov Subspace Methods
- Analysis of Projection Methods for Solving Linear Systems with Multiple Right-Hand Sides
- Deflated and Augmented Krylov Subspace Techniques
- An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides
- Variable Block CG Algorithms for Solving Large Sparse Symmetric Positive Definite Linear Systems on Parallel Computers, I: General Iterative Scheme
- A Restarted GMRES Method Augmented with Eigenvectors