An efficient alternating direction method of multipliers for optimal control problems constrained by random Helmholtz equations

Based on the alternating direction method of multipliers (ADMM), we develop three numerical algorithms incrementally for solving the optimal control problems constrained by random Helmholtz equations. First, we apply the standard Monte Carlo technique and finite element method for the random and spatial discretization, respectively, and then ADMM is used to solve the resulting system. Next, combining the multi-modes expansion, Monte Carlo technique, finite element method, and ADMM, we propose the second algorithm. In the third algorithm, we preprocess certain quantities before the ADMM iteration, so that nearly no random variable is in the inner iteration. This algorithm is the most efficient one and is easy to implement. The error estimates of these three algorithms are established. The numerical experiments verify the efficiency of our algorithms.     

Volterra积分方程的蒙特卡罗数值求解方法

本文讨论了第一类、第二类以及具有奇异核的Volterra积分方程的数值解问题.利用重要抽样蒙特卡罗随机模拟方法获得积分方程解的近似计算结果.通过对文献中算例的实现表明文中所提方法扩展了Volterra型积分方程的数值求解方法,     

利用随机模拟方法求解第二类积分方程

给出一种求解第二类Fredholm和Volterra积分方程的数值算法,算法在数值积分技术的基础上使用Monte Carlo随机模拟方法求积分方程的近似解.通过数值例子证明了该算法是有效的.     

Numerical comparison of three stochastic methods for nonlinear PN junction problems

We apply the Monte Carlo, stochastic Galerkin, and stochastic collocation methods to solving the drift-diffusion equations coupled with the Poisson equation arising in semiconductor devices with random rough surfaces. Instead of dividing the rough surface into slices, we use stochastic mapping to transform the original deterministic equations in a random domain into stochastic equations in the corresponding deterministic domain. A finite element discretization with the help of AFEPack is applied to the physical space, and the equations obtained are solved by the approximate Newton iterative method. Comparison of the three stochastic methods through numerical experiment on different PN junctions are given. The numerical results show that, for such a complicated nonlinear problem, the stochastic Galerkin method has no obvious advantages on efficiency except accuracy over the other two methods, and the stochastic collocation method combines the accuracy of the stochastic Galerkin method and the easy implementation of the Monte Carlo method.     

A multigrid compact finite difference method for solving the one‐dimensional nonlinear sine‐Gordon equation

The aim of this paper is to propose a multigrid method to obtain the numerical solution of the one‐dimensional nonlinear sine‐Gordon equation. The finite difference equations at all interior grid points form a large sparse linear system, which needs to be solved efficiently. The solution cost of this sparse linear system usually dominates the total cost of solving the discretized partial differential equation. The proposed method is based on applying a compact finite difference scheme of fourth‐order for discretizing the spatial derivative and the standard second‐order central finite difference method for the time derivative. The proposed method uses the Richardson extrapolation method in time variable. The obtained system has been solved by V‐cycle multigrid (VMG) method, where the VMG method is used for solving the large sparse linear systems. The numerical examples show the efficiency of this algorithm for solving the one‐dimensional sine‐Gordon equation. Copyright © 2014 John Wiley & Sons, Ltd.     

Mixed two‐grid finite difference methods for solving one‐dimensional and two‐dimensional Fitzhugh–Nagumo equations

The aim of this paper is to propose mixed two‐grid finite difference methods to obtain the numerical solution of the one‐dimensional and two‐dimensional Fitzhugh–Nagumo equations. The finite difference equations at all interior grid points form a large‐sparse linear system, which needs to be solved efficiently. The solution cost of this sparse linear system usually dominates the total cost of solving the discretized partial differential equation. The proposed method is based on applying a family of finite difference methods for discretizing the spatial and time derivatives. The obtained system has been solved by two‐grid method, where the two‐grid method is used for solving the large‐sparse linear systems. Also, in the proposed method, the spectral radius with local Fourier analysis is calculated for different values of h and Δt. The numerical examples show the efficiency of this algorithm for solving the one‐dimensional and two‐dimensional Fitzhugh–Nagumo equations. Copyright © 2016 John Wiley & Sons, Ltd.     

Monte Carlo simulation via a numerical algorithm for solving a nonlinear inverse problem

This paper is intended to provide a numerical algorithm involving the combined use of the finite differences scheme and Monte Carlo method for estimating the diffusion coefficient in a one-dimensional nonlinear parabolic inverse problem. In the present study, the functional form of the diffusion coefficient is unknown a priori. The unknown diffusion coefficient is approximated by the polynomial form and the present numerical algorithm is employed to find the solution. To modify the values of estimated coefficients of this polynomial form, we introduce a random search algorithm in Monte Carlo method for global optimization. A numerical test is performed in order to show the efficiency and accuracy of the present work.     

A fast and efficient two-grid method for solving d-dimensional poisson equations

The aim of this paper is to introduce a fast and efficient new two-grid method to solve the d-dimensional (d=1,2,3) Poisson elliptic equations. The finite difference equations at all interior grid points form a large sparse linear system, which needs to be solved efficiently. The solution cost of this sparse linear system usually dominates the total cost of solving the discretized partial differential equation. The finite difference equations are based on applying a finite difference scheme of two- and four-orders (compact finite difference method) for discretizing the spatial derivative. The obtained linear systems of Poisson elliptic equations have been solved by a new two-grid (NTG) method and we also note that the NTG method which is used for solving the large sparse linear systems is faster and more effective than that of the standard two-grid method. We utilize the local Fourier analysis to show that the spectral radius of the new two-grid method for 1D and 2D models is less than that of the standard two-grid method. As well as, we expand the corresponding algorithm to the new multi-grid method. The numerical examples show the efficiency of the new algorithms for solving the d-dimensional Poisson equations.     

Linearized perturbation method for stochastic analysis of a rill erosion model

The linearization and correction method (LCM) proposed by He is a simple and effective perturbation technique to solve nonlinear equations. To analyze the random properties of rill erosion model, a new stochastic perturbation technique called linearized perturbation method is developed by combining the traditional stochastic perturbation method with the LCM. Comparisons between the numerical results obtained by the linearized perturbation method and those obtained by Monte Carlo method indicated an excellent agreement. However, the calculation efficiency of the linearized perturbation method is higher.     

Some sufficient conditions for the non-negativity preservation property in the discrete heat conduction model

In the course of the numerical approximation of mathematical models there is often a need to solve a system of linear equations with a tridiagonal or a block-tridiagonal matrices. Usually it is efficient to solve these systems using a special algorithm (tridiagonal matrix algorithm or TDMA) which takes advantage of the structure. The main result of this work is to formulate a sufficient condition for the numerical method to preserve the non-negativity for the special algorithm for structured meshes. We show that a different condition can be obtained for such cases where there is no way to fulfill this condition. Moreover, as an example, the numerical solution of the two-dimensional heat conduction equation on a rectangular domain is investigated by applying Dirichlet boundary condition and Neumann boundary condition on different parts of the boundary of the domain. For space discretization, we apply the linear finite element method, and for time discretization, the well-known Θ-method. The theoretical results of the paper are verified by several numerical experiments.     

Transient analysis of thermo-elastic waves in thick hollow cylinders using a stochastic hybrid numerical method,considering Gaussian mechanical properties

This article attempts to study the stochastic coupled thermo-elasticity of thick hollow cylinders subjected to thermal shock loading considering uncertainty in mechanical properties. The thermo-elastic governing equations based on Green–Naghdi theory (without energy dissipation) are stochastically solved using a hybrid numerical method (combined Galerkin finite element and Newmark finite difference methods). The mechanical properties are considered as random variables with Gaussian distribution, which are generated using Monte Carlo simulation method with various coefficients of variations (COVs). The effects of uncertainty in mechanical properties with various coefficients of variations on thermo-elastic wave propagation are studied in detail. Also, the maximum, mean and variance of temperature, displacement and stresses are illustrated across thickness of cylinder in various times.     

Three-layer finite difference method for solving linear differential algebraic systems of partial differential equations

A boundary value problem is examined for a linear differential algebraic system of partial differential equations with a special structure of the associate matrix pencil. The use of an appropriate transformation makes it possible to split such a system into a system of ordinary differential equations, a hyperbolic system, and a linear algebraic system. A three-layer finite difference method is applied to solve the resulting problem numerically. A theorem on the stability and the convergence of this method is proved, and some numerical results are presented.     

Multigrid solution of high order discretisation for three-dimensional biharmonic equation with Dirichlet boundary conditions of second kind

In this paper, we propose two compact finite difference approximations for three-dimensional biharmonic equation with Dirichlet boundary conditions of second kind. In these methods there is no need to define special formulas near the boundaries and boundary conditions are incorporated with these techniques. The unknown solution and its second derivatives are carried as unknowns at grid points. We derive second-order and fourth-order approximations on a 27 point compact stencil. Classical iteration methods such as Gauss–Seidel and SOR for solving the linear system arising from the second-order and fourth-order discretisation suffer from slow convergence. In order to overcome this problem we use multigrid method which exhibit grid-independent convergence and solve the linear system of equations in small amount of computer time. The fourth-order finite difference approximations are used to solve several test problems and produce high accurate numerical solutions.     

A boundary element method to price time-dependent double barrier options

In this paper we propose a new method for pricing double-barrier options with moving barriers under the Black-Scholes and the CEV models. First of all, by applying a variational technique typical of the boundary element method, we derive an integral representation of the double-barrier option price in which two of the integrand functions are not given explicitly but must be obtained solving a system of Volterra integral equations of the first kind. Second, we develop an ad hoc numerical method to regularize and solve the system of integral equations obtained. Several numerical experiments are carried out showing that the overall algorithm is extraordinarily fast and accurate, even if the barriers are not differentiable functions. Moreover the numerical method presented in this paper performs significantly better than the finite difference approach.     

半导体器件瞬态模拟的对称正定混合元方法

提出具有对称正定特性的混合元格式求解非稳态半导体器件瞬态模拟问题。提出一个最小二乘混合元方法、一个新的具有分裂和对称正定性质的混合元格式和一个解经典混合元方程的对称正定失窃工格式求解电场位势和电场强度方程;提出一个最小二乘混合元格式求解关于电子与空穴浓度的非稳态对流扩散方程,浓度函数和流函数被同时求解;采用标准的有限元方法求解热传导方程。建立了误差分析理论。     

Wavelet-Galerkin method for solving parabolic equations in finite domains

A novel wavelet-Galerkin method tailored to solve parabolic equations in finite domains is presented. The emphasis of the paper is on the development of the discretization formulations that are specific to finite domain parabolic equations with arbitrary boundary conditions based on weak form functionals. The proposed method also deals with the development of algorithms for computing the associated connection coefficients at arbitrary points. Here the Lagrange multiplier method is used to enforce the essential boundary conditions. The numerical results on a two-dimensional transient heat conducting problem are used to validate the proposed wavelet-Galerkin algorithm as an effective numerical method to solve finite domain parabolic equations.     

Nonmonotone Inexact Newton Method for the Extended Linear Complementarity Problem

This paper presents a nonmonotone inexact Newton-type method for the extended linear complementarity problem (ELCP). We first reformulate the optimization system of the ELCP problem into a system of smoothed equations. Then we solve this system by a nonmonotone inexact Newton-type algorithm. The global convergence is obtained and numerical tests for some classes of ELCP include linear complementarity, horizontal linear complementarity, and generalized linear complementarity problems are also given to show the e?ciency of the proposed algorithm.     

Finite integration method for partial differential equations

A finite integration method is proposed in this paper to deal with partial differential equations in which the finite integration matrices of the first order are constructed by using both standard integral algorithm and radial basis functions interpolation respectively. These matrices of first order can directly be used to obtain finite integration matrices of higher order. Combining with the Laplace transform technique, the finite integration method is extended to solve time dependent partial differential equations. The accuracy of both the finite integration method and finite difference method are demonstrated with several examples. It has been observed that the finite integration method using either radial basis function or simple linear approximation gives a much higher degree of accuracy than the traditional finite difference 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.     

Cardinal functions for Legendre pseudo-spectral method for solving the integro-differential equations

In this article, we present a new numerical method to solve the integro-differential equations (IDEs). The proposed method uses the Legendre cardinal functions to express the approximate solution as a finite series. In our method the operational matrix of derivatives is used to reduce IDEs to a system of algebraic equations. To demonstrate the validity and applicability of the proposed method, we present some numerical examples. We compare the obtained numerical results from the proposed method with some other methods. The results show that the proposed algorithm is of high accuracy, more simple and effective.