A note on the <Emphasis Type="BoldItalic">O</Emphasis>(<Emphasis Type="BoldItalic">n</Emphasis>)-storage implementation of the GKO algorithm and its adaptation to Trummer-like matrices |
| |
Authors: | Federico Poloni |
| |
Institution: | 1.Scuola Normale Superiore,Pisa,Italy |
| |
Abstract: | We propose a new O(n)-space implementation of the GKO-Cauchy algorithm for the solution of linear systems where the coefficient matrix is Cauchy-like.
Moreover, this new algorithm makes a more efficient use of the processor cache memory; for matrices of size larger than n ≈ 500–1,000, it outperforms the customary GKO algorithm. We present an applicative case of Cauchy-like matrices with non-reconstructible
main diagonal. In this special instance, the O(n) space algorithms can be adapted nicely to provide an efficient implementation of basic linear algebra operations in terms
of the low displacement-rank generators. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|