Stability of fast algorithms for structured linear systems

Details Stability of fast algorithms for structured linear systems Stability of fast algorithms for structured linear systems

2010-05-05

arxiv.org/abs/1005.0671v1

"Fast Reliable Algorithms for Matrices with Structure" (edited by Ali Sayed and Thomas Kailath), SIAM, Philadelphia, 1999, 103

Mathematics

Numerical Analysis

13 pages. An old Technical Report (CSL, ANU, September 1997, 13 pages), submitted for archival purposes. For further details s

Scientific paper

We survey the numerical stability of some fast algorithms for solving systems of linear equations and linear least squares problems with a low displacement-rank structure. For example, the matrices involved may be Toeplitz or Hankel. We consider algorithms which incorporate pivoting without destroying the structure, and describe some recent results on the stability of these algorithms. We also compare these results with the corresponding stability results for the well known algorithms of Schur/Bareiss and Levinson, and for algorithms based on the semi-normal equations.

Affiliated with

Also associated with

No associations

Rating

Stability of fast algorithms for structured linear systems 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 Stability of fast algorithms for structured linear systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stability of fast algorithms for structured linear systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-436525