Sciweavers

89 search results - page 3 / 18
» Hypermap operations of finite order
Sort
View
ORDER
2006
128views more  ORDER 2006»
13 years 5 months ago
Algebras Defined from Ordered Sets and the Varieties they Generate
We investigate ways of representing ordered sets as algebras and how the order relation is reflected in the algebraic properties of the variety (equational class) generated by the...
Joel Berman, Willem J. Blok
CADE
2010
Springer
13 years 7 months ago
Analytic Tableaux for Higher-Order Logic with Choice
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...
Julian Backes, Chad E. Brown
MOC
2002
70views more  MOC 2002»
13 years 5 months ago
Positivity preserving finite element approximation
We consider finite element operators defined on "rough" functions in a bounded polyhedron in RN . Insisting on preserving positivity in the approximations, we discover a...
Ricardo H. Nochetto, Lars B. Wahlbin
SIAMNUM
2010
106views more  SIAMNUM 2010»
13 years 21 days ago
Approximation of the Buckling Problem for Reissner-Mindlin Plates
This paper deals with the approximation of the buckling coefficients and modes of a clamped plate modeled by the Reissner-Mindlin equations. These coefficients are related with the...
Carlo Lovadina, David Mora, Rodolfo Rodrígu...
LISP
2006
76views more  LISP 2006»
13 years 5 months ago
Semantics of roundoff error propagation in finite precision calculations
We introduce a concrete semantics for floating-point operations which describes the propagation of roundoff errors throughout a calculation. This semantics is used to assert the co...
Matthieu Martel