Continuous and discrete zeroing dynamics models using JMP function array and design formula for solving time-varying Sylvester-transpose matrix inequality
From MaRDI portal
Publication:2661682
Recommendations
- Continuous and discrete zeroing neural dynamics handling future unknown-transpose matrix inequality as well as scalar inequality of linear class
- Proposing, developing and verification of a novel discrete-time zeroing neural network for solving future augmented Sylvester matrix equation
- Improved finite-time solutions to time-varying Sylvester tensor equation via zeroing neural networks
- Solving time-varying nonlinear inequalities using continuous and discrete-time Zhang dynamics
- Discrete-time ZD, GD and NI for solving nonlinear time-varying equations
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- A 5-instant finite difference formula to find discrete time-varying generalized matrix inverses, matrix inverses, and scalar reciprocals
- A hybrid algorithm for solving linear inequalities in a least squares sense
- An Introduction to Numerical Analysis
- 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
- Developing BiCOR and CORS methods for coupled Sylvester-transpose and periodic Sylvester matrix equations
- Discrete-time ZD, GD and NI for solving nonlinear time-varying equations
- Extending LSQR methods to solve the generalized Sylvester-transpose and periodic Sylvester matrix equations
- Extending the CGLS algorithm for least squares solutions of the generalized Sylvester-transpose matrix equations
- Image space analysis for vector variational inequalities with matrix inequality constraints and applications
- LMI Techniques for Optimization Over Polynomials in Control: A Survey
- Matrix iterative methods for solving the Sylvester-transpose and periodic Sylvester matrix equations
- Neural networks for solving linear inequality systems
- New five-step DTZD algorithm for future nonlinear minimization with quartic steady-state error pattern
- New iterative methods for linear inequalities
- Numerical Methods for Ordinary Differential Equations
- Optimal zeroing dynamics with applications to control of serial and parallel manipulators
- Robust adaptive learning of feedforward neural networks via LMI optimizations
- Stepsize domain confirmation and optimum of zead formula for future optimization
- The inexact fixed matrix iteration for solving large linear inequalities in a least squares sense
- Zhang neural network solving for time-varying full-rank matrix Moore-Penrose inverse
Cited in
(5)- Relationship between time-instant number and precision of ZeaD formulas with proofs
- Discrete generalized-Sylvester matrix equation solved by RNN with a novel direct discretization numerical method
- Continuous and discrete zeroing neural dynamics handling future unknown-transpose matrix inequality as well as scalar inequality of linear class
- New models for solving time-varying LU decomposition by using ZNN method and ZeaD formulas
- New zeroing neural dynamics models for diagonalization of symmetric matrix stream
This page was built for publication: Continuous and discrete zeroing dynamics models using JMP function array and design formula for solving time-varying Sylvester-transpose matrix inequality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2661682)
