Displaying 121 – 140 of 498

Showing per page

Nonlinear state prediction by separation approach for continuous-discrete stochastic systems

Jaroslav Švácha, Miroslav Šimandl (2008)

Kybernetika

The paper deals with a filter design for nonlinear continuous stochastic systems with discrete-time measurements. The general recursive solution is given by the Fokker–Planck equation (FPE) and by the Bayesian rule. The stress is laid on the computation of the predictive conditional probability density function from the FPE. The solution of the FPE and its integration into the estimation algorithm is the cornerstone for the whole recursive computation. A new usable numerical scheme for the FPE is...

Nonlinear Tensor Diffusion in Image Processing

Stašová, Olga, Mikula, Karol, Handlovičová, Angela, Peyriéras, Nadine (2017)

Proceedings of Equadiff 14

This paper presents and summarize our results concerning the nonlinear tensor diffusion which enhances image structure coherence. The core of the paper comes from [3, 2, 4, 5]. First we briefly describe the diffusion model and provide its basic properties. Further we build a semi-implicit finite volume scheme for the above mentioned model with the help of a co-volume mesh. This strategy is well-known as diamond-cell method owing to the choice of co-volume as a diamondshaped polygon, see [1]. We...

Nonmonotone strategy for minimization of quadratics with simple constraints

M. A. Diniz-Ehrhardt, Zdeněk Dostál, M. A. Gomes-Ruggiero, J. M. Martínez, Sandra Augusta Santos (2001)

Applications of Mathematics

An algorithm for quadratic minimization with simple bounds is introduced, combining, as many well-known methods do, active set strategies and projection steps. The novelty is that here the criterion for acceptance of a projected trial point is weaker than the usual ones, which are based on monotone decrease of the objective function. It is proved that convergence follows as in the monotone case. Numerical experiments with bound-constrained quadratic problems from CUTE collection show that the modified...

Non-monotoneous parallel iteration for solving convex feasibility problems

Gilbert Crombez (2003)

Kybernetika

The method of projections onto convex sets to find a point in the intersection of a finite number of closed convex sets in an Euclidean space, sometimes leads to slow convergence of the constructed sequence. Such slow convergence depends both on the choice of the starting point and on the monotoneous behaviour of the usual algorithms. As there is normally no indication of how to choose the starting point in order to avoid slow convergence, we present in this paper a non-monotoneous parallel algorithm...

Nonobtuse tetrahedral partitions that refine locally towards Fichera-like corners

Larisa Beilina, Sergey Korotov, Michal Křížek (2005)

Applications of Mathematics

Linear tetrahedral finite elements whose dihedral angles are all nonobtuse guarantee the validity of the discrete maximum principle for a wide class of second order elliptic and parabolic problems. In this paper we present an algorithm which generates nonobtuse face-to-face tetrahedral partitions that refine locally towards a given Fichera-like corner of a particular polyhedral domain.

Currently displaying 121 – 140 of 498