Rate of approximation by rectangular partial sums of double orthogonal series

( ) . .

---

---

Dedicated to Professor K. Tandori on his seventieth birthday

---

This research was supported in part by Grant # K41 100 of the Joint Fund of the Government of Ukraine and the International Science Foundation.     

Approximation of functions of several variables by trigonometric polynomials with given number of harmonics,and estimates of ε-entropy

. - . .. . . . , 340 048 . 1      

Finitely Valued f-Modules, An Addendum

In an -group M with an appropriate operator set it is shown that the -value set (M) can be embedded in the value set (M). This embedding is an isomorphism if and only if each convex -subgroup is an -subgroup. If (M) has a.c.c. and M is either representable or finitely valued, then the two value sets are identical. More generally, these results hold for two related operator sets ₁ and ₂ and the corresponding -value sets and . If R is a unital -ring, then each unital -module over R is an f-module and has exactly when R is an f-ring in which 1 is a strong order unit.     

О Сходимости Лагранжева Интерполирования В Некоторых Множествах Функций

.      

On equivalence of rearrangements of the Haar system in dyadic Hardy and BMO spaces

H={h ₁,I } — , . : , I ¦(I)¦=¦I¦, ¦I¦ — I. H H ={h _(I),I} . , , . L ^p .

---

---

Dedicated to Professor B. Szökefalvi-Nagy on his 75th birthday

---

This research was supported in part by MTA-NSF Grants INT-8400708 and 8620153.     

A Hubert space characterization among function spaces

— [0,1] ,E — - e=1 [0,1]. I — _E =1, E=L ₂ x _e =xL ₂ x E.

---

---

This work was prepared when the second author was a visiting professor of the CNR at the University of Firenze. He was supported by the Soros International Fund.     

On the Cesàro summability of orthogonal sequences

(C, ). , . 0<<1. 1) - ( _k ), _k =a _k , (C, ), . 2) , , (C, ) ; _k = =¦a _k ¦.     

Nonlinear programming,approximation, and optimization on infinitely differentiable functions

A nonnegative, infinitely differentiable function defined on the real line is called a Friedrichs mollifier function if it has support in [0, 1] and ₀ ¹ (t)dt=1. In this article, the following problem is considered. Determine _k =inf ₀ ¹ |^(k)(t)|dt,k=1, 2, ..., where ^(k) denotes thekth derivative of and the infimum is taken over the set of all mollifier functions , which is a convex set. This problem has applications to monotone polynomial approximation as shown by this author elsewhere. The problem is reducible to three equivalent problems, a nonlinear programming problem, a problem on the functions of bounded variation, and an approximation problem involving Tchebycheff polynomials. One of the results of this article shows that _k =k!2^2k–1,k=1, 2, .... The numerical values of the optimal solutions of the three problems are obtained as a function ofk. Some inequalities of independent interest are also derived.This research was supported in part by the National Science Foundation, Grant No. GK-32712.     

K1 of Twisted Rings of Polynomials

We prove that for an arbitrary endomorphism of a ring R the group K1(R[t]) splits into the direct sum of K1(R) and Ñil (r;). Moreover, for any such R and Ñil (R; ) is isomorphic to Ñil (R ; ) for some ring R with : R R – an isomorphism.     

Bari bases of subspaces

We shall establish certain characteristic properties of Bari^* bases of subspaces. We shall show that a complete sequence of finite-dimensional subspaces {N _j}₁ is a Bari basis if and only if each sequence {_j{₁ (_j€N _j, _j=1) is a Bari basis of its own closed linear hull.Translated from Matematicheskie Zametki, Vol. 5, No. 4, pp. 461–469, April, 1969.     

Structures of topological type

In this paper we continue the study of structures of various types initiated by the author in the earlier paper Structures of extensions (Ref. Zh. Mat., 1974, 4A361). The present paper is devoted to the so-called structure of topological type. By a structure of topological type on the set X is meant a topological structure, defined on some set obtained from X, and possibly additional sets, by a totally ordered sequence of operations of unions of sets, products of sets, and passage to the set of subsets. We study certain structures of topological type: bitopological (Sec. 2) and settopological (Sec. 3). A bitopological structure on the set X is any topological structure on the set X×X, and a bitopological space is a pair (X,). This concept is a natural extension of the concept of a bitopological space as a set X on which there are given two topological structures ₁ and ₂-these structures define a structure =₁×₂ on the set X×X. A settopological structure on the set X is any topological structure on the set={A¦A. There are given representations of piecewise-linear structures (Sec. 4) and smooth structures (Sec. 5) as settopological structures.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 83, pp. 5–62, 1979.     

Implications of order reduction for implicit Runge-Kutta methods

Stability analysis of Runge-Kutta (RK) formulas was originally limited to linear ordinary differential equations (ODEs). More recently such analysis has been extended to include the behaviour of solutions to nonlinear problems. This extension led to additional stability requirements for RK methods. Although the class of problems has been widened, the analysis is still restricted to a fixed stepsize. In the case of differential algebraic equations (DAEs), additional order conditions must be satisfied [6] to achieve full classical ODE order and avoid possible order reduction. In this case too, a fixed stepsize analysis is employed. Such analysis may be of only limited use in quantifying the effectiveness of adaptive methods on stiff problems.In this paper we examine the phenomenon of order reduction and its implications on variable-step algorithms. We introduce a global measure of order referred to here as the observed order which is based on the average stepsize over the region of integration. This measure may be better suited to the study of stiff systems, where the stepsize selection algorithm will vary the stepsize considerably over the interval of integration. Observed order gives a better indication of the relationship between accuracy and cost. Using this measure, the observed order reduction will be seen to be less severe than that predicated by fixed stepsize order analysis.Supported by the Information Technology Research Centre of Ontario, and the Natural Science and Engineering Research Council of Canada.     

On Shikata's distance between differentiable structures

Shikata proved: there is a number (n) with the following property: If two compact homeomorphic n-dimensional manifolds have a distance less than (n), then they are diffeomorphic. We improve the known lower bound (n!)^–n for (n) to 1/3n ^–2.This work was done under the program Sonderforschungsbereich Theoretische Mathematik (SFB 40) at Bonn University while Shikata was SFB-guest at Bonn.     

Ergodic properties of Poisson processes with almost periodic intensity

Summary We discuss in this paper a non-homogeneous Poisson process A driven by an almost periodic intensity function. We give the stationary version A ^* and the Palm version A ⁰ corresponding to A ^*. Let (T _i ,i) be the inter-point distance sequence in A and (T _i ⁰ ,i) in A ⁰. We prove that forj, the sequence (T _i+j,i) converges in distribution to (T _i ⁰ ,i). If the intensity function is periodic then the convergence is in variation.     

Complete problems withL-samplable distributions

The average case complexity classes P, L-samplable and NL, L-samplable are defined. We show that Deterministic Bounded Halting is complete for P, L-samplable and that Graph Reachability is complete for NL-samplable, both problems with a universal logspace samplable distribution.     

Comparison of Normal Linear Experiments by Quadratic Forms

Let X and Y be observation vectors in normal linear experiments =N(A, V) and F = N(B, W). We write > Fif for any quadratic form YGY there exists a quadratic formXHX such that E(XHX) = E(Y'GY) and var(X'HX) var(Y'GY).The relation > is characterized by the matrices A, B, V and W. Moreoversome connections with known orderings of linear experiments are given.     

On the complexity of approximating a KKT point of quadratic programming

We present a potential reduction algorithm to approximate a Karush—Kuhn—Tucker (KKT) point of general quadratic programming (QP). We show that the algorithm is a fully polynomial-time approximation scheme, and its running-time dependency on accuracy (0, 1) is O((l/) log(l/) log(log(l/))), compared to the previously best-known result O((l/)²). Furthermore, the limit of the KKT point satisfies the second-order necessary optimality condition of being a local minimizer. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.Research support in part by NSF grants DDM-9207347 and DMI-9522507, and the Iowa Business School Summer Grant.     

On the Projections of Multivalued Maps

This paper considers analogues of the Helmholtz projections of the set of selections of a piecewise smooth multivalued map , n2. It is shown that, for mn–1 (m=1), the closure of the projection of on the subspace of gradient fields (solenoidal vector fields) is a convex set. For the general case, there are given point-wise conditions on the values of the map which ensure that the closure of the projection of contains the zero element. Possible applications to optimal control problems are discussed.     

Large-Deviation Local Theorem for Additive Functionals of a Markov Gaussian Field. I

We prove a local limit theorem (LLT) on Cramer-type large deviations for sums S _V = _t V ( _t ), where _t , t Z , 1, is a Markov Gaussian random field, V Z , and is a bounded Borel function. We get an estimate from below for the variance of S _V and construct two classes of functions , for which the LLT of large deviations holds.     

A complete asymptotic expansion of the jacobi functions with error bounds

In this paper we give a complete asymptotic expansion of the Jacobi functions ^{(, )} (t) as + . The method we employed to get the complete expansion follows that of Olver in treating similar problems. By using a Gronwall-Bellman type inequality for an improper integral in which the integrand is an unbounded function and contains a parameter, we get an error bound of the asymptotic approximation which is different from that of Olver's.