Hybrid method for computing the nearest singular polynomials

Japan Journal of Industrial and Applied Mathematics

Volumn 21, Issue 2, 2004, Pages 149-162

  Zhi, Lihong ^a,c   Noda, Matu Tarow ^a   Kai, Hiroshi ^a   Wu, Wenda ^b  

^a EHIME UNIVERSITY   (Japan)

^b Beijing Municipal Computing Center   (China)

^c INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

Author keywords

Minimization; Multiple roots; Quadratic form

Indexed keywords

EID: 3042855689     PISSN: 09167005     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF03167469     Document Type: Article

References (8)

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.
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.
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 Processing 57, 2, 1995, 81-100.
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.