Relationship between time-instant number and precision of ZeaD formulas with proofs
For time-varying numerical matrix problems, the paper studies the coefficients \(a_i\) of look-ahead and convergent discretization formulas \(\dot x_k = a_{m-1} x_{k+1}/\tau + \dots + a_0 x_{k-m+2}/\tau + O(\tau^p)\) that are used in Zhang Neural Networks (ZNN). The standard approach uses \(m\) Taylor expansions of \(x_{k+1}\) through \(x_{k-m+2}\) around \(x_k\) for a constant sampling gap \(\tau = x_j - x_{j-1}\). Forming the linear combination of these Taylor expansions with the coefficients \(a_{m-1}, \dots, a_0\) in turn then leads to a linear system for feasible \(a_j\) coefficients. If \(m > p+1\), then the linear system in \(a_j\) is solvable over the rational numbers and the relations between the coefficients can be exploited to reduce the solution set further. This method is applied to exhibit and study look-ahead and convergent finite difference formulas for various \(m\) and \(p\) values in light of their length \(m\) and their innate truncation error order \(O(\tau^p)\) on a time-varying quadratic optimization problem.
- 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
- A 5-instant finite difference formula to find discrete time-varying generalized matrix inverses, matrix inverses, and scalar reciprocals
- A neurodynamic approach to nonlinear optimization problems with affine equality and convex inequality constraints
- A New Varying-Parameter Convergent-Differential Neural-Network for Solving Time-Varying Convex QP Problem Constrained by Linear-Equality
- An Introduction to Numerical Analysis
- Continuous and discrete time Zhang dynamics for time-varying 4th root finding
- Continuous and discrete zeroing dynamics models using JMP function array and design formula for solving time-varying Sylvester-transpose matrix inequality
- Continuous and discrete zeroing neural dynamics handling future unknown-transpose matrix inequality as well as scalar inequality of linear class
- Continuous and discrete Zhang dynamics for real-time varying nonlinear optimization
- Design and analysis of two discrete-time ZD algorithms for time-varying nonlinear minimization
- Discrete-time consensus filters for average tracking of time-varying inputs on directed switching graphs
- Discrete-time ZD, GD and NI for solving nonlinear time-varying equations
- General five-step discrete-time Zhang neural network for time-varying nonlinear optimization
- General four-step discrete-time zeroing and derivative dynamics applied to time-varying nonlinear optimization
- scientific article; zbMATH DE number 53583 (Why is no real title available?)
- New five-step DTZD algorithm for future nonlinear minimization with quartic steady-state error pattern
- Stepsize domain confirmation and optimum of zead formula for future optimization
- New models for solving time-varying LU decomposition by using ZNN method and ZeaD formulas
- Time-varying matrix eigenanalyses via Zhang neural networks and look-ahead finite difference equations
- Tracking control of ship course system using new six-step ZeaD (Zhang et al discretization) formula with high precision
- The construction of high order convergent look-ahead finite difference formulas for Zhang neural networks
- Discrete generalized-Sylvester matrix equation solved by RNN with a novel direct discretization numerical method
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)
