Defining and computing a greatest common divisor of two polynomials with inexact coefficients is a classical problem in symbolic-numeric computation.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
Condición: new. Nº de ref. del artículo: 551300792be1f6b607d18dc4c65e0d5d
Cantidad disponible: 5 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 14368976-n
Cantidad disponible: 16 disponibles
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
Paperback. Condición: 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. Nº de ref. del artículo: 9788876423802
Cantidad disponible: 1 disponibles
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Condición: New. Nº de ref. del artículo: ABLIING23Apr0316110327759
Cantidad disponible: 5 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 14368976
Cantidad disponible: 16 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Paperback. Condición: Brand New. 2011 edition. 199 pages. 9.00x6.00x0.75 inches. In Stock. Nº de ref. del artículo: __887642380X
Cantidad disponible: 2 disponibles
Librería: Brook Bookstore, Milano, MI, Italia
Condición: new. Nº de ref. del artículo: 551300792be1f6b607d18dc4c65e0d5d
Cantidad disponible: 5 disponibles
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condición: 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. . . . . Nº de ref. del artículo: V9788876423802
Cantidad disponible: 16 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Paperback. Condición: Brand New. 2011 edition. 199 pages. 9.00x6.00x0.75 inches. In Stock. Nº de ref. del artículo: x-887642380X
Cantidad disponible: 2 disponibles
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
Condición: 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. Nº de ref. del artículo: V9788876423802
Cantidad disponible: 16 disponibles