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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: Brook Bookstore On Demand, Napoli, NA, Italia
Condizione: new. Codice articolo 551300792be1f6b607d18dc4c65e0d5d
Quantità: 5 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 14368976-n
Quantità: 16 disponibili
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condizione: 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. Codice articolo 9788876423802
Quantità: 1 disponibili
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Condizione: New. Codice articolo ABLIING23Apr0316110327759
Quantità: 5 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition. Codice articolo 14368976
Quantità: 16 disponibili
Da: Revaluation Books, Exeter, Regno Unito
Paperback. Condizione: Brand New. 2011 edition. 199 pages. 9.00x6.00x0.75 inches. In Stock. Codice articolo __887642380X
Quantità: 2 disponibili
Da: Brook Bookstore, Milano, MI, Italia
Condizione: new. Codice articolo 551300792be1f6b607d18dc4c65e0d5d
Quantità: 5 disponibili
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condizione: 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. . . . . Codice articolo V9788876423802
Quantità: 16 disponibili
Da: Revaluation Books, Exeter, Regno Unito
Paperback. Condizione: Brand New. 2011 edition. 199 pages. 9.00x6.00x0.75 inches. In Stock. Codice articolo x-887642380X
Quantità: 2 disponibili
Da: Kennys Bookstore, Olney, MD, U.S.A.
Condizione: 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. Codice articolo V9788876423802
Quantità: 16 disponibili