Rational Chebyshev approximation on the unit disk

Summary In a recent paper we showed that error curves in polynomial Chebyshev approximation of analytic functions on the unit disk tend to approximate perfect circles about the origin [23]. Making use of a theorem of Carathéodory and Fejér, we derived in the process a method for calculating near-best approximations rapidly by finding the principal singular value and corresponding singular vector of a complex Hankel matrix. This paper extends these developments to the problem of Chebyshev approximation by rational functions, where non-principal singular values and vectors of the same matrix turn out to be required. The theory is based on certain extensions of the Carathéodory-Fejér result which are also currently finding application in the fields of digital signal processing and linear systems theory.It is shown among other things that iff(z) is approximated by a rational function of type (m, n) for >0, then under weak assumptions the corresponding error curves deviate from perfect circles of winding numberm+n+1 by a relative magnitudeO( ^{m + n + 2} as 0. The CF approximation that our method computes approximates the true best approximation to the same high relative order. A numerical procedure for computing such approximations is described and shown to give results that confirm the asymptotic theory. Approximation ofe ^z on the unit disk is taken as a central computational example.     

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.     

Functions with a finite dirichlet integral in a domain with cusp points on the boundary

Let be a domain in ⁿ, n >2, the boundary of which has a cusp point, pointing inside or outside the domain. The purpose of the paper is to characterize the traces on of the elements of the space H¹() of functions with a finite Dirichlet integral. As a consequence one establishes the existence of a linear continuous extension operator H¹ () H¹(ⁿ) under the presence of an interior cusp point on . Theorems on domains with cusps are proved with the aid of results on cylindrical domains. In the space of functions with a finite Dirichlet integral in the exterior or the interior of the cylinder one introduces the norm, depending on a small parameter and generating a norm of the trace on as an element of the quotient space. The latter is placed in correspondence with an explicitly described norm of functions on the boundary, uniformly equivalent relative to . One constructs an operator of extension of functions from the exterior of the cylinder to Rⁿ, preserving H¹, whose norm is uniformly bounded relative to . For the optimal operator of extension from the inside of the cylinder one finds the asymptotic behavior of the norm as 0. From these results there follow similar theorems on functions with a finite Dirichlet integral inside and outside a thin closed tube (of width ).Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 126, pp. 117–137, 1983.     

Errors in approximate solutions of Cauchy's problem for a first-order quasilinear equation

The proximity is investigated of the solution of Cauchy's problem for the equation u _t +((u))_x= u _xx ((u) > 0) to the solution of Cauchy's problem for the equation u_t+ ((u))_x= 0, when the solution of the latter problem has a finite number of lines of discontinuity in the strip 0 t T. It is proved that, everywhere outside a fixed neighborhood of the lines of discontinuity, we have |u–u| C, where the constant C is independent of. Similar inequalities are derived for the first derivatives of u–u.Translated from Matematicheskie Zametki, Vol. 8, No. 3, pp. 309–320, September, 1970.In conclusion we express our gratitude to L. A. Chudov for his valuable advice concerning this work.     

Small representations of the relation algebra ɛn+1(1, 2, 3)

Applying combinatorial methods, we prove that the symmetric relation algebra _n+1(1, 2, 3) ofn+1 atoms is finitely representable for alln 1, on at most (2+o(1))n² elements asn . We explicitly construct a representation of size 4.5n², for every n >1.Presented by B. Jonsson.     

Hermitian K-theory on a Theorem of Giffen

Let be an exact category with duality. In [1] a category () was introduced and the authors asserted that the loop space of the topological realization of () is homotopy equivalent to Karoubis U-theory space of when = (R), the category of finitely generated projective modules over a ring R with an involution if 2 is invertible in R. Unfortunately, their proof contains a mistake. We present a different proof which avoids their argument.Mathematics Subject Classifications (1991): 19DO6, 19G38, 11E70.     

On some approximately balanced combinatorial cooperative games

A model of taxation for cooperativen-person games is introduced where proper coalitions Are taxed proportionally to their value. Games with non-empty core under taxation at rate-balanced. Sharp bounds on in matching games (not necessarily bipartite) graphs are estabLished. Upper and lower bounds on the smallest in bin packing games are derived and euclidean random TSP games are seen to be, with high probability,-balanced for0.06.     

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.     

On some growth models with a small parameter

Summary We consider the behavior of the asymptotic speed of growth and the asymptotic shape in some growth models, when a certain parameter becomes small. The basic example treated is the variant of Richardson's growth model on ^d in which each site which is not yet occupied becomes occupied at rate 1 if it has at least two occupied neighbors, at rate 1 if it has exactly 1 occupied neighbor and, of course, at rate 0 if it has no occupied neighbor. Occupied sites remain occupied forever. Starting from a single occupied site, this model has asymptotic speeds of growth in each direction (as time goes to infinity) and these speeds determine an asymptotic shape in the usual sense. It is proven that as tends to 0, the asymptotic speeds scale as ^1/d and the asymptotic shape, when renormalized by dividing it by ^1/d , converges to a cube. Other similar models which are partially oriented are also studied.The work of R.H.S. was supported by the N.S.F. through grant DMS 91-00725. In addition, both authors were supported by the Newton Institute in Cambridge. The authors thank the Newton Institute for its support and hospitality     

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.     

On the completeness of a system of functions on a segment

The question is considered of the completeness of the systems of functions {Xⁿ[1÷_n]}, where _n(x) are small, in the spaces C and L_p on the segment [0, a].Translated from Matematicheskie Zametki, Vol. 4, No. 5, pp. 557–568, November, 1968.     

Die ɛ-Störung linearer und quadratischer Optimierungsaufgaben und ihre Anwendung auf das Hildreth-Verfahren

Zusammenfassung Durch eine -Störung in der Diagonalen der quadratischen Form kann man eine lineare oder quadratisch semidefinite Optimierungsaufgabe zu einer streng definiten quadratischen Aufgabe machen, so daß Lösungsverfahren, die die Formmatrix als nichtsingulär voraussetzen müssen, anwendbar werden. Bekanntlich konvergiert die Lösungx der -gestörten Aufgabe für 0 gegen den Lösungsvektorx ^m von minimalem Betrag der ursprünglichen Aufgabe. Wir zeigen darüber hinaus, daß im linearen Fall immer und im eigentlich quadratischen in gewissen Fällen schon für 0<<* die beiden Lösungenx undx ^m übereinstimmen. Im linearen Fall ist die obere Grenze * durch die Lösung eines linearen Ungleichungssystems gegeben.Im zweiten Abschnitt wenden wir dasHildreth-Verfahren mittels der -Störung auf lineare und quadratisch semidefinite Aufgaben an, diskutieren Konvergenz- und Genauigkeitsfragen und kommen zu dem Schluß, daß man in der Praxis sowohl bei Rechnung von Hand als auch bei maschineller Rechnung zu befriedigenden Ergebnissen kommt.

---

Summary Linear and quadratic semidefinite programming problems may be transformed into strongly definite quadratic problems by means of an -perturbation of the quadratic form so that procedures which presuppose the matrix of the form to be nonsingular, may be applied. As is well known, the solutionx of the -perturbated problem converges to the solutionx ^m of minimal length of the original problem as 0. We show that always in the linear case and in the quadratic case under certain circumstances, both solutionsx andx ^m are equal if 0 <<*. In the linear case, the upper limit * is given by the solution of a system of linear inequalities.In the second part of this paper we apply the method ofHildreth to linear and quadratic semidefinite programming problems by the -perturbation. We discuss questions of convergence and exactness, and conclude that in practice calculation by hand as well as by computer leads to satisfying results.

---

---

Der Verfasser ist Herrn Prof. Dr.W. Vogel, Bonn, für einen Hinweis zu Dank verpflichtet.

---

Vorgel. v.:H. P. Künzi     

Multiscale convergence and reiterated homogenization of parabolic problems

Reiterated homogenization is studied for divergence structure parabolic problems of the form u /t–div (a(x,x/,x/²,t,t/ ^k)u )=f. It is shown that under standard assumptions on the function a(x, y ₁,y ₂,t,) the sequence {u } of solutions converges weakly in L ² (0,T; H ₀ ¹ ()) to the solution u of the homogenized problem u/t– div(b(x,t)u)=f.This revised version was published online in April 2005 with a corrected missing date string.     

Bin packing games

We consider bin packing games introduced by Faigle and Kern (1993) and we restrict ourselves to the subclass of games for which all bins have unit capacity and all items are larger than 1/3. We adopt the taxation model of Faigle and Kern and we prove that for a tax-rate of = sk_7/1 the -core is always non empty. The bound is sharp, since for every < sk_7/1 there exist instances of the bin packing game within our sublass with an empty -core.     

Sensitivity analysis of the greatest eigenvalue of a symmetric matrix via the ɛ-subdifferential of the associated convex quadratic form

LetA(·) be ann × n symmetric affine matrix-valued function of a parameteruR ^m , and let (u) be the greatest eigenvalue ofA(u). Recently, there has been interest in calculating (u), the subdifferential of atu, which is useful for both the construction of efficient algorithms for the minimization of (u) and the sensitivity analysis of (u), namely, the perturbation theory of (u). In this paper, more generally, we investigate the Legendre-Fenchel conjugate function of (·) and the -subdifferential (u) of atu. Then, we discuss relations between the set (u) and some perturbation bounds for (u).The author is deeply indebted to Professor J. B. Hiriart-Urruty who suggested this study and provided helpful advice and constant encouragement. The author also thanks the referees and the editors for their substantial help in the improvement of this paper.     

Periodic optimal control in Hilbert space

Optimal control problem governed byy=Ay + Bu, y(0)=y (T), =±1 are studied, whereA is the infinitesimal generator of a nonasymptotically stableC _o semigroup andB is a linear operator from a controller spaceU into a state spaceH. Both distributed (B L(U, H)) and boundary cases (B L(U, (D(A ^*)))) are investigated. Some applications to periodic control of wave equations are given.This work was supported by the National Science Foundation under Grant No. DMS-91-11794.     

A result from diophantine approximation which has applications in economics

We say that a real number allows poor approximations if we can find 0<=()<1 and a sequence of integers n₁2<... such that for all rationals p/q with qn. we have |–.p/q| > Kn _j ^–l– where K is a constant depending only on .In this note we prove that the set of numbers which allow poor approximations are precisely the very well-approximable numbers.The existence of numbers with poor approximations has been used by Cheng [1] to show the existence of a dense set of economies whose cone converges to the Walras equilibrium as slowly as 0(n^–1/2–) after n replications.     

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( ²).     

Convergence of the series of large-deviation probabilities for sums of independent equally distributed random variables

The series is studied, where S_n are the sums of independent equally distributed random variables, _n is a sequence of nonnegative numbers, >0, and >0 is an arbitrary positive number. For a broad class of sequences _n, the necessary and sufficient conditions are established for the convergence of this series for any >0.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 45, No. 6, pp. 770–784, June, 1993.     

Littlewood-paley operators on the generalized Lipschitz spaces

Littlewood-Paley operators defined on a new kind of generalized Lipschitz spaces ₀ ^,p are studied. It is proved that the image of a function under the action of these operators is either equal to infinity almost everywhere or is in ₀ ^,p , where –n<<1 and 1<p<.