On the numerical solution of a nonlocal boundary value problem for a degenerating pseudoparabolic equation

We study a nonlocal boundary value problem for a degenerating pseudoparabolic third-order equation of the general form. For the solution of the problem, we obtain a priori estimates in differential and difference form, which imply the stability of the solution with respect to the initial data and right-hand side on a layer as well as the convergence of the solution of the difference problem to the solution of the differential problem.     

Numerical solution of a nonlinear reaction diffusion equation

In this paper, the authors propose a numerical method to compute the solution of a Cauchy problem with blow-up of the solution. The problem is split in two parts: a hyperbolic problem which is solved by using Hopf and Lax formula and a parabolic problem solved by a backward linearized Euler method in time and a finite element method in space. It is proved that the numerical solution blows up in a finite time as the exact solution and the support of the approximation of a self-similar solution remains bounded. The convergence of the scheme is obtained.     

Convolution solutions of an abstract stochastic Cauchy problem

We study convolution solutions of an abstract stochastic Cauchy problem with the generator of a convolution operator semigroup. In the case of additive noise, we prove the existence and uniqueness of a weak convolution solution; this solution is described by a formula generalizing the classical Cauchy formula in which the solution operators of the homogeneous problem are replaced by the convolution solution operators of the homogeneous problem. For the problem with multiplicative noise, we find a condition under which the weak convolution solution coincides with the soft solution and indicate a sufficient condition for the existence and uniqueness of a weak convolution solution; the latter can be obtained by the successive approximation method.     

An Iterative Method for Finding the Least Solution to the Tensor Complementarity Problem

In this paper, we are concerned with finding the least solution to the tensor complementarity problem. When the involved tensor is strongly monotone, we present a way to estimate the nonzero elements of the solution in a successive manner. The procedure for identifying the nonzero elements of the solution gives rise to an iterative method of solving the tensor complementarity problem. In each iteration, we obtain an iterate by solving a lower-dimensional tensor equation. After finitely many iterations, the method terminates with a solution to the problem. Moreover, the sequence generated by the method is monotonically convergent to the least solution to the problem. We then extend this idea for general case and propose a sequential mathematical programming method for finding the least solution to the problem. Since the least solution to the tensor complementarity problem is the sparsest solution to the problem, the method can be regarded as an extension of a recent result by Luo et al. (Optim Lett 11:471–482, 2017). Our limited numerical results show that the method can be used to solve the tensor complementarity problem efficiently.     

On the existence and uniqueness of a generalized solution of the mixed problem for the wave equation with the second and third boundary conditions

We prove the uniqueness of a generalized solution of an initial-boundary value problem for the wave equation with boundary conditions of the third and second kind. In addition, we find a closed-form expression for the analytic solution of that problem with zero initial data. The result plays an important role in the investigation of the boundary control problem. We show how to use the obtained solution for the investigation of the boundary control problem in the case of subcritical time intervals for which the solution of the boundary control problem, if it exists at all, is unique. We obtain necessary and sufficient conditions for the existence of a unique solution in a class admitting the existence of finite energy.     

热传导方程小波解的点态收敛

本文主要考虑热传导方程uxx=ut,0≤x<1,t≥0;u(1,t)=g(t),其中边界条件g(t)为已知函数．此定解问题为一不适定问题,也就是说当边界条件有微小扰动时,将会引起解大的扰动．本文将利用多分辨率分析构造一小波解,且证明此解是适定的,并给出所定义小波解与定解问题的真正解在点态意义下的误差估计．     

An approach for solving nonlinear programming problems

In this paper we use measure theory to solve a wide range of the nonlinear programming problems. First, we transform a nonlinear programming problem to a classical optimal control problem with no restriction on states and controls. The new problem is modified into one consisting of the minimization of a special linear functional over a set of Radon measures; then we obtain an optimal measure corresponding to functional problem which is then approximated by a finite combination of atomic measures and the problem converted approximately to a finite-dimensional linear programming. Then by the solution of the linear programming problem we obtain the approximate optimal control and then, by the solution of the latter problem we obtain an approximate solution for the original problem. Furthermore, we obtain the path from the initial point to the admissible solution.     

A Solution Concept for Fuzzy Multiobjective Programming Problems Based on Convex Cones

A solution concept for fuzzy multiobjective programming problems based on ordering cones (convex cones) is proposed in this paper. The notions of ordering cones and partial orderings on a vector space are essentially equivalent. Therefore, the optimality notions in a real vector space can be elicited naturally by invoking a concept similar to that of the Pareto-optimal solution in vector optimization problems. We introduce a corresponding multiobjective programming problem and a weighting problem of the original fuzzy multiobjective programming problem using linear functionals so that the optimal solution of its corresponding weighting problem is also the Pareto-optimal solution of the original fuzzy multiobjective programming problem.     

On the Existence of a Generalized Solution of the Saturated-Unsaturated Filtration Problem

We study the existence of a generalized solution of an initial–boundary value problem describing the process of unsteady filtration of a liquid in a bounded region of an n-dimensional space. We consider the case in which the Kirchhoff transformation used to determine the generalized solution takes the real axis into a semiaxis bounded below. An auxiliary problem is constructed. It is proved that any solution of the auxiliary problem is a solution of the problem under study. The solvability of the auxiliary problem is established by using the method of semidiscretization in time and the Galerkin method.     

The planar Dirichlet problem for the Stokes equations

The Dirichlet problem for the Stokes equations is studied in a planar domain. We construct a solution of this problem in form of appropriate potentials and determine the unknown source densities via integral equation systems on the boundary of the domain. The solution is given explicitly in the form of a series. As a consequence we determine a solution of the Dirichlet problem for a compressible Stokes system and a solution of a boundary value problem on a domain with cracks. Copyright © 2011 John Wiley & Sons, Ltd.     

Problem with integral condition for a partial differential equation of the first order with respect to time

We investigate the problem with inhomogeneous integral condition for a homogeneous partial differential equation of the first order with respect to time and, in the general case, of infinite order with respect to the space variable with constant coefficients. We prove the existence and uniqueness of a solution of the problem in a class of quasipolynomials of the special form. We construct a solution of this problem with the use of the differential-symbol method. In the case of existence of a nonunique solution of the problem, we propose formulas for the construction of a particular solution of the problem.     

To the Solution of the Hilbert Problem with Infinite Index

In this paper, we obtain a generalization of the method of regularizing multipliers for the solution of the Hilbert boundary-value problem with finite index in the theory of analytic functions to the case of an infinite power-behaved index. This method is used to obtain a general solution of the homogeneous Hilbert problem for the half-plane, a solution that depends on the existence and the number of entire functions possessing mirror symmetry with respect to the real axis and satisfying some additional constraints related to the singularity characteristic of the index. To solve of the inhomogeneous problem, we essentially use a specially constructed solution of the homogeneous problem whereby we reduce the boundary condition of the Hilbert problem to a Dirichlet problem.     

A variational technique for optimal boundary control in a hyperbolic problem

We investigate the problem of controlling the boundary functions in a one dimensional hyperbolic problem by minimizing the functional including the final state. After proving the existence and uniqueness of the solution to the given optimal control problem, we get the Frechet differential of the functional and give the necessary condition to the optimal solution in the form of the variational inequality via the solution of the adjoint problem. We constitute a minimizing sequence by the method of projection of the gradient and prove its convergence to the optimal solution.     

On the characteristic initial value problem for the wave equation in odd spatial dimensions with radial initial data

Summary The paper obtains an explicit solution of the characteristic initial value problem for the wave equation in odd spatial dimensions with radial initial data via solution of a characteristic boundary value problem involving a singular differential equation. The solution of the latter problem is obtained by a modified Riemann method. It is shown that on the time axis the solution of the original problem reduces to the solution that is obtainable by the use of Asgeirsson’s mean value theorem. Entrata in Redazione il 29 agosto 1971.     

An extension of the edge covering problem

In this paper we define a weightedr-covering problem, and show that there exists an optimum solution of ther-covering problem which can be decomposed into the sum of a rounded down solution of its linear relaxation and an optimal solution of a weighted edge covering problem on a reduced graph. Vertexr-packing problem can also be reduced to ther-covering problem.     

Ellipsoid projection method in matrix games

A problem of calculating a solution of a zero-sum matrix game is considered in the paper The problem of search of a solution is reduced to a constrained convex minimization problem for which an ellipsoid projection algorithm is used. The algorithm generates an ?-optimal solution of the game in a polynomial time     

The community problem for Stieltjes matrices

The communality problem in factor analysis is that of reducing the diagonal elements of a correlation matrix so that the resulting matrix will be positive semidefinite and of minimum rank. The problem is well studied, but no effective solution procedures have been devised. In this paper, we propose a variant problem and give an algorithm for its solution. We prove that a solution to this problem also solves the communality problem if the correlation matrix is Stieltjes.     

驻定Harry—Dym方程解的参数表示

本文推导出相联于ＨＤ（Ｈａｒｒｙ－Ｄｙｍ）族的Ｌｅｎａｒｄ递归方程的多项式解，并证明了任一驻定ＨＤ方程的解都可由非线性比的ＨＤ特征值问题的解表示。     

Solving Inverse Problems for Hyperbolic Equations via the Regularization Method

In the paper, we first deduce an optimization problem from an inverse problem for a general operator equation and prove that the optimization problem possesses a unique, stable solution that converges to the solution of the original inverse problem, if it exists, as a regularization factor goes to zero. Secondly, we apply the above results to an inverse problem determining the spatially varying coefficients of a second order hyperbolic equation and obtain a necessary condition, which can be used to get an approximate solution to the inverse problem.     

Heuristic Solution Methods for the Multilevel Generalized Assignment Problem

The multilevel generalized assignment problem is a problem of assigning agents to tasks where the agents can perform tasks at more than one efficiency level. A profit is associated with each assignment and the objective of the problem is profit maximization. Two heuristic solution methods are presented for the problem. The heuristics are developed from solution methods for the generalized assignment problem. One method uses a regret minimization approach whilst the other method uses a repair approach on a relaxation of the problem. The heuristics are able to solve moderately large instances of the problem rapidly and effectively. Procedures for deriving an upper bound on the solution of the problem are also described. On larger and harder instances of the problem one heuristic is particularly effective.