28 search results - page 1 / 6 » Moving Least Squares via Orthogonal Polynomials |
SIAMSC
2010
13 years 3 months ago
2010
A method for moving least squares interpolation and differentiation is presented in the framework of orthogonal polynomials on discrete points. This yields a robust and efficient ...
ICASSP
2009
IEEE
13 years 11 months ago
2009
IEEE
Sampling error due to jitter, or noise in the sample times, affects the precision of analog-to-digital converters in a significant, nonlinear fashion. In this paper, a polynomial...
CGF
2010
13 years 5 months ago
2010
We propose a new family of barycentric coordinates that have closed-forms for arbitrary 2D polygons. These coordinates are easy to compute and have linear precision even for open ...
SIAMSC
2011
12 years 11 months ago
2011
Given a certain function f, various methods have been proposed in the past for addressing the important problem of computing the matrix-vector product f(A)b without explicitly comp...
JGO
2010
12 years 11 months ago
2010