Sciweavers

1330 search results - page 56 / 266
» No Classic Boundary Conditions
Sort
View
SIAMMA
2010
63views more  SIAMMA 2010»
13 years 5 months ago
Sparse Tensor Product Wavelet Approximation of Singular Functions
Abstract. On product domains, sparse-grid approximation yields optimal, dimension-independent convergence rates when the function that is approximated has L2-bounded mixed derivati...
Monique Dauge, Rob Stevenson
DCG
2010
146views more  DCG 2010»
13 years 8 months ago
An Elementary Deduction of the Topological Radon Theorem from Borsuk-Ulam
Abstract. The Topological Radon Theorem states that, for every continuous function from the boundary of a (d + 1)-dimensional simplex into Rn , there exist a pair of disjoint faces...
Craig R. Guilbault
SIAMDM
2011
13 years 5 months ago
Root Polytopes and Growth Series of Root Lattices
The convex hull of the roots of a classical root lattice is called a root polytope. We determine explicit unimodular triangulations of the boundaries of the root polytopes associat...
Federico Ardila, Matthias Beck, Serkan Hosten, Jul...
RSFDGRC
2005
Springer
126views Data Mining» more  RSFDGRC 2005»
14 years 4 months ago
Rough Sets and Higher Order Vagueness
Abstract. We present a rough set approach to vague concept approximation within the adaptive learning framework. In particular, the role of extensions of approximation spaces in se...
Andrzej Skowron, Roman W. Swiniarski
ARITH
2007
IEEE
14 years 5 months ago
How to Ensure a Faithful Polynomial Evaluation with the Compensated Horner Algorithm
The compensated Horner algorithm improves the accuracy of polynomial evaluation in IEEE-754 floating point arithmetic: the computed result is as accurate as if it was computed wi...
Philippe Langlois, Nicolas Louvet