The two-dimensional,linear, orthotropic plate: The traction problem

In [13] we extended the analysis of Ciarlet and Destuynder [5] to the clamped orthotropic plate. For the present paper we shall apply these methods to the orthotropic plate under traction. In particular, we shall be considering the type of problem posed in Friedrichs and Dressler [10] for the isotropic plate and make use of the fact that the variational problem will split just as was the case for the partial differential equation formulation. With the present approach we shall be able to produce a proper convergence analysis for the formal asymptotics used in Friedrichs and Dressler.     

Lagrange基函数的复矩阵有理插值及连分式插值

1引言 矩阵有理插值问题与系统线性理论中的模型简化问题和部分实现问题有着紧密的联系~[1][2]，在矩阵外推方法中也常常涉及线性或有理矩阵插值问题~[3]。按照文~[1]的阐述。目前已经研究的矩阵有理插值问题包括矩阵幂级数和Newton-Pade逼近。Hade逼近，联立Pade逼近，M-Pade逼近，多点Pade逼近等。显然，上述各种形式的矩阵Pade逼上梁山近是矩     

Positive Refinable Operators

Recently, linear positive operators of Bernstein–Schoenberg type, relative to B-splines bases, have been considered. The properties of these operators are derived mainly from the total positivity of normalized B-spline bases. In this paper we shall construct a generalization of the operator considered in [15] by means of normalized totally positive bases generated by a particular class of totally positive scaling functions. Next, we shall study its approximation properties. Our results can be established also for more general sequences of normalized totally positive bases.     

Moderate deviations for longest increasing subsequences: The upper tail

We derive the upper‐tail moderate deviations for the length of a longest increasing subsequence in a random permutation. This concerns the regime between the upper‐tail large‐deviation regime and the central limit regime. Our proof uses a formula to describe the relevant probabilities in terms of the solution of the rank 2 Riemann‐Hilbert problem (RHP); this formula was invented by Baik, Deift, and Johansson [3] to find the central limit asymptotics of the same quantities. In contrast to the work of these authors, who apply a third‐order (nonstandard) steepest‐descent approximation at an inflection point of the transition matrix elements of the RHP, our approach is based on a (more classical) second‐order (Gaussian) saddle point approximation at the stationary points of the transition function matrix elements. © 2001 John Wiley & Sons, Inc.     

最小二乘线性逼近的一个注

给定m维实空间中N个点P_i=(x_1~((i)),x_2~((i)),…,x_m~((i)),i=1(1)N.对于任何超平面 k_1x_1+k_2x_2+…+k_mx_m+k_0=0,P_i到它的垂直距离平方和     

Maximal functions and ergodic averages related to Waring’s problem

We study the arithmetic analogue of maximal functions on diagonal hypersurfaces. This paper is a natural step following the papers of [13], [14] and [16]. We combine more precise knowledge of oscillatory integrals and exponential sums to generalize the asymptotic formula in Waring’s problem to an approximation formula for the Fourier transform of the solution set of lattice points on hypersurfaces arising in Waring’s problem and apply this result to arithmetic maximal functions and ergodic averages. In sufficiently large dimensions, the approximation formula, ? ²-maximal theorems and ergodic theorems were previously known. Our contribution is in reducing the dimensional constraint in the approximation formula using recent bounds of Wooley, and improving the range of ? ^p spaces in the maximal and ergodic theorems. We also conjecture the expected range of spaces.     

带约束导数值域的L逼近

1972年J.A.Roulier和G.D.Taylor研究了带约束导数值域的一致逼近,在文章最后,他们提出了一个未解决的问题,就是关于带约束导数值域的L逼近问题.本文研究了这个问题,得到与[1]平行的结果.这个结果同时也推广了 R.A.Lorentz的工作. 第一节给出存在定理,第二节证明若干特征定理,第三节给出一个唯一性定理.     

The use of the bloomfield model as an approximation to ARMA processes in the context of fractional integration

In this article, we propose the use of a model proposed by Bloomfield [1] as an approximation to the ARMA structure underlying the I(0) disturbances in the context of fractional integration. For this purpose, we use tests due to Robinson [2] and show, via Monte Carlo simulations, that the power properties of the tests are not much affected by the use of this nonparametric approach. A small empirical application is also carried out at the end of the article.     

A comparative analysis of linear fitting for non-linear functions on optimization: A case study: Air pollution problems

A very frequent problem in advanced mathematical programming models is the linear approximation of convex and non-convex non-linear functions in either the constraints or the objective function of an otherwise linear programming problem. In this paper, based on a model that has been developed for the evaluation and selection of pollutant emission control policies and standards, we shall study several ways of representing non-linear functions of a single argument in mixed integer, separable and related programming terms. Thus we shall study the approximations based on piecewise constant, piecewise adjacent, piecewise non-adjacent additional and piecewise non-adjacent segmented functions. In each type of modelization we show the problem size and optimization results of using the following techniques: separable programming, mixed integer programming with Special Ordered Sets of type 1, linear programming with Special Ordered Sets of type 2 and mixed integer programming using strategies based on the quasi-integrality of the binary variables.     

Least squares coefficients for a quadrature formula for Laplace transform inversion

A linear iterative method of least squares approximation of functions by exponentials due to Miller [9] is adapted to derive a set of least squares coefficients for an approximate Laplace transform inversion formula eq. (1). An earlier assumption made by Zakian [2] - that the approximation to the Laplace transform inverse will improve provided the approximation to the Dirac delta function is improved - is shown to be not substantiated for a number of test functions.     

Some applications of Henkin quantifiers

We show how to approximate a Henkin formula by first order formulas. This method of approximation is then applied to problems of axiomatizing classes of structures. Dedicated to the memory of Abraham Robinson. The author is an Alfred P. Sloan Fellow.     

Calcul stochastique non adapté pour des processus à deux paramètres: formules de changement de variables de type Stratonovitch et de type Skorohod

Résumé Nous établissons une formule de changement de variables de type Stratonovitch pour des processus non adaptés indéxés par [0, 1]² qui est analogue à celle existant en calcul déterministe. Pour cela nous définissons une intégrale de Stratonovitch simple (resp. double): Nous en déduisons une formule de changement de variables de type Skorohod ne contenant pas d'intégrale curviligne. Nous utilisons des régularisations du processus de Wiener obtenues par convolution avec une approximation de l'unité.

---

Summary We prove a Stratonovitch-type change of variable formula for anticipative processes on [0, 1]². The formula is the same as the existing one from deterministic calculus. In order to do so we define simple and double Stratonovitch integrals. We deduce a Skorohod-type change of variable formula which does not contain any line integral. Our method consists in using regularization of the Wiener process obtained by convolution.

     

Approximation of multivariable functions with respect to random points less than 2 k,k dimension of space

Summary The problem of the numerical approximation of multivariable functions has been solved by the Monte Carlo method when the data points are assumed to be given on discrete lattice points [5, 8, 2]. When the data points are randomly distributed and very numerous there are some results in the literature [3, 6] but if the number of the points is less than 2 ^k , wherek is the dimension of the space, it is very difficult to develop approximation formulas. This paper gives a solution to this problem by local approximations.     

Numerical analysis for stochastic age-dependent population equations with Poisson jump and phase semi-Markovian switching

In this paper, we shall examine the convergence of semi-implicit Euler approximation for stochastic age-dependent population equations with Poisson jump and phase semi-Markovian switching. Here, the main ideas from the papers Ronghua et al. (2009) [2] and Wang and Wang (2010) [3] are successfully developed to the more general cases. Finally, a numerical example is provided to illustrate the theoretical result of convergence.     

The Euler-Minding series for branched continued fractions

In the paper “Branched continued fractions for double power series” [J. Comput. Appl. Math. 6 (1980) 121–125] Siemaszko generalizes for branched continued fractions the formula that expresses the difference of two successive convergents of an ordinary continued fraction. However, the generalization is not yet fit to write the branched continued fraction as an Euler-Minding series for the following reason. Indeed a convergent of the branched continued fraction can be written as a partial sum of a series but different convergents are different partial sums of different series. The next convergent cannot be obtained from the previous one by adding some terms. We shall develop here another formula that overcomes this problem.     

The projected newton method for solving inverse eigenvalue problems - the case of multiple eigenvaues

This paper deals with the optimal solution of ill-posed linear problems, i.e..linear problems for which the solution operator is unbounded. We consider worst-case ar,and averagecase settings. Our main result is that algorithms having finite error (for a given setting) exist if and only if the solution operator is bounded (in that setting). In the worst-case setting, this means that there is no algorithm for solving ill-posed problems having finite error. In the average-case setting, this means that algorithms having finite error exist if and only lf the solution operator is bounded on the average. If the solution operator is bounded on the average, we find average-case optimal information of cardinality n and optimal algorithms using this information, and show that the average error of these algorithms tends to zero as n→∞. These results are then used to determine the [euro]-complexity, i.e., the minimal costof finding an [euro]-accurate approximation. In the worst-case setting, the [euro]comp1exity of an illposed problem is infinite for all [euro]>0; that is, we cannot find an approximation having finite error and finite cost. In the average-case setting, the [euro]-complexity of an ill-posed problem is infinite for all [euro]>0 iff the solution operator is not bounded on the average, moreover, if the the solutionoperator is bounded on the average, then the [euro]-complexity is finite for all [euro]>0.     

Finite element approximationof a nonlinear elliptic equation arising from bimaterial problemsin elastic-plastic mechanics

Summary. In [13], a nonlinear elliptic equation arising from elastic-plastic mechanics is studied. A well-posed weak formulation is established for the equation and some regularity results are further obtained for the solution of the boundary problem. In this work, the finite element approximation of this boundary problem is examined in the framework of [13]. Some error bounds for this approximation are initially established in an energy type quasi-norm, which naturally arises in degenerate problems of this type and proves very useful in deriving sharper error bounds for the finite element approximation of such problems. For sufficiently regular solutions optimal error bounds are then obtained for some fully degenerate cases in energy type norms. Received June 12, 1998 / Revised version received June 21, 1999 / Published online June 8, 2000     

Approximation in eigenvalue problems for holomorphic fredholm operator functions I

The approximation of a holomorphic eigenvalue problem is considered. The main purpose is to present a construction by which the derivation of the asymptotic error estimations for the approximate eigenvalues of Fredholm operator functions can be reduced to the derivation of these estimations for the case of matrix functions. (Some estimations for the latter problem can be derived, in one's turn, from the error estimations for the zeros of the corresponding determinants.) The asymptotic error estimations are considered in part II of this paper, in [10]. By the presented construction also the stability of the algebraic multiplicity of eigenvalues by regular approximation is proved in Section 3

The presented construction, in essence, reproduces the constructions in [7] for the case of the compact approximation in subspaces and in [9] for the case of projection—like methods. It is simpler to use than similiar construction in [8], and allows unified consideration of the general case and the case of projection—like methods, what in [8, 9] was not achieved     

Zum Franklin—Schneiderschen Satz

In this note we shall carry on further the simultaneous approximation of a, b and exp(bloga). In a recent paper BUNDSCHUH [2] proved a theorem which appears to be a sharpening of a theorem of SCHNEIDER [10]. But there is an error in the proof. We shall show, that under a supplementary condition, the theorem of BUNDSCHUH remains valid and as well, get an improvement to this theorem. We further give some results on linear forms in logarithms of two U-numbers with algebraic coefficients.     

THE AMBIGUOUS TYPE THEORY IS HEREDITARILY UNDECIDABLE

The ambiguous type theory ATT is introduced in [1] in order to obtain a new proof of Specker's theorem on typical ambiguity [3]. In the present paper we imbed the recursively undecidable theory TR of a single transitive-reflexive relation in an arbitrary stratified theory T such that T ? ATT and so reduce the problem of derivability in TR to the same problem for T. From this it follows that ATT is hereditarily undecidable, i.e. ATT has no decidable subtheories.