QR factoring to compute the GCD of univariate approximate polynomials

We present a stable and practical algorithm that uses QR factors of the Sylvester matrix to compute the greatest common divisor (GCD) of univariate approximate polynomials over /spl Ropf/[x] or /spl Copf/[x]. An approximate polynomial is a polynomial with coefficients that are not known with certain...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on signal processing 2004-12, Vol.52 (12), p.3394-3402
Hauptverfasser:	Corless, R.M., Watt, S.M., Lihong Zhi
Format:	Artikel
Sprache:	eng
Schlagworte:	Adaptive control Algebra Algorithms Applied sciences Approximation Computational efficiency Exact sciences and technology Gaussian processes Greatest common divisor Information, signal and communications theory Materials handling Mathematical methods Mathematical model Packages Packaging Polynomials Roots Signal processing SNAP Splitting Stability Sylvester matrix Telecommunications and information theory Testing
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!