Results 1  10
of
16,523
Approximate Controllability of the Degenerate System with the FirstOrder Term
"... We consider the approximate controllability of the degenerate system with the firstorder term. The firstorder term in the equation cannot be controlled by the diffusion term. The system is shown to be approximately controllable by constructing a control by means of its conjugate problem. ..."
Abstract
 Add to MetaCart
We consider the approximate controllability of the degenerate system with the firstorder term. The firstorder term in the equation cannot be controlled by the diffusion term. The system is shown to be approximately controllable by constructing a control by means of its conjugate problem.
Identifiability at the boundary for firstorder terms
"... Abstract. Let Ω be a domain in R n whose boundary is C 1 if n ≥ 3 or C 1,β if n = 2. We consider a magnetic Schrödinger operator LW,q in Ω and show how to recover the boundary values of the tangential component of the vector potential W from the Dirichlet to Neumann map for LW,q. We also consider a ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
steady state heat equation with convection term ∆+2W · ∇ and recover the boundary values of the convection term W from the Dirichlet to Neumann map. Our method is constructive and gives a stability result at the boundary. 1
FirstOrder Term Compression: Techniques and Applications
, 1998
"... Lossless sequential data compression techniques are wellknown. ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Lossless sequential data compression techniques are wellknown.
A Theory About FirstOrder Terms in ACL2
 In Third ACL2 Workshop
, 2002
"... We describe the development in ACL2 of a library of results about firstorder terms. In particular, we present the formalization of some of the main properties of the complete lattice of firstorder terms with respect to the subsumption relation. As a byproduct, verified executable implementations a ..."
Abstract
 Add to MetaCart
We describe the development in ACL2 of a library of results about firstorder terms. In particular, we present the formalization of some of the main properties of the complete lattice of firstorder terms with respect to the subsumption relation. As a byproduct, verified executable implementations
A Theory About First–Order Terms in ACL2
 In Third ACL2 Workshop
, 2002
"... Abstract. We describe the development in ACL2 of a library of results about firstorder terms. In particular, we present the formalization of some of the main properties of the complete lattice of firstorder terms with respect to the subsumption relation. As a byproduct, verified executable impleme ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. We describe the development in ACL2 of a library of results about firstorder terms. In particular, we present the formalization of some of the main properties of the complete lattice of firstorder terms with respect to the subsumption relation. As a byproduct, verified executable
A New ContextSensitive and Composable Distance for FirstOrder Terms
"... In this work, we introduce a new distance function for data representations based on firstorder logic (atoms, to be more precise) which integrates the main advantages of the distances that have been previously presented in the literature. Basically, our distance simultaneously takes into account s ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
In this work, we introduce a new distance function for data representations based on firstorder logic (atoms, to be more precise) which integrates the main advantages of the distances that have been previously presented in the literature. Basically, our distance simultaneously takes into account
PICONETYPE INEQUALITIES FOR NONLINEAR ELLIPTIC EQUATIONS WITH FIRSTORDER TERMS AND THEIR APPLICATIONS
"... Piconetype inequalities are established for nonlinear elliptic equations which are generalizations of nonselfadjoint linear elliptic equations, and Sturmian comparison theorems are derived as applications. Oscillation results are also obtained for forced superlinear elliptic equations and superli ..."
Abstract
 Add to MetaCart
Piconetype inequalities are established for nonlinear elliptic equations which are generalizations of nonselfadjoint linear elliptic equations, and Sturmian comparison theorems are derived as applications. Oscillation results are also obtained for forced superlinear elliptic equations and superlinearsublinear elliptic equations. Copyright © 2006 Hindawi Publishing Corporation. All rights reserved. 1.
Elliptic equations with first order terms (Rough notes of the course at Alexandria, Ecole Cimpa 1/2009)
"... The aim of this short course is to take a look to some questions arising around elliptic equations with first order terms. The following models are the main examples to be kept in mind. The domain Ω will always be assumed to be a ..."
Abstract
 Add to MetaCart
The aim of this short course is to take a look to some questions arising around elliptic equations with first order terms. The following models are the main examples to be kept in mind. The domain Ω will always be assumed to be a
DETERMINING NONSMOOTH FIRST ORDER TERMS FROM PARTIAL BOUNDARY MEASUREMENTS
, 2006
"... Abstract. We extend results of Dos Santos FerreiraKenigSjöstrandUhlmann (arXiv:math.AP/0601466) to less smooth coefficients, and we show that measurements on part of the boundary for the magnetic Schrödinger operator determine uniquely the magnetic field related to a Hölder continuous potential. ..."
Abstract

Cited by 27 (7 self)
 Add to MetaCart
. We give a similar result for determining a convection term. The proofs involve Carleman estimates, a smoothing procedure, and an extension of the NakamuraUhlmann pseudodifferential conjugation method to logarithmic Carleman weights. 1.
FirstOrder Formative Rules?
"... Abstract This paper discusses the method of formative rules for firstorder term rewriting, which was previously defined for a higherorder setting. Dual to the wellknown usable rules, formative rules allow dropping some of the term constraints that need to be solved during a termination proof. Co ..."
Abstract
 Add to MetaCart
Abstract This paper discusses the method of formative rules for firstorder term rewriting, which was previously defined for a higherorder setting. Dual to the wellknown usable rules, formative rules allow dropping some of the term constraints that need to be solved during a termination proof
Results 1  10
of
16,523