✦ LIBER ✦

Parallel pivoting algorithms for sparse symmetric matrices

✍ Scribed by Frans J. Peters

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 586 KB
Volume: 1
Category: Article
ISSN: 0167-8191
DOI: 10.1016/s0167-8191(84)90446-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A pivoting strategy for symmetric tridia

A pivoting strategy for symmetric tridiagonal matrices

✍ James R. Bunch; Roummel F. Marcia 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB

Parallel implementations for solving gen

Parallel implementations for solving generalized eigenvalue problems with symmetric sparse matrices

✍ Bernard Philippe; Brigitte Vital 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 893 KB

A simplified pivoting strategy for symme

A simplified pivoting strategy for symmetric tridiagonal matrices

✍ James R. Bunch; Roummel F. Marcia 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 71 KB

A parallel algorithm for the partial eig

A parallel algorithm for the partial eigensolution of sparse symmetric matrices on the CRAY Y-MP

✍ Giorgio Pini 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 482 KB

A parallel algorithm for the calculation of the p leftmost eigenpairs of large, sparse FE\_M. matrices is presented. Test problems are carried out on symmetric, positive definite matrices whose dimensions range from N = 222 to N = 4560. The method, which is intrinsically parallel, is based on the si

A fully parallel block independent set a

A fully parallel block independent set algorithm for distributed sparse matrices

✍ Chi Shen; Jun Zhang 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 233 KB

Parallel algorithms for sparse triangula

Parallel algorithms for sparse triangular system solution

✍ P.Sreenivasa Kumar; M.Kishore Kumar; A Basu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 569 KB