Accelerated residual methods for the iterative solution of systems of equations
DOI10.1137/17M1141369zbMATH Open1401.65053OpenAlexW2894145971WikidataQ129189941 ScholiaQ129189941MaRDI QIDQ4685335FDOQ4685335
Authors:
Publication date: 8 October 2018
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/17m1141369
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
linear systemsnonlinear systemspartial differential equationsaccelerated first-order methodsaccelerated residual methods
Iterative numerical methods for linear systems (65F10) Numerical computation of solutions to systems of equations (65H10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Cites Work
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- Smooth minimization of non-smooth functions
- Introductory lectures on convex optimization. A basic course.
- Adaptive restart for accelerated gradient schemes
- Title not available (Why is that?)
- Gradient methods for minimizing composite functions
- Title not available (Why is that?)
- A Family of Variable-Metric Methods Derived by Variational Means
- A new approach to variable metric algorithms
- Conditioning of Quasi-Newton Methods for Function Minimization
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Methods of conjugate gradients for solving linear systems
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- 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
- Multi-Level Adaptive Solutions to Boundary-Value Problems
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- Solution of Sparse Indefinite Systems of Linear Equations
- A Multigrid Tutorial, Second Edition
- Jacobian-free Newton-Krylov methods: a survey of approaches and applications.
- A differential equation for modeling Nesterov's accelerated gradient method: theory and insights
- Hybrid Krylov Methods for Nonlinear Systems of Equations
- Nonlinearly Preconditioned Krylov Subspace Methods for Discrete Newton Algorithms
- Iterative Methods for Solving Partial Difference Equations of Elliptic Type
- Multigrid strategies for viscous flow solvers on anisotropic unstructured meshes
- The rate of convergence of Nesterov's accelerated forward-backward method is actually faster than \(1/k^2\)
Cited In (6)
- Nonlinearly preconditioned semismooth Newton algorithms for nonlinear nonsmooth systems
- On the efficiency of combining different methods for acceleration of iterations at the solution of PDEs by the method of collocations and least residuals
- From differential equation solvers to accelerated first-order methods for convex optimization
- Accelerated high-index saddle dynamics method for searching high-index saddle points
- Distributed minimal residual (DMR) method for acceleration of iterative algorithms
- Anderson acceleration of the Jacobi iterative method: an efficient alternative to Krylov methods for large, sparse linear systems
Uses Software
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)
