Sciweavers

1469 search results - page 62 / 294
» Approximate polynomial decomposition
Sort
View
ISSAC
2007
Springer
132views Mathematics» more  ISSAC 2007»
15 years 4 months ago
Structured matrix methods for polynomial root-finding
In this paper we discuss the use of structured matrix methods for the numerical approximation of the zeros of a univariate polynomial. In particular, it is shown that root-findin...
Luca Gemignani
FOCS
2003
IEEE
15 years 3 months ago
Polynomial Degree vs. Quantum Query Complexity
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
Andris Ambainis
JAT
2010
109views more  JAT 2010»
14 years 8 months ago
Networks of polynomial pieces with application to the analysis of point clouds and images
We consider H¨older smoothness classes of surfaces for which we construct piecewise polynomial approximation networks, which are graphs with polynomial pieces as nodes and edges ...
Ery Arias-Castro, Boris Efros, Ofer Levi
RC
1998
66views more  RC 1998»
14 years 9 months ago
An Interval Polynomial Interpolation Problem and Its Lagrange Solution
Numerical interpolation and approximation are powerful tools to solve real world application problems. To take data measurement errors into considerations of interpolating a d deg...
Chenyi Hu, Angelina Cardenas, Stephanie Hoogendoor...
MOC
1998
111views more  MOC 1998»
14 years 9 months ago
The approximation power of moving least-squares
A general method for near-best approximations to functionals on Rd, using scattered-data information is discussed. The method is actually the moving least-squares method, presented...
David Levin