Characterizations of logA≥logB and normaloid operators via Heinz inequality

In 1951, Heinz showed the following useful norm inequality:If A, B0and XB(H), then AXB ^r X^1–r A ^r XB ^r holds for r [0, 1]. In this paper, we shall show the following two applications of this inequality:Firstly, by using Furuta inequality, we shall show an extension of Cordes inequality. And we shall show a characterization of chaotic order (i.e., logAlogB) by a norm inequality.Secondly, we shall study the condition under which , where is Aluthge transformation ofT. Moreover we shall show a characterization of normaloid operators (i.e.,r(T)=T) via Aluthge transformation.     

Numerical stability of the Chebyshev method for the solution of large linear systems

Summary This paper contains the rounding error analysis for the Chebyshev method for the solution of large linear systemsAx+g=0 whereA=A ^* is positive definite. We prove that the Chebyshev method in floating point arithmetic is numerically stable, which means that the computed sequence {x _k} approximates the solution such that x _k – is of order AA ^–1 where is the relative computer precision.We also point out that in general the Chebyshev method is not well-behaved, which means that the computed residualsr _k=Ax _k+g are of order A²A ^–1.This work was supported in part by the Office of Naval Research under Contract N0014-67-0314-0010, NR 044-422 and by the National Science Foundation under Grant GJ32111     

Convergence of random products of compact contractions in Hilbert space

Let {T₁, ..., T_N} be a finite set of linear contraction mappings of a Hilbert space H into itself, and let r be a mapping from the natural numbers N to {1, ..., N}. One can form S_n=T_r(n)...T_r(1) which could be described as a random product of the T_i's. Roughly, the S_n converge strongly in the mean, but additional side conditions are necessary to ensure uniform, strong or weak convergence. We examine contractions with three such conditions. (W): x_n1, Tx_n1 implies (I-T)x_n0 weakly, (S): x_n1, Tx_n1 implies (I-T)x_n0 strongly, and (K): there exists a constant K>0 such that for all x, (I-T)x²K(x²–Tx²).We have three main results in the event that the T_i's are compact contractions. First, if r assumes each value infinitely often, then S_n converges uniformly to the projection Q on the subspace _i= ₁ ^N [x|T_ix=x]. Secondly we prove that for such compact contractions, the three conditions (W), (S), and (K) are equivalent. Finally if S=S(T₁, ..., T_N) denotes the algebraic semigroup generated by the T_i's, then there exists a fixed positive constant K such that each element in S satisfies (K) with that K.     

Upper bounds for theL p -norms of martingales

Summary Let (f _n ) be a martingale. We establish a relationship between exponential bounds for the probabilities of the typeP(|f _n |>·T(f _n )) and the size of the constantC _p appearing in the inequality f ^* _p C _p T ^*(f) _p , for some quasi-linear operators acting on martingales.This research was supported in part by NSF Grant, no. DMS-8902418On leave from Academy of Physical Education, Warsaw, Poland     

A Note on the Optimal L 2-Estimate of the Finite Volume Element Method

In this note, the optimal L ²-error estimate of the finite volume element method (FVE) for elliptic boundary value problem is discussed. It is shown that u–u _{h 0}Ch ²|ln h|^1/2f_1,1 and u–u _{h 0}Ch ²f_1,p , p>1, where u is the solution of the variational problem of the second order elliptic partial differential equation, u _h is the solution of the FVE scheme for solving the problem, and f is the given function in the right-hand side of the equation.     

Parsimonious Least Norm Approximation

A theoretically justifiable fast finite successive linear approximation algorithm is proposed for obtaining a parsimonious solutionto a corrupted linear system Ax=b+p, where the corruption p is due to noise or error in measurement. The proposedlinear-programming-based algorithm finds a solution x by parametrically minimizing the number of nonzeroelements in x and the error Ax-b-p₁.Numerical tests on a signal-processing-based exampleindicate that the proposed method is comparable to a method that parametrically minimizesthe 1-norm of the solution x and the error Ax-b-p₁, and that both methods are superior, byorders of magnitude, to solutions obtained by least squares as well by combinatorially choosing an optimal solution with a specific number of nonzero elements.     

An algorithm for best approximate solutions ofAx=b with a smooth strictly convex norm

Summary In this paper, overdetermined systems ofm linear equations inn unknowns are considered. With ^m equipped with a smooth strictly convex norm, ·, an iterative algorithm for finding the best approximate solution of the linear system which minimizes the ·-error is given. The convergence of the algorithm is established and numerical results are presented for the case when · is anl _p norm, 1<p<.Portions of this paper are taken from the author's Ph.D. thesis at Michigan State University     

Round-off error analysis of iterations for large linear systems

Summary We deal with the rounding error analysis of successive approximation iterations for the solution of large linear systemsA _x =b. We prove that Jacobi, Richardson, Gauss-Seidel and SOR iterations arenumerically stable wheneverA=A ^*>0 andA has PropertyA. This means that the computed resultx _k approximates the exact solution with relative error of order A·A ^–1 where is the relative computer precision. However with the exception of Gauss-Seidel iteration the residual vector Ax _k –b is of order A² A ^–1 and hence the remaining three iterations arenot well-behaved.This work was partly done during the author's visit at Carnegie-Mellon University and it was supported in part by the Office of Naval Research under Contract N00014-76-C-0370; NR 044-422 and by the National Science Foundation under Grant MCS75-222-55     

Small into isomorphisms onL ∞ spaces

IfT is an isomorphism ofL (A, ) intoL (B, ) which satisfies the condition T T ^–11+, where (A, ) is a -finite measure space, thenT/T is close to an isometry with an error less than 4.     

Continuity of Approximation by Neural Networks in Lp Spaces

Devices such as neural networks typically approximate the elements of some function space X by elements of a nontrivial finite union M of finite-dimensional spaces. It is shown that if X=L ^p () (1<p< and R ^d ), then for any positive constant and any continuous function from X to M, f–(f)>f–M+ for some f in X. Thus, no continuous finite neural network approximation can be within any positive constant of a best approximation in the L ^p -norm.     

Numerical stability of descent methods for solving linear equations

Summary In this paper we perform a round-off error analysis of descent methods for solving a liner systemAx=b, whereA is supposed to be symmetric and positive definite. This leads to a general result on the attainable accuracy of the computed sequence {x _i } when the method is performed in floating point arithmetic. The general theory is applied to the Gauss-Southwell method and the gradient method. Both methods appear to be well-behaved which means that these methods compute an approximationx _i to the exact solutionA ^–1 b which is the exact solution of a slightly perturbed linear system, i.e. (A+A)x _i =b, A of order A, where is the relative machine precision and · denotes the spectral norm.     

Perron-frobenius theory for Banach spaces with a hyperbolic cone

If X is a real Banach space, then the inequality x defines so-called hyperbolic cone in E=X. We develop a relevant version of Perron-Frobenius-Krein-Rutman theory.     

Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm

In this paper overdetermined linear equations inn unknowns are considered. Ifm is the number of equations, let _m be equipped with a smooth strictly convex norm, ·. Algorithms for finding best-fit solutions of the system which minimize the ·-error are given. The algorithms are iterative and in particular apply to the important case where _m is given thel ^p -norms, (1<p<). The algorithms consist of obtaining a least square solution i.e. carrying out an orthogonal projection at each stage of the iteration and solving a non-linear equation in a single real variable. The convergence of the algorithms are proved in the paper.     

On the norms of polynomials of two adjoint projections and a shift

LetP be a projection (non-selfadjoint in general), andV a selfadjoint involution acting in a Hilbert spaceH. In this paper the polynomialsF(X, Y, Z) of three non-commuting variables are described such that the norms F(P, P ^*,V) depend only on P. A method of calculation of the norms F(P, P ^*,V) for such polynomials is given. For polynomialsF(P, P ^*) this problem was investigated in [KMF], [FKM].     

A superfast algorithm for multi-dimensional Padé systems

For a vector ofk+1 matrix power series, a superfast algorithm is given for the computation of multi-dimensional Padé systems. The algorithm provides a method for obtaining matrix Padé, matrix Hermite Padé and matrix simultaneous Padé approximants. When the matrix power series is normal or perfect, the algorithm is shown to calculate multi-dimensional matrix Padé systems of type (n ₀,...,n _k ) inO(n · log²n) block-matrix operations, where n=n ₀+...+n _k . Whenk=1 and the power series is scalar, this is the same complexity as that of other superfast algorithms for computing Padé systems. Whenk>1, the fastest methods presently compute these matrix Padé approximants with a complexity ofO(n²). The algorithm succeeds also in the non-normal and non-perfect case, but with a possibility of an increase in the cost complexity.Supported in part by NSERC grant No. A8035.Partially supported by NSERC operating grant No. 6194.     

A note on operator norm inequalities

If P is a positive operator on a Hilbert space H whose range is dense, then a theorem of Foias, Ong, and Rosenthal says that: [(P)]^–1T[(P)]<-12 max {T, P^–1TP} for any bounded operator T on H, where is a continuous, concave, nonnegative, nondecreasing function on [0, P]. This inequality is extended to the class of normal operators with dense range to obtain the inequality [(N)]^–1T[(N)]<-12c² max {tT, N^–1TN} where is a complex valued function in a class of functions called vase-like, and c is a constant which is associated with by the definition of vase-like. As a corollary, it is shown that the reflexive lattice of operator ranges generated by the range NH of a normal operator N consists of the ranges of all operators of the form (N), where is vase-like. Similar results are obtained for scalar-type spectral operators on a Hilbert space.This author gratefully acknowledges the support of Central Michigan University in the form of a Research Professorship.     

Attracting properties for one dimensional flows of a general barotropic viscous fluid. Periodic flows

Summary We consider the motion of a barotropic compressible fluid in a one dimensional bounded region with impermeable boundary, see equation (1.1). Here, u(t, q) denotes the velocity and v(t, q) the specific volume. The quantity log v(t, q) measures the displacement of v(t, q) with respect to the equilibrium v 1. For the sake of brevity we denote here different norms by the simbol . We show that there is a positive constant r₀=r₀(), a small ball B₁ (r) (with radius R₁ (r), ), and a large ball B(r) (with radius R(r), ) such that the following holds, for each r [0, r₀ [(i) If f(t) < r for all t 0, and if (u(0), log v(0))R(r) (i.e. (u(0), log v(0)) B(r)) then, for sufficiently large values of t, (u(t), log v(t))R₁ (r); (ii) The solutions starting at time t=0 from the large ball B(r) have all the same asymptotic behaviour (see (1.11)); (iii) If f is T-periodic then there is a (unique) T-periodic solution (u(t), log v(t)) inside the small ball B₁ (r). This periodic solution atracts all solutions which intersect the large ball B(r). Periodic solutions had been previously studied only for very specific pressure laws, namely p(v)-log v and p(v)-v^–1.     

On the order of approximation of a continuous 2π-periodic function by Fejer and Poisson means of its Fourier series

Let _n (f) and P_r (f) be, respectively, the Fejer and Poisson means of the Fourier series of the functionf. The present work considers problems associated with the rapidity of approximation of a continuous 2-periodic function by means of Fejer and Poisson processes, and gives, in particular, an upper bound to the deviation of the Fejer and Poisson processes from the function in terms of moduli of continuity, and a lower bound to _n (f)–f in terms of functionals composed of best approximations to the functionf; in addition, some relationships among the quantities P_r (f)–f and _n (f)–f are established.Translated from Matematicheskie Zametki, Vol. 4, No. 1, pp. 21–32, July, 1968.     

The fractional parts of a sum of polynomials

LetX=(x ₁,...,x _s ) be a vector ofs real components and , whereP _j (x _j ) are polynomials of exact degree k with real coefficients and without constant terms. The authors extend a result of Davenport and obtain an approximation on f(X) where t means the distance fromt to the nearest integer.     

An extremal property of outer functions

Our main result is the following: iff (z) is in the space H², and F(z) is its outer part, then F⁽ⁿ⁾_H2F⁽ⁿ⁾_H2(n=1,2,...), the left side being finite if the right side is finite. Under certain essential restrictions, this. inequality was proved by B. I. Korenblyum and V. S. Korolevich [1].Translated from Matematicheskie Zametki, Vol. 10, No. 1, pp. 53–56, July, 1971.