کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
403357 677109 2008 18 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Approximate factorization of multivariate polynomials using singular value decomposition
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
Approximate factorization of multivariate polynomials using singular value decomposition
چکیده انگلیسی

We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficients that contain numerical noise. Our algorithms are based on a generalization of the differential forms introduced by W. Ruppert and S. Gao to many variables, and use singular value decomposition or structured total least squares approximation and Gauss–Newton optimization to numerically compute the approximate multivariate factors. We demonstrate on a large set of benchmark polynomials that our algorithms efficiently yield approximate factorizations within the coefficient noise even when the relative error in the input is substantial (10−3).

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Symbolic Computation - Volume 43, Issue 5, May 2008, Pages 359-376