A Periodicity Theorem in K-Theory for Finite Covariant Systems

Let A be a complex Banach algebra. In this paper, we prove a periodicity theorem that K(S ² A, G, )K(A, G,), where (A,G,) is a finite covariant system and K(A,G,) is an Abelian group associated with (A,G,).     

Average Number of Real Roots of Random Harmonic Equations

Let {g_k}be a sequence of normally distributed independent random variables with mathematical expectation zero and variance unity. Let _k (t ) (k = 0, 1, 2,...) be the normalized Jacobi polynomials orthogonal with respect to the interval [ – 1, 1 ]. Then it is proved that the average number of real roots of the random equations, _k=0 ⁿ g_kk(1)=C where Cis a constant, is asymptotically equal to n/in the same interval when nis large and even for C as long as C=O (n ²).     

Limit Theorems for Multiplicative Processes

Let W be a non-negative random variable with EW=1, and let {W _i } be a family of independent copies of W, indexed by all the finite sequences i=i ₁i _n of positive integers. For fixed r and n the random multiplicative measure ⁿ _r has, on each r-adic interval at nth level, the density with respect to the Lebesgue measure on [0,1]. If EW log Wr, the sequence { ⁿ _r } _n converges a.s. weakly to the Mandelbrot measure _r . For each fixed 1n, we study asymptotic properties for the sequence of random measures { ⁿ _r } _r as r. We prove uniform laws of large numbers, functional central limit theorems, a functional law of iterated logarithm, and large deviation principles. The function-indexed processes is a natural extension to a tree-indexed process at nth level of the usual smoothed partial-sum process corresponding to n=1. The results extend the classical ones for { ¹ _r } _r , and the recent ones for the masses of { _r } _r established in Ref. 23.     

Weak solutions of the Stokes problem in weighted Sobolev spaces

For n2 we consider the Stokes problem in ⁿ, -u + p=f, -divu=g, in weighted Soboiev spaces H ₆ ^m,r , where the weights are proportional to (1+|x|). We prove the existence of weak solutions for any K, whereK is a discrete set of critical values. Furthermore, we characterize the solutions of the homogeneous problem.This research was supported by the DFG research group Equations of Hydrodynamics, Universities of Bayreuth and Paderborn.     

Algebraic polynomial bases of space LP

Let (_n) be a system, close to the orthonormal complete system (x _n). An estimate is obtained for the deviation of the system {f_n}, obtained from {_n} by Schmidt's method, from the system {x_n}. This estimate is used to show that, in any L_P(–1,1), withp (1,4/3] [4,), and for any >e¦4 = i,13..., there exists an orthogonal algebraic system (P _n (x)) _n=0 , forming a basis in L_P and such that _n = degP _n (x) n for n>n_o(p,).Translated from Matematicheskie Zametki, Vol. 23, No. 2, pp. 223–230, February, 1978.     

Head of the line processor sharing for many symmetric queues with finite capacity

In this paper the steady-state behavior of many symmetric queues, under the head of the line processor-sharing discipline, is investigated. The arrival process to each of n queues is Poisson, with rateA, and each queue hasr waiting spaces. A job arriving at a full queue is lost. The queues are served by a single exponential server, which has a mean raten, and splits its capacity equally amongst the jobs at the head of each nonempty queue. The normal traffic casep=/< 1 is considered, and it is assumed thatn1 andr= 0(1). A 2-term asymptotic approximation to the loss probabilityL is derived, and it is found thatL = 0(n ^–r ), for fixedp. If6=(1–p)/p 1, then the approximation is valid if n² 1 and (r+ 1)²n, and in this caseL r!/(n)^r. Numerical values ofL are obtained forr = 1,2,3,4 and 5,n = 1000,500 and 200, and various values ofp< 1. Very small loss probabilities may be obtained with appropriate values of these parameters.     

On the speed of convergence in the central limit theorem of log-likelihood ratio processes

Let , the parameter space, be an open subset ofR ^k ,k1. For each , let the r.v.'sX _n ,n=1, 2,... be defined on the probability space (X, P ) and take values in (S,S,L) whereS is a Borel subset of a Euclidean space andL is the -field of Borel subsets ofS. ForhR _k and a sequence of p.d. normalizing matrices _n = _n ^{k × k} (₀ set _n ^* = ^* = ₀ + _n h, where ₀ is the true value of , such that ^*, . Let _n (^*, _*)( be the log-likelihood ratio of the probability measure with respect to the probability measure , whereP _n is the restriction ofP over _n = (X ₁,X ₂,...,X _n . In this paper we, under a very general dependence setup obtain a rate of convergence of the normalized log-likelihood ratio statistic to Standard Normal Variable. Two examples are taken into account.     

C r -finite elements of Powell-Sabin type on the three direction mesh

Let be the triangulation generated by a uniform three direction mesh of the plane. Let ₆ be the Powell-Sabin subtriangulation obtained by subdividing each triangleT by connecting each vertex to the midpoint of the opposite side.Given a smooth functionu, we construct a piecewise polynomial function C ^r (²) of degreen=2r (resp. 2r+1) forr odd (resp. even) in each triangle of ₆, interpolating derivatives ofu up to orderr at the vertices of.     

Recurrence and transience for random walks with stationary increments

Summary Let S _n = ₁+...+ _n , n1, be the partial sums of stationary, dependent random variables in ^m . The probability space can be partitioned into I _t I _r , where I _t = {S _n} and I _r ={each S _n is limit point of (S _n)_n1}. This result follows from the inclusion{S _n > for n>0}I _t a.s., which is obtained by using Kac's inequality.     

Π r P1-bundle from which a surjective morphism to Π m P1 exists

Let : X Y be a morphism of smooth projective varieties over an algebraically closed field k of characteristic not equal to 2 whose closed fibres are all isomorphic to ^r P¹ and let ': X ^r P¹ be a surjective morphism. This article gives a sufficient condition concerning ' and Y under which X is isomorphic to Y× ^r P¹.     

Extremal types for certainL p minimization problems and associated large scale nonlinear programs

Extremals for constrained minimization problems, min F, are classified according to the growth properties of the linear functionalF() restricted to . Various singular and nonsingular extremal types are investigated in detail for the special case where = {measurableu(·): [0, 1] U},U = a bounded polyhedral convex set in ^m , andF is understood in Fréchet's sense relative to anL ^p norm withp [1, ). The analysis yields newL ^p minimization corollaries of recently developed general convergence rate theories for conditional and projected gradient methods, and a Newton method for constrained minimization. These results help to explain trends in the behavior of computational procedures for certain large scale structured nonlinear programs in ^k ask increases to , with particular application to a large class of optimal control problems with linearly constrained inputs; control problems with bang-bang solutions are considered at some length.Investigation supported by NSF Research Grants ECS-8005958 and ENG 78-03385.     

Convexity of Nonlinear Image of a Small Ball with Applications to Optimization

Let f: XY be a nonlinear differentiable map, X,Y are Hilbert spaces, B(a,r) is a ball in X with a center a and radius r. Suppose f (x) is Lipschitz in B(a,r) with Lipschitz constant L and f (a) is a surjection: f (a)X=Y; this implies the existence of >0 such that f (a)^* yy, yY. Then, if r,/(2L), the image F=f(B(a,)) of the ball B(a,) is convex. This result has numerous applications in optimization and control. First, duality theory holds for nonconvex mathematical programming problems with extra constraint x–a. Special effective algorithms for such optimization problems can be constructed as well. Second, the reachability set for small power control is convex. This leads to various results in optimal control.     

An explicit solution of the linear filtering problem for certain classes of nonrational spectral densities

We present an explicit solution of the problem of optimal linear filtering: the recovery of the useful signal(s) at the instantt+, (>0,<0, or=0) from known values of the received signal(s)=(s)+(s) in the past, i.e., at the instantt–s, s0. In doing so we assume the random processes(s) and /gr(s) are stationary and jointly stationary, while the stationary process of noise (s) with zero mean is assumed to be mutually correlated and jointly stationary with the process(s) under the assumption that there exists a common spectral densityf() for these processes.Translated fromTeoriya Sluchaínykh Protsessov, Vol. 14, pp. 83–91, 1986.     

Local extrema of analytic functions

We give a complete answer to the problem of the finite decidability of the local extremality character of a real analytic function at a given point, a problem that found partial answers in some works by Severi and ojasiewicz. Consider a real analytic functionf defined in a neighbourhood of a pointx ₀R ⁿ . Restrictf to the spherical surface centered inx ₀ and with radiusr0 and take its infimumm(r) and its supremumM(r). We establish some properties ofm(r) andM(r) for smallr>0. In particular, we prove that they have asymptotic expansions of the formf(x ₀)+c·(r +o(r )) asr0 for a realc and a rational 1 (of course the parameters will usually be different form andM).This work was supported by the Brazilian Fundação Carlos Chagas and by the Italian Consiglio Nazionale delle Ricerche.     

Mappings that preserve cones in Lobachevskii space

Let ⁿ be n-dimensional Lobachevskii space, and {l_x:x ⁿ} be a family of lines, parallel to a linel ₀, 0ⁿ (in a given direction). Let {c_x:Xⁿ} be a family of circular cones in ⁿ of opening with axes l_X and vertex X. Then, iff:ⁿⁿ(n>2) is a bijective mapping andf(C_x)=C _f(x), it follows thatf is a motion in the space ⁿ.Translated from Matematicheskie Zametki, Vol. 13, No. 5, pp. 687–694, May, 1973.     

Constraint decomposition algorithms in global optimization

Many global optimization problems can be formulated in the form min{c(x, y): x X, y Y, (x, y) Z, y G} where X, Y are polytopes in ^p , ⁿ , respectively, Z is a closed convex set in ^p+n, while G is the complement of an open convex set in ⁿ . The function c: ^p+n is assumed to be linear. Using the fact that the nonconvex constraints depend only upon they-variables, we modify and combine basic global optimization techniques such that some new decomposition methods result which involve global optimization procedures only in ⁿ . Computational experiments show that the resulting algorithms work well for problems with smalln.     

Approximation of differentiable functions by polynomial splines in domains with external peaks

For unbounded domains with external power-type peaks, we propose a method for the approximation of functionsf(x) w _p ^r () by polynomial splines in the metricw _p ^r (), 1pq, and present the corresponding estimates.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 46, No. 9, pp. 1224–1233, September, 1994.     

On the Monotone Error Rule for Parameter Choice in Iterative and Continuous Regularization Methods

We consider in Hilbert spaces linear ill-posed problems Ax = y with noisy data y satisfying y –y. Regularized approximations x _r to the minimum-norm solution x of Ax = y are constructed by continuous regularization methods or by iterative methods. For the choice of the regularization parameter r (the stopping index n in iterative methods) the following monotone error rule (ME rule) is used: we choose r = r _ME (n = n _ME) as the largest r-value with the guaranteed monotonical decrease of the error x _r – x for r [0, r _ME] (x _n – x <#60; x _n–1 – x for n = 1, 2, ..., n _ME). Main attention is paid to iterative methods of gradient type and to nonstationary implicit iteration methods. As shown, the ME rule leads for many methods to order optimal error bounds. Comparisons with other rules for the choice of the stopping index are made and numerical examples are given.This revised version was published online in October 2005 with corrections to the Cover Date.     

On a Test Statistic for Linear Trend

Let {W(s)} _s 0 be a standard Wiener process. The supremum of the squared Euclidian norm Y (t)², of the R²-valued process Y(t)=(1/t W(t), {12/t ³ int_{0 t} s dW (s)– {3/t} W(t)), t [, 1], is the asymptotic, large sample distribution, of a test statistic for a change point detection problem, of appearance of linear trend. We determine the asymptotic behavior P {sup _t [, 1] Y(t)² > u as u , of this statistic, for a fixed (0,1), and for a moving = (u) 0 at a suitable rate as u . The statistical interest of our results lie in their use as approximate test levels.     

On Completeness of a System of Functions in an Angular Domain

We show that the system {e ^–z /(1 + z ²) : > 0} is complete in a class of functions analytic in an angle.