Rates of Convergence for a Class of Iterative Procedures
From MaRDI portal
Cited in
(9)- The root and Bell's disk iteration methods are of the same error propagation characteristics in the simultaneous determination of the zeros of a polynomial. I: Correction methods
- k-step iterative methods for solving nonlinear systems of equations
- Iterative k-step methods for computing possibly repulsive fixed points in Banach spaces
- On the local convergence of certain two step iterative procedures
- From linear to nonlinear iterative methods
- A class of gradient unconstrained minimization algorithms with adaptive stepsize
- ADAPTIVE ALGORITHMS FOR NEURAL NETWORK SUPERVISED LEARNING: A DETERMINISTIC OPTIMIZATION APPROACH
- On the acceleration of the backpropagation training method
- A minimum norm approach for low-rank approximations of a matrix
This page was built for publication: Rates of Convergence for a Class of Iterative Procedures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5640662)