Skip to main content
Article thumbnail
Location of Repository

We start with the positive definite Toeplitz matrix

By Michael Stewart

Abstract

This paper describes a new O(n log 3 (n)) solver for the positive definite Toeplitz system T x = b. Instead of computing generators for the inverse of T, the new algorithm adjoins b to T and applies a superfast Schur algorithm to the resulting augmented matrix. The generators of this augmented matrix and its Schur complements are used by a divide-and-conquer block back-substitution routine to complete the solution of the system. The goal is to avoid the well-known numerical instability inherent in explicit inversion. Experiments suggest that the algorithm is backward stable in most cases

Year: 2003
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.8620
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://saaz.cs.gsu.edu/papers/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.