On Richardson's Method for Solving Linear Systems with Positive Definite Matrices
From MaRDI portal
Cited in
(32)- Stepsize restrictions for stability in the numerical solution of ordinary and partial differential equations
- A survey of the iterative methods for the solution of linear systems by extrapolation, relaxation and other techniques
- On the acceleration of the preconditioned simultaneous displacement method
- On the general problem of formulation and optimization of a p-parametric extrapolated alternating direction implicit sheme
- Iterative solution of linear systems in the 20th century
- Pseudoinverse preconditioners and iterative methods for large dense linear least-squares problems
- The development of Runge-Kutta methods for partial differential equations
- A cyclic projected gradient method
- Cyclic schemes for PDE-based image analysis
- A fast explicit diffusion algorithm of fractional order anisotropic diffusion for image denoising
- On some convergence results of the k-step iterative methods
- Controlled overrelaxation method and the general extrapolation method
- The life and times of Dr David M. Young, Jr
- Iterative algorithms and software for solving large sparse linear systems
- Composite convergence bounds based on Chebyshev polynomials and finite precision conjugate gradient computations
- scientific article; zbMATH DE number 7202316 (Why is no real title available?)
- Milestones in the development of iterative solution methods
- Coupled Harmonic Equations, SOR, and Chebyshev Acceleration
- A generalized SSOR method
- The problem of optimization of trinomial iteration processes
- Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods
- Provably faster gradient descent via long steps
- On the equivalence between the scheduled relaxation Jacobi method and Richardson's non-stationary method
- Momentum-accelerated Richardson(m) neural solvers and their multi-level extensions
- Acceleration methods for fixed-point iterations
- Application of Chebyshev methods for solving elliptic equations on voxel meshes
- A comparative study on low-memory iterative solvers for FFT-based homogenization of periodic media
- Complexity of minimizing regularized convex quadratic functions
- Learning algorithm hyperparameters for fast parametric convex optimization
- Good regularity creates large learning rate implicit biases: edge of stability, balancing, and catapult
- The application of Leja points to Richardson iteration and polynomial preconditioning
- Implementation of an adaptive algorithm for Richardson's method
This page was built for publication: On Richardson's Method for Solving Linear Systems with Positive Definite Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5826015)
