Advertisement

The Ratio Between the Toeplitz and the Unstructured Condition Number

  • Siegfried M. Rump
  • Hiroshi Sekigawa
Part of the Operator Theory: Advances and Applications book series (OT, volume 199)

Abstract

Recently it was shown that the ratio between the normwise Toeplitz structured condition number of a linear system and the general unstructured condition number has a finite lower bound. However, the bound was not explicit, and nothing was known about the quality of the bound. In this note we derive an explicit lower bound only depending on the dimension n, and we show that this bound is almost sharp for all n.

Mathematics Subject Classification (2000)

15A12 26D05 

Keywords

Structured condition number Toeplitz matrix Mahler measure polynomial norms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    M. Berz. From Taylor series to Taylor models. In Nonlinear problems in accelerator physics, AIP Conference proceedings, number CP405, pages 1–27, 1997.Google Scholar
  2. [2]
    A. Böttcher and S. Grudsky. Spectral properties of banded Toeplitz matrices. SIAM, Philadelphia, 2005.zbMATHGoogle Scholar
  3. [3]
    A. Böttcher and S. Grudsky. Structured condition numbers of large Toeplitz matrices are rarely better than usual condition numbers. Numerical Linear Algebra and its Applications, 12:95–102, 2005.zbMATHCrossRefGoogle Scholar
  4. [4]
    A. Böttcher and K. Rost. Topics in the numerical linear algebra of Toeplitz and Hankel matrices. Mitt. Ges. Angew. Math. Mech., 27(2):174–188, 2004.zbMATHMathSciNetGoogle Scholar
  5. [5]
    D.W. Boyd. Two sharp inequalities for the norm of a factor of a polynomial. Mathematika, 39:341–349, 1992.zbMATHCrossRefMathSciNetGoogle Scholar
  6. [6]
    D.W. Boyd. Sharp inequalities for the product of polynomials. Bull. London Math. Soc., 26:449–454, 1994.zbMATHCrossRefMathSciNetGoogle Scholar
  7. [7]
    S. Dallwig, A. Neumaier, and H. Schichl. GLOPT — a program for constrained global optimization. In I.M. Bomze et al., editor, Developments in global optimization, pages 19–36. Kluwer Academic Publishers, 1997.Google Scholar
  8. [8]
    I. Gohberg and A.A. Semencul. The inversion of finite Toeplitz matrices and their continual analogues. Matem. Issled, 7:201–223, 1972.zbMATHMathSciNetGoogle Scholar
  9. [10]
    D.J. Higham and N.J. Higham. Backward error and condition of structured linear systems. SIAM J. Matrix Anal. Appl., 13(1):162–175, 1992.zbMATHCrossRefMathSciNetGoogle Scholar
  10. [11]
    E. Kaltofen, L. Bin, Y. Zhengfeng, and Z. Lihong. Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients. submitted for publication, 2009.Google Scholar
  11. [12]
    H. Kneser. Das Maximum des Produkts zweier Polynome. In Sitz. Preuss. Akad. Wiss., Phys.-Math. Kl., pages 426–431, 1934.Google Scholar
  12. [13]
    A. Neumaier. Complete search in continuous global optimization and constraint satisfaction. Acta Numerica, 13:271–369, 2004.CrossRefMathSciNetGoogle Scholar
  13. [14]
    S.M. Rump. Structured perturbations Part I: Normwise distances. SIAM J. Matrix Anal. Appl. (SIMAX), 25(1):1–30, 2003.zbMATHCrossRefMathSciNetGoogle Scholar
  14. [15]
    S.M. Rump. A Model Problem for Global optimization. submitted for publication, 2009.Google Scholar
  15. [16]
    E.B. Saff and T. Sheil-Small. Coefficient and integral mean estimates for algebraic and trigonometric polynomials with restricted zeros. J. London Math. Soc., 9:16–22, 1974.zbMATHCrossRefMathSciNetGoogle Scholar
  16. [17]
    T. Sheil-Small. Complex polynomials, volume 75 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, 2002.Google Scholar

Copyright information

© Birkhäuser Verlag Basel/Switzerland 2010

Authors and Affiliations

  • Siegfried M. Rump
    • 1
    • 2
  • Hiroshi Sekigawa
    • 3
  1. 1.Institute for Reliable ComputingHamburg University of TechonologyHamburgGermany
  2. 2.Faculty of Science and EngineeringWaseda UniversityTokyoJapan
  3. 3.NTT Communication Science LaboratoriesNippon Telegraph and Telephone CorporationKanagawaJapan

Personalised recommendations