Skip to main content
SpringerLink
Log in

Relative-error bounds for the LU decomposition via the GTH algorithm

  • Published:
Numerische Mathematik Aims and scope Submit manuscript

Summary.

Recently the author showed that the Grassmann-Taksar-Heyman (GTH) algorithm computes the steady-state distribution of a finite-state Markov chain with low relative error. Here it is shown that the LU decomposition computed in the course of the GTH algorithm also has low relative error. The proof requires a refinement of the methods used in the earlier paper.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. School of Industrial Engineering, Grissom Hall, Purdue University, West Lafayette, IN 47907-1287, USA , , , , , , US

    Colm Art O'Cinneide

Authors
  1. Colm Art O'Cinneide
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received September 2, 1994 / Revised version received July 17, 1995

Rights and permissions

Reprints and permissions

About this article

Cite this article

O'Cinneide, C. Relative-error bounds for the LU decomposition via the GTH algorithm . Numer. Math. 73, 507–519 (1996). https://doi.org/10.1007/s002110050203

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002110050203

Search

Navigation