Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions

A domain partitioning algorithm for minimizing or maximizing a Lipschitz continuous function is enhanced to yield two new, more efficient algorithms. The use of interval arithmetic in the case of rational functions and the estimates of Lipschitz constants valid in subsets of the domain in the case of others and the addition of local optimization have resulted in an algorithm which, in tests on standard functions, performs well.     

关于Fejer点上的一种复有理型插值的一致逼近阶

设D是一个Jordan,Г为其边界，并设Г满足Aльпер条件。本文得到了一种基于Fejer点的有理型插值算子对于f(z)∈C（Г）的一致逼近阶。     

Linearized and rational approximation method for solving non‐linear Burgers' equation

A new numerical method called linearized and rational approximation method is presented to solve non‐linear evolution equations. The utility of the method is demonstrated for the case of differentiation of functions involving steep gradients. The solution of Burgers' equation is presented to illustrate the effectiveness of the technique for the solution of non‐linear evolution equations exhibiting nearly discontinuous solutions. Copyright © 2004 John Wiley & Sons, Ltd.     

The Linear Rational Pseudospectral Method with Preassigned Poles

We present a linear rational pseudospectral (collocation) method with preassigned poles for solving boundary value problems. It consists in attaching poles to the trial polynomial so as to make it a rational interpolant. Its convergence is proved by transforming the problem into an associated boundary value problem. Numerical examples demonstrate that the rational pseudospectral method is often more efficient than the polynomial method.     

“矩阵有理插值及其误差公式”一文的注

本文对文[1]中所给出的错误的误差公式做了修订,并给出了相应的证明。     

第二类变型Bessel函数的Chebyshev逼近

第二类变型Bessel函数Kn(z)在自变量趋于无穷时就是指数变小的，使用多项式逼近的方法求解往往误差很大．采用指数变换和J．P．Boyd的有理Chebyshev多项式计算第二类变型Bessel函数，得到了令人满意的在较大范围内有效的解．     

Rational approximation in the complex plane using a τ-method and computer algebra

Numerous versions of the Lanczos τ-methods have been extensively used to produce polynomial approximations for functions verifying a linear differential equation with polynomial coefficients. In the case of an initial-value problem, an adapted τ-method based on Chebyshev series and the use of symbolic computation lead to a rational approximation of the solution on a region of the complex plane. Numerical examples show that the simplicity of the method does not prevent a high accuracy of results. This revised version was published online in June 2006 with corrections to the Cover Date.     

THE STEP-TRANSITION OPERATORS FOR MULTI-STEP METHODS OF ODE'S

1.'IntroductionThedisad~ageofsymplecticmethodsinusingtheinformationfrompasttimestepsleadstotheirneedingmorefunctionevaluationthannonsymplecticmethods.Thisdisadvantagecanbeovercomeifonecouldconstructsymplecticmulti-stepmethods.But'theaestProblemshouldbesolvedistogiveoutthedefinitionofsymplecticmultistepmethod.Ulltilnow,apopularideaisthatanm-stepmethodonMmaybewrittenasaone-stepmethodonMa.Inpaper12,71,theauthorshaveinvestigatedthecircumstanceunderWhichadifferenceschemecanpreservetheproductsympl…     

Fast computation of a rational point of a variety over a finite field

We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time-space complexity is roughly quadratic in the logarithm of the cardinality of the field and a geometric invariant of the input system. This invariant, called the degree, is bounded by the Bézout number of the system. Our algorithm works for fields of any characteristic, but requires the cardinality of the field to be greater than a quantity which is roughly the fourth power of the degree of the input variety.

     

关于艾森斯坦因判别法的间接应用

探讨了间接应用艾森斯坦因判别法判断整系数多项式在有理数域上不可约的两种途径.