✦ LIBER ✦

Matrix decomposition : An APL function to compute the Cholesky factor of a gramian matrix

✍ Scribed by William T. McGowan

Book ID: 120726746
Publisher: Psychonomic Society Publications
Year: 1983
Tongue: English
Weight: 259 KB
Volume: 15
Category: Article
ISSN: 1554-351X
DOI: 10.3758/BF03203452

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cholesky decomposition with fixing nodes

Cholesky decomposition with fixing nodes to stable computation of a generalized inverse of the stiffness matrix of a floating structure

✍ T. Brzobohatý; Z. Dostál; T. Kozubek; P. Kovář; A. Markopoulos 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 537 KB

## Abstract The direct methods for the solution of systems of linear equations with a symmetric positive‐semidefinite (SPS) matrix __A__ usually comprise the Cholesky decomposition of a nonsingular diagonal block **A**~𝒥~𝒥 of **A** and effective evaluation of the action of a generalized inverse of

Avoiding the square-root bottleneck in t

Avoiding the square-root bottleneck in the Choleski factorization of a matrix on a parallel computer

✍ David S. Scott 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 231 KB

A fast algorithm to compute the H∞-norm

A fast algorithm to compute the H∞-norm of a transfer function matrix

✍ N.A. Bruinsma; M. Steinbuch 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 437 KB

On the stability of the incomplete Chole

On the stability of the incomplete Cholesky decomposition for a singular perturbed problem, where the coefficient matrix is not an M-matrix

✍ Stefan A. Sauter 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 465 KB

An algorithm to compute the square root

An algorithm to compute the square root of a 3 × 3 positive definite matrix

✍ L.P. Franca 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 354 KB

A fast parallel algorithm to compute the

A fast parallel algorithm to compute the rank of a matrix over an arbitrary field

✍ Ketan Mulmuley 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 177 KB