An error analysis for absolute and relative approximation

We consider the vectorial algorithm for finding best polynomial approximationsp P _n to a given functionf C[a, b], with respect to the norm · _s , defined byp – f _s =w ₁ (p – f)+w ₂ (p – f) A bound for the modulus of continuity of the best vectorial approximation operator is given, and using the floating point calculus of J. H. Wilkinson, a bound for the rounding error in the algorithm is derived. For givenf, these estimates provide an indication of the conditioning of the problem, an estimate of the obtainable accuracy, and a practical method for terminating the iteration.This paper was supported in part by the Canadian NCR A-8108, FCAC 74-09 and G.E.T.M.A.Part of this research was done during the first-named author's visit to theB! Chair of Applied Mathematics, University of Athens, Spring term, 1975.     

Tritronquée Solutions of Perturbed First Painlevé Equations

We consider solutions of the class of ODEs y=6y ²–x , which contains the first Painlevé equation (PI) for =1. It is well known that PI has a unique real solution (called a tritronquée solution) asymptotic to and decaying monotonically on the positive real line. We prove the existence and uniqueness of a corresponding solution for each real nonnegative 1.     

On the approximation by rational combinations of a class of functions

() [0,1] — {(n)} — , +. , f(x) [0,1] () , x ₁ ,x ₂ [0, 1], (₁)=(₂), f(x ₁ )=f(x ₂ ).     

Über eine Verallgemeinerung der Nicoletti-Aufgabe für Funktional-Differentialgleichungen mit voreilendem Argument

We consider a functional differential equation (1) (t)=F(t,) fort[0,+) together with a generalized Nicoletti condition (2)H()=. The functionF: [0,+)×C ⁰[0,+)B is given (whereB denotes the Banach space) and the value ofF (t, ) may depend on the values of (t) fort[0,+);H: C ⁰[0,+)B is a given linear operator and B. Under suitable assumptions we show that when the solution :[0,+)B satisfies a certain growth condition, then there exists exactly one solution of the problem (1), (2).     

Stellare Abänderungen und Schälbarkeit von Komplexen und Polytopen

Brugesser and Mani proved that the boundary-complex of a convex polytope can be shelled. This result lead to McMullen's proof of the Upper-bound-conjecture. We show that the shellability of complexes has a close connection to the theory of stellar operations. Several results on special shelling procedures and on non-shellable complexes are obtained.     

Target-Oriented Branch and Bound Method for Global Optimization

We introduce a very simple but efficient idea for branch and bound (&) algorithms in global optimization (GO). As input for our generic algorithm, we need an upper bound algorithm for the GO maximization problem and a branching rule. The latter reduces the problem into several smaller subproblems of the same type. The new & approach delivers one global optimizer or, if stopped before finished, improved upper and lower bounds for the problem. Its main difference to commonly used & techniques is its ability to approximate the problem from above and from below while traversing the problem tree. It needs no supplementary information about the system optimized and does not consume more time than classical & techniques. Experimental results with the maximum clique problem illustrate the benefit of this new method.     

Large transversals to small families of unit disks

Summary It is proved that if the nonempty intersection of bounded closed convex sets AnB is contained in (A + F)U(B+F) and one of the following holds true: (i) the space X is less-than-three dimensional, (ii) AUB is convex, (iii) F is a one-point set, then AnBCA+F or AnBCB+F (Theorems 2 and 3). Moreover, under some hypotheses the characterization of A and B such that AnB is a summand of AUB is given (Theorem 3).     

Some functional inequalities and their Baire category properties

Summary In the paper we consider, from a topological point of view, the set of all continuous functionsf:I I for which the unique continuous solution:I – [0, ) of(f(x)) (x, (x)) and(x, (x)) (f(x)) (x, (x)), respectively, is the zero function. We obtain also some corollaries on the qualitative theory of the functional equation(f(x)) = g(x, (x)). No assumption on the iterative behaviour off is imposed.     

A Niche Width Model of Optimal Specialization

Niche width theory, a part of organizational ecology, predicts whether specialist or generalist forms of organizations have higher fitness, in a continually changing environment. To this end, niche width theory uses a mathematical model borrowed from biology. In this paper, we first loosen the specialist-generalist dichotomy, so that we can predict the optimal degree of specialization. Second, we generalize the model to a larger class of environmental conditions, on the basis of the model's underlying assumptions. Third, we criticize the way the biological model is treated in sociological theory. Two of the model's dimensions seem to be confused, i.e., that of trait and environment; the predicted optimal specialization is a property of individual organizations, not of populations; and, the distinction between fine and coarse grained environments is superfluous.     

Chebyshev Solution of the Nearly-Singular One-Dimensional Helmholtz Equation and Related Singular Perturbation Equations: Multiple Scale Series and the Boundary Layer Rule-of-Thumb

The one-dimensional Helmholtz equation, ² u _xx –u=f(x), arises in many applications, often as a component of three-dimensional fluids codes. Unfortunately, it is difficult to solve for 1 because the homogeneous solutions are exp(±x/), which have boundary layers of thickness O(1/). By analyzing the asymptotic Chebyshev coefficients of exponentials, we rederive the Orszag–Israeli rule [16] that Chebyshev polynomials are needed to obtain an accuracy of 1% or better for the homogeneous solutions. (Interestingly, this is identical with the boundary layer rule-of-thumb in [5], which was derived for singular functions like tanh([x–1]/).) Two strategies for small are described. The first is the method of multiple scales, which is very general, and applies to variable coefficient differential equations, too. The second, when f(x) is a polynomial, is to compute an exact particular integral of the Helmholtz equation as a polynomial of the same degree in the form of a Chebyshev series by solving triangular pentadiagonal systems. This can be combined with the analytic homogeneous solutions to synthesize the general solution. However, the multiple scales method is more efficient than the Chebyshev algorithm when is very, very tiny.     

Moduli of smoothness and best approximation in the spacesL p , 0<p<1

L ^p , 0<<1, .     

Certain nonlocal problems for two-dimensional equations of motion of Oldroyd fluids

The solvability of a boundary-value problem on the semi-axis t0 is studied for two-dimensional equations of motion of Oldroyd fluids (1), and with trivial problem data a proof is given of the existence of a solution which is periodic with respect to t and has the period . This solution has an absolute term which is also periodic with respect to t and has the period . Substantiation is given for the principle of linearization (first Liapunov method) in the theory of the exponential stability of solutions at t.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 189, pp. 101–121, 1991.     

A quantitative refinement of Rado's theorem

The fundamental result of the paper is the following. Theorem: Let be a k-quasiconformal Jordan curve and let be another Jordan curve (not necessarily quasiconformal). Assume that f maps conformallyext ontoext , f()=, f()>0. We assume that there exists a homeomorphism between and such that Then there exist numbers =(k)>0 and A=A(k), such that f(())– A, .Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 157, pp. 103–112, 1987.     

Martingale Hardy spaces,BMO and VMO spaces with nonlinearly ordered stochastic basis

VMO. , ⁺, «» VMO . « » .     

Fredholm integro-differential equation

We consider numerical solution of an integro-differential equation with nonsmooth initspaial values. Unique solvability in Sobolev spaceW ₂ (0, 1), =1,2, is proved. We establish the rate of convergence of the approximate solution to the exact solution in fractional spacesW ₂ ⁺¹ , 01, with approximation order O(h ^++1/2 ) for 01/2 andO(h ⁺¹ |ln h|1/2, for 1/2 #x2264;1.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 64, pp. 8–16, 1988.     

Measure properties of the set of initial data yielding non uniqueness for a class of differential inclusions

We study uniqueness property for the Cauchy problemxV(x), x(0)=, whereVR ⁿR is a locally Lipschitz continuous, quasiconvex function (i.e. the sublevel sets {Vc} are convex) and V(x) is the generalized gradient ofV atx. We prove that if 0V(x) forV(x)b, then the set of initial data {V=b} yielding non uniqueness of solution in a geometric sense has (n–1)-dimensional Hausdorff measure zero in {V=b}.     

An Iterative Approach to Quadratic Optimization

Assume that C ₁, . . . , C _N are N closed convex subsets of a real Hilbert space H having a nonempty intersection C. Assume also that each C _i is the fixed point set of a nonexpansive mapping T _i of H. We devise an iterative algorithm which generates a sequence (x _n ) from an arbitrary initial x ₀H. The sequence (x_n) is shown to converge in norm to the unique solution of the quadratic minimization problem min _xC (1/2)Ax, x–x, u, where A is a bounded linear strongly positive operator on H and u is a given point in H. Quadratic–quadratic minimization problems are also discussed.     

On the solution of a generalized Schrödinger-type equation

Lu(t)+(u,F)g(t)=f(t), tS. , ( F, g). .

---

---

The authors wish to thank Professor Yu. A. Rozanov for his help and discussions.     

Functional Approach of Large Deviations in General Spaces

Let X be a topological space, ( ) a net of Borel probability measures on X, and (t) a net in ]0,[ converging to 0. Let be a set of continuous functions such that for all x X that can be suitably distinguished by some continuous functions from any closed set not containing contains such a distinguishing function. Assuming that exists for all , we give a sufficient condition in order that ( ₎ satisfies a large deviation principle with powers (t₎ and not necessary tight rate function. When X is completely regular (not necessary Hausdorff), this condition is also necessary, and so strictly weaker than exponential tightness; this allows us to strengthen Brycs theorem in various ways. We give the general form of a rate function in terms of . A Prohorov-type theorem with a weaker notion than exponential tightness is obtained, which improves known results.     

Runge property and multiplicity of solutions for elliptic equations in ℝN with a monotone nonlinearity

In this paper, we describe a method for extending (in some approximated sense) solutions of a nonlinear P.D.E. on a domain , to solutions in a domain containing . Such an extension property, the Runge property, is well known for a large class of linear problems including elliptic equations. We prove here the Runge property for semilinear problems of the kind -u+g(u)=f, with f L _loc ¹ (^N). (As a consequence, we get infinitely many solutions for these problems). The proof is based on a homotopy method, and requires a refinement of the linear results: We prove that the Runge extension v on of a solution u in for a linear elliptic equation Lu=f can be choosen in order to depend continuously on u and the coefficients of L.