首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 171 毫秒
1.
提出了一种方法,利用正则化方法和积分方程,由散射波的近场数据反演时间调和声波阻尼系数.给出了该方法收敛性的证明及数值例子,算法与数值例子表明这种方法不仅简单而且很有效.  相似文献   

2.
本文研究了声波散射区域的重建,给上散射波的叠加重建散射区域的一个方法,该方法利用散射波的叠加,将声波障碍反散射这个非一不适定问题分两步处理,第一步求解一个第一类线性积分方程。第二步求解一个非线性最优化问题,我们证明了该方法的收敛性。  相似文献   

3.
阐述了利用声波散射远场模Fourier展开的第P个傅立叶系数(声散射远场模的不完全信息),重建声阻抗系数的一种非线性最优化方法.并给出了该方法收敛性的证明,其数值例子说明这种方法的有效性和可行性.  相似文献   

4.
利用近场数据反演声波阻尼系数   总被引:2,自引:0,他引:2  
1引言声波散射理论在二十世纪的数学物理领域占有重要的地位,在这方面已有大量的研究工作,而对声波反散射理论的大量的研究才是近十多年的事.D.ColtonandR.Kress[1-4]等人利用积分方程方法对反散射问题作了很深刻的研究.反散射问题的实质性困难是问题的非线性与强不适定性,对不适定性,Tikhonov[5]正则化方法是一个有力工具.由于声波反散射理论在雷达、声纳及地球物理勘探等领域的迫切需要,对反散射理论及计算方法的研究有着广泛的应用前景.考虑在均匀介质中传播的声波,此声波碰到障碍D发生散…  相似文献   

5.
对于多散射区域的声波散射问题的外Neumann边值问题,用单层位势来逼近每个散射域上的散射波,再利用位势理论的跳跃关系将问题转换为第二类边界积分方程组的求解问题,然后用Nystrom方法进行了求解.对多个随机散射区域的声波散射问题,数值例子体现了该求解方法的可行性和准确性.  相似文献   

6.
利用周期变换和位势理论将声波散射问题转化为第二类边界积分方程,再利用Nystrom方法来求解该边界积分方程.给出二维空间的数值例子,结果表明该方法简单,可行并且具有较好的精度.  相似文献   

7.
阻尼边界条件散射问题的数值解法   总被引:1,自引:0,他引:1       下载免费PDF全文
该文研究了光滑区域上二维Helmholtz方程阻尼边界条件外问题的数值解法, 应用单双层位势组合来逼近散射场, 因此积分方程中含有超奇异算子. 给出了超奇异算子的离散化方法, 在Holder空间中给出了误差估计和解析边界的收敛性分析. 最后针对该方法给出数值实例, 以表明该方法的有效性.  相似文献   

8.
刚性目标形状反演的一种非线性最优化方法   总被引:1,自引:1,他引:0  
发展了从声散射场的远场分布的信息来再现声刚性目标形状反问题的一种非线性最优化方法,它是通过独立地求解一个不适定的线性系统和一个适定的非线性最小化问题来实现的。对反问题的非线性和不适定性的这种分离式数值处理,使所建立方法的数值实现是非常容易和快速的,因为在确定声刚性障碍物形状的非线性最优化步中,只需求解一个只有一个未知函数的小规模的最小平方问题。该方法的另一个特别的性质是,只需要远场分布的一个Fourier系数,即可对未知的刚性目标作物形设别。进而提出了数值实现该方法的一种两步调整迭代算法。对具有各种形状的二维刚性障碍物的数值试验保证了本算法是有效和实用的。  相似文献   

9.
孟文辉  王连堂 《计算数学》2005,27(3):231-242
本文用声波远场模式的完全与不完全数据对声波散射区域进行了反演。其前提条件是整体场满足齐次Dirichlet边界条件,对于这个问题,文中给出一种对任意波数k(k〉0)的组合方法。方法的收敛性得到证明,数值例子表明了方法是可行的和精确的。  相似文献   

10.
王泽文  张文 《计算数学》2011,33(1):87-102
本文研究由单个入射声波或电磁波及其远场数据反演多个柔性散射体边界的逆散射问题.通过建立边界到边界总场的非线性算子及其n6chet导数,本文首先给出了基于单层位势的组合Newton法.将组合Newton法转化为泛响优化问题,从而获得了该方法重建单个散射体的收敛性分析.然后,基于遗传算法和正则化参数选取的模型函数方法,给出...  相似文献   

11.
In this paper, nonclassical pseudospectral method is proposed for solving the classic brachistochrone problem. The brachistochrone problem is first formulated as a nonlinear optimal control problem. Properties of nonclassical pseudospectral method are presented, these properties are then utilized to reduce the computation of brachistochrone problem to the solution of algebraic equations. Using this method, the solution to the brachistochrone problem is compared with those in the literature.  相似文献   

12.
An inverse problem of the reconstruction of the right-hand side of the Euler-Darboux equation is studied. This problem is equivalent to the Volterra integral equation of the third kind with the operator of multiplication by a smooth nonincreasing function. Numerical solution of this problem is constructed using an integral representation of the solution of the inverse problem, the regularization method, and the method of quadratures. The convergence and stability of the numerical method is proved.  相似文献   

13.
A problem of reconstruction of boundary regimes in a model for free convection of a high-viscosity fluid is considered. A variational method and a quasi-inversion method are suggested for solving the problem in question. The variational method is based on the reduction of the original inverse problem to some equivalent variational minimum problem for an appropriate objective functional and solving this problem by a gradient method. When realizing the gradient method for finding a minimizing element of the objective functional, an iterative process actually reducing the original problem to a series of direct well-posed problems is organized. For the quasi-inversion method, the original differential model is modified by means of introducing special additional differential terms of higher order with small parameters as coefficients. The new perturbed problem is well-posed; this allows one to solve this problem by standard methods. An appropriate choice of small parameters gives an opportunity to obtain acceptable qualitative and quantitative results in solving the inverse problem. A comparison of the methods suggested for solving the inverse problem is made with the use of model examples.  相似文献   

14.
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.  相似文献   

15.
The inverse electrocardiography problem related to medical diagnostics is considered in terms of potentials. Within the framework of the quasi-stationary model of the electric field of the heart, the solution of the problem is reduced to the solution of the Cauchy problem for the Laplace equation in R 3. A numerical algorithm based on the Tikhonov regularization method is proposed for the solution of this problem. The Cauchy problem for the Laplace equation is reduced to an operator equation of the first kind, which is solved via minimization of the Tikhonov functional with the regularization parameter chosen according to the discrepancy principle. In addition, an algorithm based on numerical solution of the corresponding Euler equation is proposed for minimization of the Tikhonov functional. The Euler equation is solved using an iteration method that involves solution of mixed boundary value problems for the Laplace equation. An individual mixed problem is solved by means of the method of boundary integral equations of the potential theory. In the study, the inverse electrocardiography problem is solved in region Ω close to the real geometry of the torso and heart.  相似文献   

16.
Increasingly, tourists are planning trips by themselves using the vast amount of information available on the Web. However, they still expect and want trip plan advisory services. In this paper, we study the tour planning problem in which our goal is to design a tour trip with the most desirable sites, subject to various budget and time constraints. We first establish a framework for this problem, and then formulate it as a mixed integer linear programming problem. However, except when the size of the problem is small, say, with less than 20–30 sites, it is computationally infeasible to solve the mixed-integer linear programming problem. Therefore, we propose a heuristic method based on local search ideas. The method is efficient and provides good approximation solutions. Numerical results are provided to validate the method. We also apply our method to the team orienteering problem, a special case of the tour planning problem which has been considered in the literature, and compare our method with other existing methods. Our numerical results show that our method produces very good approximation solutions with relatively small computational efforts comparing with other existing methods.  相似文献   

17.
An algorithm is proposed for solving the Signorini problem /1/ in the formulation of a unilateral variational problem for the boundary functional in the zone of possible contact /2/. The algorithm is based on a dual formulation of Lagrange maximin problems for whose solution a decomposition approach is used in the following sense: a Ritz process in the basis functions that satisfy the linear constraint of the problem, the differential equation in the domain, is used in solving the minimum problem (with fixed Lagrange multipliers); the maximum problem is solved by the method of descent (a generalization of the Frank-Wolf method) under convexity constraints on the Lagrange multipliers. The algorithm constructed can be conisidered as a modification of the well-known algorithm to find the Udzawa-Arrow-Hurwitz saddle points /3, 4/. The convergence of the algorithm is investigated. A numerical analysis of the algorithm is performed in the example of a classical contact problem about the insertion of a stamp in an elastic half-plane under approximation of the contact boundary by isoparametric boundary elements. The comparative efficiency of the algorithm is associated with the reduction in the dimensionality of the boundary value problem being solved and the possibility of utilizing the calculation apparatus of the method of boundary elements to realize the solution.  相似文献   

18.
最短时限最少耗费的缺省指派问题及决策求解   总被引:6,自引:0,他引:6  
文章指出了存在于军事决策与管理科学中最短时限最少耗费的缺省指派问题,并对其进行了深入的理论研究。论证了逼近最短时限的一个重要的定理及联系最短时限、最少耗费缺省指派最优解与经典指派问题最优解之间的相关性定理。据此首次建立了求解最短时限、最少耗费缺省指派的决策方法。这一方法可被广泛地应用于军事决策中进攻目标最优缺省选择与经济建设中工程最优缺省立项尽快见效等方面的一类新的科学决策。  相似文献   

19.
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.  相似文献   

20.
In this paper, the wavelet multiscale method is applied to the inversion of porosity in the fluid-saturated porous media. The inverse problem is decomposed to multiple scales with wavelet transform and hence the original inverse problem is re-formulated to be a set of sub-inverse problem corresponding to different scales and is solved successively according to the size of scale from the smallest to the largest. On each scale, regularization Gauss–Newton method is carried out, which is stable and fast, until the optimum solution of original inverse problem is found. The results of numerical simulations demonstrate that the method is a widely convergent optimization method and exhibits the advantages of conventional regularization Gauss–Newton method methods on computational efficiency and precision.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号