Advertisement

Hybrid method for computing the nearest singular polynomials

  • Lihong Zhi
  • Matu-Tarow Noda
  • Hiroshi Kai
  • Wenda Wu
Article

Abstract

In this paper, we propose a combined symbolic-numeric algorithm for computing the nearest singular polynomial and its multiple zero. Explicit expressions of the minimal perturbation and the nearest singular polynomials are presented. A theoretical error bound and several numerical examples are given.

Key words

quadratic form minimization multiple roots 

References

  1. [1]
    G.H. Golub and C.F. Van Loan, Matrix Computations (3rd ed.). John Hopkins U. Press, 1996.Google Scholar
  2. [2]
    M.A. Hitz and E. Kaltofen, Efficient algorithms for computing the nearest singular polynomials with constrained roots. Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, 1998, 236–243.Google Scholar
  3. [3]
    V. Hribernig and H.J. Stetter, Detection and validation of clusters of polynomial zeros. J. Symb. Comp.,24 (1997), 667–681.MATHCrossRefMathSciNetGoogle Scholar
  4. [4]
    N. Karmarkar and Y.N. Lakshman, Approximate polynomial greatest common divisors and nearest singular polynomials. Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996, 35–39.Google Scholar
  5. [5]
    N. Karmarkar and Y.N. Lakshman, On approximate polynomial greatest common divisors. J. Symb. Comp.,26, No. 6 (1998), 653–666.MATHCrossRefMathSciNetGoogle Scholar
  6. [6]
    D. Manocha and J. Demmel, Algorithms for intersecting parametric and algebraic curves II: Multiple intersections. Computer Vision, Graphics and Image Processing: Graphical Models and Image Processing57, 2, 1995, 81–100.Google Scholar
  7. [7]
    C.R. Rao and S.K. Mitra, Generalized Inverse of Matrices and its Applications. John Wiley & Sons, 1971.Google Scholar
  8. [8]
    L.H. Zhi and W.D. Wu, Nearest singular polynomials. J. Symb. Comp.,26, No. 6 (1998), 667–676.MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© JJIAM Publishing Committee 2004

Authors and Affiliations

  • Lihong Zhi
    • 1
  • Matu-Tarow Noda
    • 1
  • Hiroshi Kai
    • 1
  • Wenda Wu
    • 2
  1. 1.Department of Computer ScienceEhime UniversityJapan
  2. 2.Beijing Municipal Computing CenterChina

Personalised recommendations