Extremal Polynomials on Discrete Sets

We study asymptotics for orthogonal polynomials and other extremalpolynomials on infinite discrete sets, typical examples beingthe Meixner polynomials and the Charlier polynomials. Followingideas of Rakhmanov, Dragnev and Saff, weshow that the asymptoticbehaviour is governed by a constrained extremal energy problemfor logarithmic potentials, which can be solved explicitly.We give formulas for the contracted zero distributions, thenth root asymptotics and the asymptotics of the largest zeros.1991 Mathematics Subject Classification: 42C05, 33C25, 31A15.     

Weakly Admissible Meshes and Discrete Extremal Sets

We present a brief survey on (Weakly) Admissible Meshes and corresponding Discrete Extremal Sets, namely Approximate Fekete Points and Discrete Leja Points. These provide new computational tools for polynomial least squares and interpolation on multidimensional compact sets, with different applications such as numerical cubature, digital filtering, spectral and high-order methods for PDEs.     

On the Superlinear Convergence of the Successive Approximations Method

The Ostrowski theorem is a classical result which ensures the attraction of all the successive approximations x _k+1 = G(x _k ) near a fixed point x*. Different conditions [ultimately on the magnitude of G(x*)] provide lower bounds for the convergence order of the process as a whole. In this paper, we consider only one such sequence and we characterize its high convergence orders in terms of some spectral elements of G(x*); we obtain that the set of trajectories with high convergence orders is restricted to some affine subspaces, regardless of the nonlinearity of G. We analyze also the stability of the successive approximations under perturbation assumptions.     

一个新的SQP方法及其超线性收敛性

由Ｗｉｌｓｏｎ,Ｈａｎ,Ｐｏｗｅｌｌ发展的ＳＱＰ技术是解非线性规划的最有效的方法之一,但是,如果其中的二次子规划问题无可行解或者其搜索方向向量无界,该方法ａｎ和Ｂｕｒｋｅ「３」,周广路「２」分别对二次规划问题作了修正,克服了上述矛盾,本文在「２」的基础上,进上步修正,证明在Ａｒｍｉｊｏ搜索下算法具有全局收敛性,并通过解一辅助线性方程组,利用弧式搜索,得出该方法具有超线性收敛性。     

差商变尺度法的超线性收敛性

在文[1]的基础上,本文继续研究差商变尺度法的收敛性质,从文[1]的整体收敛性出发,进一步探讨了差商变尺度法的超线性收敛的特征,同时给出了保证超线性收敛的差商步长条件。     

Strong and Weak Convergence of Rational Functions Orthogonal on the Circle

Rational functions orthogonal on the unit circle with prescribedpoles lying outside the unit circle are studied. We establisha relation between the orthogonal rational functions and theorthogonal polynomials with respect to varying measures. Usingthis relation, we extend the recent results of Bultheel, González-Vera,Hendriksen and Njåstad on the asymptotic behaviour oforthogonal rational functions.     

On the Convergence of Polynomial Approximation of Rational Functions

This paper investigates the convergence condition for the polynomial approximation of rational functions and rational curves. The main result, based on a hybrid expression of rational functions (or curves), is that two-point Hermite interpolation converges if all eigenvalue moduli of a certainr×rmatrix are less than 2, whereris the degree of the rational function (or curve), and where the elements of the matrix are expressions involving only the denominator polynomial coefficients (weights) of the rational function (or curve). As a corollary for the special case ofr=1, a necessary and sufficient condition for convergence is also obtained which only involves the roots of the denominator of the rational function and which is shown to be superior to the condition obtained by the traditional remainder theory for polynomial interpolation. For the low degree cases (r=1, 2, and 3), concrete conditions are derived. Application to rational Bernstein–Bézier curves is discussed.     

On the Convergence of Rational Functions of Best Lp-Approximation

In the present paper, for sequences of rational functions, analytic in some domain, a theorem of Montel’s type is proved. As an application, sequences of rational functions of best Lp — approximation of a function ?(z) ∈ L_p(Γ), with Γ being a closed rectifiable analytic curve, are considered. The case ?(z) ∈ Hp is discussed, too.     

Quadratic and Superlinear Convergence of the Huschens Method for Nonlinear Least Squares Problems

This paper is concerned with quadratic and superlinear convergence of structured quasi-Newton methods for solving nonlinear least squares problems. These methods make use of a special structure of the Hessian matrix of the objective function. Recently, Huschens proposed a new kind of structured quasi-Newton methods and dealt with the convex class of the structured Broyden family, and showed its quadratic and superlinear convergence properties for zero and nonzero residual problems, respectively. In this paper, we extend the results by Huschens to a wider class of the structured Broyden family. We prove local convergence properties of the method in a way different from the proof by Huschens.     

The Superlinear Convergence of a Modified BFGS-Type Method for Unconstrained Optimization

The BFGS method is the most effective of the quasi-Newton methods for solving unconstrained optimization problems. Wei, Li, and Qi [16] have proposed some modified BFGS methods based on the new quasi-Newton equation B _k+1 s _k = y* _k , where y* _k is the sum of y _k and A _k s _k, and A _k is some matrix. The average performance of Algorithm 4.3 in [16] is better than that of the BFGS method, but its superlinear convergence is still open. This article proves the superlinear convergence of Algorithm 4.3 under some suitable conditions.     

Convergence of Discrete Green's Functions for Finite Difference Schemes

AMS(MOS): 65L10

The convergence of the discrete Green's function g_h is studied for finite difference schemes approximating m-th order linear two-point boundary value problems. Schemes of noncompact form and in part of the paper also nonuniform grids are admitted. Sharp convergence results are obtained for the difference quotients of g_h up to order m-1.     

Convergence of Discrete Green Functions with Neumann Boundary Conditions

In this article we prove convergence of Green functions with Neumann boundary conditions for the random walk to their continuous counterparts. Our methods rely on local central limit theorems for convergence of random walks on discretizations of smooth domains to Reflected Brownian motion.     

Superlinear Convergence of a Stabilized SQP Method to a Degenerate Solution

We describe a slight modification of the well-known sequential quadratic programming method for nonlinear programming that attains superlinear convergence to a primal-dual solution even when the Jacobian of the active constraints is rank deficient at the solution. We show that rapid convergence occurs even in the presence of the roundoff errors that are introduced when the algorithm is implemented in floating-point arithmetic.     

On the Local and Superlinear Convergence of Quasi-Newton Methods

This paper presents a local convergence analysis for severalwell-known quasi-Newton methods when used, without line searches,in an iteration of the form to solve for x^* such that Fx^* = 0. The basic idea behind theproofs is that under certain reasonable conditions on x_o, Fand x_o, the errors in the sequence of approximations {H_k} toF'(x^*)^–1 can be shown to be of bounded deterioration inthat these errors, while not ensured to decrease, can increaseonly in a controlled way. Despite the fact that H_k is not shownto approach F'(x^*)^–1, the methods considered, includingthose based on the single-rank Broyden and double-rank Davidon-Fletcher-Powellformulae, generate locally Q-superlinearly convergent sequences{x_k}.     

Isomorphism of the Index Sets of Discrete Families of General Recursive Functions

We establish isomorphism between the index set of an arbitrary computable family of general recursive functions and the index set of a certain computable discrete family of general recursive functions.     

Subdivision Schemes of Sets and the Approximation of Set-Valued Functions in the Symmetric Difference Metric

In this work we construct subdivision schemes refining general subsets of ? ⁿ and study their applications to the approximation of set-valued functions. Differently from previous works on set-valued approximation, our methods are developed and analyzed in the metric space of Lebesgue measurable sets endowed with the symmetric difference metric. The construction of the set-valued subdivision schemes is based on a new weighted average of two sets, which is defined for positive weights (corresponding to interpolation) and also when one weight is negative (corresponding to extrapolation). Using the new average with positive weights, we adapt to sets spline subdivision schemes computed by the Lane–Riesenfeld algorithm, which requires only averages of pairs of numbers. The averages of numbers are then replaced by the new averages of pairs of sets. Among other features of the resulting set-valued subdivision schemes, we prove their monotonicity preservation property. Using the new weighted average of sets with both positive and negative weights, we adapt to sets the 4-point interpolatory subdivision scheme. Finally, we discuss the extension of the results obtained in metric spaces of sets, to general metric spaces endowed with an averaging operation satisfying certain properties.     

对称多胞形的极值性质及其应用

凸多胞形现代理论的主要成就是被称之为Dehn-Sommerville关系的上界定理和下界定理,它们属于凸多胞形的经典组合理论.本文建立了关于对称凸多胞形的两个极值定理,它们可视为凸多胞形度量理论中的上界定理和下界定理,另外给出了两个极值定理的一个应用.     

对称多胞形的极值性质及其应用

凸多胞形现代理论的主要成就是被称之为Dehn-Sommerville关系的上界定理和下界定理,它们属于凸多胞形的经典组合理论．本文建立了关于对称凸多胞形的两个极值定理,它们可视为凸多胞形度量理论中的上界定理和下界定理,另外给出了两个极值定理的一个应用．     

Sets of Uniform Convergence of Fourier Expansions of Piecewise Smooth Functions

For Fourier expansions of piecewise smooth functions associated with an elliptic operator of order m in Rⁿ, the sets of uniform convergence are described.