Sciweavers

414 search results - page 39 / 83
» On discrete norms of polynomials
Sort
View
COMPGEOM
2007
ACM
14 years 1 months ago
On the hardness of minkowski addition and related operations
For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it...
Hans Raj Tiwary
COMPGEOM
2001
ACM
14 years 1 months ago
Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
We present two approaches to the problem of calculating a cell in a 3-dimensional arrangement of quadrics. The first approach solves the problem using rational arithmetic. It work...
Nicola Geismann, Michael Hemmer, Elmar Schöme...
JSCIC
2007
89views more  JSCIC 2007»
13 years 9 months ago
Dispersion and Dissipation Error in High-Order Runge-Kutta Discontinuous Galerkin Discretisations of the Maxwell Equations
Different time-stepping methods for a nodal high-order discontinuous Galerkin discretisation of the Maxwell equations are discussed. A comparison between the most popular choices o...
D. Sármány, M. A. Botchev, Jaap J. W...
STOC
2009
ACM
107views Algorithms» more  STOC 2009»
14 years 10 months ago
Efficient discrete-time simulations of continuous-time quantum query algorithms
The continuous-time query model is a variant of the discrete query model in which queries can be interleaved with known operations (called "driving operations") continuo...
Richard Cleve, Daniel Gottesman, Michele Mosca, Ro...
IMR
2003
Springer
14 years 3 months ago
Fully Automatic Adaptive Mesh Refinement Integrated into the Solution Process
Finite element analysts and designers need to feel confident in the results of their analyses before sending a product to prototype or production. Mesh discretization can greatly ...
Joseph R. Tristano, Zhijian Chen, D. Alfred Hancq,...