<電子ブック>
Structured Matrix Based Methods for Approximate Polynomial GCD / by Paola Boito
(Theses. ISSN:25321668 ; 15)
版 | 1st ed. 2011. |
---|---|
出版者 | (Pisa : Scuola Normale Superiore : Imprint: Edizioni della Normale) |
出版年 | 2011 |
大きさ | 250 p : online resource |
著者標目 | *Boito, Paola author SpringerLink (Online service) |
件 名 | LCSH:Algebra FREE:Algebra |
一般注記 | 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 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 polynomial GCD problem can be expressed in matrix form: the second part of the book focuses on this point of view and analyses the structure of the relevant matrices, such as Toeplitz, Toepliz-block and displacement structures. New algorithms for the computation of approximate polynomial GCD are presented, along with extensive numerical tests. The use of matrix structure allows, in particular, to lower the asymptotic computational cost from cubic to quadratic order with respect to polynomial degree. HTTP:URL=https://doi.org/10.1007/978-88-7642-381-9 |
目次/あらすじ
所蔵情報を非表示
電子ブック | 配架場所 | 資料種別 | 巻 次 | 請求記号 | 状 態 | 予約 | コメント | ISBN | 刷 年 | 利用注記 | 指定図書 | 登録番号 |
---|---|---|---|---|---|---|---|---|---|---|---|---|
電子ブック | オンライン | 電子ブック |
|
Springer eBooks | 9788876423819 |
|
電子リソース |
|
EB00207943 |
類似資料
この資料の利用統計
このページへのアクセス回数:2回
※2017年9月4日以降