The Lanczos and conjugate gradient algorithms in finite precision arithmetic
From MaRDI portal
Publication:3430643
DOI10.1017/S096249290626001XzbMATH Open1113.65032OpenAlexW2125426869MaRDI QIDQ3430643FDOQ3430643
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
Recommendations
- The Lanczos and conjugate gradient algorithms in finite precision arithmetic
- The Lanczos and Conjugate Gradient Algorithms
- Predicting the Behavior of Finite Precision Lanczos and Conjugate Gradient Computations
- On the real convergence rate of the conjugate gradient method
- Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976
symmetric matricesdominant eigenvaluesfinite precision arithmeticconjugate gradient algorithmsLanzcos method
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10)
Cited In (74)
- Accuracy of the Lanczos Process for the Eigenproblem and Solution of Equations
- The joint bidiagonalization process with partial reorthogonalization
- Interplay between discretization and algebraic computation in adaptive numerical solution of elliptic PDE problems
- The behavior of the Gauss-Radau upper bound of the error norm in CG
- Model reduction using the Vorobyev moment problem
- Composite convergence bounds based on Chebyshev polynomials and finite precision conjugate gradient computations
- On the choice of preconditioner for minimum residual methods for non-Hermitian matrices
- Error bounds and estimates for Krylov subspace approximations of Stieltjes matrix functions
- On the gauge-algebra dependence of Landau-gauge Yang-Mills propagators
- Improved seed methods for symmetric positive definite linear equations with multiple right‐hand sides
- Predict-and-Recompute Conjugate Gradient Variants
- Error Bounds for Lanczos-Based Matrix Function Approximation
- A Low Complexity Scaling Method for the Lanczos Kernel in Fixed-Point Arithmetic
- Finite precision representation of the Conley decomposition
- Polynomial Accelerated Solutions to a Large Gaussian Model for Imaging Biofilms: In Theory and Finite Precision
- Accurate error estimation in CG
- Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences
- The Lanczos algorithm and complex Gauss quadrature
- Mixed-precision explicit stabilized Runge-Kutta methods for single- and multi-scale differential equations
- A cooperative conjugate gradient method for linear systems permitting efficient multi-thread implementation
- Low-Rank Updates of Matrix Functions
- Extended Lanczos bidiagonalization algorithm for low rank approximation and its applications
- Noise representation in residuals of LSQR, LSMR, and CRAIG regularization
- Monotone convergence of the extended Krylov subspace method for Laplace-Stieltjes functions of Hermitian positive definite matrices
- An augmented analysis of the perturbed two-sided Lanczos tridiagonalization process
- Structure in loss of orthogonality
- GMRES with adaptively deflated restarting and its performance on an electromagnetic cavity problem
- On refined Ritz vectors and polynomial characterization
- On sensitivity of Gauss-Christoffel quadrature
- Guaranteed two-sided bounds on all eigenvalues of preconditioned diffusion and elasticity problems solved by the finite element method.
- The Lanczos and Conjugate Gradient Algorithms
- Abstract perturbed Krylov methods
- When does the Lanczos algorithm compute exactly?
- Distribution of the discretization and algebraic error in numerical solution of partial differential equations
- On computing quadrature-based bounds for the \(A\)-norm of the error in conjugate gradients
- Iterative numerical methods for sampling from high dimensional Gaussian distributions
- Lattice Landau gauge with stochastic quantisation
- Laplacian Preconditioning of Elliptic PDEs: Localization of the Eigenvalues of the Discretized Operator
- On the robustness of numerical algorithms for linear systems and signal processing in finite precision arithmetic
- The stabilization of weights in the Lanczos and conjugate gradient method
- Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976
- Lossy compression for PDE-constrained optimization: adaptive error control
- Monotonic linear recurrences
- Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision
- Computing the logarithmic capacity of compact sets having (infinitely) many components with the charge simulation method
- 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
- Communication lower bounds and optimal algorithms for numerical linear algebra
- Estimating and localizing the algebraic and total numerical errors using flux reconstructions
- The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data
- Analysis of the Truncated Conjugate Gradient Method for Linear Matrix Equations
- Applying approximate LU-factorizations as preconditioners in eight iterative methods for solving systems of linear algebraic equations
- A Comparison of Additive Schwarz Preconditioners for Parallel Adaptive Finite Elements
- New results on the convergence of the conjugate gradient method
- On the cost of iterative computations
- Superlinear convergence of the rational Arnoldi method for the approximation of matrix functions
- On Soft Errors in the Conjugate Gradient Method: Sensitivity and Robust Numerical Detection
- Multipreconditioned Gmres for Shifted Systems
- Analyzing the Effect of Local Rounding Error Propagation on the Maximal Attainable Accuracy of the Pipelined Conjugate Gradient Method
- The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology
- A Lanczos method for approximating composite functions
- Title not available (Why is that?)
- The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision
- Universal characteristics of deep neural network loss surfaces from random matrix theory
- Stability of the Lanczos algorithm on matrices with regular spectral distributions
- The Lanczos Algorithm Under Few Iterations: Concentration and Location of the Output
- Low-Memory Krylov Subspace Methods for Optimal Rational Matrix Function Approximation
- Double precision is not necessary for LSQR for solving discrete linear ill-posed problems
- Towards understanding CG and GMRES through examples
- Backward error analysis of the Lanczos bidiagonalization with reorthogonalization
- Title not available (Why is that?)
- Analyzing vector orthogonalization algorithms
- Arbitrary Precision Computations of Variations of Kansa's Method
Uses Software
This page was built for publication: The Lanczos and conjugate gradient algorithms in finite precision arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3430643)
