Results 1  10
of
111
Complexity of Bezout's theorem V: Polynomial time
 Theoretical Computer Science
, 1994
"... this paper is to show that the problem of finding approximately a zero of a polynomial system of equations can be solved in polynomial time, on the average. The number of arithmetic operations is bounded by cN ..."
Abstract

Cited by 52 (5 self)
 Add to MetaCart
this paper is to show that the problem of finding approximately a zero of a polynomial system of equations can be solved in polynomial time, on the average. The number of arithmetic operations is bounded by cN
Special Lagrangian submanifolds with isolated conical singularities
 V. Survey and applications
"... Special Lagrangian mfolds (SL mfolds) are a distinguished class of real mdimensional minimal submanifolds which may be defined in C m, or in Calabi– ..."
Abstract

Cited by 27 (9 self)
 Add to MetaCart
(Show Context)
Special Lagrangian mfolds (SL mfolds) are a distinguished class of real mdimensional minimal submanifolds which may be defined in C m, or in Calabi–
Singularities of special Lagrangian fibrations and the SYZ conjecture
, 2000
"... In 1996, Strominger, Yau and Zaslow [22] suggested a geometrical interpretation of Mirror Symmetry between Calabi–Yau 3folds M, ˆ M in terms of dual fibrations ..."
Abstract

Cited by 23 (7 self)
 Add to MetaCart
(Show Context)
In 1996, Strominger, Yau and Zaslow [22] suggested a geometrical interpretation of Mirror Symmetry between Calabi–Yau 3folds M, ˆ M in terms of dual fibrations
A Discrete Global Minimization Algorithm for Continuous Variational Problems
, 2004
"... In this paper, we apply the ideas from combinatorial optimization to find globally optimal solutions to continuous variational problems. At the heart of our method is an algorithm to solve for globally optimal discrete minimal surfaces. This discrete surface problem is a natural generalization of ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
In this paper, we apply the ideas from combinatorial optimization to find globally optimal solutions to continuous variational problems. At the heart of our method is an algorithm to solve for globally optimal discrete minimal surfaces. This discrete surface problem is a natural generalization of the planargraph shortest path problem.
Rectifiability of flat chain
, 1999
"... We prove (without using Federer’s structure theorem) that a finitemass flat chain over any coefficient group is rectifiable if and only if almost all of its 0dimensional slices are rectifiable. This implies that every flat chain of finite mass and finite size is rectifiable. It also leads to a sim ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
We prove (without using Federer’s structure theorem) that a finitemass flat chain over any coefficient group is rectifiable if and only if almost all of its 0dimensional slices are rectifiable. This implies that every flat chain of finite mass and finite size is rectifiable. It also leads to a simple necessary and sufficient condition on the coefficient group in order for every finitemass flat chain to be rectifiable.
On Mathematical Models For Phase Separation In Elastically Stressed Solids
, 2000
"... Contents 1. Introduction 2 2. The diffuse interface model 7 3. Existence for the diffuse interface system 12 3.1. The gradient flow structure 12 3.2. Assumptions 15 3.3. Weak solutions 16 3.4. The implicit time discretisation 17 3.5. Uniform estimates 21 3.6. Proof of the existence theorem 25 3.7. ..."
Abstract

Cited by 20 (9 self)
 Add to MetaCart
(Show Context)
Contents 1. Introduction 2 2. The diffuse interface model 7 3. Existence for the diffuse interface system 12 3.1. The gradient flow structure 12 3.2. Assumptions 15 3.3. Weak solutions 16 3.4. The implicit time discretisation 17 3.5. Uniform estimates 21 3.6. Proof of the existence theorem 25 3.7. Uniqueness for homogeneous linear elasticity 26 4. Logarithmic free energy 29 4.1. A regularised problem 32 4.2. Higher integrability for the strain tensor 36 4.3. Higher integrability for the logarithmic free energy 42 4.4. Proof of the existence theorem 45 5. The sharp interface limit 46 5.1. The \Gammalimit of the elastic GinzburgLandau energies 52 5.2. EulerLagrange equation for the sharp interface functional 60 6. The GibbsThomson equation as a singular limit in the scalar case 70 7. Discussion 79 8. Appendix 81 9. Notation 86 References 90 1 1. Introduction We study a mathematical model describing phase separation in multi component alloy
Lower Bound Gradient Estimates for FirstOrder HamiltonJacobi Equations and Applications to the Regularity of Propagating Fronts.
 Adv. Differential Equations
, 2001
"... This paper is concerned with firstorder timedependent HamiltonJacobi Equations. Exploiting some ideas of Barron and Jensen [9], we derive lower bound estimates for the gradient of a locally Lipschitz continuous viscosity solution u of equations with a convex Hamiltonian. Using these estimates in ..."
Abstract

Cited by 19 (9 self)
 Add to MetaCart
This paper is concerned with firstorder timedependent HamiltonJacobi Equations. Exploiting some ideas of Barron and Jensen [9], we derive lower bound estimates for the gradient of a locally Lipschitz continuous viscosity solution u of equations with a convex Hamiltonian. Using these estimates in the context of the levelset approach to front propagation, we investigate the regularity properties of the propagating front of u, namely \Gamma t = fx 2 IR n : u(x; t) = 0g for t 0. We show that, contrary to the smooth case, such estimates do not guarantee, in general, any expected regularity for \Gamma t even if u is semiconcave. 1 Introduction We consider the firstorder timedependent HamiltonJacobi Equation @! @t +H(x; t; D x !) = 0 in IR n \Theta (0; T ) (1) with the initial condition !(x; 0) = u 0 (x) in IR n (2) where H 2 C(IR n \Theta [0; T ] \Theta IR n ), u 0 2 C(IR n ) and the solution ! is a realvalued function. Under suitable assumptions on the Hamiltonian H...
Regularity of Horizons and The Area Theorem
"... We prove that the area of sections of future event horizons in spacetimes satisfying the null energy condition is nondecreasing towards the future under the following circumstances: 1) the horizon is future geodesically complete; 2) the horizon is a black hole event horizon in a globally hyperboli ..."
Abstract

Cited by 17 (12 self)
 Add to MetaCart
We prove that the area of sections of future event horizons in spacetimes satisfying the null energy condition is nondecreasing towards the future under the following circumstances: 1) the horizon is future geodesically complete; 2) the horizon is a black hole event horizon in a globally hyperbolic spacetime and there exists a conformal completion with a "regular" I + ; 3) the horizon is a black hole event horizon in a spacetime which has a globally hyperbolic conformal completion. (Some related results under less restrictive hypotheses are also established.) This extends ...