A note on the O(n)-storage implementation of the GKO algorithm

Details A note on the O(n)-storage implementation of the GKO algorithm A note on the O(n)-storage implementation of the GKO algorithm

2009-03-26

arxiv.org/abs/0903.4569v3

Numer. Algorithms 55 (2010), pp. 115-139

Mathematics

Numerical Analysis

Scientific paper

10.1007/s11075-010-9361-5

We propose a new O(n)-space implementation of the GKO-Cauchy algorithm for the solution of linear systems with Cauchy-like matrix. Despite its slightly higher computational cost, this new algorithm makes a more efficient use of the processor cache memory. Thus, for matrices of size larger than about 500-1000, it outperforms the existing algorithms. 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.

Affiliated with

Also associated with

No associations

Rating

A note on the O(n)-storage implementation of the GKO algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A note on the O(n)-storage implementation of the GKO algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on the O(n)-storage implementation of the GKO algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-64705