A Seed Method for Solving Nonsymmetric Linear Systems with Multiple Right-hand Sides
DOI10.1080/00207160211931zbMATH Open0995.65031OpenAlexW2058143366MaRDI QIDQ4531349FDOQ4531349
Authors: Guiding Gu
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
Recommendations
- A block seed method for solving linear systems with multiple right-hand sides
- MINRES seed projection methods for solving symmetric linear systems with multiple right-hand sides
- Improved seed methods for symmetric positive definite linear equations with multiple right-hand sides.
- The block least squares method for solving nonsymmetric linear systems with multiple right-hand sides
- Skew-symmetric methods for nonsymmetric linear systems with multiple right-hand sides
numerical experimentslinear systemsGMRESKrylov subspacemultiple right-hand sidesblock methodefficiency of methodsseed method
Complexity and performance of numerical algorithms (65Y20) Iterative numerical methods for linear systems (65F10)
Cites Work
- Computing interior eigenvalues of large matrices
- Title not available (Why is that?)
- A Restarted GMRES Method Augmented with Eigenvectors
- The block conjugate gradient algorithm and related methods
- Convergence properties of block GMRES and matrix polynomials
- A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
- An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides
- Deflated and Augmented Krylov Subspace Techniques
- Analysis of Augmented Krylov Subspace Methods
- Variable Block CG Algorithms for Solving Large Sparse Symmetric Positive Definite Linear Systems on Parallel Computers, I: General Iterative Scheme
- The linear algebra of block quasi-Newton algorithms
- Analysis of Projection Methods for Solving Linear Systems with Multiple Right-Hand Sides
- 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
Cited In (7)
- A distributed and parallel unite and conquer method to solve sequences of non-Hermitian linear systems
- Restarted GMRES augmented with harmonic Ritz vectors for shifted linear systems
- On global randomized block Kaczmarz method for image reconstruction
- A Lanczos-type method for solving nonsymmetric linear systems with multiple right-hand sides -- matrix and polynomial interpretation
- Title not available (Why is that?)
- 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
- MINRES seed projection methods for solving symmetric linear systems with multiple right-hand sides
This page was built for publication: A Seed Method for Solving Nonsymmetric Linear Systems with Multiple Right-hand Sides
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4531349)