Skip to main content

Error Analysis of Triangular Linear Systems

  • Chapter
Condition

Part of the book series: Grundlehren der mathematischen Wissenschaften ((GL,volume 349))

  • 2400 Accesses

Abstract

The vast majority of the occurrences of condition numbers in the study of linear systems of equations involve the normwise condition number κ(A). Almost invariably, the use of κ(A) is enough to provide a satisfying explanation of the phenomena observed in practice.

The case of triangular systems of linear equations provides, in contrast, an example in which κ(A) turns out to be inadequate. Practitioners long observed that triangular systems of equations are generally solved to high accuracy in spite of being, in general, ill-conditioned. Thus, for instance, J.H. Wilkinson wrote: “In practice one almost invariably finds that if L is ill-conditioned, so that ∥L∥∥L −1∥≫1, then the computed solution of Lx=b (or the computed inverse) is far more accurate than [what forward stability analysis] would suggest.”

A first goal in this chapter is to give a precise meaning to the feeling that triangular matrices are, in general, ill-conditioned. We prove that if \(L\in \mathbb {R}^{n\times n}\) is a lower-triangular matrix whose entries are independent standard Gaussian random variables, then \(\mathbb {E}(\log \kappa(L))=\varOmega(n)\). This yields an expected loss of precision satisfying

$$\mathbb {E}\bigl(\mathsf {LoP}\bigl(L^{-1}b\bigr)\bigr)= \mathcal {O}(n). $$

Were the loss of precision in the solution of triangular systems to conform to this bound, we would not be able to accurately find these solutions. The reason we actually do find them can be briefly stated. The error analysis of triangular systems reveals that we may use a componentwise condition number Cw(L,b) instead of the normwise condition number. The second goal of this chapter is to prove that when L and \(b\in \mathbb {R}^{n}\) are drawn from standard Gaussian distributions, then we have \(\mathbb {E}(\log \mathsf {Cw}(L,b))=\mathcal {O}(\log n)\). This bound, together with some backward error analysis, yields bounds for \(\mathbb {E}(\mathsf {LoP}(L^{-1}b))\) that are much smaller than the one above, as well as closer to the loss of precision observed in practice.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 159.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 159.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    The word “sparse” is also used to denote matrices with a large number of zeros, not necessarily in fixed positions.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bürgisser, P., Cucker, F. (2013). Error Analysis of Triangular Linear Systems. In: Condition. Grundlehren der mathematischen Wissenschaften, vol 349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38896-5_3

Download citation

Publish with us

Policies and ethics