Displaying 601 – 620 of 1948

Showing per page

A non-overlapping domain decomposition method for continuous-pressure mixed finite element approximations of the Stokes problem

Hani Benhassine, Abderrahmane Bendali (2011)

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

This study is mainly dedicated to the development and analysis of non-overlapping domain decomposition methods for solving continuous-pressure finite element formulations of the Stokes problem. These methods have the following special features. By keeping the equations and unknowns unchanged at the cross points, that is, points shared by more than two subdomains, one can interpret them as iterative solvers of the actual discrete problem directly issued from the finite element scheme. In this way,...

A non-overlapping domain decomposition method for continuous-pressure mixed finite element approximations of the Stokes problem***

Hani Benhassine, Abderrahmane Bendali (2011)

ESAIM: Mathematical Modelling and Numerical Analysis

This study is mainly dedicated to the development and analysis of non-overlapping domain decomposition methods for solving continuous-pressure finite element formulations of the Stokes problem. These methods have the following special features. By keeping the equations and unknowns unchanged at the cross points, that is, points shared by more than two subdomains, one can interpret them as iterative solvers of the actual discrete problem directly issued from the finite element scheme. In this way,...

A nonsmooth optimisation approach for the stabilisation of time-delay systems

Stefan Vandewalle, Wim Michiels, Koen Verheyden, Joris Vanbiervliet (2008)

ESAIM: Control, Optimisation and Calculus of Variations

This paper is concerned with the stabilisation of linear time-delay systems by tuning a finite number of parameters. Such problems typically arise in the design of fixed-order controllers. As time-delay systems exhibit an infinite amount of characteristic roots, a full assignment of the spectrum is impossible. However, if the system is stabilisable for the given parameter set, stability can in principle always be achieved through minimising the real part of the rightmost characteristic root, or...

A nonsmooth optimisation approach for the stabilisation of time-delay systems

Joris Vanbiervliet, Koen Verheyden, Wim Michiels, Stefan Vandewalle (2007)

ESAIM: Control, Optimisation and Calculus of Variations

This paper is concerned with the stabilisation of linear time-delay systems by tuning a finite number of parameters. Such problems typically arise in the design of fixed-order controllers. As time-delay systems exhibit an infinite amount of characteristic roots, a full assignment of the spectrum is impossible. However, if the system is stabilisable for the given parameter set, stability can in principle always be achieved through minimising the real part of the rightmost characteristic...

A nonsmooth version of the univariate optimization algorithm for locating the nearest extremum (locating extremum in nonsmooth univariate optimization)

Marek Smietanski (2008)

Open Mathematics

An algorithm for univariate optimization using a linear lower bounding function is extended to a nonsmooth case by using the generalized gradient instead of the derivative. A convergence theorem is proved under the condition of semismoothness. This approach gives a globally superlinear convergence of algorithm, which is a generalized Newton-type method.

A note concerning Gauss-Jackson method.

Ana B. González, Pablo Martín (1996)

Extracta Mathematicae

Specialized literature concerning studies on Orbital Dynamics usually mentions the Gauss-Jackson or sum squared (∑2) method for the numerical integration of second order differential equations. However, as far as we know, no detailed description of this code is available and there is some confusion about the order of the method and its relation with the Störmer method. In this paper we present a simple way of deriving this algorithm and its corresponding analog for first order equations from the...

A note on ( 2 𝖪 + 1 ) -point conservative monotone schemes

Huazhong Tang, Gerald Warnecke (2004)

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

First–order accurate monotone conservative schemes have good convergence and stability properties, and thus play a very important role in designing modern high resolution shock-capturing schemes. Do the monotone difference approximations always give a good numerical solution in sense of monotonicity preservation or suppression of oscillations? This note will investigate this problem from a numerical point of view and show that a ( 2 K + 1 ) -point monotone scheme may give an oscillatory solution even though...

A note on (2K+1)-point conservative monotone schemes

Huazhong Tang, Gerald Warnecke (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

First–order accurate monotone conservative schemes have good convergence and stability properties, and thus play a very important role in designing modern high resolution shock-capturing schemes. Do the monotone difference approximations always give a good numerical solution in sense of monotonicity preservation or suppression of oscillations? This note will investigate this problem from a numerical point of view and show that a (2K+1)-point monotone scheme may give an oscillatory solution even...

A note on a class of equilibrium problems with equilibrium constraints

Jiří V. Outrata (2004)

Kybernetika

The paper concerns a two-level hierarchical game, where the players on each level behave noncooperatively. In this way one can model eg an oligopolistic market with several large and several small firms. We derive two types of necessary conditions for a solution of this game and discuss briefly the possibilities of its computation.

A note on a discrete form of Friedrichs' inequality

Libor Čermák (1983)

Aplikace matematiky

The proof of the Friedrichs' inequality on the class of finite dimensional spaces used in the finite element method is given. In particular, the approximate spaces generated by simplicial isoparametric elements are considered.

A note on certain ergodicity coeflcients

Francesco Tudisco (2015)

Special Matrices

We investigate two ergodicity coefficients ɸ ∥∥ and τn−1, originally introduced to bound the subdominant eigenvalues of nonnegative matrices. The former has been generalized to complex matrices in recent years and several properties for such generalized version have been shown so far.We provide a further result concerning the limit of its powers. Then we propose a generalization of the second coefficient τ n−1 and we show that, under mild conditions, it can be used to recast the eigenvector problem...

Currently displaying 601 – 620 of 1948