✦ LIBER ✦

Very Fast Approximation of the Matrix Chain Product Problem

✍ Scribed by Artur Czumaj

Book ID: 102578194
Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 126 KB
Volume: 21
Category: Article
ISSN: 0196-6774
DOI: 10.1006/jagm.1996.0037

No coin nor oath required. For personal study only.

✦ Synopsis

This paper considers the matrix chain product problem. This problem can be Ž . solved in O n log n sequential time, while the best known parallel NC algorithm Ž 2 .

6 6 ' Ž . algorithm produces solutions for the above problems that are at most 1r 2 3 q 3 Ž . f0.1547 times the optimal solutions.

📜 SIMILAR VOLUMES

On the Solution of Boundary Value Proble

On the Solution of Boundary Value Problems by Using Fast Generalized Approximate Inverse Banded Matrix Techniques

✍ George A. Gravvanis 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 115 KB

Problem of the approximate matrix factor

Problem of the approximate matrix factorization and its applications

✍ V. D. Didenko 📂 Article 📅 1984 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 463 KB

The susceptibility of anisotropic Heisen

The susceptibility of anisotropic Heisenberg alternating- and random-bond chains by a density matrix product approximation

✍ A. Tanaka; J.W. Tucker; T. Idogaki 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 666 KB

Approximate solution of the Riemann prob

Approximate solution of the Riemann problem with functionally commutative matrix

✍ V. M. Matskul 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 179 KB

Fast Approximation Algorithms for the Kn

Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

✍ Ibarra, Oscar H.; Kim, Chul E. 📂 Article 📅 1975 🏛 Association for Computing Machinery 🌐 English ⚖ 377 KB

Numerical approximation of the product o

Numerical approximation of the product of the square root of a matrix with a vector

✍ E.J. Allen; J. Baglama; S.K. Boyd 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 122 KB