CiteULike mmuecke's CiteULike Search Register Log in
CiteULike is a free online bibliography manager. Register and you can start organising your references online.

Stability of fast algorithms for structured linear systems Export

by: Richard P. Brent

edited by: Ali Sayed, Thomas Kailath

In Fast Reliable Algorithms for Matrices with Structure (1999), pp. 103-152.

Citation Format

[Posts]

View FullText article


mmuecke's tags for this article

linear_algebra matrix

X Reviews [Write a review of this article]

X Find related articles from these CiteULike users

X Find related articles with these CiteULike tags

X Posting History

X Abstract

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.


X BibTeX record

X RIS record


Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.