A 5-instant finite difference formula to find discrete time-varying generalized matrix inverses, matrix inverses, and scalar reciprocals

DOI10.1007/s11075-018-0564-5zbMath1434.65022OpenAlexW2809770557WikidataQ129618551 ScholiaQ129618551MaRDI QIDQ2420161

Mingzhi Mao, Frank Uhlig, Jian Li, Yu-Nong Zhang

Publication date: 5 June 2019

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-018-0564-5

zbMATH Keywords

matrix inversefinite difference formulageneralized matrix inversediscrete time-varying inversesscalar reciprocal

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Theory of matrix inversion and generalized inverses (15A09) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Relationship between time-instant number and precision of ZeaD formulas with proofs ⋮ Continuous and discrete zeroing dynamics models using JMP function array and design formula for solving time-varying Sylvester-transpose matrix inequality ⋮ Zhang Neural Networks for fast and accurate computations of the field of values ⋮ Time-varying matrix eigenanalyses via Zhang neural networks and look-ahead finite difference equations ⋮ The construction of high order convergent look-ahead finite difference formulas for Zhang Neural Networks

Cites Work

• Unnamed Item
• Continuous and discrete Zhang dynamics for real-time varying nonlinear optimization
• Continuous and discrete time Zhang dynamics for time-varying 4th root finding
• Robustness analysis of a hybrid of recursive neural dynamics for online matrix inversion
• 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
• A class of finite-time dual neural networks for solving quadratic programming problems and its \(k\)-winners-take-all application
• Behavioural modelling using the MOESP algorithm, dynamic neural networks and the Bartels-Stewart algorithm
• A way to obtain Monte Carlo matrix inversion with minimal error
• Generalized matrix inversion is not harder than matrix multiplication
• Dynamical methods for polar decomposition and inversion of matrices
• 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
• Presentation, error analysis and numerical experiments on a group of 1-step-ahead numerical differentiation formulas
• Taylor-type 1-step-ahead numerical differentiation rule for first-order derivative approximation and ZNN discretization
• Recurrent implicit dynamics for online matrix inversion
• Discrete-time ZD, GD and NI for solving nonlinear time-varying equations
• A recursive partitioning algorithm for inverting tridiagonal matrices
• An implicit iterative process for matrix inversion
• Inversion Of A Generalized Vandermonde Matrix
• An Introduction to Numerical Analysis
• From Zhang Neural Network to Newton Iteration for Matrix Inversion
• Parallel Computation of Entries of ${A}^{-1}$
• Gradient based iterative algorithms for solving a class of matrix equations
• Theoretical and Computational Issues of Optimal Control for Distributed Hopfield Neural Network Equations with Diffusion Term

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