The Lanczos and conjugate gradient algorithms in finite precision arithmetic
From MaRDI portal
(Redirected from Publication:3430643)
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
Cited in
(82)- Arbitrary Precision Computations of Variations of Kansa's Method
- The joint bidiagonalization process with partial reorthogonalization
- Interplay between discretization and algebraic computation in adaptive numerical solution of elliptic PDE problems
- Model reduction using the Vorobyev moment problem
- Composite convergence bounds based on Chebyshev polynomials and finite precision conjugate gradient computations
- The behavior of the Gauss-Radau upper bound of the error norm in CG
- Error bounds and estimates for Krylov subspace approximations of Stieltjes matrix functions
- On the choice of preconditioner for minimum residual methods for non-Hermitian matrices
- On the gauge-algebra dependence of Landau-gauge Yang-Mills propagators
- 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
- Polynomial Accelerated Solutions to a Large Gaussian Model for Imaging Biofilms: In Theory and Finite Precision
- Finite precision representation of the Conley decomposition
- scientific article; zbMATH DE number 7258828 (Why is no real title available?)
- Accurate error estimation in CG
- Multipreconditioned GMRES for shifted systems
- Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences
- Theoretical error bounds and general analysis of a few Lanczos-type algorithms
- The Lanczos algorithm and complex Gauss quadrature
- Analyzing the effect of local rounding error propagation on the maximal attainable accuracy of the pipelined conjugate gradient method
- On soft errors in the conjugate gradient method: sensitivity and robust numerical detection
- 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
- LSEMINK: a modified Newton-Krylov method for log-sum-exp minimization
- Monotone convergence of the extended Krylov subspace method for Laplace-Stieltjes functions of Hermitian positive definite matrices
- Extended Lanczos bidiagonalization algorithm for low rank approximation and its applications
- Noise representation in residuals of LSQR, LSMR, and CRAIG regularization
- Accuracy of the Lanczos process for the eigenproblem and solution of equations
- An augmented analysis of the perturbed two-sided Lanczos tridiagonalization process
- Structure in loss of orthogonality
- On refined Ritz vectors and polynomial characterization
- GMRES with adaptively deflated restarting and its performance on an electromagnetic cavity problem
- The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision
- Improved seed methods for symmetric positive definite linear equations with multiple right-hand sides.
- The numerical stability analysis of pipelined conjugate gradient methods: historical context and methodology
- Universal characteristics of deep neural network loss surfaces from random matrix theory
- 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 Algorithm Under Few Iterations: Concentration and Location of the Output
- Stability of the Lanczos algorithm on matrices with regular spectral distributions
- Abstract perturbed Krylov methods
- When does the Lanczos algorithm compute exactly?
- The Lanczos and Conjugate Gradient Algorithms
- Low-Memory Krylov Subspace Methods for Optimal Rational Matrix Function Approximation
- Distribution of the discretization and algebraic error in numerical solution of partial differential equations
- Double precision is not necessary for LSQR for solving discrete linear ill-posed problems
- Lattice Landau gauge with stochastic quantisation
- 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
- On the robustness of numerical algorithms for linear systems and signal processing in finite precision arithmetic
- A comparison of additive Schwarz preconditioners for parallel adaptive finite elements
- Lossy compression for PDE-constrained optimization: adaptive error control
- The stabilization of weights in the Lanczos and conjugate gradient method
- Some History of the Conjugate Gradient and Lanczos Algorithms: 1948–1976
- Monotonic linear recurrences
- Low-rank updates of matrix functions
- Accuracy of the s-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision
- 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
- Computing the logarithmic capacity of compact sets having (infinitely) many components with the charge simulation method
- Lanczos algorithm explained in statistics
- Estimating and localizing the algebraic and total numerical errors using flux reconstructions
- Communication lower bounds and optimal algorithms for numerical linear algebra
- Fast convergence of trust-regions for non-isolated minima via analysis of CG on indefinite matrices
- Applying approximate LU-factorizations as preconditioners in eight iterative methods for solving systems of linear algebraic equations
- The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data
- The Lanczos and conjugate gradient algorithms in finite precision arithmetic
- On finite precision block Lanczos computations
- Analysis of the Truncated Conjugate Gradient Method for Linear Matrix Equations
- Towards understanding CG and GMRES through examples
- Backward error analysis of the Lanczos bidiagonalization with reorthogonalization
- Superlinear convergence of the rational Arnoldi method for the approximation of matrix functions
- New results on the convergence of the conjugate gradient method
- On the cost of iterative computations
- scientific article; zbMATH DE number 7771103 (Why is no real title available?)
- Analyzing vector orthogonalization algorithms
- Conjugate Gradients
- Lanczos Algorithm
- Laplacian preconditioning of elliptic PDEs: localization of the eigenvalues of the discretized operator
- A Lanczos method for approximating composite functions
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)
