✦ LIBER ✦

A multishift QR iteration without computation of the shifts

✍ Scribed by Augustin A. Dubrulle; Gene H. Golub

Publisher: Springer US
Year: 1994
Tongue: English
Weight: 486 KB
Volume: 7
Category: Article
ISSN: 1017-1398
DOI: 10.1007/bf02140681

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A quadratically convergent QR-like metho

A quadratically convergent QR-like method without shifts for the Hermitian eigenvalue problem

✍ Hongyuan Zha; Zhenyue Zhang; Wenlong Ying 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 288 KB

We propose a new QR-like algorithm, symmetric squared QR (SSQR) method, that can be readily parallelized using commonly available parallel computational primitives such as matrix-matrix multiplication and QR decomposition. The algorithm converges quadratically and the quadratic convergence is achiev

A Segmentation Algorithm Based on an Ite

A Segmentation Algorithm Based on an Iterative Computation of the Mean Shift Filtering

✍ Roberto Rodríguez; Ana G. Suarez; Juan H. Sossa 📂 Article 📅 2010 🏛 Springer Netherlands 🌐 English ⚖ 701 KB

A lower bound on the computational compl

A lower bound on the computational complexity of the QR decomposition on a shared memory SIMD computer

✍ Eric Goles; Marcos Kiwi 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 483 KB

A pipelined givens method for computing

A pipelined givens method for computing the QR factorization of a sparse matrix

✍ M.T. Heath; D.C. Sorensen 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 885 KB

Four algorithms for the the efficient co

Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix

✍ G.W. Stewart 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 87 KB

Charge iteration: A procedure for the fi

Charge iteration: A procedure for the finite element computation of unbounded electrical fields

✍ G. Aiello; S. Alfonzetti; S. Coco 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 943 KB