Time-varying square roots finding via Zhang dynamics versus gradient dynamics and the former's link and new explanation to Newton-Raphson iteration
type: Item
instance of: scholarly article
title: Time-varying square roots finding via Zhang dynamics versus gradient dynamics and the former's link and new explanation to Newton-Raphson iteration
zbMATH Open document ID: 1380.65086
author: Peng Zhang
published in: Information Processing Letters
publication date: 2017-11-03T00:00:00Z
Mathematics Subject Classification ID: 65H04
Mathematics Subject Classification ID: 34A34
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 92B05
zbMATH DE Number: 6802711
zbMATH Keywords: parallel algorithms
zbMATH Keywords: real-time systems
zbMATH Keywords: Zhang dynamics
zbMATH Keywords: gradient dynamics
zbMATH Keywords: indefinite error-function
zbMATH Keywords: square roots finding
zbMATH Keywords: Newton-Raphson iteration
describes a project that uses: Simulink
MaRDI profile type: Publication
full work available at URL: j.ipl.2010.09.013
OpenAlex ID: W2051969395
cites work: Stable iterations for the matrix square root
cites work: Improved generalized Atkin algorithm for computing square roots in finite fields
cites work: Improving Newton-Raphson method for nonlinear equations by modified Adomian decomposition method
cites work: How much precision is needed to compare two sums of square roots of integers?
cites work: A new iterative method to compute nonlinear equations
cites work: Q4692495
cites work: Zhang neural network for online solution of time-varying convex quadratic program subject to time-varying linear-equality constraints
cites work: From Zhang Neural Network to Newton Iteration for Matrix Inversion
DOI: 10.1016/J.IPL.2010.09.013
description: scientific article; zbMATH DE number 6802711