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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Brook Bookstore On Demand, Napoli, NA, Italien
Zustand: new. Bestandsnummer des Verkäufers 551300792be1f6b607d18dc4c65e0d5d
Anzahl: 5 verfügbar
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: New. Bestandsnummer des Verkäufers 14368976-n
Anzahl: 16 verfügbar
Anbieter: Grand Eagle Retail, Bensenville, IL, USA
Paperback. Zustand: 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. Bestandsnummer des Verkäufers 9788876423802
Anbieter: Lucky's Textbooks, Dallas, TX, USA
Zustand: New. Bestandsnummer des Verkäufers ABLIING23Apr0316110327759
Anzahl: 5 verfügbar
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: As New. Unread book in perfect condition. Bestandsnummer des Verkäufers 14368976
Anzahl: 16 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Paperback. Zustand: Brand New. 2011 edition. 199 pages. 9.00x6.00x0.75 inches. In Stock. Bestandsnummer des Verkäufers __887642380X
Anzahl: 2 verfügbar
Anbieter: Brook Bookstore, Milano, MI, Italien
Zustand: new. Bestandsnummer des Verkäufers 551300792be1f6b607d18dc4c65e0d5d
Anzahl: 5 verfügbar
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
Zustand: 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. . . . . Bestandsnummer des Verkäufers V9788876423802
Anzahl: 16 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Paperback. Zustand: Brand New. 2011 edition. 199 pages. 9.00x6.00x0.75 inches. In Stock. Bestandsnummer des Verkäufers x-887642380X
Anzahl: 2 verfügbar
Anbieter: Kennys Bookstore, Olney, MD, USA
Zustand: 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. Bestandsnummer des Verkäufers V9788876423802
Anzahl: 16 verfügbar