87 search results - page 1 / 18 » Nearest Singular Polynomials |
JSC
1998
13 years 4 months ago
1998
The nearest singular polynomials to a given polynomial have been studied in [1], based on minimization of quadratic forms. An equivalent expression of the quadratic form is present...
CAGD
2002
13 years 5 months ago
2002
This paper gives an algorithm for computing proper polynomial parametrizations for a particular class of curves. This class is characterized by the existence of a polynomial param...
ADCM
2000
13 years 5 months ago
2000
We discuss the problem of detecting the location of discontinuities of derivatives of a periodic function, given either finitely many Fourier coefficients of the function, or the ...
JSC
2008
13 years 5 months ago
2008
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
ISSAC
1995
Springer
13 years 8 months ago
1995
Springer
This paper introduces singular value decomposition (SVD) algorithms for some standard polynomial computations, in the case where the coefficients are inexact or imperfectly known....