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.
"synopsis" may belong to another edition of this title.
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.
"About this title" may belong to another edition of this title.
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 14368976-n
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condition: new. Paperback. 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. Defining and computing a greatest common divisor of two polynomials with inexact coefficients is a classical problem in symbolic-numeric computation. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9788876423802
Seller: Brook Bookstore On Demand, Napoli, NA, Italy
Condition: new. Seller Inventory # 551300792be1f6b607d18dc4c65e0d5d
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New. Seller Inventory # ABLIING23Apr0316110327759
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 14368976
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 2011 edition. 199 pages. 9.00x6.00x0.75 inches. In Stock. Seller Inventory # __887642380X
Quantity: 2 available
Seller: Brook Bookstore, Milano, MI, Italy
Condition: new. Seller Inventory # 551300792be1f6b607d18dc4c65e0d5d
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Condition: New. Defining and computing a greatest common divisor of two polynomials with inexact coefficients is a classical problem in symbolic-numeric computation. This book focuses on this point of view and analyses the structure of the relevant matrices, such as Toeplitz, Toepliz-block and displacement structures. Series: Publications of the Scuola Normale Superiore. Num Pages: 250 pages, biography. BIC Classification: PBF. Category: (P) Professional & Vocational. Dimension: 240 x 168 x 15. Weight in Grams: 408. . 2011. Paperback. . . . . Seller Inventory # V9788876423802
Quantity: 16 available
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 2011 edition. 199 pages. 9.00x6.00x0.75 inches. In Stock. Seller Inventory # x-887642380X
Quantity: 2 available
Seller: Kennys Bookstore, Olney, MD, U.S.A.
Condition: New. Defining and computing a greatest common divisor of two polynomials with inexact coefficients is a classical problem in symbolic-numeric computation. This book focuses on this point of view and analyses the structure of the relevant matrices, such as Toeplitz, Toepliz-block and displacement structures. Series: Publications of the Scuola Normale Superiore. Num Pages: 250 pages, biography. BIC Classification: PBF. Category: (P) Professional & Vocational. Dimension: 240 x 168 x 15. Weight in Grams: 408. . 2011. Paperback. . . . . Books ship from the US and Ireland. Seller Inventory # V9788876423802