Accelerated residual methods for the iterative solution of systems of equations
From MaRDI portal
Recommendations
- On Accelerated Iterative Methods for the Solution of Systems of Linear Equations
- Residual algorithm with preconitioner for linear system of equations
- Secant Acceleration of Sequential Residual Methods for Solving Large-Scale Nonlinear Systems of Equations
- Residual Replacement Strategies for Krylov Subspace Iterative Methods for the Convergence of True Residuals
- An acceleration of preconditioned generalized accelerated over relaxation methods for systems of linear equations
Cites work
- A differential equation for modeling Nesterov's accelerated gradient method: theory and insights
- A Family of Variable-Metric Methods Derived by Variational Means
- A Multigrid Tutorial, Second Edition
- A new approach to variable metric algorithms
- Adaptive restart for accelerated gradient schemes
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Conditioning of Quasi-Newton Methods for Function Minimization
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Gradient methods for minimizing composite functions
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 3958638 (Why is no real title available?)
- Hybrid Krylov Methods for Nonlinear Systems of Equations
- Introductory lectures on convex optimization. A basic course.
- Iterative Methods for Solving Partial Difference Equations of Elliptic Type
- Jacobian-free Newton-Krylov methods: a survey of approaches and applications.
- Methods of conjugate gradients for solving linear systems
- Multi-Level Adaptive Solutions to Boundary-Value Problems
- Multigrid strategies for viscous flow solvers on anisotropic unstructured meshes
- Nonlinearly Preconditioned Krylov Subspace Methods for Discrete Newton Algorithms
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Smooth minimization of non-smooth functions
- Solution of Sparse Indefinite Systems of Linear Equations
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- The rate of convergence of Nesterov's accelerated forward-backward method is actually faster than 1/k^2
Cited in
(8)- Distributed minimal residual (DMR) method for acceleration of iterative algorithms
- From differential equation solvers to accelerated first-order methods for convex optimization
- On the efficiency of combining different methods for acceleration of iterations at the solution of PDEs by the method of collocations and least residuals
- Nonlinearly preconditioned semismooth Newton algorithms for nonlinear nonsmooth systems
- Accelerated high-index saddle dynamics method for searching high-index saddle points
- Improved accelerated gradient algorithms with line search for smooth convex optimization problems
- Anderson acceleration of the Jacobi iterative method: an efficient alternative to Krylov methods for large, sparse linear systems
- A normalized parametrization of accelerated gradient flows and structure-preserving discretizations
This page was built for publication: Accelerated residual methods for the iterative solution of systems of equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4685335)
