Displaying 141 – 160 of 1497

Showing per page

A discrete contact model for crowd motion

Bertrand Maury, Juliette Venel (2011)

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

The aim of this paper is to develop a crowd motion model designed to handle highly packed situations. The model we propose rests on two principles: we first define a spontaneous velocity which corresponds to the velocity each individual would like to have in the absence of other people. The actual velocity is then computed as the projection of the spontaneous velocity onto the set of admissible velocities (i.e. velocities which do not violate the non-overlapping constraint). We describe here the...

A discrete contact model for crowd motion

Bertrand Maury, Juliette Venel (2011)

ESAIM: Mathematical Modelling and Numerical Analysis

The aim of this paper is to develop a crowd motion model designed to handle highly packed situations. The model we propose rests on two principles: we first define a spontaneous velocity which corresponds to the velocity each individual would like to have in the absence of other people. The actual velocity is then computed as the projection of the spontaneous velocity onto the set of admissible velocities (i.e. velocities which do not violate the non-overlapping constraint). We describe here...

A family of Lyapunov-based control schemes for maximum power point tracking in buck converters

Jorge Álvarez, Jorge Ruiz, Miguel Bernal (2023)

Kybernetika

This paper presents a novel family of Lyapunov-based controllers for the maximum power point tracking problem in the buck converter case. The solar power generation system here considered is composed by a stand-alone photovoltaic panel connected to a DC/DC buck converter. Lyapunov function candidates depending on the output are considered to develop conditions which, in some cases, can be expressed as linear matrix inequalities; these conditions guarantee that the output goes asymptotically to zero,...

A fast numerical test of multivariate polynomial positiveness with applications

Petr Augusta, Petra Augustová (2018)

Kybernetika

The paper presents a simple method to check a positiveness of symmetric multivariate polynomials on the unit multi-circle. The method is based on the sampling polynomials using the fast Fourier transform. The algorithm is described and its possible applications are proposed. One of the aims of the paper is to show that presented algorithm is significantly faster than commonly used method based on the semi-definite programming expression.

A finite dimensional reduction of the Schauder Conjecture

Espedito De Pascale (1993)

Commentationes Mathematicae Universitatis Carolinae

Schauder’s Conjecture (i.eėvery compact convex set in a Hausdorff topological vector space has the f.p.p.) is reduced to the search for fixed points of suitable multivalued maps in finite dimensional spaces.

A finite multiplicity Helson-Lowdenslager-de Branges theorem

Sneh Lata, Meghna Mittal, Dinesh Singh (2010)

Studia Mathematica

We prove two theorems. The first theorem reduces to a scalar situation the well known vector-valued generalization of the Helson-Lowdenslager theorem that characterizes the invariant subspaces of the operator of multiplication by the coordinate function z on the vector-valued Lebesgue space L²(;ℂⁿ). Our approach allows us to prove an equivalent version of the vector-valued Helson-Lowdenslager theorem in a completely scalar setting, thereby eliminating the use of range functions and partial isometries....

Currently displaying 141 – 160 of 1497