Art

J-GLOBAL ID：201302210239954056   Reference number：13A0204280

Hybrid method for computing the nearest singular polynomials

Author (4)： ZHI LH ,  NODA MT ,  KAI H ,  WU W
Material： JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS
Volume： 21  Issue： 2  Page： 149-162  Publication year： 2004 
JST Material Number： O1699A  ISSN： 0916-7005  Document type： Article
Country of issue： Other (ZZZ)  Language： ENGLISH (EN)

Reference (8)：

• GOLUB, G. H. Matrix Computations. 1996
• HITZ, M. A. 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
• HRIBERNIG, V. Detection and validation of clusters of polynomial zeros. J. Symb. Comp. 1997, 24, 667-681
• KARMARKAR, N. Approximate polynomial greatest common divisors and nearest singular polynomials. Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation. 1996, 35-39
• KARMARKAR, N. On approximate polynomial greatest common divisors. J. Symb. Comp. 1998, 26, 6, 653-666