Time-Varying Pseudoinversion Based on Full-Rank Decomposition and Zeroing Neural Networks

被引:6
作者
Alharbi, Hadeel [1 ]
Jerbi, Houssem [2 ]
Kchaou, Mourad [3 ]
Abbassi, Rabeh [3 ]
Simos, Theodore E. [4 ,5 ,6 ,7 ]
Mourtas, Spyridon D. [8 ,9 ]
Katsikis, Vasilios N. [8 ]
机构
[1] Univ Hail, Coll Comp Sci & Engn, Dept Comp Sci, Hail 1234, Saudi Arabia
[2] Univ Hail, Coll Engn, Dept Ind Engn, Hail 1234, Saudi Arabia
[3] Univ Hail, Coll Engn, Dept Elect Engn, Hail 1234, Saudi Arabia
[4] China Med Univ, China Med Univ Hosp, Dept Med Res, Taichung 40402, Taiwan
[5] Ulyanovsk State Tech Univ, Lab Interdisciplinary Problems Energy Prod, 32 Severny Venetz St, Ulyanovsk 432027, Russia
[6] Neijing Normal Univ, Data Recovery Key Lab Sichun Prov, Neijiang 641100, Peoples R China
[7] Democritus Univ Thrace, Dept Civil Engn, Sect Math, Xanthi 67100, Greece
[8] Natl & Kapodistrian Univ Athens, Dept Econ Math Informat & Stat Econometr, Sofokleous 1 St, Athens 10559, Greece
[9] Siberian Fed Univ, Lab Hybrid Methods Modelling & Optimizat Complex S, Prosp Svobodny 79, Krasnoyarsk 660041, Russia
关键词
pseudoinversion; dynamical system; full-rank decomposition; zeroing neural networks; MOORE-PENROSE INVERSE; MATRIX; OPTIMIZATION; DESIGN; SCHEME; MODEL; ZFS;
D O I
10.3390/math11030600
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The computation of the time-varying matrix pseudoinverse has become crucial in recent years for solving time-varying problems in engineering and science domains. This paper investigates the issue of calculating the time-varying pseudoinverse based on full-rank decomposition (FRD) using the zeroing neural network (ZNN) method, which is currently considered to be a cutting edge method for calculating the time-varying matrix pseudoinverse. As a consequence, for the first time in the literature, a new ZNN model called ZNNFRDP is introduced for time-varying pseudoinversion and it is based on FRD. Five numerical experiments investigate and confirm that the ZNNFRDP model performs as well as, if not better than, other well-performing ZNN models in the calculation of the time-varying pseudoinverse. Additionally, theoretical analysis and numerical findings have both supported the effectiveness of the proposed model.
引用
收藏
页数:14
相关论文
共 40 条
[1]  
Aleskerov F., 2011, LINEAR ALGEBRA ECONO, DOI [10.1007/978-3-642-20570-5, DOI 10.1007/978-3-642-20570-5]
[2]   Service provider portfolio selection for project management using a BP neural network [J].
Bai, Libiao ;
Zheng, Kanyin ;
Wang, Zhiguo ;
Liu, Jiale .
ANNALS OF OPERATIONS RESEARCH, 2022, 308 (1-2) :41-62
[3]  
Ben-Israel A., 2003, CMS Books in Mathematics, V2, DOI [DOI 10.1007/B97366, 10.1007/b97366]
[4]   A Neural Network for Moore-Penrose Inverse of Time-Varying Complex-Valued Matrices [J].
Chai, Yiyuan ;
Li, Haojin ;
Qiao, Defeng ;
Qin, Sitian ;
Feng, Jiqiang .
INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2020, 13 (01) :663-671
[5]   A fuzzy adaptive zeroing neural network with superior finite-time convergence for solving time-variant linear matrix equations [J].
Dai, Jianhua ;
Tan, Ping ;
Yang, Xing ;
Xiao, Lin ;
Jia, Lei ;
He, Yongjun .
KNOWLEDGE-BASED SYSTEMS, 2022, 242
[6]   Design and Analysis of a Self-Adaptive Zeroing Neural Network for Solving Time-Varying Quadratic Programming [J].
Dai, Jianhua ;
Yang, Xing ;
Xiao, Lin ;
Jia, Lei ;
Liu, Xinwang ;
Wang, Yaonan .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2023, 34 (10) :7135-7144
[7]  
Graham A., 2018, Kronecker Products and Matrix Calculus with Applications
[8]  
Gupta A.K., 2014, MATLAB Solutions Series
[9]   Time-varying mean-variance portfolio selection problem solving via LVI-PDNN [J].
Katsikis, Vasilios N. ;
Mourtas, Spyridon D. ;
Stanimirovic, Predrag S. ;
Li, Shuai ;
Cao, Xinwei .
COMPUTERS & OPERATIONS RESEARCH, 2022, 138
[10]   An improved method for the computation of the Moore-Penrose inverse matrix [J].
Katsikis, Vasilios N. ;
Pappas, Dimitrios ;
Petralias, Athanassios .
APPLIED MATHEMATICS AND COMPUTATION, 2011, 217 (23) :9828-9834