Iterative approximation of a common solution of a split equilibrium problem,a variational inequality problem and a fixed point problem

In this paper, we introduce an iterative method to approximate a common solution of a split equilibrium problem, a variational inequality problem and a fixed point problem for a nonexpansive mapping in real Hilbert spaces. We prove that the sequences generated by the iterative scheme converge strongly to a common solution of the split equilibrium problem, the variational inequality problem and the fixed point problem for a nonexpansive mapping. The results presented in this paper extend and generalize many previously known results in this research area.     

Inverse problem for a quasilinear hyperbolic equation with a nonlocal boundary condition containing a delay argument

We consider a problem for a quasilinear hyperbolic equation with a nonlocal condition that contains a retarded argument. By reducing this problem to a nonlinear integrofunctional equation, we prove the existence and uniqueness theorem for its solution. We pose an inverse problem of finding a solution-dependent coefficient of the equation on the basis of additional information on the solution; the information is given at a fixed point in space and is a function of time. We prove the uniqueness theorem for the solution of the inverse problem. The proof is based on the derivation and analysis of an integro-functional equation for the difference of two solutions of the inverse problem.     

On a spectral problem for a classical biorthogonal system

We consider a mixed problem for a fourth-order equation and the corresponding spectral problem, which describes the system biorthogonal to the classical system of root functions for the loaded string problem.     

Stability of a smooth flow in a Laval nozzle

A boundary-value problem for a non-linear second-order equation of mixed type in a cylindrical domain is considered. This problem simulates the development of small disturbances in a transonic flow of a chemical mixture in a Laval nozzle. The existence of a regular solution is proved with the help of a priori estimates for a corresponding linear problem and the contractive mapping theorem. The solution of the linear problem is constructed by the Galerkin method.     

A recognition problem for a vector alphabet generating a sequence with a quasiperiodic structure

An off-line recognition problem is analyzed for a vector alphabet generating sequences with quasiperiodic vector fragments that coincide with alphabet vectors. It is shown that the solution of this problem reduces to solving a special optimization problem. It is proved that the problem considered is solvable in polynomial time, and an algorithm for its exact solution is justified. The algorithm ensures the maximum likelihood recognition of a vector alphabet for the case of additive noise which is a Gaussian sequence of independent random values having an identical distribution.     

On the uniqueness of a solution of a two-phase free boundary problem

In this paper, we study the uniqueness problem of a two-phase elliptic free boundary problem arising from the phase transition problem subject to given boundary data. We show that in general the comparison principle between the sub- and super-solutions does not hold, and there is no uniqueness of either a viscosity solution or a minimizer of this free boundary problem by constructing counter-examples in various cases in any dimension. In one-dimension, a bifurcation phenomenon presents and the uniqueness problem has been completely analyzed. In fact, the critical case signifies the change from uniqueness to non-uniqueness of a solution of the free boundary problem. Non-uniqueness of a solution of the free boundary problem suggests different physical stationary states caused by different processes, such as melting of ice or solidification of water, even with the same prescribed boundary data. However, we prove that a uniqueness theorem is true for the initial-boundary value problem of an ε-evolutionary problem which is the smoothed two-phase parabolic free boundary problem.     

Recovering a space-dependent source term in a time-fractional diffusion wave equation

This work is concerned with identifying a space-dependent source function from noisy final time measured data in a time-fractional diffusion wave equation by a variational regularization approach. We provide a regularity of direct problem as well as the existence and uniqueness of adjoint problem. The uniqueness of the inverse source problem is discussed. Using the Tikhonov regularization method, the inverse source problem is formulated into a variational problem and a conjugate gradient algorithm is proposed to solve it. The efficiency and robust of the proposed method are supported by some numerical experiments.     

On a variational statement of a nonlocal boundary value problem for a fourth-order ordinary differential equation

We study a nonlocal boundary value problem for a fourth-order ordinary differential equation. We give a variational statement of the problem by constructing the corresponding functional. The minimization of this functional provides a solution of the problem.     

Existence of a Fixed Point of a Nonsmooth Function Arising in Numerical Mechanics

A recent work (Acary et al. 2010) introduces a formulation as a nonsmooth fixed-point problem of a basic problem in numerical mechanics (namely the dynamical Coulomb friction problem in finite dimension with discretized time). Using this new formulation, the existence of a solution to the problem and its numerical resolution are then guaranteed under a strong assumption on the data of this problem. In this paper, we show that the fixed point problem admits solution under a natural, weaker assumption. This existence proof uses a perturbation argument combined with continuity properties of a set-valued mapping associated with the constraints of the problem.     

Dirichlet problem for a third-order equation of mixed type in a rectangular domain

For a third-order differential equation of parabolic-hyperbolic type, we suggest a method for studying the first boundary value problem by solving an inverse problem for a second-order equation of mixed type with unknown right-hand side. We obtain a uniqueness criterion for the solution of the inverse problem. The solution of the inverse problem and the Dirichlet problem for the original equation is constructed in the form of the sum of a Fourier series.     

Routing trains through a railway station based on a node packing model

In this paper, we describe the problem of routing trains through a railway station. This routing problem is a subproblem of the automatic generation of timetables for the Dutch railway system. The problem of routing trains through a railway station is the problem of assigning each of the involved trains to a route through the railway station, given the detailed layout of the railway network within the station and given the arrival and departure times of the trains. When solving this routing problem, several aspects such as capacity, safety, and customer service have to be taken into account. In this paper, we describe this routing problem in terms of a weighted node packing problem. Furthermore, we describe an algorithm for solving this routing problem to optimality. The algorithm is based on preprocessing, valid inequalities, and a branch-and-cut approach. The preprocessing techniques aim at identifying superfluous nodes which can be removed from the problem instance. The characteristics of the preprocessing techniques with respect to propagation are investigated. We also present the results of a computational study in which the model, the preprocessing techniques and the algorithm are tested based on data related to the railway stations Arnhem, Hoorn and Utrecht CS in the Netherlands.     

Reduction method for a fourth-order equation on a graph

We justify a method that permits one to reduce a boundary value problem on a graph to a problem on a narrower subset provided that the right-hand side of the differential equation is identically zero on some subgraph of the original graph. We find the signs of the coefficients in the boundary conditions of the reduced problem and clarify the relationship between these coefficients.     

Solvability of a multivalued filtering problem in a heterogeneous environment with a distributed source

In this paper we formulate a generalized filtering problem in a heterogeneous environment in the presence of a source distributed along a line. Incompressible fluids obey a multivalued law with a linear growth at infinity. In this study we use the additive singularity extraction in the right-hand side of the problem constraint. We represent the pressure field as the sum of a known solution to a certain linear problem and an unknown “additive term”. We reduce the problem under consideration to a variational inequality of the second kind in a Hilbert space (with respect to the mentioned “additive term”) and prove its solvability.     

An Optimization Problem with a Separable Non-Convex Objective Function and a Linear Constraint

For a class of global optimization (maximization) problems, with a separable non-concave objective function and a linear constraint a computationally efficient heuristic has been developed.The concave relaxation of a global optimization problem is introduced. An algorithm for solving this problem to optimality is presented. The optimal solution of the relaxation problem is shown to provide an upper bound for the optimal value of the objective function of the original global optimization problem. An easily checked sufficient optimality condition is formulated under which the optimal solution of concave relaxation problem is optimal for the corresponding non-concave problem. An heuristic algorithm for solving the considered global optimization problem is developed.The considered global optimization problem models a wide class of optimal distribution of a unidimensional resource over subsystems to provide maximum total output in a multicomponent systems.In the presented computational experiments the developed heuristic algorithm generated solutions, which either met optimality conditions or had objective function values with a negligible deviation from optimality (less than 1/10 of a percent over entire range of problems tested).     

Analysis of a time-dependent fluid-solid interaction problem above a local rough surface

This paper is concerned with the mathematical analysis of a time-dependent fluid-solid interaction problem associated with a bounded elastic body immersed in a homogeneous air or fluid above a local rough surface. We reformulate the unbounded scattering problem into an equivalent initial-boundary value problem defined in a bounded domain by proposing a transparent boundary condition(TBC) on a hemisphere. Analyzing the reduced problem with the Lax-Milgram lemma and the abstract inversion theorem of the Laplace transform,we prove the well-posedness and stability for the reduced problem. Moreover, an a priori estimate is established directly in the time domain for the acoustic wave and elastic displacement by using the energy method.     

Reduction from a Semi-Infinite Interval to a Finite Interval of a Nonlinear Boundary Value Problem for a System of Second-Order Equations with a Small Parameter

We consider a boundary value problem over a semi-infinite interval for a nonlinear autonomous system of second-order ordinary differential equations with a small parameter at the leading derivatives. We impose certain constraints on the Jacobian under which a solution to the problem exists and is unique. To transfer the boundary condition from infinity, we use the well-known approach that rests on distinguishing the variety of solutions satisfying the limit condition at infinity. To solve an auxiliary Cauchy problem, we apply expansions of a solution in the parameter.     

Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge

The minimum cost path problem in a time-varying road network is a complicated problem. The paper proposes two heuristic methods to solve the minimum cost path problem between a pair of nodes with a time-varying road network and a congestion charge. The heuristic methods are compared with an alternative exact method using real traffic information. Also, the heuristic methods are tested in a benchmark dataset and a London road network dataset. The heuristic methods can achieve good solutions in a reasonable running time.     

Optimal boundary control by a force at one end of a string with a given force mode at the other end

We consider the problem of boundary control by a force applied to one end of a string in the case of a given force mode at the other end. The problem is studied in the sense of the generalized solution of the corresponding mixed initial-boundary value problem in the Sobolev space. We also solve the problem of choosing an optimal boundary control in the set of all admissible controls. The generalized solution of the mixed initial-boundary value problem is constructed in closed form, and its uniqueness is proved.     

Impact of a cone on a thin elastic membrane

The problem of computation of parameters of motion of a thin elastic membrane under the Impact of a rigid body, was considered by various authors (see [1] together with bibliography) without, however, yielding a rational solution. This paper presents a full qualitative analysis of solution of this problem for the case of normal impact of a circular cone moving with constant velocity on an infinite elastic membrane of constant thickness. Although this is the simplest case, it is important, insofar as it brings to light the characteristic features of the problem. In the “membrane” approximation the thickness of the layer is found to be an unessential parameter, therefore the problem, as postulated by us, is self-similar and its solution is reducible to the problem for ordinary differential equations.     

Optimization of a Quadratic Function with a Circulant Matrix

A problem arising in the control of flutter in compression systems via mistuning is formulated as maximizing a quadratic function with a circulant matrix over a set of vectors whose every component can take one of three values (the three level problem) or one of two values (the two level problem).