Renormalization group second‐order approximation for singularly perturbed nonlinear ordinary differential equations

We consider a 2 time scale nonlinear system of ordinary differential equations. The small parameter of the system is the ratio ϵ of the time scales. We search for an approximation involving only the slow time unknowns and valid uniformly for all times at order O(ϵ²). A classical approach to study these problems is Tikhonov's singular perturbation theorem. We develop an approach leading to a higher order approximation using the renormalization group (RG) method. We apply it in 2 steps. In the first step, we show that the RG method allows for approximation of the fast time variables by their RG expansion taken at the slow time unknowns. Next, we study the slow time equations, where the fast time unknowns are replaced by their RG expansion. This allows to rigorously show the second order uniform error estimate. Our result is a higher order extension of Hoppensteadt's work on the Tikhonov singular perturbation theorem for infinite times. The proposed procedure is suitable for problems from applications, and it is computationally less demanding than the classical Vasil'eva‐O'Malley expansion. We apply the developed method to a mathematical model of stem cell dynamics.     

On the no-slip boundary conditions for squeeze flow of viscous fluids

A typical class of boundary conditions for squeeze flow problems in lubrication approximation is the one in which the squeezing rate and the width between the squeezing plates are constant. This hypothesis is justified by claiming that the plates moves so slowly that they can be considered static. In this short note we prove that this assumption leads to a contradiction and hence cannot be used.     

非线性玻尔兹曼方程的傅里叶谱方法

玻尔兹曼方程作为空气动理学中最基本的方程之一,是连接微观牛顿力学和宏观连续介质力学的重要桥梁.该方程描述了一个由大量粒子组成的复杂系统的非平衡态时间演化:除了基本的输运项,其最重要的特性是粒子间的相互碰撞由一个高维,非局部且非线性的积分算子来描述,从而给玻尔兹曼方程的数值求解带来非常大的挑战.在过去的二十年间,基于傅里叶级数的谱方法成为了数值求解玻尔兹曼方程的一种很受欢迎且有效的确定性算法.这主要归功于谱方法的高精度及它可以被快速傅里叶变换加速的特质.本文将回顾玻尔兹曼方程的傅里叶谱方法,具体包括方法的导出,稳定性和收敛性分析,快速算法,以及在一大类基于碰撞的空气动理学方程中的推广.     

Non-perturbative QCD amplitudes in quenched and eikonal approximations

Even though approximated, strong coupling non-perturbative QCD amplitudes remain very difficult to obtain. In this article, in eikonal and quenched approximations at least, physical insights are presented that rely on the newly-discovered property of effective locality. The present article also provides a more rigorous mathematical basis for the crude approximations used in the previous derivation of the binding potential of quarks and nucleons. Furthermore, the techniques of Random Matrix calculus along with Meijer G-functions are applied to analyze the generic structure of fermionic amplitudes in QCD.     

The Chebyshev Hyperplane Optimization Problem

We consider the following problem. Given a finite set of pointsy ^j in we want to determine a hyperplane H such that the maximum Euclidean distance betweenH and the pointsy ^j is minimized. This problem(CHOP) is a non-convex optimization problem with a special structure. Forexample, all local minima can be shown to be strongly unique. We present agenericity analysis of the problem. Two different global optimizationapproaches are considered for solving (CHOP). The first is a Lipschitzoptimization method; the other a cutting plane method for concaveoptimization. The local structure of the problem is elucidated by analysingthe relation between (CHOP) and certain associated linear optimizationproblems. We report on numerical experiments.     

A numerical scheme based on mean value solutions for the helmholtz equation on triangular grids

A numerical treatment for the Dirichlet boundary value problem on regular triangular grids for homogeneous Helmholtz equations is presented, which also applies to the convection-diffusion problems. The main characteristic of the method is that an accuracy estimate is provided in analytical form with a better evaluation than that obtained with the usual finite difference method. Besides, this classical method can be seen as a truncated series approximation to the proposed method. The method is developed from the analytical solutions for the Dirichlet problem on a ball together with an error evaluation of an integral on the corresponding circle, yielding accuracy. Some numerical examples are discussed and the results are compared with other methods, with a consistent advantage to the solution obtained here.

     

New estimates for Ritz vectors

The following estimate for the Rayleigh-Ritz method is proved:

Here is a bounded self-adjoint operator in a real Hilbert/euclidian space, one of its eigenpairs, a trial subspace for the Rayleigh-Ritz method, and a Ritz pair. This inequality makes it possible to analyze the fine structure of the error of the Rayleigh-Ritz method, in particular, it shows that if an eigenvector is close to the trial subspace with accuracy and a Ritz vector is an approximation to another eigenvector, with a different eigenvalue. Generalizations of the estimate to the cases of eigenspaces and invariant subspaces are suggested, and estimates of approximation of eigenspaces and invariant subspaces are proved.

     

On numerical methods for discrete least-squares approximation by trigonometric polynomials

Fast, efficient and reliable algorithms for discrete least-squares approximation of a real-valued function given at arbitrary distinct nodes in by trigonometric polynomials are presented. The algorithms are based on schemes for the solution of inverse unitary eigenproblems and require only arithmetic operations as compared to operations needed for algorithms that ignore the structure of the problem. An algorithm which solves this problem with real-valued data and real-valued solution using only real arithmetic is given. Numerical examples are presented that show that the proposed algorithms produce consistently accurate results that are often better than those obtained by general QR decomposition methods for the least-squares problem.

     

Some properties of rational approximations of degree (k, 1) in the hardy spaceH 2(D)

We prove that the well-known interpolation conditions for rational approximations with free poles are not sufficient for finding a rational function of the least deviation. For rational approximations of degree (k, 1), we establish that these interpolation conditions are equivalent to the assertion that the interpolation pointc is a stationary point of the functionk(c) defined as the squared deviation off from the subspace of rational functions with numerator of degree k and with a given pole 1/¯c. For any positive integersk ands, we construct a functiong H₂(D) such thatR _k ,1(g)=R _k +s,1(g) > 0. whereR _k ,1(g) is the least deviation ofg from the class of rational function of degree (k, 1).Translated fromMatematicheskie Zametki, Vol. 64, No. 2, pp. 251–259, August, 1998.The author is keenly grateful to N. S. Vyacheslavov, E. P. Dolzhenko, and V. G. Zinov for useful discussions.