In this paper, we investigate a method to decompose the search space explored by a Constraint Programming algorithm to allow a parallel solution of a Constraint Satisfaction or Optimization Problem (CSP or COP). The static tree decomposition used is based on domain partitioning according to a value ordering heuristic and a discrepancybased search strategy. This work is a parallel adaptation of ...

This paper focuses on the application of modal decomposition to a nonlinear convection-reaction-diffusion distributed parameter system (DPS). More precisely it will concentrate on the dynamical model of an industrial pulp bleaching tubular reactor described by nonlinear partial differential equations (PDEs). The objective of the modal decomposition is to generate, for control design, a discreti...

The main focus of this paper is to suggest a domain decomposition method for finite element approximations of elliptic problems with anisotropic coefficients in domains consisting of anisotropic shape rectangles. The theorems on traces of functions from Sobolev spaces play an important role in studying boundary value problems of partial differential equations. These theorems are commonly used f...

The main focus of this paper is to suggest a domain decomposition method for mixed finite element approximations of elliptic problems with anisotropic coefficients in domains. The theorems on traces of functions from Sobolev spaces play an important role in studying boundary value problems of partial differential equations. These theorems are commonly used for a priori estimates of the stabilit...

We consider an image decomposition model involving a variational (minimization) problem and an evolutionary partial differential equation (PDE). We utilize a linear inhomogenuous diffusion constrained and weighted total variation (TV) scheme for image adaptive decomposition. An adaptive weight along with TV regularization splits a given image into three components representing the geometrical (...