All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 3 Next

Displaying 41 – 60 of 272

Showing per page

The dual form of Knaster-Kuratowski-Mazurkiewicz principle in hyperconvex metric spaces and some applications

George Isac, George Xian-Zhi Yuan (1999)

Discussiones Mathematicae, Differential Inclusions, Control and Optimization

In this paper, we first establish the dual form of Knaster- Kuratowski-Mazurkiewicz principle which is a hyperconvex version of corresponding result due to Shih. Then Ky Fan type matching theorems for finitely closed and open covers are given. As applications, we establish some intersection theorems which are hyperconvex versions of corresponding results due to Alexandroff and Pasynkoff, Fan, Klee, Horvath and Lassonde. Then Ky Fan type best approximation theorem and Schauder-Tychonoff fixed point...

The Euler Lagrange Equation and the Pontriagin Maximum Principle

Arrigo Cellina (2005)

Bollettino dell'Unione Matematica Italiana

We consider the necessary conditions in the Calculus of Variations, expressed by the validity of the Euler Lagrange equation, or of the Pontriagin Maximum Principle; in particular, problems on multi-dimensional domanis are considered.

The Euler-Lagrange inclusion in Orlicz-Sobolev spaces

Hôǹg Thái Nguyêñ, Dariusz Pączka (2014)

Banach Center Publications

We establish the Euler-Lagrange inclusion of a nonsmooth integral functional defined on Orlicz-Sobolev spaces. This result is achieved through variational techniques in nonsmooth analysis and an integral representation formula for the Clarke generalized gradient of locally Lipschitz integral functionals defined on Orlicz spaces.

The extended adjoint method

Stanislas Larnier, Mohamed Masmoudi (2013)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Searching for the optimal partitioning of a domain leads to the use of the adjoint method in topological asymptotic expansions to know the influence of a domain perturbation on a cost function. Our approach works by restricting to local subproblems containing the perturbation and outperforms the adjoint method by providing approximations of higher order. It is a universal tool, easily adapted to different kinds of real problems and does not need the fundamental solution of the problem; furthermore...

The extended adjoint method

Stanislas Larnier, Mohamed Masmoudi (2012)

ESAIM: Mathematical Modelling and Numerical Analysis

Searching for the optimal partitioning of a domain leads to the use of the adjoint method in topological asymptotic expansions to know the influence of a domain perturbation on a cost function. Our approach works by restricting to local subproblems containing the perturbation and outperforms the adjoint method by providing approximations of higher order. It is a universal tool, easily adapted to different kinds of real problems and does not need...

The finite automata approaches in stringology

Jan Holub (2012)

Kybernetika

We present an overview of four approaches of the finite automata use in stringology: deterministic finite automaton, deterministic simulation of nondeterministic finite automaton, finite automaton as a model of computation, and compositions of finite automata solutions. We also show how the finite automata can process strings build over more complex alphabet than just single symbols (degenerate symbols, strings, variables).

Currently displaying 41 – 60 of 272