Efficient Acceleration Techniques for Fixed Point Algorithms
From MaRDI portal
Publication:4179756
DOI10.1137/0715065zbMath0396.65022OpenAlexW2073862944MaRDI QIDQ4179756
Michael J. Todd, Romesh Saigal
Publication date: 1978
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: http://www.kellogg.northwestern.edu/research/math/papers/261.pdf
Newton's MethodIterative MethodNonlinear Equations in Rn-SpaceAcceleration of ConvergenceFixed Point Algorithm
Numerical computation of solutions to systems of equations (65H10) Acceleration of convergence in numerical analysis (65B99)
Related Items (21)
Solving spline-collocation approximations to nonlinear two-point boundary-value problems by a homotopy method ⋮ A PL homotopy continuation method with the use of an odd map for the artificial level ⋮ The primal power affine scaling method ⋮ A note on computing equilibria in economies with activity analysis models of production ⋮ A closed-form bound on the asymptotic linear convergence of iterative methods via fixed point analysis ⋮ Engineering applications of the Chow-Yorke algorithm ⋮ Deforming subdivisions ⋮ Under-relaxed quasi-Newton acceleration for an inverse fixed-point problem coming from positron emission tomography ⋮ Efficiency and implementation of simplicial zero point algorithms ⋮ Globally convergent homotopy methods: A tutorial ⋮ A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization ⋮ Exploiting structure in piecewise-linear homotopy algorithms for solving equations ⋮ Computational experience with the Chow—Yorke algorithm ⋮ A new subdivision for computing fixed points with a homotopy algorithm ⋮ A variable-dimension simplicial algorithm for antipodal fixed-point theorems ⋮ Piecewise linear paths to minimize convex functions may not be monotonic ⋮ The octahedral algorithm, a new simplicial fixed point algorithm ⋮ On accelerating PL continuation algorithms by predictor—corrector methods ⋮ Piecewise linear methods for nonlinear equations and optimization ⋮ Model transform and local parameters. Application to instantaneous attractors ⋮ Permutation congruent transformations of the freudenthal triangulation with minimum surface density
This page was built for publication: Efficient Acceleration Techniques for Fixed Point Algorithms
