Skip to main content
Log in

Hybrid method for computing the nearest singular polynomials

  • Published:
Japan Journal of Industrial and Applied Mathematics Aims and scope Submit manuscript

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.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. G.H. Golub and C.F. Van Loan, Matrix Computations (3rd ed.). John Hopkins U. Press, 1996.

  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.

  3. V. Hribernig and H.J. Stetter, Detection and validation of clusters of polynomial zeros. J. Symb. Comp.,24 (1997), 667–681.

    Article  MATH  MathSciNet  Google Scholar 

  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.

  5. N. Karmarkar and Y.N. Lakshman, On approximate polynomial greatest common divisors. J. Symb. Comp.,26, No. 6 (1998), 653–666.

    Article  MATH  MathSciNet  Google Scholar 

  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. C.R. Rao and S.K. Mitra, Generalized Inverse of Matrices and its Applications. John Wiley & Sons, 1971.

  8. L.H. Zhi and W.D. Wu, Nearest singular polynomials. J. Symb. Comp.,26, No. 6 (1998), 667–676.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lihong Zhi.

About this article

Cite this article

Zhi, L., Noda, MT., Kai, H. et al. Hybrid method for computing the nearest singular polynomials. Japan J. Indust. Appl. Math. 21, 149 (2004). https://doi.org/10.1007/BF03167469

Download citation

  • Received:

  • Revised:

  • DOI: https://doi.org/10.1007/BF03167469

Key words

Navigation