Results 1  10
of
251,599
THE CONSTRAINT ALGEBRA OF TETRAD THEORIES
, 1996
"... Abstract. The constraint algebra for field theories constructed in an arbitrary spatial linear frame is derived from the principle of path independence. ..."
Abstract
 Add to MetaCart
Abstract. The constraint algebra for field theories constructed in an arbitrary spatial linear frame is derived from the principle of path independence.
The tetrad frame constraint algebra
 Class. Quantum Grav
, 1997
"... Abstract. It is shown via the principle of path independence that the (time gauge) constraint algebra derived in [3] for vielbein General Relativity is a generic feature of any covariant theory formulated in a vielbein frame. In the process of doing so, the relationship between the coordinate and or ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Abstract. It is shown via the principle of path independence that the (time gauge) constraint algebra derived in [3] for vielbein General Relativity is a generic feature of any covariant theory formulated in a vielbein frame. In the process of doing so, the relationship between the coordinate
A constraint algebra
 In 1st International Workshop on Constraint Propagation and Implementation
, 2004
"... We propose a constraint algebra in which complex constraint expressions can be built up from primitive constraints using logical connectives like conjunction, disjunction, negation, implication, and equivalence. The algebra facilitates the task of modeling a problem by providing a richer language fo ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We propose a constraint algebra in which complex constraint expressions can be built up from primitive constraints using logical connectives like conjunction, disjunction, negation, implication, and equivalence. The algebra facilitates the task of modeling a problem by providing a richer language
A Constraint Algebra
, 2004
"... We propose a constraint algebra in which complex constraint expressions can be built up from primitive constraints using logical connectives like conjunction, disjunction, negation, implication, and equivalence. The algebra facilitates the task of modeling a problem by providing a richer language ..."
Abstract
 Add to MetaCart
We propose a constraint algebra in which complex constraint expressions can be built up from primitive constraints using logical connectives like conjunction, disjunction, negation, implication, and equivalence. The algebra facilitates the task of modeling a problem by providing a richer
ON THE CONSTRAINT ALGEBRA OF DEGENERATE RELATIVITY
, 1993
"... As shown by Ashtekar in the mid 80’s, general relativity can be extended to incorporate degenerate metrics. This extension is not unique, however, as one can change the form of the hamiltonian constraints and obtain an alternative degenerate extension of general relativity that disagrees with Ashtek ..."
Abstract
 Add to MetaCart
with Ashtekar’s original theory when the triads vectors are degenerate. In this paper, the constraint algebra of a particular alternative theory is explicitly evaluated and compared with that of Ashtekar’s original degenerate extension. A generic classification of the difference between the two theories
Note on the structure of constraint algebras
, 2008
"... It is shown that when the gauge algebra is with root system the canonical Hamiltonian commutes with the constraints. Two other simple propositions concerning gauge fixing are proved too. 1 There is a vast literature on systems with constraints. Here we follow the Hamiltonian approach in which any co ..."
Abstract
 Add to MetaCart
It is shown that when the gauge algebra is with root system the canonical Hamiltonian commutes with the constraints. Two other simple propositions concerning gauge fixing are proved too. 1 There is a vast literature on systems with constraints. Here we follow the Hamiltonian approach in which any
The geometry of algorithms with orthogonality constraints
 SIAM J. MATRIX ANAL. APPL
, 1998
"... In this paper we develop new Newton and conjugate gradient algorithms on the Grassmann and Stiefel manifolds. These manifolds represent the constraints that arise in such areas as the symmetric eigenvalue problem, nonlinear eigenvalue problems, electronic structures computations, and signal proces ..."
Abstract

Cited by 642 (1 self)
 Add to MetaCart
In this paper we develop new Newton and conjugate gradient algorithms on the Grassmann and Stiefel manifolds. These manifolds represent the constraints that arise in such areas as the symmetric eigenvalue problem, nonlinear eigenvalue problems, electronic structures computations, and signal
Constraint algebras in gauge invariant systems
 INR preprint–860/94
, 1994
"... The Hamiltonian description for a wide class of mechanical systems, having local symmetry transformations depending on time derivatives of the gauge parameters of arbitrary order, is constructed. The Poisson brackets of the Hamiltonian and constraints with each other and with arbitrary function are ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
are explicitly obtained. The constraint algebra is proved to be the first class. 1 E–mail:
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
Results 1  10
of
251,599