Efficient Acceleration Techniques for Fixed Point Algorithms
From MaRDI portal
Cited in
(21)- Computational experience with the Chow—Yorke algorithm
- Model transform and local parameters. Application to instantaneous attractors
- Piecewise linear methods for nonlinear equations and optimization
- A note on computing equilibria in economies with activity analysis models of production
- The primal power affine scaling method
- Globally convergent homotopy methods: A tutorial
- On accelerating PL continuation algorithms by predictor—corrector methods
- A variable-dimension simplicial algorithm for antipodal fixed-point theorems
- Permutation congruent transformations of the freudenthal triangulation with minimum surface density
- Efficiency and implementation of simplicial zero point algorithms
- Solving spline-collocation approximations to nonlinear two-point boundary-value problems by a homotopy method
- Engineering applications of the Chow-Yorke algorithm
- A PL homotopy continuation method with the use of an odd map for the artificial level
- A new subdivision for computing fixed points with a homotopy algorithm
- Deforming subdivisions
- A quadratically-convergent fixed-point algorithm for economic equilibria and linearly constrained optimization
- The octahedral algorithm, a new simplicial fixed point algorithm
- Piecewise linear paths to minimize convex functions may not be monotonic
- A closed-form bound on the asymptotic linear convergence of iterative methods via fixed point analysis
- Under-relaxed quasi-Newton acceleration for an inverse fixed-point problem coming from positron emission tomography
- Exploiting structure in piecewise-linear homotopy algorithms for solving equations
This page was built for publication: Efficient Acceleration Techniques for Fixed Point Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4179756)
