Structured matrix based methods for approximate polynomial GCD
Defining and computing a greatest common divisor of two polynomials with inexact coefficients is a classical problem in symbolic-numeric computation. The first part of this book reviews the main results that have been proposed so far in the literature. As usual with polynomial computations, the poly...
保存先:
| 第一著者: | |
|---|---|
| フォーマット: | Livre numérique |
| 言語: | Anglais |
| 出版事項: |
Pisa :
Scuola Normale Superiore
[20..].
Cham : Springer Nature |
| 版: | 1st ed. 2011. |
| シリーズ: | Theses (Scuola Normale Superiore)
15 |
| 主題: | |
| オンライン･アクセス: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| 注記: |
L'impression du document génère xvi-199 p. Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Structured Matrix Based Methods for Approximate Polynomial GCD, Texte imprimé, 9788876423802 |
目次:
- i. 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.