Page 1 Next

Displaying 1 – 20 of 33

Showing per page

Data assimilation for the time-dependent transport problem

Victor Shutyaev (2000)

Banach Center Publications

In this paper we consider the data assimilation problem for a timedependent transport problem in a slab when the initial condition is not known. The spaces of traces are introduced, the solvability of the original initial-boundary value transport problem is studied. The properties of the control operator are investigated, the solvability of the data assimilation problem is proved. The class of iterative methods for solving the problem is considered, and the convergence conditions are studied. The...

Detection and accommodation of second order distributed parameter systems with abrupt changes in input term: stability and adaptation

Michael A. Demetriou, Marios M. Polycarpou (1998)

Kybernetika

In this note, we employ nonlinear on-line parameter estimation methods based on adaptive neural network approximators for detecting changes due to actuator faults in a class of second order distributed parameter systems. The motivating example is a cantilevered beam actuated via a pair of piezoceramic patches. We examine changes in the control input term, which provide a simple and practical model of actuator failures. Using Lyapunov redesign methods, a stable learning scheme for fault diagnosis...

Deterministic global optimization using interval constraint propagation techniques

Frederic Messine (2004)

RAIRO - Operations Research - Recherche Opérationnelle

The purpose of this article is to show the great interest of the use of propagation (or pruning) techniques, inside classical interval Branch-and-Bound algorithms. Therefore, a propagation technique based on the construction of the calculus tree is entirely explained and some properties are presented without the need of any formalism (excepted interval analysis). This approach is then validated on a real example: the optimal design of an electrical rotating machine.

Deterministic global optimization using interval constraint propagation techniques

Frederic Messine (2010)

RAIRO - Operations Research

The purpose of this article is to show the great interest of the use of propagation (or pruning) techniques, inside classical interval Branch-and-Bound algorithms. Therefore, a propagation technique based on the construction of the calculus tree is entirely explained and some properties are presented without the need of any formalism (excepted interval analysis). This approach is then validated on a real example: the optimal design of an electrical rotating machine.

Dewetting dynamics of anisotropic particles: A level set numerical approach

Siddharth Gavhale, Karel Švadlenka (2022)

Applications of Mathematics

We extend thresholding methods for numerical realization of mean curvature flow on obstacles to the anisotropic setting where interfacial energy depends on the orientation of the interface. This type of schemes treats the interface implicitly, which supports natural implementation of topology changes, such as merging and splitting, and makes the approach attractive for applications in material science. The main tool in the new scheme are convolution kernels developed in previous studies that approximate...

Differential evolution algorithm combined with chaotic pattern search

Yaoyao He, Jianzhong Zhou, Ning Lu, Hui Qin, Youlin Lu (2010)

Kybernetika

Differential evolution algorithm combined with chaotic pattern search(DE-CPS) for global optimization is introduced to improve the performance of simple DE algorithm. Pattern search algorithm using chaotic variables instead of random variables is used to accelerate the convergence of solving the objective value. Experiments on 6 benchmark problems, including morbid Rosenbrock function, show that the novel hybrid algorithm is effective for nonlinear optimization problems in high dimensional space....

Discrete evolutions: Convergence and applications

Erich Bohl, Johannes Schropp (1993)

Applications of Mathematics

We prove a convergence result for a time discrete process of the form x ( t + h ) - x ( t ) = h V ( h , x ( t + α 1 ( t ) h ) , . . . , x ( t + α L ( t ) h ) ) t = T + j h , j = 0 , . . . , σ ( h ) - 1 under weak conditions on the function V . 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 mechanics and optimal control: An analysis

Sina Ober-Blöbaum, Oliver Junge, Jerrold E. Marsden (2011)

ESAIM: Control, Optimisation and Calculus of Variations

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*

Sina Ober-Blöbaum, Oliver Junge, Jerrold E. Marsden (2011)

ESAIM: Control, Optimisation and Calculus of Variations

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...

Currently displaying 1 – 20 of 33

Page 1 Next