The Lanczos and Conjugate Gradient Algorithms
From MaRDI portal
Publication:5491444
DOI10.1137/1.9780898718140zbMath1110.65029OpenAlexW72753083MaRDI QIDQ5491444
Publication date: 5 October 2006
Full work available at URL: https://doi.org/10.1137/1.9780898718140
convergencenumerical experimentstextbookpreconditionerRitz valuesLanczos algorithmKrylov subspaceinner-outer iterationsconjugate-gradient method
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items
Regularization properties of Krylov iterative solvers CGME and LSMR for linear discrete ill-posed problems with an application to truncated randomized SVDs, Krylov subspace methods for the Dirac equation, Finding graph embeddings by incremental low-rank semidefinite programming, The Numerical Stability Analysis of Pipelined Conjugate Gradient Methods: Historical Context and Methodology, Theoretical and Computable Optimal Subspace Expansions for Matrix Eigenvalue Problems, An application of the discrete-time Toda lattice to the progressive algorithm by Lanczos and related problems, A Lanczos method for approximating composite functions, Abstract perturbed Krylov methods, A balanced accumulation scheme for parallel PDE solvers, On computing quadrature-based bounds for the \(A\)-norm of the error in conjugate gradients, Detection and correction of silent errors in the conjugate gradient algorithm, Solution of the \(k\)-th eigenvalue problem in large-scale electronic structure calculations, Prior-Preconditioned Conjugate Gradient Method for Accelerated Gibbs Sampling in “Large n , Large p ” Bayesian Sparse Regression, Towards backward perturbation bounds for approximate dual Krylov subspaces, Erasure Coding for Fault-Oblivious Linear System Solvers, On generating Sobolev orthogonal polynomials, On global Hessenberg based methods for solving Sylvester matrix equations, Composite convergence bounds based on Chebyshev polynomials and finite precision conjugate gradient computations, Predict-and-Recompute Conjugate Gradient Variants, An augmented analysis of the perturbed two-sided Lanczos tridiagonalization process, Continuous Analogues of Krylov Subspace Methods for Differential Operators, Krylov space approximate Kalman filtering, Accurate error estimation in CG, Lossy compression for PDE-constrained optimization: adaptive error control, New results on the convergence of the conjugate gradient method, Interval simulated annealing applied to electrical impedance tomography image reconstruction with fast objective function evaluation, Communication lower bounds and optimal algorithms for numerical linear algebra, Inexact Half-Quadratic Optimization for Linear Inverse Problems, Linear algebra algorithms as dynamical systems, Fast and accurate surface normal integration on non-rectangular domains, Static Analysis of Finite Precision Computations, Interior-point solver for convex separable block-angular problems, Iterative Approximation of Preconditioning Matrices Through Krylov-Type Solver Iterations, Model reduction using the Vorobyev moment problem, Laplacian Preconditioning of Elliptic PDEs: Localization of the Eigenvalues of the Discretized Operator, Randomized block Krylov methods for approximating extreme eigenvalues, Unnamed Item, Unnamed Item, On prescribing the convergence behavior of the conjugate gradient algorithm, Gauss-Christoffel quadrature for inverse regression: applications to computer experiments, Improved seed methods for symmetric positive definite linear equations with multiple right‐hand sides, 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, The Convergence of the Generalized Lanczos Trust-Region Method for the Trust-Region Subproblem, A framework of conjugate direction methods for symmetric linear systems in optimization, Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision, Improving an interior-point approach for large block-angular problems by hybrid preconditioners
Uses Software
