Results 1  10
of
959,974
The Constraint Equations
 50 Years of the Cauchy Problem
, 2004
"... Initial data for solutions of Einstein’s gravitational field equations cannot be chosen freely: the data must satisfy the four Einstein constraint equations. We first discuss the geometric origins of the Einstein constraints and the role the constraint equations play in generating solutions of the f ..."
Abstract

Cited by 27 (1 self)
 Add to MetaCart
Initial data for solutions of Einstein’s gravitational field equations cannot be chosen freely: the data must satisfy the four Einstein constraint equations. We first discuss the geometric origins of the Einstein constraints and the role the constraint equations play in generating solutions
Constraint equations
, 2000
"... We will present results of a long term stable evolution, to t = 1000m, of a maximally sliced Schwarzschild blackhole using a smooth lattice method. In recent papers 1,2 we have shown how local sets of Riemann normal coordinates on a lattice can be used to generate numerical spacetimes. In this talk ..."
Abstract
 Add to MetaCart
we will report on a combination of the ADM equations with the smooth lattice method to produce long term stable evolution of a maximally sliced Schwarzschild blackhole. A suitable lattice for a spherically symmetric space is a semiinfinite ladder. The ladder has rungs of length Lx and each rung
Constraint Equations
"... Partly motivated by algebraic multigrid and renormalization group methods, systematic multiscale procedures are described for solving or simulating very large systems, with computations at each fine scale being confined to just small parts of the entire domain. Applicable to nonlinear, deterministic ..."
Abstract
 Add to MetaCart
Partly motivated by algebraic multigrid and renormalization group methods, systematic multiscale procedures are described for solving or simulating very large systems, with computations at each fine scale being confined to just small parts of the entire domain. Applicable to nonlinear, deterministic or stochastic, autonomous systems with strong interscale interactions. Examples from molecular dynamics to turbulent flows. Analysis and Convergent Adaptive Solution of the Einstein
On the Asymptotics for the Vacuum Einstein Constraint Equations
"... Given asymptotically flat initial data on M 3 for the vacuum Einstein field equation, and given a bounded domain in M, we construct solutions of the vacuum constraint equations which agree with the original data inside the given domain, and are identical to that of a suitable Kerr slice (or identica ..."
Abstract

Cited by 96 (7 self)
 Add to MetaCart
Given asymptotically flat initial data on M 3 for the vacuum Einstein field equation, and given a bounded domain in M, we construct solutions of the vacuum constraint equations which agree with the original data inside the given domain, and are identical to that of a suitable Kerr slice (or
Rough solution of the Einstein constraint equations
 URL (cited on 15 February 2005): http://arXiv.org/abs/grqc/0405088
, 2004
"... Abstract. We construct low regularity solutions of the vacuum Einstein constraint equations. In particular, on 3manifolds we obtain solutions with metrics in Hs loc with s> 3 2. The theory of maximal asymptotically Euclidean solutions of the constraint equations descends completely the low regul ..."
Abstract

Cited by 45 (0 self)
 Add to MetaCart
Abstract. We construct low regularity solutions of the vacuum Einstein constraint equations. In particular, on 3manifolds we obtain solutions with metrics in Hs loc with s> 3 2. The theory of maximal asymptotically Euclidean solutions of the constraint equations descends completely the low
Constraint Equations in Cadastral
"... Cadastral modelling uses the cadastral data including bearings and distances of boundary lines to calculate coordinates of boundary corners and associated marks, and to evaluate the data. This paper shows that at sites where several boundary corners are intended to be on a straight line a Least Squa ..."
Abstract
 Add to MetaCart
are given for constraining points to stay on a straight line by using fixed 180 ° angle observations or by using parameter constraint equations. Also, considered are multiple points on a line, parallel line constraints and constraints to keep boundary points on a circular arc, where appropriate. An example
The Semantics Of Constraint Logic Programs
 JOURNAL OF LOGIC PROGRAMMING
, 1996
"... This paper presents for the first time the semantic foundations of CLP in a selfcontained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new and comp ..."
Abstract

Cited by 872 (14 self)
 Add to MetaCart
and complete proofs for the main lemmas. Importantly, we clarify which theorems depend on conditions such as solution compactness, satisfaction completeness and independence of constraints. Second, we generalize the original results to allow for incompleteness of the constraint solver. This is important
Concurrent Constraint Programming
, 1993
"... This paper presents a new and very rich class of (concurrent) programming languages, based on the notion of comput.ing with parhal information, and the concommitant notions of consistency and entailment. ’ In this framework, computation emerges from the interaction of concurrently executing agent ..."
Abstract

Cited by 502 (16 self)
 Add to MetaCart
agents that communicate by placing, checking and instantiating constraints on shared variables. Such a view of computation is interesting in the context of programming languages because of the ability to represent and manipulate partial information about the domain of discourse, in the con
Numerical integration of the Cartesian equations of motion of a system with constraints: molecular dynamics of nalkanes
 J. Comput. Phys
, 1977
"... A numerical algorithm integrating the 3N Cartesian equations of motion of a system of N points subject to holonomic constraints is formulated. The relations of constraint remain perfectly fulfilled at each step of the trajectory despite the approximate character of numerical integration. The method ..."
Abstract

Cited by 682 (6 self)
 Add to MetaCart
A numerical algorithm integrating the 3N Cartesian equations of motion of a system of N points subject to holonomic constraints is formulated. The relations of constraint remain perfectly fulfilled at each step of the trajectory despite the approximate character of numerical integration. The method
Constraint Logic Programming: A Survey
"... Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve in differe ..."
Abstract

Cited by 864 (25 self)
 Add to MetaCart
Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve
Results 1  10
of
959,974