6110 search results - page 395 / 1222 » Approximate Computing |
146
click to vote
ISSAC
2007
Springer
16 years 28 days ago
2007
Springer
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...
157
click to vote
IEEECGIV
2006
IEEE
16 years 25 days ago
2006
IEEE
In this paper, we introduce second order and mixed order partial differential equations (PDEs) for surface blending and present an approximate algorithm for the resolution of the ...
194
click to vote
PARA
2004
Springer
16 years 4 days ago
2004
Springer
Large and sparse rational eigenproblems where the rational term is of low rank k arise in vibrations of fluid–solid structures and of plates with elastically attached loads. Exp...
200
click to vote
STACS
2004
Springer
16 years 4 days ago
2004
Springer
Abstract We give a method for approximating any n-dimensional lattice with a lattice Λ whose factor group Zn /Λ has n − 1 cycles of equal length with arbitrary precision. We al...
178
click to vote
FOCS
2003
IEEE
16 years 2 days ago
2003
IEEE
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...