A -functional and the rate of convergence of some linear polynomial operators

We show that the -functional

where , is equivalent to the rate of convergence of a certain linear polynomial operator. This operator stems from a Riesz-type summability process of expansion by Legendre polynomials. We use the operator above to obtain a linear polynomial approximation operator with a rate comparable to that of the best polynomial approximation.

     

Degenerate polynomial patches of degree 11 for almostGC 2 interpolation over triangles

We consider the problem of interpolating scattered data in ³ by analmost geometrically smoothGC ² surface, where almostGC ² meansGC ² except in a finite number of points (the vertices), where the surface isGC ¹. A local method is proposed, based on employing so-called degenerate triangular Bernstein-Bézier patches. We give an analysis of quintic patches forGC ¹ and patches of degree eleven for almostGC ² interpolation.     

C 1 surface interpolation with constraints

Givenn pairwise distinct and arbitrarily spaced pointsP _i in a domainD of thex–y plane andn real numbersf _i, consider the problem of computing a bivariate functionf(x, y) of classC ¹ inD whose values inP _i are exactlyf _i,i=1,,n, and whose first or second order partial derivatives satisfy appropriate equality and inequality constraints on a given set ofp pointsQ _l inD.In this paper we present a method for solving the above problem, which is designed for extremely large data sets. A step of this method requires the solution of a large scale quadratic programming (QP) problem.The main purpose of this work is to analyse an iterative method for determining the solution of this QP problem: such a method is very efficient and well suited for parallel implementation on a multiprocessor system.Work supported by MURST Project of Computational Mathematics, Italy.     

Glass capillary gas chromatography of amino acid enantiomers

Glass capillaries coated with Chirasil-Val, a chirally functionalised polysiloxane, are capable in principle of resolving all protein amino-acid enantiomers in a single run and within a short analysis time, thus allowing for example the quantitative amino acid determination by enantiomer labelling. The elution characteristics of the individual amino acids however are also dependent upon the chemical nature of the capillary wall surface, and a surface pretreatment is found to be necessary if all protein amino acids are to be analysed. Of the various methods of pretreatment tested, etching of borosilicate glass with gaseous HCl followed by deposition of colloidal silicic acid is considered to be the most suitable.     

Generalizations of Slater's constraint qualification for infinite convex programs

In this paper we study constraint qualifications and duality results for infinite convex programs (P) = inf{f(x): g(x) – S, x C}, whereg = (g ₁,g ₂) andS = S ₁ ×S ₂,S _i are convex cones,i = 1, 2,C is a convex subset of a vector spaceX, andf andg _i are, respectively, convex andS _i -convex,i = 1, 2. In particular, we consider the special case whenS ₂ is in afinite dimensional space,g ₂ is affine andS ₂ is polyhedral. We show that a recently introduced simple constraint qualification, and the so-called quasi relative interior constraint qualification both extend to (P), from the special case thatg = g ₂ is affine andS = S ₂ is polyhedral in a finite dimensional space (the so-called partially finite program). This provides generalized Slater type conditions for (P) which are much weaker than the standard Slater condition. We exhibit the relationship between these two constraint qualifications and show how to replace the affine assumption ong ₂ and the finite dimensionality assumption onS ₂, by a local compactness assumption. We then introduce the notion of strong quasi relative interior to get parallel results for more general infinite dimensional programs without the local compactness assumption. Our basic tool reduces to guaranteeing the closure of the sum of two closed convex cones.     

Use of Local Lagrange Interpolation for calculation of retention indices in linear temperature-programmed gas chromatrography

Summary The influence of the isothermal temperature, program rate, initial temperature and flow rate on retention indices was studied. The methods of Kováts, Van Den Dool and Local Lagrange Interpolation are compared. Ten experimental measurements were carried out on a capillary column coated with OV-101 stationary phase.     

Trivariate Polynomial Natural Spline for 3D Scattered Data Hermit Interpolation

Consider a kind of Hermit interpolation for scattered data of 3D by trivariate polynomial natural spline,such that the objective energy functional (with natural boundary conditions) is minimal.By the s...     

水面舰艇编队的最佳防空队形探讨

最佳防御队形以编队对来袭导弹的可探测面积尽可能大为前提,并以"抗饱和攻击能力"为衡量标准.各方向的可拦截批次受两方面因素限制:一是来袭导弹被发现时其与指挥舰的距离,一般距离越大,防御准备就越充分,可拦截批次就越大;二是护卫舰到来袭导弹轨迹的距离,一般距离越小,单次拦截时间就越短,可拦截批次就越大.定义以概率1可拦截批次最小的方向为最危险方向,经计算初始队形各方向可拦截的批次不等,通过"削峰补谷"的方式予以均衡和优化.若以拦截批次的期望为标准,最危险方向与以概率1可拦截的批次为标准的结果相同.如果得到空中预警机的信息支援,在最危险方向上编队就可更早地对距离指挥舰148.4km远的导弹发起拦截,增大编队的抗饱和攻击能力,但由于防空导弹射程限制,预警机提供的信,息支援无法得到充分利用,此时限制编队抗饱和攻击能力的主要矛盾转向防空导弹的射程.     

On the numerical feasibility of continuation methods for nonlinear programming problems

In the present paper the radius of convergence of a class of locally convergent nonlinear programming algorithms (containing Robinson's and Wilson's methods) applied to a parametric nonlinear programming problem is estimated. A consequence is the numerical feasibility of globalizations of Robinson's and Wilson's methods by means of continuation techniques.     

On the signal degradation induced by the interpolation and the sampling rate reduction in aeroacoustics hybrid methods

Taking place within more extensive work that focuses on hybrid methods in aeroacoustics, the present study is devoted to the data transfer operations that are to be performed between two stages of a hybrid calculation. More precisely, the article focuses on two typical operations that usually accompany such data transfer, which are (i) the sampling rate reduction and (ii) the interpolation of the unsteady perturbations to be transmitted from one stage to the other. First part of the paper analyzes the two main issues of such operations, which are the spuriousing and the aliasing phenomena. For doing so, the usual notions of the interpolation theory are revisited before they are synthesized within an original approach. The here proposed formalism allows to understand better both the spuriousing and the aliasing phenomena, as well as to accurately predict the impact of the latter on the data to be transmitted in terms of signal degradation. Second part of the paper provides an illustration and a validation of these theoretical developments via a direct application to a typical aerodynamic noise problem (aeroacoustic emission by a 2D cylinder cross flow). There, it is further shown how the here proposed formalism can help in improving aeroacoustics hybrid calculations by predicting (and thus possibly minimizing) the bias to be induced on the acoustic extrapolation stage because of the aliasing and/or spuriousing effects inherited from the sampling rate reduction and/or interpolation of CFD data—which is likely to occur in any hybrid scenario. Copyright © 2012 John Wiley & Sons, Ltd.