Abstract
Different from conventional gradient-based neural dynamics, a special type of neural dynamics has been proposed by Zhang et al. for online solution of time-varying and/or static (or termed, time-invariant) problems. The design of Zhang dynamics (ZD) is based on the elimination of an indefinite error function, instead of the elimination of a square-based positive (or at least lower-bounded) energy function usually associated with gradient dynamics (GD). In this paper, we generalize, propose and investigate the continuous-time ZD model and its discrete-time models in two situations (i.e., the time-derivative of the coefficient being known or unknown) for time-varying cube root finding, including the complex-valued continuous-time ZD model for finding cube roots in complex domain. In addition, to find the static scalar-valued cube root, a simplified continuous-time ZD model and its discrete-time model are generated. By focusing on such a static problem solving, Newton-Raphson iteration is found to be a special case of the discrete-time ZD model by utilizing the linear activation function and fixing the step-size value to be 1. Computer-simulation and testing results demonstrate the efficacy of the proposed ZD models (including real-valued ZD models and complex-valued ZD models) for time-varying and static cube root finding, as well as the link and new explanation to Newton-Raphson iteration.
Similar content being viewed by others
References
Turkowski K (1998) Computing the cube root. Technical Report, Apple Computer
Pińeiro JA, Bruguera JD, Lamberti F, Montuschi P (2008) A radix-2 digit-by-digit architecture for cube root. IEEE Trans Comput 57(4):562–566
Shin HC, Lee JA, Kim LS (1998) A minimized hardware architecture of fast phong shader using Taylor series approximation in 3D graphics. In: Proceedings of IEEE international conference on computer design: VLSI in computers and processors
Harrison J, Kubaska T, Story S, Tang PTP (1999) The computation of transcendental functions on the IA-64 architecture. Intel Technol J Q4:1–7
Ercegovac MD (2007) On digit-by-digit methods for computing certain functions. In: Proceedings of Asilomar conference on signals, systems, and computers
Peng H (1981) Algorithms for extracting square roots and cube roots. In: Proceedings of the 5th IEEE international symposium on computer arithmetic
Piñeiro JA, Bruguera JD, Muller JM (2001) Faithful powering computation using table look-up and fused accumulation tree. In: Proceedings of the 15th IEEE international symposium on computer arithmetic
Lin C (2005) Numerical computation methods. Science Press, Beijing
Zhang Y, Leithead WE, Leith DJ (2005) Time-series Gaussian process regression based on Toeplitz computation of O(N 2) operations and O(N)-level storage. In: Proceedings of the 44th IEEE conference on decision and control
Mead C (1989) Analogue VLSI and neural systems. Addison-Wesley, Reading
Zhang Y, Ma W, Li K, Yi C (2008) Brief history and prospect of coprocessors. China Sci Technol Inf 13:115–117
Yang Z, Xu D (2008) Global dynamics for non-autonomous reaction-diffusion neural networks with time-varying delays. Theor Comput Sci 403(1):3–10
Li L, Huang L (2010) Equilibrium analysis for improved signal range model of delayed cellular neural networks. Neural Process Lett 31(3):177–194
Lenze B (1998) Linking discrete orthogonality with dilation and translation for incomplete sigma-pi neural networks of Hopfield-type. Disc Appl Math 89(1–3):169–180
Gan Q, Xu R (2010) Global robust exponential stability of uncertain neutral high-order stochastic hopfield neural networks with time-varying delays. Neural Process Lett 32(1):83–96
Katada N, Nishimura H (2009) Stochastic resonance in recurrent neural network with Hopfield-type memory. Neural Process Lett 30(2):145–154
Mohamad S, Gopalsamy K (2000) Dynamics of a class of discrete-time neural networks and their continuous-time counterparts. Math Comput Simulation 53(1–2):1–39
Zhang Y, Ma W, Cai B (2009) From Zhang neural network to Newton iteration for matrix inversion. IEEE Trans Circuits Syst 56:1405–1415
Zhang Y, Yang Y (2008) Simulation and comparison of Zhang neural network and gradient neural network solving for time-varying matrix square roots. In: Proceedings of the 2nd international symposium on intelligent information technology application
Zhang Y, Jiang D, Wang J (2002) A recurrent neural network for solving Sylvester equation with time-varying coefficients. IEEE Trans Neural Netw 13:1053–1063
Zhang Y, Li Z (2009) Zhang neural network for online solution of time-varying convex quadratic program subject to time-varying linear-equality constraints. Phys Lett A 373(18-19):1639–1643
The MathWorks Inc (2008) Simulink 7 getting started guide. Natick, MA
Zhang Y, Xu P, Tan N (2009) Solution of nonlinear equations by continuous- and discrete-time Zhang dynamics and more importantly their links to Newton iteration. In: Proceedings of IEEE international conference information, communications and signal processing
Zhang Y, Ge SS (2005) Design and analysis of a general recurrent neural network model for time-varying matrix inversion. IEEE Trans Neural Netw 16:1477–1490
Zhang Y (2006) A set of nonlinear equations and inequalities arising in robotics and its online solution via a primal neural network. Neurocomputing 70(1–3):513–524
Mathews JH, Fink KD (2005) Numerical methods using MATLAB. Publishing House of Electronics Industry, Beijing
Feng J, Che G, Nie Y (2001) Principles of numerical analysis. Science Press, Beijing
Higham NJ (1997) Stable iterations for the matrix square root. Numer Algorith 15(2):227–242
Abbasbandy S (2003) Improving Newton-Raphson method for nonlinear equations by modified Adomian decomposition method. Appl Math Comput 145(2-3):887–893
Basto M, Semiao V, Calheiros FL (2006) A new iterative method to compute nonlinear equations. Appl Math Comput 173(1):468–483
Zhang Y (2007) Dual neural networks: design, analysis, and application to redundant robotics. In: Kang G B (eds) Progress in neurocomputing research, Nova Science Publishers, New York
Cardoso JR, Loureiro AF (2011) Iteration functions for pth roots of complex numbers. Numer Algor 57:329–56
Yau L, Ben-Israel A (1998) The Newton and Halley methods for complex roots. Am Math Mon 105:806–18
Abramov RV, Majda AJ (2007) Blended response algorithms for linear fluctuation-dissipation for complex nonlinear dynamical systems. Nonlinearity 20:2793–821
Mitra SK (2006) Digital signal processing-a computrer-based approach, 3rd edn. Tsinghua University Press, Beijing
Peitgen HO, Saupe D, Barnsley MF (1988) The science of fractal images. Springer, New York
Acknowledgments
This work is supported in part by the National Natural Science Foundation of China under Grant 61075121 and Grant 60935001, and also in part by the Fundamental Research Funds for the Central Universities of China.
Author information
Authors and Affiliations
Corresponding author
Appendix
Appendix
In this appendix, the discrete-time iteration model of the proposed complex-valued CTZD model (4) is developed and investigated for static cube root finding in complex domain, where, for example, let us consider the following static complex-valued cube root problem:
By following the ZD design method and using the Euler forward-difference rule, we obtain the corresponding complex-valued DTZD model as follows:
where h > 0 denotes the step-size (or say, step-length), being the same as before. It is worth pointing out that, similar to Newton fractals generated by solving nonlinear complex-valued equations via Newton-Raphson iteration [36], new fractals can be generated by using the complex-valued DTZD model (22) to solve complex-valued static cube root problem (21). In this appendix, the following hyperbolic-sine activation function (with parameter ξ ≥ 1) (which is newly introduced in the ZD research) is exploited, in addition to the aforementioned linear activation function:
For illustration and verification, the complex-valued DTZD model (22) with step-size h = 0.2 and using different activation functions is applied to the online solution of (21), and the corresponding numerical results are shown in Fig. 10. From Fig. 10a, c, we see that, by using different activation functions, different fractals are generated and visualized through the rectangle-area solution of nonlinear complex-valued equation (21) via the complex-valued DTZD model (22). In addition, the self-similar properties of the fractals are illustrated in Fig. 10b, d via partially enlarged view. Therefore, generating new fractals can be viewed as one of the interesting applications of the proposed ZD method in related scientific and engineering fields.
Rights and permissions
About this article
Cite this article
Zhang, Y., Ke, Z., Guo, D. et al. Solving for time-varying and static cube roots in real and complex domains via discrete-time ZD models. Neural Comput & Applic 23, 255–268 (2013). https://doi.org/10.1007/s00521-012-0842-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00521-012-0842-4