The Moore-Penrose Inverse for Generalized Row(Column)Symmetric Matrix
Wei Guo
Abstract
Wei Guo
Abstract
The concept of generalized row(column)symmetric matrix is given,its full rank decomposition and singular value decomposition are studied.By the two decompositions and orthogonal equivalence,three shortcut counting methods of the Moore-Penrose inverse for generalized row(column)symmetric matrix are obtained,which can dramatically reduce the amount of calculation and save the CPU time and memory,which extend the results of the related references and which spread its application scope.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The concept of generalized row(column)symmetric matrix is given,its full rank decomposition and singular value decomposition are studied.By the two decompositions and orthogonal equivalence,three shortcut counting methods of the Moore-Penrose inverse for generalized row(column)symmetric matrix are obtained,which can dramatically reduce the amount of calculation and save the CPU time and memory,which extend the results of the related references and which spread its application scope.
Key concepts: Column (typography), Singular value decomposition, Inverse, Mathematics, Matrix (chemical analysis), Equivalence (formal languages), Rank (graph theory), Moore–Penrose pseudoinverse