✦ LIBER ✦

Efficient method for computing double matrix products

✍ Scribed by David R. O'Hallaron; Charles M. Fiduccia

Book ID: 112494329
Publisher: Springer
Year: 1991
Tongue: English
Weight: 429 KB
Volume: 10
Category: Article
ISSN: 0278-081X
DOI: 10.1007/bf01183772

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient matrix partitioning for optica

Efficient matrix partitioning for optical computing

✍ H.J. Caulfield; C.M. Verber; R.L. Stermer 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 190 KB

An efficient method for computing eigenv

An efficient method for computing eigenvalues of a real normal matrix

✍ B.B Zhou; R.P Brent 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 221 KB

Jacobi-based algorithms have attracted attention as they have a high degree of potential parallelism and may be more accurate than QR-based algorithms. In this paper we discuss how to design efficient Jacobi-like algorithms for eigenvalue decomposition of a real normal matrix. We introduce a block J

On Efficient Computation of Matrix Chain

On Efficient Computation of Matrix Chain Products

✍ Godbole, Sadashiva S. 📂 Article 📅 1973 🏛 IEEE 🌐 English ⚖ 608 KB

A Hyperpower Iterative Method for Comput

A Hyperpower Iterative Method for Computing Matrix Products Involving the Generalized Inverse

✍ Garnett III, James M.; Ben-Israel, Adi; Yau, Stephen S. 📂 Article 📅 1971 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 533 KB

A Hyperpower Iterative Method for Comput

A Hyperpower Iterative Method for Computing Matrix Products Involving the Generalized Inverse

✍ James M. Garnett III, Adi Ben-Israel and Stephen S. Yau 📂 Article 📅 1971 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 164 KB

An Efficient Method for Computing Result

An Efficient Method for Computing Resultant Systems

✍ Mark J. Encarnación 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 28 KB