Relationship between time-instant number and precision of ZeaD formulas with proofs
DOI10.1007/S11075-020-01061-XzbMATH Open1491.65076OpenAlexW3159834760WikidataQ113900682 ScholiaQ113900682MaRDI QIDQ820734FDOQ820734
Authors: Min Yang, Yunong Zhang, Haifeng Hu 
Publication date: 27 September 2021
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-020-01061-x
Recommendations
- General four-step discrete-time zeroing and derivative dynamics applied to time-varying nonlinear optimization
- Discrete-time ZD, GD and NI for solving nonlinear time-varying equations
- Discrete-time Zhang neural networks for time-varying nonlinear optimization
- Design and analysis of two discrete-time ZD algorithms for time-varying nonlinear minimization
- Continuous and discrete zeroing dynamics models using JMP function array and design formula for solving time-varying Sylvester-transpose matrix inequality
time-varying optimizationconvergent difference formulasfinite difference formulasprecision of finite difference formulastime-instant numbertime-varying matrix algorithmtime-varying matrix problemsZhang neural networks
Artificial neural networks and deep learning (68T07) Basic linear algebra (15A99) General theory of difference equations (39A05) Numerical methods for initial value problems involving ordinary differential equations (65L05) Numerical methods for ordinary differential equations (65L99)
Cites Work
- Title not available (Why is that?)
- An Introduction to Numerical Analysis
- Discrete-time ZD, GD and NI for solving nonlinear time-varying equations
- Continuous and discrete Zhang dynamics for real-time varying nonlinear optimization
- Continuous and discrete time Zhang dynamics for time-varying 4th root finding
- Design and analysis of two discrete-time ZD algorithms for time-varying nonlinear minimization
- General four-step discrete-time zeroing and derivative dynamics applied to time-varying nonlinear optimization
- A neurodynamic approach to nonlinear optimization problems with affine equality and convex inequality constraints
- Continuous and discrete zeroing neural dynamics handling future unknown-transpose matrix inequality as well as scalar inequality of linear class
- General five-step discrete-time Zhang neural network for time-varying nonlinear optimization
- Stepsize domain confirmation and optimum of zead formula for future optimization
- A 5-instant finite difference formula to find discrete time-varying generalized matrix inverses, matrix inverses, and scalar reciprocals
- New five-step DTZD algorithm for future nonlinear minimization with quartic steady-state error pattern
- Continuous and discrete zeroing dynamics models using JMP function array and design formula for solving time-varying Sylvester-transpose matrix inequality
- A New Varying-Parameter Convergent-Differential Neural-Network for Solving Time-Varying Convex QP Problem Constrained by Linear-Equality
- Discrete-time consensus filters for average tracking of time-varying inputs on directed switching graphs
Cited In (5)
- Time-varying matrix eigenanalyses via Zhang neural networks and look-ahead finite difference equations
- Discrete generalized-Sylvester matrix equation solved by RNN with a novel direct discretization numerical method
- Tracking control of ship course system using new six-step ZeaD (Zhang et al discretization) formula with high precision
- New models for solving time-varying LU decomposition by using ZNN method and ZeaD formulas
- The construction of high order convergent look-ahead finite difference formulas for Zhang neural networks
This page was built for publication: Relationship between time-instant number and precision of ZeaD formulas with proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820734)
