this paper describes an efficient edge-preserved regularization algorithm for downward continuation of magnetic data in detection of unexploded ordnance (uxo). the magnetic anomalies arising from multi-source uxo can overlap at a height over the ground surface, while causative sources may not be readily separated due to low level of signal-to-noise ratio of the observed data. to effectively the...

time-delays are important components of many dynamical systems that describe coupling or interconnection between dynamics, propagation or transport phenomena, and heredity and competition in population dynamics. the stabilization with time delay in observation or control represents difficult mathematical challenges in the control of distributed parameter systems. it is well-known that the stabi...

in this paper, an iterative method is proposed for solving the matrix inverse problem $ax=b$ for hermitian-generalized hamiltonian matrices with a submatrix constraint. by this iterative method, for any initial matrix $a_0$, a solution $a^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...

Given an instance of the minimum cost flow problem, a version of the corresponding inverse problem, called the capacity inverse problem, is to modify the upper and lower bounds on arc flows as little as possible so that a given feasible flow becomes optimal to the modified minimum cost flow problem. The modifications can be measured by different distances. In this article, we consider the capac...

This paper deals with the boundary value problem involving the differential equation begin{equation*}     ell y:=-y''+qy=lambda y,  end{equation*}  subject to the standard boundary conditions along with the following discontinuity  conditions at a point $ain (0,pi)$  begin{equation*}     y(a+0)=a_1 y(a-0),quad y'(a+0)=a_1^{-1}y'(a-0)+a_2 y(a-0), end{equation*} where $q(x),  a_1 , a_2$ are  rea...

Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...