Roundoff error analysis of algorithms based on Krylov subspace methods
type: Item
instance of: scholarly article
title: Roundoff error analysis of algorithms based on Krylov subspace methods
zbMATH Open document ID: 0848.65019
DOI: 10.1007/BF01731978
published in: BIT
publication date: 1996-06-09T00:00:00Z
Mathematics Subject Classification ID: 65F10
zbMATH DE Number: 885548
zbMATH Keywords: roundoff error propagation
zbMATH Keywords: algorithm
zbMATH Keywords: orthonormal basis
zbMATH Keywords: Krylov subspace
zbMATH Keywords: Householder orthonormal matrices
zbMATH Keywords: GMRES algorithm
zbMATH Keywords: full orthogonalization method
zbMATH Keywords: large sparse linear system
author: M. Arioli
author: C. Fassino
MaRDI profile type: Publication
cites work: Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations
cites work: A Theoretical Comparison of the Arnoldi and GMRES Algorithms
cites work: Q4113326
cites work: Numerical stability of GMRES
cites work: Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
cites work: Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
cites work: Q4879581
cites work: How Fast are Nonsymmetric Matrix Iterations?
cites work: Q3868672
cites work: Numerical methods for large eigenvalue problems
cites work: Conjugate Gradient-Like Algorithms for Solving Nonsymmetric Linear Systems
cites work: GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
cites work: Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
cites work: Implementation of the GMRES Method Using Householder Transformations
cites work: A Lanczos Method for a Class of Nonsymmetric Systems of Linear Equations
cites work: Q5674306
description: scientific article; zbMATH DE number 885548