On the cost of iterative computations
From MaRDI portal
Recommendations
- How to minimize the cost of iterative methods in the presence of perturbations
- On numerical stability in large scale linear algebraic computations
- Memory Aspects and Performance of Iterative Solvers
- Iterative methods for solution of linear system equations: From past to future
- Performance of iterative methods for distributed memory machines
Cites work
- A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
- A Newton basis GMRES implementation
- A Note on Preconditioning for Indefinite Linear Systems
- A parallel GMRES version for general sparse matrices
- A residual replacement strategy for improving the maximum attainable accuracy of s-step Krylov subspace methods
- A theory of complexity, condition, and roundoff
- Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
- Accuracy of the s-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision
- Accuracy of the Lanczos process for the eigenproblem and solution of equations
- Accuracy of two three-term and three two-term recurrences for Krylov space solvers
- An augmented stability result for the Lanczos Hermitian matrix tridiagonalization process
- Analyzing the effect of local rounding error propagation on the maximal attainable accuracy of the pipelined conjugate gradient method
- Any Nonincreasing Convergence Curve is Possible for GMRES
- Behavior of slightly perturbed Lanczos and conjugate-gradient recurrences
- Characterizing Computers and Optimizing the FACR(l) Poisson-Solver on Parallel Unicomputers
- Communication lower bounds for distributed-memory matrix multiplication
- Comparison of splittings used with the conjugate gradient algorithm
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Composite convergence bounds based on Chebyshev polynomials and finite precision conjugate gradient computations
- Condition. The geometry of numerical algorithms
- Estimates in quadratic formulas
- Estimating the Attainable Accuracy of Recursively Computed Residual Methods
- Hiding global communication latency in the GMRES algorithm on massively parallel machines
- scientific article; zbMATH DE number 3145563 (Why is no real title available?)
- scientific article; zbMATH DE number 3854346 (Why is no real title available?)
- scientific article; zbMATH DE number 3915502 (Why is no real title available?)
- scientific article; zbMATH DE number 3720254 (Why is no real title available?)
- scientific article; zbMATH DE number 53686 (Why is no real title available?)
- scientific article; zbMATH DE number 1305086 (Why is no real title available?)
- scientific article; zbMATH DE number 1323248 (Why is no real title available?)
- scientific article; zbMATH DE number 663835 (Why is no real title available?)
- scientific article; zbMATH DE number 1069617 (Why is no real title available?)
- scientific article; zbMATH DE number 2109415 (Why is no real title available?)
- scientific article; zbMATH DE number 3082033 (Why is no real title available?)
- Iterative Krylov Methods for Large Linear Systems
- Iterative solution of large sparse systems of equations. Transl. from the German
- John von Neumann's Analysis of Gaussian Elimination and the Origins of Modern Numerical Analysis
- Krylov sequences of maximal length and convergence of GMRES
- Krylov subspace methods. Principles and analysis.
- Laplacian preconditioning of elliptic PDEs: localization of the eigenvalues of the discretized operator
- Matrices, moments and quadrature with applications
- Methods of conjugate gradients for solving linear systems
- Minimizing communication in numerical linear algebra
- On error estimation in the conjugate gradient method and why it works in finite precision computations
- On the efficient implementation of preconditioned s-step conjugate gradient methods on multiprocessors with memory hierarchy
- On the generation of Krylov subspace bases
- On the real convergence rate of the conjugate gradient method
- Parallel iterative methods for sparse linear systems
- Parallelism in random access machines
- Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory
- Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
- Preconditioning and the conjugate gradient method in the context of solving PDEs
- Predicting the Behavior of Finite Precision Lanczos and Conjugate Gradient Computations
- Probabilistic analyses of condition numbers
- Pták's nondiscrete induction and its application to matrix iterations
- Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers
- Reliable updated residuals in hybrid Bi-CG methods
- Residual Replacement Strategies for Krylov Subspace Iterative Methods for the Convergence of True Residuals
- Superlinear CG convergence for special right-hand sides
- The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
- The Lanczos and conjugate gradient algorithms in finite precision arithmetic
- The numerical stability analysis of pipelined conjugate gradient methods: historical context and methodology
- The University of Florida sparse matrix collection
- The worst-case GMRES for normal matrices
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
- What should be a rate of convergence ?
Cited in
(12)- How to minimize the cost of iterative methods in the presence of perturbations
- Sensitivity of computational fluid dynamics simulations against soft errors
- GMRES algorithms over 35 years
- A comparison of limited-memory Krylov methods for Stieltjes functions of Hermitian matrices
- Three-precision GMRES-based iterative refinement for least squares problems
- Towards understanding CG and GMRES through examples
- Single-pass Nyström approximation in mixed precision
- High-efficiency implicit scheme for solving first-order partial differential equations
- High-level convergence order accelerators of iterative methods for nonlinear problems
- Maximally efficient damped composed Newton-type methods to solve nonlinear systems of equations
- Full operator preconditioning and the accuracy of solving linear systems
- A modular framework for the backward error analysis of GMRES
This page was built for publication: On the cost of iterative computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993500)
