✦ LIBER ✦

Algorithms for Computing the QR Decomposition of a Set of Matrices with Common Columns

✍ Scribed by Petko Yanev; Paolo Foschi; Erricos John Kontoghiorghes

Publisher: Springer
Year: 2004
Tongue: English
Weight: 207 KB
Volume: 39
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-003-1080-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The QRPS algorithm: A generalization of

The QRPS algorithm: A generalization of the QR algorithm for the singular values decomposition of rectangular matrices

✍ M. Bolla; G. Tusnády 📂 Article 📅 1985 🏛 Springer Netherlands 🌐 English ⚖ 388 KB

A Lanczos-type algorithm for the QR fact

A Lanczos-type algorithm for the QR factorization of regular Cauchy matrices

✍ Dario Fasino; Luca Gemignani 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB

Fast algorithms for computing the diamet

Fast algorithms for computing the diameter of a finite planar set

✍ Binay K. Bhattacharya; Godfried T. Toussaint 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 792 KB

A p-adic algorithm for computing the inv

A p-adic algorithm for computing the inverse of integer matrices

✍ H. Haramoto; M. Matsumoto 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 270 KB

A method for computing the inverse of an (n × n) integer matrix A using p-adic approximation is given. The method is similar to Dixon's algorithm, but ours has a quadratic convergence rate. The complexity of this algorithm (without using FFT or fast matrix multiplication) is O(n 4 (log n) 2 ), the s

A fast computer algorithm for finding th

A fast computer algorithm for finding the permanent of adjacency matrices

✍ Gordon G. Cash 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 321 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