Existence theorems for boundary value problems in difference equations

In this research, we study linear difference equations with constant coefficients subject to boundary conditions. Necessary and/or sufficient conditions for the existence of a unique solution will be established. The proofs of the existence and uniqueness theorems are established by means of special types of determinants called Mosaic Vandermonde determinants.     

Convergence of a Difference Equation and Its Applications

In this paper, we establish a sufficient condition for every solution of the forced difference equation $$x_{n+1} - x_n + p_nx_{n-k} = r_n, \ \ n=0, 1, \ldots$$     

On weighting two criteria with a parameter in combinatorial optimization problems

Two criteria in a combinatorial problem are often combined in a weighted sum objective using a weighting parameter between 0 and 1. For special problem types, e.g., when one of the criteria is a bottleneck value, efficient algorithms are known that solve for a given value of the weighting parameter.     

Peculiarities of wave dynamics in media with oscillating inclusions

The article is concerned with mathematical models for media with oscillating inclusions. These models consist of mutually connected equations, one of which is the wave equation for carrying medium and others are equations of motion for partial oscillators. To close these models, we use cubic and nonlocal equations of state for the carrying medium. Travelling wave solutions to these models are studied in detail. Using qualitative analysis methods, the phase space is shown to contain periodic, homo- and heteroclinic trajectories. Moreover, in the case of nonlocal models we observe the creation of quasiperiodic and chaotic regimes. Bifurcations of localized regimes are studied via the Poincaré section technique.     

An equivalence between two algorithms for a class of quadratic programming problems with mmatrices *

In this paper the behaviour of the gradient projection method for the Quadratic Programming problems with M-Matrices and lower bounds on variables is analysed. It is shown that the Chandbasekaran method for solving such problems is simply a realization of the Newton projection method if for the latter one the starting point has components equal to lower bounds on variables.     

Phase unwrapping by accumulation of residual maps

We present a path independent (global) algorithm for phase unwrapping based on the minimisation of a robust cost function. The algorithm incorporates an outlier rejection mechanism making it robust to large inconsistencies and discontinuities. The proposal consists on an iterative incremental scheme that unwraps a sub-estimation of the residual phase at each iteration. The sub-estimation degree is controlled by an algorithm׳s parameter. We present an efficiently computational multigrid implementation based on a nested strategy: the process is iterated by using multiple resolutions. The proposal׳s performance is demonstrated by experiments with synthetic and real data, and successfully compared with algorithms of the state of the art.