Stability of saddle point problems with penalty
The magnetization of a ferromagnetic sample solves a non-convex variational problem, where its relaxation by convexifying the energy density resolves relevant macroscopic information. The numerical analysis of the relaxed model has to deal with a constrained convex but degenerated, nonlocal energy functional in mixed formulation for magnetic potential and magnetization . In [C. Carstensen and A. Prohl, Numer. Math. 90 (2001) 65–99], the conforming -element in spatial dimensions is shown to...
The magnetization of a ferromagnetic sample solves a non-convex variational problem, where its relaxation by convexifying the energy density resolves relevant macroscopic information. The numerical analysis of the relaxed model has to deal with a constrained convex but degenerated, nonlocal energy functional in mixed formulation for magnetic potential u and magnetization m. In [C. Carstensen and A. Prohl, Numer. Math.90 (2001) 65–99], the conforming P1 - (P0)d-element in d=2,3 spatial dimensions...
In dimension one it is proved that the solution to a total variation-regularized least-squares problem is always a function which is "constant almost everywhere" , provided that the data are in a certain sense outside the range of the operator to be inverted. A similar, but weaker result is derived in dimension two.
In this paper, we discuss the numerical simulation for a class of constrained optimal control problems governed by integral equations. The Galerkin method is used for the approximation of the problem. A priori error estimates and a superconvergence analysis for the approximation scheme are presented. Based on the results of the superconvergence analysis, a recovery type a posteriori error estimator is provided, which can be used for adaptive mesh refinement.
In this paper we are concerned with finite element approximations to the evaluation of American options. First, following W. Allegretto etc., SIAM J. Numer. Anal. 39 (2001), 834–857, we introduce a novel practical approach to the discussed problem, which involves the exact reformulation of the original problem and the implementation of the numerical solution over a very small region so that this algorithm is very rapid and highly accurate. Secondly by means of a superapproximation and interpolation...
The powerful Hamilton-Jacobi theory is used for constructing regularizations and error estimates for optimal design problems. The constructed Pontryagin method is a simple and general method for optimal design and reconstruction: the first, analytical, step is to regularize the hamiltonian; next the solution to its stationary hamiltonian system, a nonlinear partial differential equation, is computed with the Newton method. The method is efficient for designs where the hamiltonian function can be...
The powerful Hamilton-Jacobi theory is used for constructing regularizations and error estimates for optimal design problems. The constructed Pontryagin method is a simple and general method for optimal design and reconstruction: the first, analytical, step is to regularize the Hamiltonian; next the solution to its stationary Hamiltonian system, a nonlinear partial differential equation, is computed with the Newton method. The method is efficient for designs where the Hamiltonian function...