The Parametric Buffer Phenomenon for a Singularly Perturbed Telegraph Equation with a Pendulum Nonlinearity

We consider the boundary-value problem u _tt + u _t + (1 + cos2)sin u =² u _xx, u _x|_x=0=u_x|_x==0, where 0<1, =(1+)t, ,> 0, and the sign of is arbitrary. It is proved that for an appropriate choice of the external parameters and and for sufficiently small the number of exponentially stable solutions 2-periodic in can be made equal to an arbitrary predefined number.     

On a variational problem with lack of compactness: the topological effect of the critical points at infinity

We study the subcritical problemsP :–u=u ^p–,u>0 on;u=0 on , being a smooth and bounded domain in ^N,N–3,p+1=2N/N–2 the critical Sobolev exponent and >0 going to zero — in order to compute the difference of topology that the critical points at infinity induce between the level sets of the functional corresponding to the limit case (P₀).

---

Résumé Nous étudions les problèmes sous-critiquesP :–u=u ^p–,u > 0 sur;u=0 sur –où est un domaine borné et régulier de ^N,N–3,p + 1=2N/N –2 est l'exposant critique de Sobolev, et >0 tend vers zéro, afin de calculer la différence de toplogie induite par les points critiques à l'infini entre les ensembles de niveau de la fonctionnelle correspondant au cas limite (P₀).

     

Une méthode numérique pour le calcul des points de retournement. Application à un problème aux limites non-linéaire

Summary A finite element method (P₁) with numerical integration for approximating the boundary value problem –u=e ^u is considered. It is shown that the discrete problem has a solution branch (with turning point) which converges uniformely to a solution branch of the continuous problem. Error estimates are given; for example it is found that , >0, where ₀ and _h ⁰ are critical values of the parameter for continuous and discrete problems.

     

Speed of convergence as a function of given accuracy for random search methods

The essence of this article lies in a demonstration of the fact that for some random search methods (r.s.m.) of global optimization, the number of the objective function evaluations required to reach a given accuracy may have very slow (logarithmic) growth to infinity as the accuracy tends to zero. Several inequalities of this kind are derived for some typical Markovian monotone r.s.m. in metric spaces including thed-dimensional Euclidean space ^d and its compact subsets. In the compact case, one of the main results may be briefly outlined as a constructive theorem of existence: if is a first moment of approaching a good subset of-neighbourhood ofx ₀=arg maxf by some random search sequence (r.s.s.), then we may choose parameters of this r.s.s. in such a way that E c(f) In² . Certainly, some restrictions on metric space and functionf are required.     

Simple modules over the multiparameter quantum function algebra at roots of 1

We construct essentially all the irreducible modules for the multiparameter quantum function algebraF [G], whereG is a simple simply connected complex algebraic group, and is a root of unity.     

A note on quasi-periodic solutions of some elliptic systems

We extend a recent method of proof of a theorem by Kolmogorov on the conservation of quasi-periodic motion in Hamiltonian systems so as to prove existence of (uncountably many) real-analytic quasi-periodic solutions for elliptic systems u=f _x (u, y), whereu y ^M u(y) ^N ,f=f(x, y) is a real-analytic periodic function and is a small parameter. Kolmogorov's theorem is obtained (in a special case) whenM=1 while the caseN=1 is (a special case of) a theorem by J. Moser on minimal foliations of codimension 1 on a torusT ^M +1. In the autonomous case,f=f(x), the above result holds for any .     

Perturbation of the poles of the scattering matrix under variation of the boundary condition

The behavior of the poles z_n(), n=1,2,... of the scattering matrix of the operatorl u=–u(x), x , (u/n)+(x)u|=0 as 0 is considered. It is proved that |z_n()–z_n|=0(^(1/2)qn), where q_n is the order of the pole of the scattering matrix for the operator ₀u=–u, u/=0.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 117, pp. 183–191, 1981.     

Superstable implicit Runge-Kutta methods for second order initial value problems

Using the well known properties of thes-stage implicit Runge-Kutta methods for first order differential equations, single step methods of arbitrary order can be obtained for the direct integration of the general second order initial value problemsy=f(x, y, y),y(x _o)=y _o,y(x _o)=y _o. These methods when applied to the test equationy+2y+ ² y=0, ,0, +>0, are superstable with the exception of a finite number of isolated values ofh. These methods can be successfully used for solving singular perturbation problems for which f/y and/or f/y are negative and large. Numerical results demonstrate the efficiency of these methods.     

A fast solver for the first biharmonic boundary value problem

Summary This paper provides a fast and storage-saving method for the solution of the first biharmonic boundary value problem (b.v.p.). The b.v.p. is approximated via a special variational finite difference technique suggested earlier by V.G. Korneev. It is shown theoretically that our method produces an approximate solution to the finite difference equations inO(NlnNln^–1) arithmetical operations, whereN is the number of unknowns and (0<<1) denotes the relative accuracy required. The numerical results obtained by our computer code CGMFC decisively substantiate the theoretical estimates given.     

Finite activation energy reactions Part II: A reactive ridge

Summary The effect is determined of a large,O( ^–2),1, activation energy on the thermal stability of a reactant in the form of a two-dimensional ridge, undergoing a steady zero-order exothermic reaction. The reactive ridge decreases in depth at a rate ofO( ²) from a maximum ofO(1). The Biot number of the uniform lower surface of the reactant is taken to be zero and of the upper surface to beO( ^–2). The critical Frank-Kamenetskii parameter is determined toO( ²).     

A practical finite element approximation of a semi-definite Neumann problem on a curved domain

Summary This paper considers the finite element approximation of the semi-definite Neumann problem: –·(u)=f in a curved domain ⁿ (n=2 or 3), on and , a given constant, for dataf andg satisfying the compatibility condition . Due to perturbation of domain errors ( ^h ) the standard Galerkin approximation to the above problem may not have a solution. A remedy is to perturb the right hand side so that a discrete form of the compatibility condition holds. Using this approach we show that for a finite element space defined overD ^h , a union of elements, with approximation powerh ^k in theL ² norm and with dist (, ^h )Ch ^k , one obtains optimal rates of convergence in theH ¹ andL ² norms whether ^h is fitted ( ^h D ^h ) or unfitted ( ^h D ^h ) provided the numerical integration scheme has sufficient accuracy.Partially supported by the National Science Foundation, Grant #DMS-8501397, the Air Force Office of Scientific Research and the Office of Naval Research     

Stefan problem with a kinetic and the classical conditions at the free boundary

The Stefan problem is considered with the kinetic condition u⁺=u^–=k(y, )-v at the phase interface, where k(y, ) is the half-sum of the principal curvatures of the free boundary and v is the speed of its shifting in the direction of a normal. The solvability of a modified Stefan problem in spaces of smooth functions and the convergence of its solutions as 0 to a solution of the classical Stefan problem are proved.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 44, No. 2, pp. 155–166, February, 1992.     

Validity of the multiple scale method for very long intervals

For a class of nonlinear oscillation problems containing a small parameter, it is known that a two-scale method using timest and t gives results valid to any desired order for time (1/). We ask when results can be obtained which are valid for (1/²) or for allt > 0. We show that there is an obstruction to introducing a third time scale ² t, and give an example in which this obstruction does not vanish, so that a third scale cannot be introduced, even though the solution exists for all time. The obstruction does vanish if the first order averaged equation vanishes, in which case the three-scale solution actually involves onlyt and ² t and is valid for time (1/²). The obstruction also vanishes if a certain contracting or dissipative condition is met, but in this case the two-scale solution is already valid for all time and the third scale is not needed. These results correspond to known results for the method of averaging, but are here proved for the multiple scale method without use of averaging.     

Construction of ɛ-nets

LetS be a set ofn points in the plane and let be a real number, 0<<1. We give a deterministic algorithm, which in timeO(n ^–2 log(1/)+ ^–8) (resp.O(n ^–2 log(1/)+ ^–10) constructs an-netNS of sizeO((1/) (log(1/))²) for intersections ofS with double wedges (resp. triangles); this means that any double wedge (resp. triangle) containing more thatn points ofS contains a point ofN. This givesO(n logn) deterministic preprocessing for the simplex range-counting algorithm of Haussler and Welzl [HW] (in the plane).We also prove that given a setL ofn lines in the plane, we can cut the plane intoO( ^–2) triangles in such a way that no triangle is intersected by more thann lines ofL. We give a deterministic algorithm for this with running timeO(n ^–2 log(1/)). This has numerous applications in various computational geometry problems.     

Asymptotic expansions for bivariate von Mises functionals

Summary A Berry-Essen result and asymptotic expansions are derived for the distribution of bivariate von Mises functionals under moment and smoothness conditions.The results apply to the Cramér-von Mises ² — statistic as well as to the Central Limit Theorem in Hilbert space, yielding a convergence rate O(n _–1+) for every >0 on centered ellipsoids.Herrn Professor Dr. Leopold Schmetterer zu Ehren seines sechzigsten Geburtstages gewidmet     

Implicit elliptic boundary-value problems with discontinuous nonlinearities

Let be a bounded domain in ⁿ (n3) having a smooth boundary, let be an essentially bounded real-valued function defined on × ^h, and let be a continuous real-valued function defined on a given subset Y of Y ^h. In this paper, the existence of strong solutions u W ^2,p (, ^h) W _o ^1,p (n/2<p<+) to the implicit elliptic equation (–u)=(x,u), with u=(u₁, u₂, ..., u_h) and u=(u ₁, u ₂, ..., u _h), is established. The abstract framework where the problem is placed is that of set-valued analysis.     

Stability radius of polynomials occurring in the numerical solution of initial value problems

This paper deals with polynomial approximations(x) to the exponential function exp(x) related to numerical procedures for solving initial value problems. Motivated by stability requirements, we present a numerical study of the largest diskD()={z C: |z+|} that is contained in the stability regionS()={z C: |(z)|1}. The radius of this largest disk is denoted byr(), the stability radius. On the basis of our numerical study, several conjectures are made concerningr _m,p=sup {r(): _m,p}. Here _{m, p} (1pm; p, m integers) is the class of all polynomials(x) with real coefficients and degree m for which(x)=exp(x)+O(x ^p+1) (forx 0).     

Temps de vie des solutions régulières des équations d'Euler compressibles axisymétriques en dimension deux

Résumé Nous considérons le système des équations d'Euler isentropiques en dimension deux; pour des données initiales invariantes par rotation et perturbations de taille d'un état de repos, on établit un équivalent du temps de vieT de la solution classique (lim ² T = _* ² ).De plus, on donne, pour une estimation de la vraie solution, en calculant la taille de son écart à une solution approchée construite dans un précédent travail.

---

Summary We consider the 2D isentropic Euler equations; for rotationnally invariant data which are a perturbation of size of a rest state, we establish the first term asymptotic of the life spanT of the classical solution (lim ² T = _* ² ).Moreover, we give, for an estimate of the true solution, by computing the size of its difference with an approximate solution obtained in a previous work.

---

---

Oblatum 2-XII-1991 & 24-IX-1992     

Total flux estimates for a finite element approximation of the Dirichlet problem using the boundary penalty method

Summary This paper considers a fully practical piecewise linear finite element approximation of the Dirichlet problem for a second order self-adjoint elliptic equation,Au=f, in a smooth region< ⁿ (n=2 or 3) by the boundary penalty method. Using an unfitted mesh; that is ^h , an approximation of with dist (, ^h )Ch ² is not in general a union of elements; and assuminguH ⁴ () we show that one can recover the total flux across a segment of the boundary of with an error ofO(h ²⁾. We use these results to study a fully practical piecewise linear finite element approximation of an elliptic equation by the boundary penalty method when the prescribed data on part of the boundary is the total flux.Supported by a SERC research studentship     

Orderh 2 method for a singular two-point boundary value problem

A method is described based on auniform mesh for the singular two-point boundary value problem:y+(/x)y+f(x, y)=0, 0<x1,y(0)=0,y(1)=A, and it is shown to be orderh ² convergent forall 1.