Steepest Descent, CG, and Iterative Regularization of Ill-Posed Problems

The state of the art iterative method for solving large linear systems is the conjugate gradient (CG) algorithm. Theoretical convergence analysis suggests that CG converges more rapidly than steepest descent. This paper argues that steepest descent may be an attractive alternative to CG when solving linear systems arising from the discretization of ill-posed problems. Specifically, it is shown that, for ill-posed problems, steepest descent has a more stable convergence behavior than CG, which may be explained by the fact that the filter factors for steepest descent behave much less erratically than those for CG. Moreover, it is shown that, with proper preconditioning, the convergence rate of steepest descent is competitive with that of CG.This revised version was published online in October 2005 with corrections to the Cover Date.     

关于H.Yoshida的一个问题

H.Yoshida曾经提出下述问题:对级小于1/2的整函数f（z）,是否自原点出发的每一条射线,或者为它的Julia方向,或者在包含该射线的某个角域内当|z|→∞时有|f（z）|→∞.本文的结论表明对正则增长的整函数,H.Yoshida问题的答案是肯定的,而且对许多其他的Julia型方向,类似的问题的答案也是肯定的.     

Neumann problems with resonance in the first eigenvalue

The aim of this work is to present results of existence of solutions for a class of superlinear asymmetric elliptic systems with resonance in the first eigenvalue. The asymmetry that we consider has linear behavior on and superlinear on . To obtain these results we apply topological degree theory.     

Positive solutions to a new kind Sturm-Liouville-like four-point boundary value problem

In this paper, we considered the following four-point boundary value problem

     

Solving multiobjective,multiconstraint knapsack problems using mathematical programming and evolutionary algorithms

In this paper, we solve instances of the multiobjective multiconstraint (or multidimensional) knapsack problem (MOMCKP) from the literature, with three objective functions and three constraints. We use exact as well as approximate algorithms. The exact algorithm is a properly modified version of the multicriteria branch and bound (MCBB) algorithm, which is further customized by suitable heuristics. Three branching heuristics and a more general purpose composite branching and construction heuristic are devised. Comparison is made to the published results from another exact algorithm, the adaptive ε-constraint method [Laumanns, M., Thiele, L., Zitzler, E., 2006. An efficient, adaptive parameter variation scheme for Metaheuristics based on the epsilon-constraint method. European Journal of Operational Research 169, 932–942], using the same data sets. Furthermore, the same problems are solved using standard multiobjective evolutionary algorithms (MOEA), namely, the SPEA2 and the NSGAII. The results from the exact case show that the branching heuristics greatly improve the performance of the MCBB algorithm, which becomes faster than the adaptive ε -constraint. Regarding the performance of the MOEA algorithms in the specific problems, SPEA2 outperforms NSGAII in the degree of approximation of the Pareto front, as measured by the coverage metric (especially for the largest instance).     

Stochastic modeling of unresolved scales in complex systems

Model uncertainties or simulation uncertainties occur in mathematical modeling of multiscale complex systems, since some mechanisms or scales are not represented (i.e., ‘unresolved’) due to a lack in our understanding of these mechanisms or limitations in computational power. The impact of these unresolved scales on the resolved scales needs to be parameterized or taken into account. A stochastic scheme is devised to take the effects of unresolved scales into account, in the context of solving nonlinear partial differential equations. An example is presented to demonstrate this strategy. Dedicated to Professor Peter E. Kloeden on the occasion of his 60th birthday     

Superconvergence analysis of fully discrete finite element methods for semilinear parabolic optimal control problems

We study the superconvergence property of fully discrete finite element approximation for quadratic optimal control problems governed by semilinear parabolic equations with control constraints. The time discretization is based on difference methods, whereas the space discretization is done using finite element methods. The state and the adjoint state are approximated by piecewise linear functions and the control is approximated by piecewise constant functions. First, we define a fully discrete finite element approximation scheme for the semilinear parabolic control problem. Second, we derive the superconvergence properties for the control, the state and the adjoint state. Finally, we do some numerical experiments for illustrating our theoretical results.     

100～500 GPa 4.2Ni2.45Fe0.35CoW合金的冲击压缩性和物态方程

 用二级轻气炮驱动飞片技术及对称碰撞技术，测量了两相合金4.2Ni2.45Fe0.35CoW（以下简称93W）的雨贡纽线。其压力范围为100~500 GPa。实测的冲击波速度D和粒子速度u可用直线关系式D=4.008+1.277u (km/s)描述。实验结果与用混合物雨贡纽线叠加原理的计算结果符合甚好。文中还给出了由实验数据计算得到的物态方程数据。     

钨合金柱形弹超高速撞击水泥砂浆靶的侵彻深度研究

为探索钨合金柱形弹超高速撞击水泥砂浆靶的侵彻深度随撞击速度变化规律,利用二级轻气炮开展了?3.45 mm×10.5 mm的克级93 W钨合金柱形弹以1.82~3.66 km/s的速度撞击水泥砂浆靶的实验,利用CT图像诊断技术获得了侵彻深度和残余弹长随撞击速度的变化规律,对超高速撞击过程进行了数值模拟,结合数值模拟结果进一步分析了超高速撞击物理过程。结果表明:(1)超高速撞击条件下成坑是弹坑+弹洞型;(2)侵深-速度曲线呈现先增大后减小的现象,在弹速2.6 km/s附近存在侵彻深度极大值,约为8.5倍弹长,相对于中低速侵彻的深度并没有显著优势。(3)通过基于数值模拟得到的弹靶界面压力时程曲线将侵彻过程分为4个阶段,其中准定常侵彻阶段和第三侵彻阶段是决定总侵深的主要阶段。(4)随撞击速度增加,弹体侵蚀逐渐剧烈,此时准定常侵彻阶段的侵深变化不大,而第三侵彻阶段中的刚体侵彻部分大幅降低,导致总侵深大幅降低,使总侵深曲线呈现先增大后减小的现象。     

Nonhomogeneous multiparameter problems in Orlicz–Sobolev spaces

This paper is concerned with the existence and multiplicity of solutions for a class of problems involving the Φ-Laplacian operator with general assumptions on the nonlinearities, which include both semipositone cases and critical concave convex problems. The research is based on the subsupersolution technique combined with a truncation argument and an application of the Mountain Pass Theorem. The results in this paper improve and complement some recent contributions to this field.