Singular value decomposition and structures total least norm for approximate greatest common divisor of unvariate polynomials
This study presents experimental works on approximate GCD of univariate polynomials. The computation of approximate GCD is required in the case of imperfectly known or inexact data which emerges from physical measurements or previous computation error. SVD of Sylvester matrix is used to determine th...
Saved in:
Main Author: | Nordin, Nurul Aida |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2012
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/31526/1/NurulAidaNordinMFS2012.pdf http://eprints.utm.my/id/eprint/31526/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Computing the greatest common divisor of polynomials using the comrade matrix
by: Aris, Nor`Aini, et al.
Published: (2008) -
On the application of modular approach to the computation of the greatest common divisors of generalized polynomials
by: Aris, Nor'aini
Published: (2003) -
Numerical matrix methods in the computation of the greatest common divisor (GCD) of polynomials
by: Isa, S. N. A. B., et al.
Published: (2016) -
Built-in self-test method at register transfer level design for finite impulse response filter, infinite impulse response filter and greatest common divisor calculator
by: Aris, Muhammad Farhan
Published: (2010) -
Multilinear singular value decomposition for two qubits
by: Choong, Pak Shen, et al.
Published: (2016)