Estimating the condition of an upper triangular matrix

From: Thomas Schmelzer (thomas-schmelzer_at_gmx.de)
Date: 06/17/04 

Date: Thu, 17 Jun 2004 08:42:13 +0200

Dear experts,
given a small (10 \times 10) matrix in upper triangular form I am seeking an
algorithm to estimate the condition (i.e. the ratio of the largest and
smallest singular value) of that matrix. I want to avoid any kind of
overestimation. What is the state of the art on that field?
cheers
Thomas

Relevant Pages

  • Re: Can this be written more concisely in a functional style
    ... > conciseness of. ... I think that in seeking to make it more concise, ... If you want to hide the algorithm, do so inside a helper function. ... explicit semantics where the algorithm is implemented. ...
    (comp.lang.python)
  • Re: [PHP] checking the aspect ratio of an images
    ... when coding" didn't exactly confine it to the question about aspect ... ratio and an image. ... So whilst the algorithm that you use may rely on imprecise values, ... scalable system for accessing system services | ...
    (php.general)
  • Re: How to take in a string of any size?
    ... On Mon, 23 Aug 2004, josh wrote: ... >> There's a minor benefit of that it makes the algorithm Oinstead ... > Counting and seeking back to the start would be O(even if seeking itself ...
    (comp.lang.c)
  • Re: Essay on PID Motor control
    ... I still did not get the basic information I'm seeking, to wit: ... > 1) Is the algorithm as published not the same as the one tested? ...
    (comp.robotics.misc)
  • Re: Estimating the condition of an upper triangular matrix
    ... > algorithm to estimate the condition (i.e. the ratio of the largest and ... > smallest singular value) of that matrix. ... the condition number is just the ratio of the largest eigenvalue to ...
    (sci.math.num-analysis)