Skip to main content
Article thumbnail
Location of Repository

DOI 10.1007/s11750-010-0161-9 ORIGINAL PAPER An investigation of feasible descent algorithms for estimating the condition number of a matrix

By Joaquim J. Júdice, C. P. Brás, W. W. Hager and J. J. Júdice

Abstract

Abstract Techniques for estimating the condition number of a nonsingular matrix are developed. It is shown that Hager’s 1-norm condition number estimator is equivalent to the conditional gradient algorithm applied to the problem of maximizing the 1-norm of a matrix-vector product over the unit sphere in the 1-norm. By changing the constraint in this optimization problem from the unit sphere to the unit simplex, a new formulation is obtained which is the basis for both conditional gradient and projected gradient algorithms. In the test problems, the spectral projected gradient algorithm yields condition number estimates at least as good as those obtained by the previous approach. Moreover, in some cases, the spectral gradient projection algorithm, with a careful choice of the parameters, yields improved condition number estimates

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.8492
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://www.math.ufl.edu/~hager... (external link)
  • Suggested articles


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