𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Theory and algorithm of the inversion method for pentadiagonal matrices

✍ Scribed by M. E. Kanal; N. A. Baykara; M. Demiralp

Publisher
Springer
Year
2011
Tongue
English
Weight
281 KB
Volume
50
Category
Article
ISSN
0259-9791

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A fast algorithm for the inversion of ge
A fast algorithm for the inversion of general Toeplitz matrices
✍ P.G. Martinsson; V. Rokhlin; M. Tygert πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 590 KB

we propose a "fast" algorithm for the construction of a data-sparse inver'~ of a general Toeplitz matrix. The computational cost for inverting an N Γ— N Toeplitz matrix equals the cost of four length-N FFTs plus an O(N)-term. This cost should be compared to the O(Nlog2N) cost of previously published

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