414 search results - page 3 / 83 » On discrete norms of polynomials |
CG
2002
Springer
13 years 4 months ago
2002
Springer
This paper proposes a mesh simplification algorithm using a discrete curvature norm. Most of the simplification algorithms are using a distance metric to date. The distance metric...
DGCI
2009
Springer
13 years 2 months ago
2009
Springer
The test mask TM is the minimum neighbourhood sufficient to extract the medial axis of any discrete shape, for a given chamfer distance mask M. We propose an arithmetical framework...
SIAMSC
2008
13 years 5 months ago
2008
We consider a norm-preconditioning approach for the solution of discontinuous Galerkin finite element discretizations of second order PDE with non-negative characteristic form. In ...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
We present a new approach to constructing pseudorandom generators that fool lowdegree polynomials over finite fields, based on the Gowers norm. Using this approach, we obtain th...
ARITH
2007
IEEE
13 years 9 months ago
2007
IEEE
We address the problem of computing a good floating-point-coefficient polynomial approximation to a function, with respect to the supremum norm. This is a key step in most process...