探测法重构多个散射体的数值实现

声波障碍体的散射中(obstaucle scattering),由散射波的远场数据{u∞(■,d):■,d∈Sm-1}重构散射体是一个标准的逆散射问题．在单个散射体的情形,已经有了大量的研究工作．然而,如果所讨论的逆散射现象是由多个散射体引起的,则除了重建散射体的边界外,还需要确定不同散射体的边界类型．本文主要考虑用探测法重构两个不同类型散射体边界的数值实现．与以往单个散射体的探测方法相比,需要更为仔细地考虑针的选取和包含多个散射体的非凸性区域的构造．在构造指示函数时所需要的Neumann数据■Ω,是采取边界积分方程法直接求解Helmholtz混合边值问题得到的．     

二维逆散射问题探测方法的数值实现

探测方法是最近发展起来的逆散射问题的一种重要的求解方法,其主要思想是由散射波测量数据构造一个带有散射体外面参数点的指示函数,当参数点靠近散射体的边界时,指示函数爆破,由此重建散射体的边界．本文对具有Sound-soft边界的二维散射体给出了探测方法的数值实现．在给出标志函数的构造的基础上,进一步提出了利用模拟数据实现探测法的一个改进的逼近方法．为了更清楚地检验所提出的方法的数值结果,我们直接从Ω边界上的 D-to-N映射来研究探测方法的数值解．     

具有未知阻尼边界的逆散射问题解的惟一性及重构

考虑R3中的散射体D在阻尼边界条件下由散射波的远场形式重建散射体边界的逆散射问题. 证明了该反问题解的惟一性, 并给出了确定边界形状的精确的反演方法．由于边界阻尼是未知的, 这预示着散射波的远场形式含有散射体的比现在已知的更多的信息.     

双连通区域上的电磁波散射问题数值解

对于双连通区域上的电磁波散射问题,通过位势理论将其转化为边界积分方程组问题,然后采用Nystrom法和配置法对其离散求解,针对不同形状的障碍散射体,给出远场模式的数值解.     

关于Newton法的Kantorovich型定理及其优函数

本文研究Newton法的Kantorovich型定理的特点及其对Newton法的半局部收敛性研究的思想方法,论述广义Lipschitz条件下的Kantorovich型定理的概括性和统一性.同时,在理论上当x_0取定时,针对每一个满足广义Lipschitz条件的光滑算子,给出优函数的一个构造方法.     

板梁组合结构可靠性分析的随机边界元法

本文用随机边界元法分析了随机荷载作用下具有随机边界条件的正交各向异性板、梁组合结构的可靠性.文中首先给出正交各向异性板、梁组合结构的边界积分方程,进而基于随机边界元法建立了随机结构可靠性分析方法和得到用于计算正交各向异性板、梁组合结构可靠性指标的公式.算例表明了本文方法的有效性.     

无穷凹角区域各向异性问题的自然边界元与有限元耦合法

本文研究无穷凹角区域上一类各向异性问题的自然边界元与有限元耦合法.利用自然边界归化原理,获得圆弧或椭圆弧人工边界上的自然积分方程,给出了耦合的变分形式及其数值方法,以及逼近解的收敛性和误差估计,最后给出了数值例子,以示方法的可行性和有效性.     

非线性互补问题近似Newton法的二阶收敛性

本文给出了求解非线性互补问题近似Newton法二阶收敛性的一个条件，并且证明了在一定的条件下，有限差分Newton法具有二阶收敛性．     

与线弹性结构连接的弹性基础圆板大挠度问题

本文处理边界与线弹性结构连接的弹性基础圆板的轴对称大挠度问题.用混合边界条件方法[1]建立了问题的确定积分方程组,并进行了简化.用摄动法给出了解答.计算了圆板与圆柱壳组合问题的例子.     

用1颗或2颗GPS卫星确定低轨卫星初轨的算法研究 *

研究了用1颗或2颗GPS卫星进行低轨卫星初轨计算的问题 :给出了基于线性变换的初值计算方法 ;并以此为迭代起点 ,分别用割线法、Newton下降法以及同伦延拓法等综合算法解算非线性方程组 .计算机仿真结果证明 :整个算法能在较短时间内给出低轨卫星的初轨 ,并保证一定的精度 .     

A hybrid method for sound-hard obstacle reconstruction

We are interested in solving the inverse problem of acoustic wave scattering to reconstruct the position and the shape of sound-hard obstacles from a given incident field and the corresponding far field pattern of the scattered field. The method we suggest is an extension of the hybrid method for the reconstruction of sound-soft cracks as presented in [R. Kress, P. Serranho, A hybrid method for two-dimensional crack reconstruction, Inverse Problems 21 (2005) 773–784] to the case of sound-hard obstacles. The designation of the method is justified by the fact that it can be interpreted as a hybrid between a regularized Newton method applied to a nonlinear operator equation with the operator that maps the unknown boundary onto the solution of the direct scattering problem and a decomposition method in the spirit of the potential method as described in [A. Kirsch, R. Kress, On an integral equation of the first kind in inverse acoustic scattering, in: Cannon, Hornung (Eds.), Inverse Problems, ISNM, vol. 77, 1986, pp. 93–102. Since the method does not require a forward solver for each Newton step its computational costs are reduced. By some numerical examples we illustrate the feasibility of the method.     

Convex backscattering support in electric impedance tomography

This paper reinvestigates a recently introduced notion of backscattering for the inverse obstacle problem in impedance tomography. Under mild restrictions on the topological properties of the obstacles, it is shown that the corresponding backscatter data are the boundary values of a function that is holomorphic in the exterior of the obstacle(s), which allows to reformulate the obstacle problem as an inverse source problem for the Laplace equation. For general obstacles, the convex backscattering support is then defined to be the smallest convex set that carries an admissible source, i.e., a source that yields the given (backscatter) data as the trace of the associated potential. The convex backscattering support can be computed numerically; numerical reconstructions are included to illustrate the viability of the method.     

Functional and numerical solution of a control problem originating from heat transfer

The solution of a nonlinear parabolic equation is studied from both the functional and the numerical points of view. Existence, uniqueness, and stability results are given. A boundary-control problem is then presented. Expressions of the gradient and the Hessian of the cost function are given with some details, and the Newton method is compared with a gradient method and the Fletcher-Reeves method. Numerical results are given. The paper concludes with a discussion of the advantages of the Newton method as applied to a control problem.     

解变分不等式问题的混合方法

By using Fukushima‘s differentiable merit function,Taji,Fukushima and Ibaraki have given a globally convergent modified Newton method for the strongly monotone variational inequality problem and proved their method to be quadratically convergent under certain assumptions in 1993. In this paper a hybrid method for the variational inequality problem under the assumptions that the mapping F is continuously differentiable and its Jacobian matrix F(x) is positive definite for all x∈S rather than strongly monotone and that the set S is nonempty, polyhedral,closed and convex is proposed. Armijo-type line search and trust region strategies as well as Fukushima‘s differentiable merit function are incorporated into the method. It is then shown that the method is well defined and globally convergent and that,under the same assumptions as those of Taji et al. ,the method reduces to the basic Newton method and hence the rate of convergence is quadratic. Computational experiences show the efficiency of the proposed method.     

一类不可微二次规划逆问题

本文求解了一类二次规划的逆问题,具体为目标函数是矩阵谱范数与向量无穷范数之和的最小化问题.首先将该问题转化为目标函数可分离变量的凸优化问题,提出用G-ADMM法求解.并结合奇异值阈值算法,Moreau-Yosida正则化算法,matlab优化工具箱的quadprog函数来精确求解相应的子问题.而对于其中一个子问题的精确求解过程中发现其仍是目标函数可分离变量的凸优化问题,由于其变量都是矩阵,所以采用适合多个矩阵变量的交替方向法求解,通过引入新的变量,使其每个子问题的解都具有显示表达式.最后给出采用的G-ADMM法求解本文问题的数值实验.数据表明,本文所采用的方法能够高效快速地解决该二次规划逆问题.     

A Smoothing Newton Method for Semi-Infinite Programming

This paper is concerned with numerical methods for solving a semi-infinite programming problem. We reformulate the equations and nonlinear complementarity conditions of the first order optimality condition of the problem into a system of semismooth equations. By using a perturbed Fischer–Burmeister function, we develop a smoothing Newton method for solving this system of semismooth equations. An advantage of the proposed method is that at each iteration, only a system of linear equations is solved. We prove that under standard assumptions, the iterate sequence generated by the smoothing Newton method converges superlinearly/quadratically.     

A solution of the affine quadratic inverse eigenvalue problem

The quadratic inverse eigenvalue problem (QIEP) is to find the three matrices M,C, and K, given a set of numbers, closed under complex conjugations, such that these numbers become the eigenvalues of the quadratic pencil P(λ)=λ²M+λC+K. The affine inverse quadratic eigenvalue problem (AQIEP) is the QIEP with an additional constraint that the coefficient matrices belong to an affine family, that is, these matrices are linear combinations of substructured matrices. An affine family of matrices very often arise in vibration engineering modeling and analysis. Research on QIEP and AQIEP are still at developing stage. In this paper, we propose three methods and the associated mathematical theories for solving AQIEP: A Newton method, an alternating projections method, and a hybrid method combining the two. Validity of these methods are illustrated with results on numerical experiments on a spring-mass problem and comparisons are made with these three methods amongst themselves and with another Newton method developed by Elhay and Ram (2002) [12]. The results of our experiments show that the hybrid method takes much smaller number of iterations and converges faster than any of these methods.     

有奇异解的无约束最优化问题的一种混合法

本文研究求解含有奇异解的无约束最优化问题算法 .该类问题的一个重要特性是目标函数的Hessian阵可能处处奇异 .我们提出求解该类问题的一种梯度 -正则化牛顿型混合算法 .并在一定的条件下得到了算法的全局收敛性 .而且 ,经一定迭代步后 ,算法还原为正则化 Newton法 .因而 ,算法具有局部二次收敛性 .     

Convergence of Newton's method for convex best interpolation

Summary. In this paper, we consider the problem of finding a convex function which interpolates given points and has a minimal norm of the second derivative. This problem reduces to a system of equations involving semismooth functions. We study a Newton-type method utilizing Clarke's generalized Jacobian and prove that its local convergence is superlinear. For a special choice of a matrix in the generalized Jacobian, we obtain the Newton method proposed by Irvine et al. [17] and settle the question of its convergence. By using a line search strategy, we present a global extension of the Newton method considered. The efficiency of the proposed global strategy is confirmed with numerical experiments. Received October 26, 1998 / Revised version received October 20, 1999 / Published online August 2, 2000