Modified regularization method for the Cauchy problem of the Helmholtz equation

In this paper, the Cauchy problem for the Helmholtz equation is investigated. It is known that such problem is severely ill-posed. We propose a modified regularization method to solve it based on the solution given by the method of separation of variables. Convergence estimates are presented under two different a-priori bounded assumptions for the exact solution. Finally, numerical examples are given to show the effectiveness of the proposed numerical method.     

Identification of an unknown source depending on both time and space variables by a variational method

The present paper is devoted to solve the problem of identifying an unknown heat source depending simultaneously on both space and time variables. This problem is transformed into an optimization problem and the uniqueness of minimum element is proved rigorously. Then a variational formulation for solving the optimization problem is given. A conjugate gradient method and a finite difference method are used to solve the variational problem. Some numerical examples are also provided to show the efficiency of the proposed method.     

STABILIZED NUMERICAL APPROXIMATIONS OF THE BACKWARD PROBLEM OF A PARABOLIC EQUATION

1　IntroductionLetΩ be a bounded domain in Rn and Ω be its boundary.ThenΣ =Ω× ( 0 ,1 ) is abounded domain in Rn+1 .We consider the following backwad problem of a prabolic equa-tion: u t= ni,j=1 xiaij( x) u xj -c( x) u,　　 ( x,t)∈Σ,( 1 )u| Ω× [0 ,1 ] =0 , ( 2 )u| t=1 =g( x) . ( 3 )　　 Where { aij( x) } are smooth functions given onΩ satisfyingaij( x) =aji( x) ,　　 1≤ i,j≤ n, ( 4)α0 ni=1ζ2i ≤ ni,j=1aij( x)ζiζj≤α1 ni=1ζ2i,　　 ζ∈ Rn,x∈Ω. ( 5)　　Where0 <α…     

Simple layer potential method for domains having external corners

This note investigates the simple layer potential method for domains having external corners. The singular behaviour of simple layer density at the corners is studied for the Neumann problem of Helmholtz's equation. A numerical technique of solving the integral equation for this problem is proposed. This technique takes the singularity of the solution into consideration. Some numerical examples are given to show the applicability of the present method.     

A Dynamical Method for Solving the Obstacle Problem

In this paper, we consider the unilateral obstacle problem, trying to find the numerical solution and coincidence set. We construct an equivalent format of the original problem and propose a method with a second-order in time dissipative system for solving the equivalent format. Several numerical examples are given to illustrate the effectiveness and stability of the proposed algorithm. Convergence speed comparisons with existent numerical algorithm are also provided and our algorithm is fast.     

矩阵不等式约束下矩阵方程AX=B的双对称解

本文讨论矩阵不等式CXD≥E 约束下矩阵方程AX=B的双对称解,即给定矩阵A,B,C,D和 E, 求双对称矩阵X, 使得AX=B 和 CXD≥E, 其中CXD≥E表示矩阵CXD-E非负.本文将问题转化为矩阵不等式最小非负偏差问题,利用极分解理论给出了求其解的迭代方法,并结合相关矩阵理论说明算法的收敛性.最后给出数值算例验证算法的有效性.     

基于遗传算法重建多个散射体的组合Newton法

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

基于高斯伪谱的最优控制求解及其应用

研究一种基于高斯伪谱法的具有约束受限的最优控制数值计算问题.方法将状态演化和控制规律用多项式参数化近似,微分方程用正交多项式近似.将最优控制问题求解问题转化为一组有约束的非线性规划求解.详细论述了该种近似方法的有效性.作为该种方法的应用,讨论了一个障碍物环境下的机器人最优路径生成问题.将机器人路径规划问题转化为具有约束条件最优控制问题,然后用基于高斯伪谱的方法求解,并给出了仿真结果.     

Determination of unknown functions in a mathematical model of ductal carcinoma in situ

This study deals with the numerical investigation of a mathematical model of breast cancer at the initial growth stage known as ductal carcinoma in situ. This model considered as an inverse problem and the uniqueness of solution of this inverse problem is proved. To solve this problem, a computational approach is developed based on an iterative procedure and space marching and mollification methods. The stability and convergence results are given to support the method theoretically. Two test problems are considered to demonstrate the efficiency and ability of the proposed numerical approach.     

Numerical method of lines for parabolic functional differential equations

Initial boundary value problems for nonlinear parabolic functional differential equations are transformed by discretization in space variables into systems of ordinary functional differential equations. A comparison theorem for differential difference inequalities is proved. Sufficient conditions for the convergence of the numerical method of lines are given. An explicit Euler method is proposed for the numerical solution of systems thus obtained. This leads to difference scheme for the original problem. A complete convergence analysis for the method is given.     

The method of fundamental solutions with eigenfunction expansion method for nonhomogeneous diffusion equation

In this article we describe a numerical method to solve a nonhomogeneous diffusion equation with arbitrary geometry by combining the method of fundamental solutions (MFS), the method of particular solutions (MPS), and the eigenfunction expansion method (EEM). This forms a meshless numerical scheme of the MFS‐MPS‐EEM model to solve nonhomogeneous diffusion equations with time‐independent source terms and boundary conditions for any time and any shape. Nonhomogeneous diffusion equation with complex domain can be separated into a Poisson equation and a homogeneous diffusion equation using this model. The Poisson equation is solved by the MFS‐MPS model, in which the compactly supported radial basis functions are adopted for the MPS. On the other hand, utilizing the EEM the diffusion equation is first translated to a Helmholtz equation, which is then solved by the MFS together with the technique of the singular value decomposition (SVD). Since the present meshless method does not need mesh generation, nodal connectivity, or numerical integration, the computational effort and memory storage required are minimal as compared with other numerical schemes. Test results for two 2D diffusion problems show good comparability with the analytical solutions. The proposed algorithm is then extended to solve a problem with irregular domain and the results compare very well with solutions of a finite element scheme. Therefore, the present scheme has been proved to be very promising as a meshfree numerical method to solve nonhomogeneous diffusion equations with time‐independent source terms of any time frame, and for any arbitrary geometry. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

The Runge‐Kutta DG finite element method and the KFVS scheme for compressible flow simulations

This article presents a new type of second‐order scheme for solving the system of Euler equations, which combines the Runge‐Kutta discontinuous Galerkin (DG) finite element method and the kinetic flux vector splitting (KFVS) scheme. We first discretize the Euler equations in space with the DG method and then the resulting system from the method‐of‐lines approach will be discretized using a Runge‐Kutta method. Finally, a second‐order KFVS method is used to construct the numerical flux. The proposed scheme preserves the main advantages of the DG finite element method including its flexibility in handling irregular solution domains and in parallelization. The efficiency and effectiveness of the proposed method are illustrated by several numerical examples in one‐ and two‐dimensional spaces. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

A multigrid-based preconditioned Krylov subspace method for the Helmholtz equation with PML

In this paper, we generalize the complex shifted Laplacian preconditioner to the complex shifted Laplacian-PML preconditioner for the Helmholtz equation with perfectly matched layer (Helmholtz-PML equation). The Helmholtz-PML equation is discretized by an optimal 9-point difference scheme, and the preconditioned linear system is solved by the Krylov subspace method, especially by the biconjugate gradient stabilized method (Bi-CGSTAB). The spectral analysis of the linear system is given, and a new matrix-based interpolation operator is proposed for the multigrid method, which is used to approximately invert the preconditioner. The numerical experiments are presented to illustrate the efficiency of the preconditioned Bi-CGSTAB method with the multigrid based on the new interpolation operator, also, numerical results are given for comparing the performance of the new interpolation operator with that of classic bilinear interpolation operator and the one suggested in Erlangga et al. (2006) [10].     

A Lane-Based Optimization Method for Minimizing Delay at Isolated Signal-Controlled Junctions

This paper presents a lane-based optimization method for minimizing delay at isolated signal-controlled junctions. The method integrates the design of lane markings and signal settings, and considers both traffic and pedestrian movements in a unified framework. While the capacity maximization and cycle length minimization problems are formulated as Binary-Mix-Integer-Linear-Programs (BMILPs) that are solvable by standard branch-and-bound routines, the problem of delay minimization is formulated as a Binary-Mix-Integer-Non-Linear Program (BMINLP). A cutting plane algorithm and a heuristic line search algorithm are proposed to solve this difficult BMINLP problem. The integer variables include the permitted movements on traffic lanes and successor functions to govern the order of signal displays, whereas the continuous variables include the assigned lane flows, common flow multiplier, cycle length, and starts and durations of green for traffic movements, lanes and pedestrian crossings. A set of constraints is set up to ensure the feasibility and safety of the resultant optimized lane markings and signal settings. A numerical example is given to demonstrate the effectiveness of the proposed methodology. The heuristic line search algorithm is more cost-effective in terms of both optimality of solution and computing time requirement. This revised version was published online in July 2006 with corrections to the Cover Date.     

A new regularization method for solving a time-fractional inverse diffusion problem

In this paper, we consider an inverse problem for a time-fractional diffusion equation in a one-dimensional semi-infinite domain. The temperature and heat flux are sought from a measured temperature history at a fixed location inside the body. We show that such problem is severely ill-posed and further apply a new regularization method to solve it based on the solution given by the Fourier method. Convergence estimates are presented under the a priori bound assumptions for the exact solution. Finally, numerical examples are given to show that the proposed numerical method is effective.     

条形装箱问题的优化模型和增广Lagrange算法

This paper formulates a two-dimensional strip packing problem as a non-linear programming(NLP)problem and establishes the first-order optimality con-ditions for the NLP problem.A numerical algorithm for solving this NLP problemis given to find exact solutions to strip-packing problems involving up to 10 items.Approximate solutions can be found for big-sized problems by decomposing the setof items into small-sized blocks of which each block adopts the proposed numericalalgorithm.Numerical results show that the approximate solutions to big-sized prob-lems obtained by this method are superior to those by NFDH,FFDH and BFDHapproaches.     

Properties of a family of merit functions and a merit function method for the NCP

A family of merit functions are proposed, which are the generalization of several existing merit functions. A number of favorable properties of the proposed merit functions are established. By using these properties, a merit function method for solving nonlinear complementarity problem is investigated, and the global convergence of the proposed algorithm is proved under some standard assumptions. Some preliminary numerical results are given.     

Hermite spectral and pseudospectral methods for numerical differentiation

A numerical differentiation problem for a given function with noisy data is discussed in this paper. A mollification method based on spanned by Hermite functions is proposed and the mollification parameter is chosen by a discrepancy principle. The convergence estimates of the derivatives are obtained. To get a practical approach, we also derive corresponding results for pseudospectral (Hermite-Gauss interpolation) approximations. Numerical examples are given to show the efficiency of the method.     

An efficient numerical approach to solve a class of variable‐order fractional integro‐partial differential equations

The main purpose of this work is to investigate an initial boundary value problem related to a suitable class of variable order fractional integro‐partial differential equations with a weakly singular kernel. To discretize the problem in the time direction, a finite difference method will be used. Then, the Sinc‐collocation approach combined with the double exponential transformation is employed to solve the problem in each time level. The proposed numerical algorithm is completely described and the convergence analysis of the numerical solution is presented. Finally, some illustrative examples are given to demonstrate the pertinent features of the proposed algorithm.     

Extremal Eigenvalues of the Sturm-Liouville Problems with Discontinuous Coefficients

In this paper, an extremal eigenvalue problem to the Sturm-Liouville equations with discontinuous coefficients and volume constraint is investigated. Liouville transformation is applied to change the problem into an equivalent minimization problem. Finite element method is proposed and the convergence for the finite element solution is established. A monotonic decreasing algorithm is presented to solve the extremal eigenvalue problem. A global convergence for the algorithm in the continuous case is proved. A few numerical results are given to depict the efficiency of the method.