Page 1 Next

Displaying 1 – 20 of 503

Showing per page

A certified reduced basis method for parametrized elliptic optimal control problems

Mark Kärcher, Martin A. Grepl (2014)

ESAIM: Control, Optimisation and Calculus of Variations

In this paper, we employ the reduced basis method as a surrogate model for the solution of linear-quadratic optimal control problems governed by parametrized elliptic partial differential equations. We present a posteriori error estimation and dual procedures that provide rigorous bounds for the error in several quantities of interest: the optimal control, the cost functional, and general linear output functionals of the control, state, and adjoint variables. We show that, based on the assumption...

A class of minimum principles for characterizing the trajectories and the relaxation of dissipative systems

Michael Ortiz, Alexander Mielke (2008)

ESAIM: Control, Optimisation and Calculus of Variations

This work is concerned with the reformulation of evolutionary problems in a weak form enabling consideration of solutions that may exhibit evolving microstructures. This reformulation is accomplished by expressing the evolutionary problem in variational form, i.e., by identifying a functional whose minimizers represent entire trajectories of the system. The particular class of functionals under consideration is derived by first defining a sequence of time-discretized minimum problems and subsequently...

A class of minimum principles for characterizing the trajectories and the relaxation of dissipative systems

Alexander Mielke, Michael Ortiz (2007)

ESAIM: Control, Optimisation and Calculus of Variations

This work is concerned with the reformulation of evolutionary problems in a weak form enabling consideration of solutions that may exhibit evolving microstructures. This reformulation is accomplished by expressing the evolutionary problem in variational form, i.e., by identifying a functional whose minimizers represent entire trajectories of the system. The particular class of functionals under consideration is derived by first defining a sequence of time-discretized minimum problems and...

A convergence analysis of Newton's method under the gamma-condition in Banach spaces

Ioannis K. Argyros (2009)

Applicationes Mathematicae

We provide a local as well as a semilocal convergence analysis for Newton's method to approximate a locally unique solution of an equation in a Banach space setting. Using a combination of center-gamma with a gamma-condition, we obtain an upper bound on the inverses of the operators involved which can be more precise than those given in the elegant works by Smale, Wang, and Zhao and Wang. This observation leads (under the same or less computational cost) to a convergence analysis with the following...

A finite element analysis for elastoplastic bodies obeying Hencky's law

Ivan Hlaváček (1981)

Aplikace matematiky

Using the Haar-Kármán principle, approximate solutions of the basic boundary value problems are proposed and studied, which consist of piecewise linear stress fields on composite triangles. The torsion problem is solved in an analogous manner. Some convergence results are proven.

A least-squares method for the numerical solution of the Dirichlet problem for the elliptic monge − ampère equation in dimension two

Alexandre Caboussat, Roland Glowinski, Danny C. Sorensen (2013)

ESAIM: Control, Optimisation and Calculus of Variations

We address in this article the computation of the convex solutions of the Dirichlet problem for the real elliptic Monge − Ampère equation for general convex domains in two dimensions. The method we discuss combines a least-squares formulation with a relaxation method. This approach leads to a sequence of Poisson − Dirichlet problems and another sequence of low dimensional algebraic eigenvalue problems of a new type. Mixed finite element approximations with a smoothing procedure are used for the...

A method for constructing ε-value functions for the Bolza problem of optimal control

Jan Pustelnik (2005)

International Journal of Applied Mathematics and Computer Science

The problem considered is that of approximate minimisation of the Bolza problem of optimal control. Starting from Bellman's method of dynamic programming, we define the ε-value function to be an approximation to the value function being a solution to the Hamilton-Jacobi equation. The paper shows an approach that can be used to construct an algorithm for calculating the values of an ε-value function at given points, thus approximating the respective values of the value function.

Currently displaying 1 – 20 of 503

Page 1 Next