Acceleration methods for fixed-point iterations
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3114505 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 781821 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 3368076 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3111466 (Why is no real title available?)
- A Polynomial Extrapolation Method for Finding Limits and Antilimits of Vector Sequences
- A Proof That Anderson Acceleration Improves the Convergence Rate in Linearly Converging Fixed-Point Methods (But Not in Those Converging Quadratically)
- A Stochastic Approximation Method
- A Study of a Numerical Solution to a Two-Dimensional Hydrodynamical Problem
- A comparative study on methods for convergence acceleration of iterative vector sequences
- A simple solution of the Bratu problem
- Acceleration Techniques for Iterated Vector and Matrix Problems
- Acceleration of Convergence of Vector Sequences
- Acceleration of the convergence of iterative processes and a method of solving systems of non-linear equations
- Accuracy and effectiveness of the Lanczos algorithm for the symmetric eigenproblem
- Accélération de la convergence en analyse numérique
- An analysis for some methods and algorithms of quantum chemistry
- Anderson acceleration for contractive and noncontractive operators
- Anderson acceleration for fixed-point iterations
- Anderson acceleration of the alternating projections method for computing the nearest correlation matrix
- Anderson acceleration with truncated Gram-Schmidt
- Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods. I, II
- Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations
- Convergence Theory of Nonlinear Newton–Krylov Algorithms
- Convergence acceleration during the 20th century
- Convergence acceleration for the iterative solution of the equations X = AX + f
- Convergence analysis for Anderson acceleration
- Convergence analysis of adaptive DIIS algorithms with application to electronic ground state calculations
- Convex optimization: algorithms and complexity
- Extrapolation Methods for Vector Sequences
- Extrapolation and rational approximation. The works of the main contributors
- Extrapolation methods theory and practice
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Generalized conjugate-gradient acceleration of nonsymmetrizable iterative methods
- Globally Convergent Inexact Newton Methods
- Globally Convergent Type-I Anderson Acceleration for Nonsmooth Fixed-Point Iterations
- Généralisations de la transformation de Shanks, de la table de Padé et de l'\(\varepsilon\)-algorithme
- Hybrid Krylov Methods for Nonlinear Systems of Equations
- Inexact Newton Methods
- Iterative Procedures for Nonlinear Integral Equations
- Iterative residual-based vector methods to accelerate fixed point iterations
- Krylov methods for nonsymmetric linear systems. From theory to computations
- Least-square acceleration of iterative methods for linear equations
- Methods of conjugate gradients for solving linear systems
- Numerical methods for electronic structure calculations of materials
- Numerical methods for large eigenvalue problems
- On Bernoulli's numerical solution of algebraic equations.
- On Richardson's Method for Solving Linear Systems with Positive Definite Matrices
- On a Device for Computing the e m (S n ) Transformation
- On acceleration methods for coupled nonlinear elliptic systems
- On the Numerical Solution of Elliptic Difference Equations
- On the kernel of vector \(\varepsilon \)-algorithm and related topics
- On the similarities between the quasi-Newton inverse least squares method and GMRES
- On‐line learning for very large data sets
- Optimization methods for large-scale machine learning
- Padé-type approximation and general orthogonal polynomials
- Probabilistic machine learning. An introduction
- Quantum mechanics of many electron systems.
- Shanks and Anderson-type acceleration techniques for systems of nonlinear equations
- Solving linear algebraic equations can be interesting
- Some results about vector extrapolation methods and related fixed-point iterations
- The Liouville-Bratu-Gelfand problem for radial operators
- The approximate arithmetic solution by finite differences of physical problems involving differential equations, with an application to the stresses in a masonry dam.
- The genesis and early developments of Aitken's process, Shanks' transformation, the \(\varepsilon\)-algorithm, and related fixed point methods
- The origin of the method of steepest descent
- Two classes of multisecant methods for nonlinear acceleration
- Use of Tschebyscheff-Polynomial Operators in the Numerical Solution of Boundary-Value Problems
- Variational Iterative Methods for Nonsymmetric Systems of Linear Equations
- Vector extrapolation methods. Applications and numerical comparison
- nlTGCR: A Class of Nonlinear Acceleration Procedures Based on Conjugate Residuals
This page was built for publication: Acceleration methods for fixed-point iterations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6964451)
