A minimum residual algorithm for solving linear systems

DOI10.1007/s10543-006-0073-0zbMath1102.65035OpenAlexW1970522310MaRDI QIDQ2433875

Olavi Nevanlinna, Marko Huhtanen

Publication date: 31 October 2006

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10543-006-0073-0

zbMATH Keywords

iterationKrylov subspace methodlarge linear systemfive term recurrence

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10)

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization of the Hermitian and skew-Hermitian splitting iteration for saddle-point problems
• Circulant preconditioners for stochastic automata networks
• Error bounds for exponential operator splittings
• Generalizations of the field of values useful in the study of polynomial functions of a matrix
• Exclusion and Inclusion Regions for the Eigenvalues of a Normal Matrix
• A Hermitian Lanczos Method for Normal Matrices
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Extended Krylov Subspaces: Approximation of the Matrix Square Root and Related Functions
• Recent Developments in Inverse Acoustic Scattering Theory
• Conjugate Gradient Methods for Toeplitz Systems
• Iterative Krylov Methods for Large Linear Systems
• A fast minimal residual algorithm for shifted unitary matrices
• On the Occurrence of Superlinear Convergence of Exact and Inexact Krylov Subspace Methods

This page was built for publication: A minimum residual algorithm for solving linear systems