Convergence of linear multistep methods for two-parameter singular perturbation problems

1. IntroductionIt is well known that the IVPs of ODEs in singular perturbation form may be consideredas a special class of stab problems. But it is regrettable that they can't be satisfactorily covered by B-theory (of. [2-8]) because of their very special structure. In the recede ten yeaxslmany importallt and illteresting results on the convergence of linear multistep methods,Runge-Kutta methods, Rosenbrock methods and general linear methods applied to oneparameter singular perturbation pr…     

Second derivative methods with RK stability

General linear methods are extended to the case in which second derivatives, as well as first derivatives, can be calculated. Methods are constructed of third and fourth order which are A-stable, possess the Runge–Kutta stability property and have a diagonally implicit structure for efficient implementation. AMS subject classification 65L05 G. Hojjati: Corresponding author.     

Second-order numerical method for domain optimization problems

This paper is concerned with a second-order numerical method for shape optimization problems. The first variation and the second variation of the objective functional are derived. These variations are discretized by introducing a set of boundary-value problems in order to derive the second-order numerical method. The boundary-value problems are solved by the conventional finite-element method.The authors would like to express their thanks to Mr. T. Masanao, who was an undergraduate student, for his cooperation and comments. They also thank Professor Y. Sakawa of Osaka University for his encouragement.A part of this paper was presented at the IFIP Conference on Control of Boundaries and Stabilization, Clermont-Ferrand, France, 1988.     

A fast numerical method for solving coupled Burgers' equations

A new fast numerical scheme is proposed for solving time‐dependent coupled Burgers' equations. The idea of operator splitting is used to decompose the original problem into nonlinear pure convection subproblems and diffusion subproblems at each time step. Using Taylor's expansion, the nonlinearity in convection subproblems is explicitly treated by resolving a linear convection system with artificial inflow boundary conditions that can be independently solved. A multistep technique is proposed to rescue the possible instability caused by the explicit treatment of the convection system. Meanwhile, the diffusion subproblems are always self‐adjoint and coercive at each time step, and they can be efficiently solved by some existing preconditioned iterative solvers like the preconditioned conjugate galerkin method, and so forth. With the help of finite element discretization, all the major stiffness matrices remain invariant during the time marching process, which makes the present approach extremely fast for the time‐dependent nonlinear problems. Finally, several numerical examples are performed to verify the stability, convergence and performance of the new method.© 2017 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 33: 1823–1838, 2017     

Families of methods for ordinary differential equations based on trigonometric polynomials

We consider the construction of methods based on trigonometric polynomials for the initial value problems whose solutions are known to be periodic. It is assumed that the frequency w can be estimated in advance. The resulting methods depend on a parameter ν = hw, where h is the step size, and reduce to classical multistep methods if ν → 0. Gautschi [4] developed Adams and Störmer type methods. In our paper we construct Nyström's and Milne-Simpson's type methods. Numerical experiments show that these methods are not sensitive to changes in w, but require the Jacobian matrix to have purely imaginary eigenvalues.     

A continuation method for linear complementarity problems with P 0 matrix

In this article, we propose a new continuation method for solving the linear complementarity problem (LCP). The method solves one system of linear equations and carries out only a one-line search at each iteration. The continuation method is based on a modified smoothing function. The existence and continuity of a smooth path for solving the LCP with a P ₀ matrix are discussed. We investigate the boundedness of the iteration sequence generated by our continuation method under the assumption that the solution set of the LCP is nonempty and bounded. It is shown to converge to an LCP solution globally linearly and locally superlinearly without the assumption of strict complementarity at the solution under suitable assumption. In addition, some numerical results are also reported in this article.     

统计模拟在几何概率问题中应用的注解

设D为R²上的一个紧集, X 为D上的一个随机覆盖过程的统计量. 由于问题复杂, X的均 值、方差、分布函数均没有解析表达式. 统计模拟可以帮助我们找到它们的近似解. 为了在D上做统 计模拟, 需要D的代表点. 产生代表点的不同方法, 会影响统计模拟的结果. 若D不是一个矩形, 如 何选择合适的代表点至关重要. 文献中研究了一个在单位圆上的随机覆盖问题, 提出在单位圆上产生 代表点的四种方法, 并对这四种方法给予评估. 本文考虑两个随机圆的随机覆盖问题, 给出覆盖面积 的理论公式, 使比较四种产生代表点的方法有一个基准. 我们的研究结果和文献中的结论一致, 并发现 其中两种方法使覆盖面积均值的估计有偏, 且有较大的方差, 这是一个新的结果. 本文进一步指出覆 盖面积的分布可由 β 分布来拟合.     

A geometric approach for solving fuzzy linear programming problems

In this paper we first recall some definitions and results of fuzzy plane geometry, and then introduce some definitions in the geometry of two-dimensional fuzzy linear programming (FLP). After defining the optimal solution based on these definitions, we use the geometric approach for obtaining optimal solution(s) and show that the algebraic solutions obtained by Zimmermann method (ZM) and our geometric solutions are the same. Finally, numerical examples are solved by these two methods.     

A numerical method for solving nonlinear ill-posed problems

A two-step iterative process for the numerical solution of nonlinear problems is suggested. In order to avoid the ill-posed inversion of the Fréchet derivative operator, some regularization parameter is introduced. A convergence theorem is proved. The proposed method is illustrated by a numerical example in which a nonlinear inverse problem of gravimetry is considered. Based on the results of the numerical experiments practical recommendations for the choice of the regularization parameter are given. Some other iterative schemes are considered.     

Stability in linear multistep methods for pure delay equations

The stability regions of linear multistep methods for pure delay equations are compared with the stability region of the delay equation itself. A criterion is derived stating when the numerical stability region contains the analytical stability region. This criterion yields an upper bound for the integration step (conditional Q-stability). These bounds are computed for the Adams-Bashforth, Adams-Moulton and backward differentiation methods of orders ?8. Furthermore, symmetric Adams methods are considered which are shown to be unconditionally Q-stable. Finally, the extended backward differentiation methods of Cash are analysed.     

A numerical method for minimum distance estimation problems

This paper introduces a general method for the numerical derivation of a minimum distance (MD) estimator for the parameters of an unknown distribution. The approach is based on an active sampling of the space in which the random sample takes values and on the optimization of the parameters of a suitable approximating model. This allows us to derive the MD estimator function for any given distribution, by which we can immediately obtain the MD estimate of the unknown parameters in correspondence to any observed random sample. Convergence of the method is proved when mild conditions on the sampling process and on the involved functions are satisfied, and it is shown that favorable rates can be obtained when suitable deterministic sequences are employed. Finally, simulation results are provided to show the effectiveness of the proposed algorithm on two case studies.     

A numerical method for solving stochastic programming problems with moment constraints on a distribution function

The stochastic programming problem is considered in the case of a distribution function with partially known random parameters. A minimax approach is taken, and a numerical method is proposed for problems when information on the distribution function can be expressed in the form of finitely many moment constraints. Convergence is proved and results of numerical experiments are reported.     

Generating numerical algorithms using a computer algebra system

An useful application of computer algebra systems is the generation of algorithms for numerical computations. We have shown in Gander and Gruntz (SIAM Rev., 1999) how computer algebra can be used in teaching to derive numerical methods. In this paper we extend this work, using essentially the capability of computer algebra system to construct and manipulate the interpolating polynomial and to compute a series expansion of a function. We will automatically generate formulas for integration and differentiation with error terms and also generate multistep methods for integrating differential equations. In memory of Germund Dahlquist (1925–2005).AMS subject classification (2000) 65D25, 65D30, 65D32, 65L06     

A barrier function method for minimax problems

This paper presents an algorithm based on barrier functions for solving semi-infinite minimax problems which arise in an engineering design setting. The algorithm bears a resemblance to some of the current interior penalty function methods used to solve constrained minimization problems. Global convergence is proven, and numerical results are reported which show that the algorithm is exceptionally robust, and that its performance is comparable, while its structure is simpler than that of current first-order minimax algorithms.This research was supported by the National Science Foundation grant ECS-8517362, the Air Force Office Scientific Research grant 86-0116, the California State MICRO program, and the United Kingdom Science and Engineering Research Council.     

A fitted numerical method for parabolic turning point singularly perturbed problems with an interior layer

The objective of this paper is to construct and analyze a fitted operator finite difference method (FOFDM) for the family of time‐dependent singularly perturbed parabolic convection–diffusion problems. The solution to the problems we consider exhibits an interior layer due to the presence of a turning point. We first establish sharp bounds on the solution and its derivatives. Then, we discretize the time variable using the classical Euler method. This results in a system of singularly perturbed interior layer two‐point boundary value problems. We propose a FOFDM to solve the system above. Through a rigorous error analysis, we show that the scheme is uniformly convergent of order one with respect to both time and space variables. Moreover, we apply Richardson extrapolation to enhance the accuracy and the order of convergence of the proposed scheme. Numerical investigations are carried out to demonstrate the efficacy and robustness of the scheme.     

A linear sampling method for inverse problems of diffraction gratings of mixed type

This paper is concerned with the direct and inverse problem of scattering of a time‐harmonic wave by a Lipschitz diffraction grating of mixed type. The scattering problem is modeled by the mixed boundary value problem for the Helmholtz equation in the unbounded half‐plane domain above a periodic Lipschitz surface on which a mixed Dirichlet and impedance boundary condition is imposed. We first establish the well‐posedness of the direct problem, employing the variational method, and then extend Isakov's method to prove uniqueness in determining the Lipschitz diffraction grating profile by using point sources lying above the structure. Finally, we develop a periodic version of the linear sampling method to reconstruct the diffraction grating. In this case, the far field equation defined on the unit circle is replaced by a near field equation defined on a line above the surface, which is a linear integral equation of the first kind. Numerical results are also presented to illustrate the efficiency of the method in the case when the height of the unknown grating profile is not very large and the noise level of the near field measurements is not very high. Copyright © 2012 John Wiley & Sons, Ltd.     

Implicit‐explicit multistep finite element methods for nonlinear convection‐diffusion problems

Implicit‐explicit multistep finite element methods for nonlinear convection‐diffusion equations are presented and analyzed. In space we discretize by finite element methods. The discretization in time is based on linear multistep schemes. The linear part of the equation is discretized implicitly and the nonlinear part of the equation explicitly. The schemes are stable and very efficient. We derive optimal order error estimates. © 2001 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 17:93–104, 2001     

积分微分方程线性多步方法的散逸性

研究一类积分微分方程线性多步方法（p,σ）的散逸性．当积分项用复合求积公式逼近时,证明了线性多步方法是有限维散逸的．这说明该方法很好地继承了系统本身所具有的重要性质．这一结论为数值求解这一类微分方程提供了更多的选择．     

Boundary value method for inverse Sturm-Liouville problems

In this paper we present a method to recover symmetric and non-symmetric potential functions of inverse Sturm-Liouville problems from the knowledge of eigenvalues. The linear multistep method coupled with suitable boundary conditions known as boundary value method (BVM) is the main tool to approximate the eigenvalues in each iteration step of the used Newton method. The BVM was extended to work for Neumann-Neumann boundary conditions. Moreover, a suitable approximation for the asymptotic correction of the eigenvalues is given. Numerical results demonstrate that the method is able to give good results for both symmetric and non-symmetric potentials.     

Explicit multistep method for the numerical solution of stiff differential equations

An explicit multistep method of variable order for integrating stiff systems with high accuracy and low computational costs is examined. To stabilize the computational scheme, componentwise estimates are used for the eigenvalues of the Jacobian matrix having the greatest moduli. These estimates are obtained at preliminary stages of the integration step. Examples are given to demonstrate that, for certain stiff problems, the method proposed is as efficient as the best implicit methods.