New models for solving time-varying LU decomposition by using ZNN method and ZeaD formulas
From MaRDI portal
Publication:2036048
DOI10.1155/2021/6627298zbMath1477.65057OpenAlexW3155208883WikidataQ113758338 ScholiaQ113758338MaRDI QIDQ2036048
Liangjie Ming, Jinjin Guo, Yu-Nong Zhang, Xiao Liu, Zhong-hua Li
Publication date: 28 June 2021
Published in: Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2021/6627298
Factorization of matrices (15A23) Direct numerical methods for linear systems and matrix inversion (65F05)
Uses Software
Cites Work
- Unnamed Item
- Applying LU decomposition of matrices to design anonymity bilateral remote user authentication scheme
- Zhang neural network solving for time-varying full-rank matrix Moore-Penrose inverse
- General four-step discrete-time zeroing and derivative dynamics applied to time-varying nonlinear optimization
- Two finite-time convergent Zhang neural network models for time-varying complex matrix Drazin inverse
- Nonlinear recurrent neural networks for finite-time solution of general time-varying linear matrix equations
- A neurodynamic approach to nonlinear optimization problems with affine equality and convex inequality constraints
- Minimum deviation, quasi-LU factorization of nonsingular matrices
- Continuous and discrete zeroing dynamics models using JMP function array and design formula for solving time-varying Sylvester-transpose matrix inequality
- An Introduction to Numerical Analysis
- Numerical Methods for Ordinary Differential Equations
This page was built for publication: New models for solving time-varying LU decomposition by using ZNN method and ZeaD formulas