✦ LIBER ✦

Stability of fast algorithms for matrix multiplication

✍ Scribed by Dario Bini; Grazia Lotti

Publisher: Springer-Verlag
Year: 1980
Tongue: English
Weight: 362 KB
Volume: 36
Category: Article
ISSN: 0029-599X
DOI: 10.1007/bf01395989

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast Algorithms with Preprocessing for M

Fast Algorithms with Preprocessing for Matrix-Vector Multiplication Problems

✍ I. Gohberg; V. Olshevsky 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 587 KB

Parallel algorithms and architectures fo

Parallel algorithms and architectures for matrix multiplication

✍ C. Puglisi 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 648 KB

Analysis of algorithms of fast multiplic

Analysis of algorithms of fast multiplication in digital computers

✍ V. I. Korneichuk; B. M. Shlem 📂 Article 📅 1975 🏛 Springer US 🌐 English ⚖ 205 KB

On the complexity of some algorithms of

On the complexity of some algorithms of matrix multiplication

✍ Valery B Alekseyev 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 712 KB

Fast Spectral Projection Algorithms for

Fast Spectral Projection Algorithms for Density-Matrix Computations

✍ Gregory Beylkin; Nicholas Coult; Martin J Mohlenkamp 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 196 KB

We present a fast algorithm for the construction of a spectral projector. This algorithm allows us to compute the density matrix, as used in, e.g., the Kohn-Sham iteration, and so obtain the electron density. We compute the spectral projector by constructing the matrix sign function through a simple

Efficient Algorithms for the Maximum Sub

Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication

✍ Tadao Takaoka 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 222 KB