✦ LIBER ✦

Fast Parallel Algorithms for Matrix Reduction to Normal Forms

✍ Scribed by Gilles Villard

Publisher: Springer
Year: 1997
Tongue: English
Weight: 305 KB
Volume: 8
Category: Article
ISSN: 0938-1279
DOI: 10.1007/s002000050089

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A parallel algorithm for achieving the S

A parallel algorithm for achieving the Smith Normal Form of an integer matrix

✍ Ingmar Neumann; Wolfgang Wilhelmi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 815 KB

The Smith Normal Form of a matrix is a diagonal representation which contains the invariant factors of the matrix in its diagonal. In this paper, a new algorithm, which exploits parallelism by considering data dependencies, is proposed. In case of sparse matrices a high degree of parallelism can he

Fast parallel algorithms for matrix inve

Fast parallel algorithms for matrix inversion and linear systems solution

✍ B. Codenotti 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 225 KB

On the fast reduction of a quasiseparabl

On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms

✍ Yuli Eidelman; Israel Gohberg; Luca Gemignani 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 222 KB

Data reduction and fast routing: A strat

Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers

✍ Jorge L. C. Sanz; Robert Cypher 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 880 KB

Spectral sequence for reduction of funct

Spectral sequence for reduction of functions to normal form

✍ V. I. Arnol'd 📂 Article 📅 1979 🏛 Springer US 🌐 English ⚖ 182 KB

An algorithm for the reduction of finite

An algorithm for the reduction of finite non-oriented graphs to canonical form

✍ V.L. Arlazarov; I.I. Zuev; A.V. Uskov; I.A. Faradzhev 📂 Article 📅 1974 🏛 Elsevier Science ⚖ 570 KB