Detailansicht

Inhaltsangabei. Introduction.- ii. Notation.- 1. Approximate polynomial GCD.- 2. Structured and resultant matrices.- 3. The Euclidean algorithm.- 4. Matrix factorization and approximate GCDs.- 5. Optimization approach.- 6. New factorization-based methods.- 7. A fast GCD algorithm.- 8. Numerical tests.- 9. Generalizations and further work.- 10. Appendix A: Distances and norms.- 11. Appendix B: Special matrices.- 12. Bibliography.- 13. Index.

Topics situated at the crossroads between two fields of increasing interest to the mathematical community: symbolic-numeric polynomial computation and structured numerical linear algebraSurvey of the main tools and techniques used in either domainState-of-the-art methods that exploit matrix structure to improve the performance of polynomial computations