Time-varying square roots finding via Zhang dynamics versus gradient dynamics and the former's link and new explanation to Newton-Raphson iteration
DOI10.1016/j.ipl.2010.09.013zbMath1380.65086OpenAlexW2051969395MaRDI QIDQ1675875
Publication date: 3 November 2017
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.09.013
real-time systemsparallel algorithmsNewton-Raphson iterationgradient dynamicsZhang dynamicsindefinite error-functionsquare roots finding
Nonlinear ordinary differential equations and systems (34A34) Parallel numerical computation (65Y05) General biology and biomathematics (92B05) Numerical computation of roots of polynomial equations (65H04)
Related Items (15)
Uses Software
Cites Work
- Unnamed Item
- Zhang neural network for online solution of time-varying convex quadratic program subject to time-varying linear-equality constraints
- Improved generalized Atkin algorithm for computing square roots in finite fields
- How much precision is needed to compare two sums of square roots of integers?
- Stable iterations for the matrix square root
- Improving Newton-Raphson method for nonlinear equations by modified Adomian decomposition method
- A new iterative method to compute nonlinear equations
- From Zhang Neural Network to Newton Iteration for Matrix Inversion
This page was built for publication: Time-varying square roots finding via Zhang dynamics versus gradient dynamics and the former's link and new explanation to Newton-Raphson iteration