A fast minimal residual algorithm for shifted unitary matrices

DOI10.1002/NLA.1680010604zbMATH Open0839.65039OpenAlexW2158404168MaRDI QIDQ4868096FDOQ4868096

Authors: Carl Jagels, Lothar Reichel 

Publication date: 16 June 1996

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.1680010604

Recommendations

• A minimum residual algorithm for solving linear systems
• scientific article; zbMATH DE number 592768
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• The continued fraction methods for the solution of systems of linear equations

zbMATH Keywords

fast algorithmiterative methodsKrylov subspace methodArnoldi processlarge linear systemsminimal residual algorithmconjugate gradient algorithmsconjugate residual algorithms

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Cites Work

• Methods of conjugate gradients for solving linear systems
• Title not available (Why is that?)

Cited In (13)

• On a conjugate gradient-type method for solving complex symmetric linear systems
• Revisiting \((k,\ell)\)-step methods
• A generalized isometric Arnoldi algorithm
• SYMMLQ-like procedure for \(Ax=b\) where \(A\) is a special normal matrix
• A generalized unitary Hessenberg matrix
• A numerical comparison of two minimal residual methods for linear polynomials in unitary matrices
• A minimal residual method for linear polynomials in unitary matrices
• On an economic Arnoldi method for \(BML\)-matrices
• Structured Eigenvalue Problems
• Title not available (Why is that?)
• The Arnoldi process, short recursions, and displacement ranks
• A minimum residual algorithm for solving linear systems
• Error bounds in the isometric Arnoldi process

This page was built for publication: A fast minimal residual algorithm for shifted unitary matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4868096)