求解参数识别反问题的同伦正则化方法

提出了求解参数识别反问题的同伦正则化方法,给出了相应的收敛性定理.数值结果表明该方法是一种快速的大范围收敛方法.     

An adaptive pruning algorithm for the discrete L-curve criterion

We describe a robust and adaptive implementation of the L-curve criterion. The algorithm locates the corner of a discrete L-curve which is a log–log plot of corresponding residual norms and solution norms of regularized solutions from a method with a discrete regularization parameter (such as truncated SVD or regularizing CG iterations). Our algorithm needs no predefined parameters, and in order to capture the global features of the curve in an adaptive fashion, we use a sequence of pruned L-curves that correspond to considering the curves at different scales. We compare our new algorithm to existing algorithms and demonstrate its robustness by numerical examples.     

<Emphasis FontCategory="NonProportional">L</Emphasis>-Matrices and solvability of linear complementarity problems by a linear program-Matrices and solvability of linear complementarity problems by a linear program

The classes ofL ₁-matrices,L ₂-matrices,L ₃-matrices andW-matrices are introduced to study solvability of a linear complementarity problem via solving a linear program. Three sufficient conditions are presented to guarantee that a linear complementarity problem is solvable via a linear program. The new sufficient conditions are weaker than the ones introduced by Mangasarian. This fact is also illustrated by an example. Partially supported by NSFC. This author is also with College of Business Administration of Human University as a Lotus chair professor.     

Discrete Sturm–Liouville problems, Jacobi matrices and Lagrange interpolation series

The close relationship between discrete Sturm–Liouville problems belonging to the so-called limit-circle case, the indeterminate Hamburger moment problem and the search of self-adjoint extensions of the associated semi-infinite Jacobi matrix is well known. In this paper, all these important topics are also related with associated sampling expansions involving analytic Lagrange-type interpolation series.     

Propagation of singularities in Cauchy problems for quasilinear thermoelastic systems in three space variables

By using microlocal analysis, the propagation of weak singularities in Cauchy problems for quasilinear thermoelastic systems in three space variables are investigated. First, paradifferential operators are employed to decouple the quasilinear thermoelastic systems. Second, by investigating the decoupled hyperbolic-parabolic systems and using the classical bootstrap argument, the property of finite propagation speeds of singularities in Cauchy problems for the quasilinear thermoelastic systems is obtained. Finally, it is shown that the microlocal weak singularities for Cauchy problems of the thermoelastic systems are propagated along the null bicharacteristics of the hyperbolic operators.     

Structural properties and tractability results for linear synteny

The syntenic distance between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic distance, a restricted form of this model, has been shown to be close to the syntenic distance. Both models are computationally difficult to compute and have resisted efficient approximation algorithms with non-trivial performance guarantees. In this paper, we prove that many useful properties of syntenic distance carry over to linear syntenic distance. We also give a reduction from the general linear synteny problem to the question of whether a given instance can be solved using the maximum possible number of translocations. Our main contribution is an algorithm exactly computing linear syntenic distance in nested instances of the problem. This is the first polynomial time algorithm exactly solving linear synteny for a non-trivial class of instances. It is based on a novel connection between the syntenic distance and a scheduling problem that has been studied in the operations research literature.     

Algorithms for Finite and Semi-Infinite Min–Max–Min Problems Using Adaptive Smoothing Techniques

We develop two implementable algorithms, the first for the solution of finite and the second for the solution of semi-infinite min-max-min problems. A smoothing technique (together with discretization for the semi-infinite case) is used to construct a sequence of approximating finite min-max problems, which are solved with increasing precision. The smoothing and discretization approximations are initially coarse, but are made progressively finer as the number of iterations is increased. This reduces the potential ill-conditioning due to high smoothing precision parameter values and computational cost due to high levels of discretization. The behavior of the algorithms is illustrated with three semi-infinite numerical examples.     

Computation of the eigenvalues of Sturm-Liouville problems with parameter dependent boundary conditions using the regularized sampling method

The purpose in this paper is to compute the eigenvalues of Sturm-Liouville problems with quite general separated boundary conditions nonlinear in the eigenvalue parameter using the regularized sampling method, an improvement on the method based on Shannon sampling theory, which does not involve any multiple integration and provides higher order estimates of the eigenvalues at a very low cost. A few examples shall be presented to illustrate the power of the method and a comparison made with the the exact eigenvalues obtained as squares of the zeros of the exact characteristic functions.

     

On fencing problems

Fencing problems regard the bisection of a convex body in a way that some geometric measures are optimized. We introduce the notion of relative diameter and study bisections of centrally symmetric planar convex bodies, bisections by straight line cuts in general planar convex bodies and also bisections by hyperplane cuts for convex bodies in higher dimensions. In the planar case we obtain the best possible lower bound for the ratio between the relative diameter and the area.     

First order dynamic inclusions on time scales

In this paper, we study existence of solutions of first order dynamic inclusions on time scales with general boundary conditions. Both the ∇-derivative and Δ-derivative cases are considered. Examples are presented to illustrate that the Δ-derivative case needs more restrictive assumptions.