A Fast Algorithm of Moore-Penrose Inverse for the Loewner-Type Matrix
A Fast Algorithm of Moore-Penrose Inverse for the Loewner-Type Matrix
In this paper, we present a fast algorithm of Moore‐Penrose inverse for m × n Loewner‐type matrix with full column rank by forming a special block matrix and studying its inverse. Its computation complexity is O ( m n ) + O ( n 2 ), but it is O …