A 5-instant finite difference formula to find discrete time-varying generalized matrix inverses, matrix inverses, and scalar reciprocals
From MaRDI portal
(Redirected from Publication:2420161)
Recommendations
- An efficient computation of generalized inverse of a matrix
- Finding generalized inverses by a fast and efficient numerical method
- scientific article; zbMATH DE number 428073
- scientific article; zbMATH DE number 1740438
- A fast numerical algorithm for the inverse of a tridiagonal and pentadiagonal matrix
- On recursive calculation of the generalized inverse of a matrix
- Computation of generalized matrix inverses and applications
- scientific article; zbMATH DE number 5259791
- A new recursive algorithm for inverting general periodic pentadiagonal and anti-pentadiagonal matrices
- scientific article; zbMATH DE number 4024634
Cites work
- scientific article; zbMATH DE number 925118 (Why is no real title available?)
- A class of finite-time dual neural networks for solving quadratic programming problems and its \(k\)-winners-take-all application
- A dual neural network for convex quadratic programming subject to linear equality and inequality constraints
- A recurrent neural network with exponential convergence for solving convex quadratic program and related linear piecewise equations
- A recursive partitioning algorithm for inverting tridiagonal matrices
- A way to obtain Monte Carlo matrix inversion with minimal error
- An Introduction to Numerical Analysis
- An implicit iterative process for matrix inversion
- Behavioural modelling using the MOESP algorithm, dynamic neural networks and the Bartels-Stewart algorithm
- 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
- Different Zhang functions leading to different Zhang-dynamics models illustrated via time-varying reciprocal solving
- Discrete-time ZD, GD and NI for solving nonlinear time-varying equations
- Dynamical methods for polar decomposition and inversion of matrices
- From Zhang Neural Network to Newton Iteration for Matrix Inversion
- Generalized matrix inversion is not harder than matrix multiplication
- Gradient based iterative algorithms for solving a class of matrix equations
- Inversion Of A Generalized Vandermonde Matrix
- Parallel computation of entries of \({A}^{-1}\)
- Presentation, error analysis and numerical experiments on a group of 1-step-ahead numerical differentiation formulas
- Recurrent implicit dynamics for online matrix inversion
- Robustness analysis of a hybrid of recursive neural dynamics for online matrix inversion
- Taylor-type 1-step-ahead numerical differentiation rule for first-order derivative approximation and ZNN discretization
- Theoretical and Computational Issues of Optimal Control for Distributed Hopfield Neural Network Equations with Diffusion Term
Cited in
(5)- Relationship between time-instant number and precision of ZeaD formulas with proofs
- Time-varying matrix eigenanalyses via Zhang neural networks and look-ahead finite difference equations
- Zhang Neural Networks for fast and accurate computations of the field of values
- Continuous and discrete zeroing dynamics models using JMP function array and design formula for solving time-varying Sylvester-transpose matrix inequality
- The construction of high order convergent look-ahead finite difference formulas for Zhang neural networks
This page was built for publication: A 5-instant finite difference formula to find discrete time-varying generalized matrix inverses, matrix inverses, and scalar reciprocals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2420161)
