A Seed Method for Solving Nonsymmetric Linear Systems with Multiple Right-hand Sides

DOI10.1080/00207160211931MaRDI QIDQ4531349zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

numerical experimentslinear systemsGMRESKrylov subspacemultiple right-hand sidesblock methodefficiency of methodsseed method

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Iterative numerical methods for linear systems (65F10)

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

Cites work

• scientific article; zbMATH DE number 1953446 (Why is no real title available?)
• A Restarted GMRES Method Augmented with Eigenvectors
• A block EN algorithm for nonsymmetric linear systems with multiple right-hand sides
• A block QMR algorithm for non-Hermitian linear systems with multiple right-hand sides
• A hybrid block GMRES method for nonsymmetric systems with multiple right-hand sides
• An Iterative Method for Nonsymmetric Systems with Multiple Right-Hand Sides
• Analysis of Augmented Krylov Subspace Methods
• Analysis of Projection Methods for Solving Linear Systems with Multiple Right-Hand Sides
• Computing interior eigenvalues of large matrices
• Convergence properties of block GMRES and matrix polynomials
• Deflated and Augmented Krylov Subspace Techniques
• The block conjugate gradient algorithm and related methods
• The linear algebra of block quasi-Newton algorithms
• Variable Block CG Algorithms for Solving Large Sparse Symmetric Positive Definite Linear Systems on Parallel Computers, I: General Iterative Scheme

Cited in

(9)

• 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 applying weighted weed techniques to GMRES algorithm for solving multiple 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
• Improved seed methods for symmetric positive definite linear equations with multiple right-hand sides.
• 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 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

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)