Method of Generalized Moment Representations in the Theory of Rational Approximation (A Survey)

We give a survey of the method of generalized moment representations introduced by Dzyadyk in 1981 and its applications to Padé approximations. In particular, some properties of biorthogonal polynomials are investigated and numerous important examples are given. We also consider applications of this method to joint Padé approximations, Padé–Chebyshev approximations, Hermite–Padé approximations, and two-point Padé approximations.     

Global and mid-range function approximation for engineering optimization

Global and mid-range approximation concepts are used in engineering optimisation in those cases were the commonly used local approximations are not available or applicable. In this paper the response surface method is discussed as a method to build both global and mid-range approximations of the objective and constraint functions. In this method analysis results in multiple design points are fitted on a chosen approximation model function by means of regression techniques. Especially global approximations rely heavily on appropriate choices of the model functions. This builds a serious bottleneck in applying the method. In mid-range approximations the model selection is much less critical. The response surface method is illustrated at two relatively simple design problems. For building global approximations a new method was developed by Sacks and co-workers, especially regarding the nature of computer experiments. Here, the analysis results in the design sites are exactly predicted, and model selection is more flexible compared to the response surface method. The method will be applied to an analytical test function and a simple design problem. Finally the methods are discussed and compared.     

Recurrence Relations for the Coefficients in Ultraspherical Series Solutions of Ordinary Differential Equations

A method is presented for obtaining recurrence relations for the coefficients in ultraspherical series of linear differential equations. This method applies Doha's method (1985) to generate polynomial approximations in terms of ultraspherical polynomials of $y(zx), -1\leq x\leq 1,z\in C,|z|\leq 1$, where y is a solution of a linear differential equation. In particular, rational approximations of $y(z)$ result if $x$ is set equal to unity. Two numerical examples are given to illustrate the application of the method to first and second order differential equations. In general, the rational approximations obtained by this method are better than the corresponding polynomial approximations, and compare favourably with Pade approximants.     

A New Method for Approximations in Probability and Operator Theories

The aim of this work is to introduce a new approach in normal approximations, approximations of semigroups of operators, and approximations by accompanying laws. We describe the method and provide several examples showing how the method works. Loosely speaking, the approach is based on multiplicative representations of differences to estimate. The method considerably reduces the technical part of proofs compared to the traditional approaches. In probability theory, it nicely applies to the nonidentically distributed case; another advantage of the method is its extendability to the case of dependent random variables.     

Numerical computation of forced oscillations in coupled duffing equations

Oscillating phenomena in non-linear mechanical systems with two degrees of freedom described by coupled Duffing equations are studied from the computational view point. Galerkin approximations of order 7 are computed with a very high precision on an electronic computer by applying a numerical approximation method of Urabe for the Galerkin method. The existence of an exact isolated periodic solution in a small neighborhood of these Galerkin approximations is proved and the error bound of these Galerkin approximations is given. The stability of Stierel's integration method in combination with Galerkin approximations is shown.     

Incremental unknowns for solving partial differential equations

Summary Incremental unknowns have been proposed in [T] as a method to approximate fractal attractors by using finite difference approximations of evolution equations. In the case of linear elliptic problems, the utilization of incremental unknown methods provides a new way for solving such problems using several levels of discretization; the method is similar but different from the classical multigrid method.In this article we describe the application of incremental unknowns for solving Laplace equations in dimensions one and two. We provide theoretical results concerning two-level approximations and we report on numerical tests done with multi-level approximations.     

On the construction of second-to-fourth-order accurate approximations of spatial derivatives on an arbitrary set of points

The method of undetermined coefficients generates a set of fixed-order approximations of spatial derivatives on an irregular stencil. An additional condition is proposed that singles out a unique scheme from this set. The resulting second-to-fourth order accurate approximations are applied to solving Poisson’s and the biharmonic equations. The bending of a plate supported by an edge, the nonlinear bending of a circular plate, and two-dimensional problems in solid mechanics are discussed. A method is proposed for constructing oriented approximations, which are validated by solving an advection equation.     

A note on the secant method

It is conjectured that the secant method converges linearly to a root of multiplicitym. In support of this, it is proved that the linearized secant method produces a bounded sequence of approximations except for a restricted set of values of the two initial approximations.     

Analog of the secant method for Banach spaces

An analog of the secant method using successive approximations for an inverse operator is studied. This is a second-order method. The Newton-Kantorovich method of obtaining successive approximations for an inverse operator is a special case of the method discussed here.Translated from Matematicheskie Zametki, Vol. 8, No. 4, pp. 487–492, October, 1970.     

Approximation of solutions to operator equations in spaces of smooth functions and in spaces of distributions

The Galerkin method, in particular, the Galerkin method with finite elements (called finite element method) is widely used for numerical solution of differential equations. The Galerkin method allows us to obtain approximations of weak solutions only. However, there arises in applications a rich variety of problems where approximations of smooth solutions and solutions in the sense of distributions have to be found. This article is devoted to the employment of the Petrov–Galerkin method for solving such problems. The article contains general results on the Petrov–Galerkin approximations of solutions to linear and nonlinear operator equations. The problem on construction of the subspaces, which ensure the convergence of the approximations, is investigated. We apply the general results to two‐dimensional (2D) and 3D problems of the elasticity, to a parabolic problem, and to a nonlinear problem of the plasticity. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 406–450, 2014     

Approximations for multi-server queues: System interpolations

This paper provides a unifying method of generating and/or evaluating approximations for the principal congestion measures in aGI/G/s queueing system. The main focus is on the mean waiting time, but approximations are also developed for the queue-length distribution, the waiting-time distribution and the delay probability for the Poisson arrival case. The approximations have closed forms that combine analytical solutions of simpler systems, and hence they are referred to as system-interpolation approximations or, simply, system interpolations. The method in this paper is consistent with and generalizes system interpolations previously presented for the mean waiting time in theGI/G/s queue.     

Composite Approximations to the Solutions of the Orr-Sommerfeld Equation

The method of matched asymptotic expansions is used to derive composite approximations to the solutions of the Orr-Sommerfeld equation which satisfy Olver's completeness requirement. It is shown that the inner expansions can be obtained to all orders in terms of a certain class of generalized Airy functions, and these expansions are then used to derive approximations to the connection formulae. Because of the linearity of the problem it is possible and convenient to fix the normalization of the inner and outer expansions separately and then to relate them through the central matching coefficients. The Stokes multipliers can then be expressed in terms of the central matching coefficients and the coefficients which appear in the connection formulae. Once the inner and outer expansions have been matched they can be combined, if desired, to form composite approximations of either the additive or multiplicative type. For example, the ‘modified’ viscous solutions of Tollmien emerge in a natural way as first-order composite approximations obtained by multiplicative composition; similarly, the form of the ‘viscous correction’ to the singular inviscid solutions which I conjectured some years ago emerges as a first-order additive composite approximation. Because of the completeness requirement, however, these composite approximations are valid only in certain wedge shaped domains; approximations which are valid in the complementary sectors can then be obtained by the use of the connections formulae. The theory thus provides a relatively simple and explicit method of obtaining higher approximations, and its structure permits a direct comparison of the present results not only with the older heuristic theories but also with the comparison equation method.     

Fractional differential equations with a Krasnoselskii–Krein type condition

We consider an initial value problem for a fractional differential equation of Caputo type. The convergence of the Picard successive approximations is established by first showing that the Caputo derivatives of these approximations converge. The method utilized, originally introduced in [O. Kooi, The method of successive approximations and a uniqueness theorem of Krasnoselskii–Krein in the theory of differential equations, Nederi. Akad. Wetensch, Proc. Ser. A61; Indag. Math. 20 (1958) 322–327], is interesting in itself.     

Parametric Cubic Spline Approach to the Solution of a System of Second-Order Boundary-Value Problems

We use parametric cubic spline functions to develop a numerical method for computing approximations to the solution of a system of second-order boundary-value problems associated with obstacle, unilateral, and contact problems. We show that the present method gives approximations which are better than those produced by other collocation, finite-difference, and spline methods. A numerical example is given to illustrate the applicability and efficiency of the new method.     

Grid approximation of the first derivatives of the solution to the Dirichlet problem for the Laplace equation on a polygon

Using the method of composite square and polar grids, we construct approximations of the first derivatives of the solution to the Dirichlet problem for the Laplace equation on a polygon and find error estimates for such approximations.     

一类常微分方程的非多项式样条函数逼近解

本文提出一种新的数值方法来获得三阶带障碍边值问题的常微分方程的数值解,这类方法的基函数包括三角函数、指数函数、多项式函数。本文将给出一数值例子说明这种方法优于其他差分法、配置法、多项式样条函数法。     

Data-Driven Robust Chance Constrained Problems: A Mixture Model Approach

This paper discusses the mixture distribution-based data-driven robust chance constrained problem. We construct a data-driven mixture distribution-based uncertainty set from the perspective of simultaneously estimating higher-order moments. Then, we derive a reformulation of the data-driven robust chance constrained problem. As the reformulation is not a convex programming problem, we propose new and tight convex approximations based on the piecewise linear approximation method. We establish the theoretical foundation for these approximations. Finally, numerical results show that the proposed approximations are practical and efficient.     

非光滑第二类Fredholm方程Collocation解的迭代──校正方法

本文对于一类具非光滑核第二类Ｆｒｅｄｈｏｌｍ方程的Ｃｏｌｌｏｃａｔｉｏｎ解提出一种迭代─校正方法，使得在计算量增加很少的前提下，成倍提高逼近解精度，并将此方法用于平面多角域上边界积分方程，从而给出其相应微分方程逼近解的高精度算法。此方法还是一种自适应方法。     

Numerical solution of scattering problems using pseudo-differential impedance operators

Direct numerical solutions of scattering problems based on boundary-integral equations are computationally costly at high frequencies. A numerical method is presented that efficiently computes accurate approximations to unknown surface quantities given known surface data (an approximate Dirichlet-to-Neumann map). The method is based on a pseudo-differential impedance operator (PIO) numerically implemented using rational approximations. An example of a PIO is the so-called on-surface radiation condition (OSRC) method. For a convex obstacle, the method can be viewed as applying a parabolic equation directly on the surface of a scatterer. In contrast to past OSRCs, the use of rational approximations provides accuracy for wide scattering angles which is needed for grazing angles of incidence. Generalization to impedance operators for two-dimensional acoustic scatterers with concave parts is presented. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

特征值问题的三角形二次元的展开式及其外推

我们考虑利用三角形二次元来求解特征值问题,并给出特征值的误差展开式,以此为基础进行外推获得高精度.