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 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On the application of modular approach to the computation of the greatest common divisors of generalized polynomials
by: Aris, Nor'aini
Published: (2003) -
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) -
Numerical Solutions Of Cauchy Type Singular Integral Equations Of The First Kind Using Polynomial Approximations
by: Mahiub, Mohammad Abdulkawi
Published: (2010) -
Chebyshev approximation of discrete polynomials and splines
by: Che Seman, Fauziahanim
Published: (2004) -
Chebyshev approximation of discrete polynomials and splines
by: Che Seman, Fauziahanim
Published: (2004)