Moore Penrose inverse for row or column symmetric matrix
Jia An-ping
Abstract
Jia An-ping
Abstract
The problem of fast computing the Moore Penrose inverse of row or column symmetric(matrix) is condidered.Two new algorithms based on a correspondence of Moore Penrose inverse(matrices) between the row or column symmetric matrix and its mother matrix are obtained.Theoretical analysis and numerical evidence show that,for a class of row or column symmetric matrices,using the mother matrix rather than the row or column symmeric matrix per se can save dramatically the CPU time and memory without loss of any numerical precision,when computing the Moore Penrose(inverse).
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
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 problem of fast computing the Moore Penrose inverse of row or column symmetric(matrix) is condidered.Two new algorithms based on a correspondence of Moore Penrose inverse(matrices) between the row or column symmetric matrix and its mother matrix are obtained.Theoretical analysis and numerical evidence show that,for a class of row or column symmetric matrices,using the mother matrix rather than the row or column symmeric matrix per se can save dramatically the CPU time and memory without loss of any numerical precision,when computing the Moore Penrose(inverse).
Key concepts: Column (typography), Inverse, Matrix (chemical analysis), Mathematics, Symmetric matrix, Combinatorics, Row and column spaces, Band matrix