Predicting the Behavior of Finite Precision Lanczos and Conjugate Gradient Computations
From MaRDI portal
Publication:3988979
DOI10.1137/0613011zbMath0755.65037OpenAlexW2045370380MaRDI QIDQ3988979
Zdeněk Strakoš, Anne Greenbaum
Publication date: 28 June 1992
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0613011
performanceconvergenceeigenvaluesnumerical experimentsconjugate gradient methodLanczos algorithmround-off errorsfinite precision
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10)
Related Items
On the convergence rate of the conjugate gradients in presence of rounding errors, Estimates in quadratic formulas, Monotone convergence of the extended Krylov subspace method for Laplace-Stieltjes functions of Hermitian positive definite matrices, 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, When does the Lanczos algorithm compute exactly?, A transpose-free quasi-minimal residual variant of the CORS method for solving non-Hermitian linear systems, A Lanczos method for approximating composite functions, Abstract perturbed Krylov methods, On the Condition Number of the Shifted Real Ginibre Ensemble, 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, Stability of the Lanczos algorithm on matrices with regular spectral distributions, Superlinear convergence of the rational Arnoldi method for the approximation of matrix functions, Universal halting times in optimization and machine learning, Analyzing the Effect of Local Rounding Error Propagation on the Maximal Attainable Accuracy of the Pipelined Conjugate Gradient Method, 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, An augmented analysis of the perturbed two-sided Lanczos tridiagonalization process, Accurate error estimation in CG, On the Convergence Rate of Variants of the Conjugate Gradient Algorithm in Finite Precision Arithmetic, Error Analysis of the Lanczos Algorithm for the Nonsymmetric Eigenvalue Problem, Milestones in the development of iterative solution methods, Sharpness in rates of convergence for the symmetric Lanczos method, Error estimation in preconditioned conjugate gradients, The effect of non-optimal bases on the convergence of Krylov subspace methods, Inexact Half-Quadratic Optimization for Linear Inverse Problems, Accuracy of the Lanczos Process for the Eigenproblem and Solution of Equations, Smoothed analysis for the conjugate gradient algorithm, A Comparison of Preconditioning Methods for Saddle Point Problems with an Application to Porous Media Flow Problems, Laplacian Preconditioning of Elliptic PDEs: Localization of the Eigenvalues of the Discretized Operator, On the cost of iterative computations, Improved seed methods for symmetric positive definite linear equations with multiple right‐hand sides, The stabilization of weights in the Lanczos and conjugate gradient method, Iterative solution of linear systems in the 20th century, A framework of conjugate direction methods for symmetric linear systems in optimization, Analysis of the finite precision bi-conjugate gradient algorithm for nonsymmetric linear systems, Error Bounds for Lanczos-Based Matrix Function Approximation, Iteration number for the conjugate gradient method, Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision, Analysis of approximate inverses in tomography. II: Iterative inverses, Preconditioning techniques for large linear systems: A survey, On the computation of a very large number of eigenvalues for selfadjoint elliptic operators by means of multigrid methods
