✦ LIBER ✦

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

✍ Scribed by G.W. Stewart

Publisher: Springer-Verlag
Year: 1999
Tongue: English
Weight: 87 KB
Volume: 83
Category: Article
ISSN: 0029-599X
DOI: 10.1007/s002110050451

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Two space-saving algorithms for computin

Two space-saving algorithms for computing the permuted transpose of a sparse matrix

✍ Frank Cameron 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 959 KB

An efficient and stable structure preser

An efficient and stable structure preserving algorithm for computing the eigenvalues of a Hamiltonian matrix

✍ Yan Qing-you; Xiong Xi-wen 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 915 KB

An Accurate and Efficient Algorithm for

An Accurate and Efficient Algorithm for the Computation of the Characteristic Polynomial of a General Square Matrix

✍ S. Rombouts; K. Heyde 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 99 KB

An algorithm is presented for the efficient and accurate computation of the coefficients of the characteristic polynomial of a general square matrix. The algorithm is especially suited for the evaluation of canonical traces in determinant quantum Monte-Carlo methods.

An efficient and reliable algorithm for

An efficient and reliable algorithm for computing the singular subspace of a matrix, associated with its smallest singular values

✍ Sabine Van Huffel; Joos Vandewalle; Ann Haegemans 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 1020 KB

A Schur-based algorithm for computing bo

A Schur-based algorithm for computing bounds to the smallest eigenvalue of a symmetric positive definite Toeplitz matrix

✍ N. Mastronardi; M. Van Barel; R. Vandebril 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 157 KB