𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The computing of pseudo-inverse matrices

✍ Scribed by E.L. Zhukovskii; R.Sh. Liptser


Publisher
Elsevier Science
Year
1975
Weight
321 KB
Volume
15
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A p-adic algorithm for computing the inv
✍ H. Haramoto; M. Matsumoto πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 270 KB

A method for computing the inverse of an (n Γ— n) integer matrix A using p-adic approximation is given. The method is similar to Dixon's algorithm, but ours has a quadratic convergence rate. The complexity of this algorithm (without using FFT or fast matrix multiplication) is O(n 4 (log n) 2 ), the s

A new method for computing Moore–Penrose
✍ F. Toutounian; A. Ataei πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 339 KB

The Moore-Penrose inverse of an arbitrary matrix (including singular and rectangular) has many applications in statistics, prediction theory, control system analysis, curve fitting and numerical analysis. In this paper, an algorithm based on the conjugate Gram-Schmidt process and the Moore-Penrose i

The inversion of matrices by the double-
✍ M.D. Levin; D.J. Evans πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 361 KB

Levin, M\_D. and D\_J. Evans, The inversion of matrices by the double-bordering algorithm on MIMD computers, Parallel Computing 17 (1991) 591-602\_ A new algorithm, the double-bordering algorithm, for the solution of linear systems of equations is derived, and adapted to enable it to perform matrix