Bounds for the error of linear systems of equations using the theory of moments
From MaRDI portal
Publication:2553143
DOI10.1016/0022-247X(72)90264-8zbMath0238.65012MaRDI QIDQ2553143
Gene H. Golub, Germund Dahlquist, Stanley C. Eisenstat
Publication date: 1972
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Iterative numerical methods for linear systems (65F10) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical linear algebra (65F99)
Related Items
Analysis of Wave Propagation in 1D Inhomogeneous Media, Estimates in quadratic formulas, Application of Gauss quadrature rule in finding bounds for solution of linear systems of equations, Practical implementation of Krylov subspace spectral methods, Matrices, moments and quadrature. II: How to compute the norm of the error iterative methods, An adaptive Richardson iteration method for indefinite linear systems, On computing quadrature-based bounds for the \(A\)-norm of the error in conjugate gradients, The behavior of the Gauss-Radau upper bound of the error norm in CG, Computational methods of linear algebra, An iterative Lavrentiev regularization method, Composite convergence bounds based on Chebyshev polynomials and finite precision conjugate gradient computations, An iterative method with error estimators, Error estimation in preconditioned conjugate gradients, A study of Auchmuty's error estimate, Krylov subspace spectral methods for the time-dependent Schrödinger equation with non-smooth potentials, Applications of semidefinite programming, Euclidean-Norm Error Bounds for SYMMLQ and CG, Approximating the extreme Ritz values and upper bounds for the \(A\)-norm of the error in CG, Explicit high-order time stepping based on componentwise application of asymptotic block Lanczos iteration, Estimates of Eigenvalues for Iterative Methods
Cites Work
