Spedizione gratuita per ordini superiori a 69,99 euro.

Controllare lo stato dell'ordine

Entra a far parte di una comunità di amanti dei libri di tutto il mondo e ottieni numerosi vantaggi. Crea un account gratuito

Spedizione gratuita con Packeta per un prezzo superiore a 69.99 €

Bartolini 4.49 € Punto Poste 5.49 € Punto Poste 5.49 € Punto Bartolini 3.49 € DHL 6.99 € GLS 5.99 €

Contatto

Come acquistare

Aiuto

Il mio account

▸ Vuoto :-(

Spedizione gratuita per ordini superiori a 69,99 euro.

Structured Matrix Based Methods for Approximate Polynomial GCD

Name: Structured Matrix Based Methods for Approximate Polynomial GCD
Brand: Birkhauser Verlag AG
SKU: 01967796
Price: 28.39 EUR
Availability: InStock
Author: Paola Boito
ISBN: 9788876423802

Paola Boito

Lingua

Inglese

Libro In brossura

Codice Libristo: 01967796

Casa editrice Birkhauser Verlag AG, luglio 2011

Defining and computing a greatest common divisor of two polynomials with inexact coefficients is a c... Descrizione completa

Codice Libristo: 01967796

69 b

28.39 €

Magazzino esterno Inviamo tra 9-15 giorni

30 giorni per il reso

I clienti hanno acquistato anche

Talbot Samba - LS, GL, GLS, cabriolet, rallye ETAI Libro

binding.

52.49 €

Sous les feux du soleil Bornarel

In brossura

49.79 €

Einf hrung in Die Freizeitwissenschaft Horst W. Opaschowski

In brossura

54.19 €

Analyses Et Projections de la Mobilit Par L Approche D mographique Zoran Krakutovski

In brossura

91.29 €

Das neue Bild vom Menschen GlobArt

In brossura

18.89 €

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.