A Fast Algorithm of Moore-Penrose Inverse for the Loewner-Type Matrix

Table 1

Orders of matrix		Fast algorithm		𝐋^+=(𝐋^𝑇𝐋)^−1𝐋^T
𝑚	𝑛	Err.	Tim.	Err.	Tim.
10000	20	7.254𝑒−16	2	8.109𝑒−14	11
20000	20	2.398𝑒−15	2	2.788𝑒−14	31
30000	20	2.019𝑒−15	5	2.106𝑒−14	89
40000	20	9.108𝑒−14	8	1.001𝑒−14	201
60000	20	4.901𝑒−14	36	3.760𝑒−14	705