✦ LIBER ✦

Recursive computation of pseudo-inverse of matrices

✍ Scribed by P.A. Janakiraman; S. Renganathan

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 205 KB
Volume: 18
Category: Article
ISSN: 0005-1098
DOI: 10.1016/0005-1098(82)90015-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Recursive Solvability of Problems with M

Recursive Solvability of Problems with Matrices

✍ Melven Krom; Myren Krom 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 380 KB

Frame Approximation of Pseudo-Inverse Op

Frame Approximation of Pseudo-Inverse Operators

✍ Ole Christensen 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 86 KB

Let T denote an operator on a Hilbert space • • , and let f i ∞ i=1 be a frame for the orthogonal complement of the kernel N T . We construct a sequence of operators n of the form n • = n i=1 • g n i f i which converges to the psuedoinverse T † of T in the strong operator topology as n → ∞. The oper

On inversion of complex matrices

✍ Adam Zielinski 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 206 KB

A method is presented for inverting an n x n complex matrix M = A + jB by using a real matrix inversion. The approach avoids the requirements of inverting a 2n X 2n real matrix as well as non-singularity assumptions placed on A or B, or A + B, or A -B, as required by earlier methods.

A BSP Recursive Divide and Conquer Algor

A BSP Recursive Divide and Conquer Algorithm to Compute the Inverse of a Tridiagonal Matrix

✍ Joan-Josep Climent; Leandro Tortosa; Antonio Zamora 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 253 KB

In this paper we discuss a recursive divide and conquer algorithm to compute the inverse of an unreduced tridiagonal matrix. It is based on the recursive application of the Sherman Morrison formula to a diagonally dominant tridiagonal matrix to avoid numerical stability problems. A theoretical study

Properties of Hadamard product of invers

Properties of Hadamard product of inverse M-matrices

✍ Chuansheng Yang; Chengxian Xu 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 102 KB

Computation of J-inner–outer factorizati

Computation of J-inner–outer factorizations of rational matrices

✍ Andras Varga; Tohru Katayama 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 294 KB

A new numerically reliable computational approach is proposed to compute the factorization of a rational transfer function matrix G as a product of a J-lossless factor with a stable, minimum-phase factor. In contrast to existing computationally involved 'one-shot' methods which require the solution