Discrete anisotropic curvature flow of graphs
Discrete anisotropic curvature flow of graphs
The evolution of n–dimensional graphs under a weighted curvature flow is approximated by linear finite elements. We obtain optimal error bounds for the normals and the normal velocities of the surfaces in natural norms. Furthermore we prove a global existence result for the continuous problem and present some examples of computed surfaces.
Discrete approximation of the solution of the Dirichlet problem by discrete means.
Discrete approximations of generalized RBSDE with random terminal time
The convergence of discrete approximations of generalized reflected backward stochastic differential equations with random terminal time in a general convex domain is studied. Applications to investigation obstacle elliptic problem with Neumann boundary condition for partial differential equations are given.
Discrete Approximations of Strong Solutions of Reflecting SDEs with Discontinuous Coefficients
We study convergence for the Euler scheme for stochastic differential equations reflecting on the boundary of a general convex domain D ⊆ ℝd. We assume that the equation has the pathwise uniqueness property and its coefficients are measurable and continuous almost everywhere with respect to the Lebesgue measure. In the case D=[0,∞) new sufficient conditions ensuring pathwise uniqueness for equations with possibly discontinuous coefficients are given.
Discrete Approximations to Spherically Symmetric Distributions.
Discrete compactness for a discontinuous Galerkin approximation of Maxwell's system
In this paper we prove the discrete compactness property for a discontinuous Galerkin approximation of Maxwell's system on quite general tetrahedral meshes. As a consequence, a discrete Friedrichs inequality is obtained and the convergence of the discrete eigenvalues to the continuous ones is deduced using the theory of collectively compact operators. Some numerical experiments confirm the theoretical predictions.
Discrete Cubic Spline Interpolation
Discrete evolutions: Convergence and applications
We prove a convergence result for a time discrete process of the form under weak conditions on the function . This result is a slight generalization of the convergence result given in [5].Furthermore, we discuss applications to minimizing problems, boundary value problems and systems of nonlinear equations.
Discrete forms of Friedrichs' inequalities in the finite element method
Discrete Inverse Sturm-Liouville Problems. I. Uniqueness for Symmetric Potentials.
Discrete, Linear Approximation Problems in Polyhedral Norms.
Discrete L-Splines.
Discrete maximum principle for interior penalty discontinuous Galerkin methods
A class of linear elliptic operators has an important qualitative property, the so-called maximum principle. In this paper we investigate how this property can be preserved on the discrete level when an interior penalty discontinuous Galerkin method is applied for the discretization of a 1D elliptic operator. We give mesh conditions for the symmetric and for the incomplete method that establish some connection between the mesh size and the penalty parameter. We then investigate the sharpness of...
Discrete maximum principle in parabolic boundary-value problems
Discrete maximum principles for the FEM solution of some nonlinear parabolic problems.
Discrete mechanics and optimal control: An analysis
The optimal control of a mechanical system is of crucial importance in many application areas. Typical examples are the determination of a time-minimal path in vehicle dynamics, a minimal energy trajectory in space mission design, or optimal motion sequences in robotics and biomechanics. In most cases, some sort of discretization of the original, infinite-dimensional optimization problem has to be performed in order to make the problem amenable to computations. The approach proposed in this paper...
Discrete mechanics and optimal control: An analysis*
The optimal control of a mechanical system is of crucial importance in many application areas. Typical examples are the determination of a time-minimal path in vehicle dynamics, a minimal energy trajectory in space mission design, or optimal motion sequences in robotics and biomechanics. In most cases, some sort of discretization of the original, infinite-dimensional optimization problem has to be performed in order to make the problem amenable to computations. The approach proposed in this paper...
Discrete Newton Methods and Iterated Defect Corrections.
Discrete, Nonlinear Approximation Problems in Polyhedral Norms.