✦ LIBER ✦

New renumbering algorithm for minimizing the bandwidth of sparse matrices

✍ Scribed by Takeo Taniguchi; Naruhito Shiraishi

Publisher: Elsevier Science
Year: 1980
Weight: 633 KB
Volume: 2
Category: Article
ISSN: 0141-1195
DOI: 10.1016/0141-1195(80)90051-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Manzur and Hamed (M-H) algorithm for res

Manzur and Hamed (M-H) algorithm for resequencing nodes in the undirected graphs to minimize the storage by reducing the bandwidth of sparse symmetric matrices

✍ M.Ali Ajiz; M.Mustafa Hamed 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 907 KB

An algorithm for the inversion of classe

An algorithm for the inversion of classes of sparse matrices

✍ Djuro M. Mišljenović 📂 Article 📅 1983 🏛 Elsevier Science ⚖ 365 KB

A normalized algorithm for the solution

A normalized algorithm for the solution of sparse symmetric seven-diagonal linear systems of semi-bandwidths M and P

✍ Elias A. Lipitakis 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 370 KB

The computational efficiency of a new mi

The computational efficiency of a new minimization algorithm for eigenvalue analysis

✍ M. Geradin 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 849 KB

A new shift of the QL algorithm for irre

A new shift of the QL algorithm for irreducible symmetric tridiagonal matrices

✍ Jiang Erxiong; Zhang Zhenyue 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 465 KB

A New Algorithm for the Computation of C

A New Algorithm for the Computation of Canonical Forms of Matrices over Fields

✍ ALLAN STEEL 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 476 KB

A new algorithm is presented for the computation of canonical forms of matrices over fields. These are the Primary Rational, Rational, and Jordan canonical forms. The algorithm works by obtaining a decomposition of the vector space acted on by the given matrix into primary cyclic spaces (spaces whos