Fast local convergence with single and multistep methods for nonlinear equations

DOI10.1017/S0334270000001077MaRDI QIDQ4131536zbMATH OpenOpenAlexFDO

Authors James P. Abbott, Richard P. Brent

Publication date 1975

Published in The Journal of the Australian Mathematical Society. Series B. Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0334270000001077

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Numerical methods for initial value problems involving ordinary differential equations (65L05)

Cited in

(12)

• Solving nonlinear systems with least significant bit accuracy
• Estimation of the sensitivity of linear and nonlinear algebraic problems
• Verified solution of large systems and global optimization problems
• Improved iteration schemes for validation algorithms for dense and sparse nonlinear systems
• An improved verification algorithm for nonlinear systems of equations based on Krawczyk operator
• Stability of singular equilibria in quasilinear implicit differential equations
• The application of Goeken-Johnson's Runge-Kutta methods in unconstrained convex optimization
• Application of the modified Runge-Kutta method to the construction of the descent method for solving boundary value problems
• Application of Runge-Kutta method with non-standard finite difference for the construction of preconditioned gradient methods
• Gradient methods based on non-standard Lagrange-Burmann Runge-Kutta method
• On the application of explicit Runge-Kutta methods to the construction of stochastic gradient descent methods for convex optimization
• On an application of dynamical systems theory to determine all the zeros of a vector function

This page was built for publication: Fast local convergence with single and multistep methods for nonlinear equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4131536)