๐”– Bobbio Scriptorium
โœฆ   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

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A p-adic algorithm for computing the inv
โœ 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