Skip navigation
Skip navigation

Stability of fast algorithms for structured linear systems

Brent, Richard P


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...[Show more]

CollectionsANU Research Publications
Date published: 1997
Type: Working/Technical Paper


File Description SizeFormat Image
1574-01.2003-07-02T06:47:23Z.xsh356 BEPrints MD5 Hash XML
TR-CS-97-18.pdf248.33 kBAdobe PDFThumbnail

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator