Sciweavers

36 search results - page 3 / 8
» Pseudozero set of interval polynomials
Sort
View
73
Voted
SIAMNUM
2010
120views more  SIAMNUM 2010»
14 years 4 months ago
Well Conditioned Spherical Designs for Integration and Interpolation on the Two-Sphere
A set XN of N points on the unit sphere is a spherical t-design if the average value of any polynomial of degree at most t over XN is equal to the average value of the polynomial o...
Congpei An, Xiaojun Chen, Ian H. Sloan, Robert S. ...
ORDER
2006
97views more  ORDER 2006»
14 years 9 months ago
Chain Dominated Orders
We study finite partial orders which have a chain such that every element of the order either belongs to this chain or has all its covers in this chain. We show that such orders a...
Glen-Brug Guenver, Jimmy Leblet, Jean-Xavier Rampo...
ICCV
2003
IEEE
15 years 11 months ago
Globally Convergent Autocalibration
Existing autocalibration techniques use numerical optimization algorithms that are prone to the problem of local minima. To address this problem, we have developed a method where ...
Arrigo Benedetti, Alessandro Busti, Michela Farenz...
JAT
2002
50views more  JAT 2002»
14 years 9 months ago
Blumenthal's Theorem for Laurent Orthogonal Polynomials
We investigate polynomials satisfying a three-term recurrence relation of the form Bn(x) = (x - n)Bn-1(x) - nxBn-2(x), with positive recurrence coefficients n+1, n (n = 1, 2, . . ...
A. Sri Ranga, Walter Van Assche
SIAMJO
2011
14 years 4 months ago
Minimizing the Condition Number of a Gram Matrix
Abstract. The condition number of a Gram matrix defined by a polynomial basis and a set of points is often used to measure the sensitivity of the least squares polynomial approxim...
Xiaojun Chen, Robert S. Womersley, Jane J. Ye