Displaying similar documents to “A symbolic algorithm for the approximate solution of an inverse problem for liner kinetic equation.”

Finite element approximation of a two-layered liquid film in the presence of insoluble surfactants

John W. Barrett, Linda El Alaoui (2008)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

We consider a system of degenerate parabolic equations modelling a thin film, consisting of two layers of immiscible Newtonian liquids, on a solid horizontal substrate. In addition, the model includes the presence of insoluble surfactants on both the free liquid-liquid and liquid-air interfaces, and the presence of both attractive and repulsive van der Waals forces in terms of the heights of the two layers. We show that this system formally satisfies a Lyapunov structure, and a...

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

Marek Smietanski (2008)

Open Mathematics

Similarity:

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.

Convergence of a method for solving the magnetostatic field in nonlinear media

Jozef Kačur, Jindřich Nečas, Josef Polák, Jiří Souček (1968)

Aplikace matematiky

Similarity:

For solving the boundary-value problem for potential of a stationary magnetic field in two dimensions in ferromagnetics it is possible to use a linearization based on the succesive approximations. In this paper the convergence of this method is proved under some conditions.

Inequality-sum : a global constraint capturing the objective function

Jean-Charles Régin, Michel Rueher (2005)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

This paper introduces a new method to prune the domains of the variables in constrained optimization problems where the objective function is defined by a sum y = Σ x i , and where the integer variables x i are subject to difference constraints of the form x j - x i c . An important application area where such problems occur is deterministic scheduling with the mean flow time as optimality criteria. This new constraint is also more general than a sum constraint defined on a set of ordered variables. Classical...