The Lanczos and conjugate gradient algorithms in finite precision arithmetic

DOI10.1017/S096249290626001XzbMath1113.65032OpenAlexW2125426869MaRDI QIDQ3430643

Publication date: 23 March 2007

Published in: Acta Numerica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s096249290626001x

zbMATH Keywords

symmetric matrices dominant eigenvalues finite precision arithmetic conjugate gradient algorithms Lanzcos method

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10)

Related Items (61)

The joint bidiagonalization process with partial reorthogonalization ⋮ Analysis of the Truncated Conjugate Gradient Method for Linear Matrix Equations ⋮ The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision ⋮ Monotone convergence of the extended Krylov subspace method for Laplace-Stieltjes functions of Hermitian positive definite matrices ⋮ On refined Ritz vectors and polynomial characterization ⋮ Error bounds and estimates for Krylov subspace approximations of Stieltjes matrix functions ⋮ The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology ⋮ On sensitivity of Gauss-Christoffel quadrature ⋮ When does the Lanczos algorithm compute exactly? ⋮ The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data ⋮ Applying approximate LU-factorizations as preconditioners in eight iterative methods for solving systems of linear algebraic equations ⋮ Noise representation in residuals of LSQR, LSMR, and CRAIG regularization ⋮ Guaranteed two-sided bounds on all eigenvalues of preconditioned diffusion and elasticity problems solved by the finite element method. ⋮ Monotonic linear recurrences ⋮ A Lanczos method for approximating composite functions ⋮ Estimating and localizing the algebraic and total numerical errors using flux reconstructions ⋮ Abstract perturbed Krylov methods ⋮ Mixed-precision explicit stabilized Runge-Kutta methods for single- and multi-scale differential equations ⋮ Iterative numerical methods for sampling from high dimensional Gaussian distributions ⋮ On computing quadrature-based bounds for the $A$-norm of the error in conjugate gradients ⋮ Lattice Landau gauge with stochastic quantisation ⋮ On the gauge-algebra dependence of Landau-gauge Yang-Mills propagators ⋮ The behavior of the Gauss-Radau upper bound of the error norm in CG ⋮ Low-Memory Krylov Subspace Methods for Optimal Rational Matrix Function Approximation ⋮ Computing the logarithmic capacity of compact sets having (infinitely) many components with the charge simulation method ⋮ Stability of the Lanczos algorithm on matrices with regular spectral distributions ⋮ Double precision is not necessary for LSQR for solving discrete linear ill-posed problems ⋮ Superlinear convergence of the rational Arnoldi method for the approximation of matrix functions ⋮ Multipreconditioned Gmres for Shifted Systems ⋮ Analyzing the Effect of Local Rounding Error Propagation on the Maximal Attainable Accuracy of the Pipelined Conjugate Gradient Method ⋮ Low-Rank Updates of Matrix Functions ⋮ Unnamed Item ⋮ Composite convergence bounds based on Chebyshev polynomials and finite precision conjugate gradient computations ⋮ Predict-and-Recompute Conjugate Gradient Variants ⋮ Distribution of the discretization and algebraic error in numerical solution of partial differential equations ⋮ On the choice of preconditioner for minimum residual methods for non-Hermitian matrices ⋮ An augmented analysis of the perturbed two-sided Lanczos tridiagonalization process ⋮ On Soft Errors in the Conjugate Gradient Method: Sensitivity and Robust Numerical Detection ⋮ Accurate error estimation in CG ⋮ Lossy compression for PDE-constrained optimization: adaptive error control ⋮ New results on the convergence of the conjugate gradient method ⋮ GMRES with adaptively deflated restarting and its performance on an electromagnetic cavity problem ⋮ Communication lower bounds and optimal algorithms for numerical linear algebra ⋮ On the robustness of numerical algorithms for linear systems and signal processing in finite precision arithmetic ⋮ Structure in loss of orthogonality ⋮ A cooperative conjugate gradient method for linear systems permitting efficient multi-thread implementation ⋮ Accuracy of the Lanczos Process for the Eigenproblem and Solution of Equations ⋮ Extended Lanczos bidiagonalization algorithm for low rank approximation and its applications ⋮ A Comparison of Additive Schwarz Preconditioners for Parallel Adaptive Finite Elements ⋮ Model reduction using the Vorobyev moment problem ⋮ Laplacian Preconditioning of Elliptic PDEs: Localization of the Eigenvalues of the Discretized Operator ⋮ On the cost of iterative computations ⋮ An adaptive $s$-step conjugate gradient algorithm with dynamic basis updating. ⋮ On prescribing the convergence behavior of the conjugate gradient algorithm ⋮ Simple stopping criteria for the LSQR method applied to discrete ill-posed problems ⋮ Improved seed methods for symmetric positive definite linear equations with multiple right‐hand sides ⋮ Polynomial Accelerated Solutions to a Large Gaussian Model for Imaging Biofilms: In Theory and Finite Precision ⋮ Interplay between discretization and algebraic computation in adaptive numerical solutionof elliptic PDE problems ⋮ Error Bounds for Lanczos-Based Matrix Function Approximation ⋮ Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision ⋮ Universal characteristics of deep neural network loss surfaces from random matrix theory

Uses Software

This page was built for publication: The Lanczos and conjugate gradient algorithms in finite precision arithmetic