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.
Similar content being viewed by others
References
G.H. Golub and C.F. Van Loan, Matrix Computations (3rd ed.). John Hopkins U. Press, 1996.
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.
V. Hribernig and H.J. Stetter, Detection and validation of clusters of polynomial zeros. J. Symb. Comp.,24 (1997), 667–681.
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.
N. Karmarkar and Y.N. Lakshman, On approximate polynomial greatest common divisors. J. Symb. Comp.,26, No. 6 (1998), 653–666.
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.
C.R. Rao and S.K. Mitra, Generalized Inverse of Matrices and its Applications. John Wiley & Sons, 1971.
L.H. Zhi and W.D. Wu, Nearest singular polynomials. J. Symb. Comp.,26, No. 6 (1998), 667–676.
Author information
Authors and Affiliations
Corresponding author
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
Received:
Revised:
DOI: https://doi.org/10.1007/BF03167469