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     

The measure of a translated ball in uniformly convex spaces

Let (E, ¦·¦) be a uniformly convex Banach space with the modulus of uniform convexity of power type. Let be the convolution of the distribution of a random series inE with independent one-dimensional components and an arbitrary probability measure onE. Under some assumptions about the components and the smoothness of the norm we show that there exists a constant such that |{·<t}–{·+r<t}|r ^q , whereq depends on the properties of the norm. We specify it in the case ofL spaces, >1.     

Generalizations of the projection method with applications to SOR theory for hermitian positive semidefinite linear systems

Summary Ann×n complex matrixB is calledparacontracting if B₂1 and 0x[N(I-B)]Bx₂<x₂. We show that a productB=B _k B _k–1 ...B ₁ ofk paracontracting matrices is semiconvergent and give upper bounds on the subdominant eigenvalue ofB in terms of the subdominant singular values of theB _i 's and in terms of the angles between certain subspaces. Our results here extend earlier results due to Halperin and due to Smith, Solomon and Wagner. We also determine necessary and sufficient conditions forn numbers in the interval [0, 1] to form the spectrum of a product of two orthogonal projections and hence characterize the subdominant eigenvalue of such a product. In the final part of the paper we apply the upper bounds mentioned earlier to provide an estimate on the subdominant eigenvalue of the SOR iteration matrix associated with ann×n hermitian positive semidefinite matrixA none of whose diagonal entries vanish.The work of this author was supported in part by NSF Research Grant No. MCS-8400879     

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.     

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.     

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     

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     

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.     

On the stability of semi-implicit methods for ordinary differential equations

The aim of this paper is to analyze the stability properties of semi-implicit methods (such as Rosenbrock methods,W-methods, and semi-implicit extrapolation methods) for nonlinear stiff systems of differential equations. First it is shown that the numerical solution satisfies y ₁ (h)y ₀, if the method is applied with stepsizeh to the systemy =Ay ( denotes the logarithmic norm ofA). Properties of the function(x) are studied. Further, conditions for the parameters of a semi-implicit method are given, which imply that the method produces contractive numerical solutions over a large class of nonlinear problems for sufficiently smallh. The restriction on the stepsize, however, does not depend on the stiffness of the differential equation. Finally, the presented theory is applied to the extrapolation method based on the semi-implicit mid-point rule.     

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.     

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.     

On the Continuity of Pathwise Solutions to Langevin Equations in Infinite Dimensions

We fix a rich probability space (,F,P). Let (H,) be a separable Hilbert space and let be the canonical cylindrical Gaussian measure on H. Given any abstract Wiener space (H,B,) over H, and for every Hilbert–Schmidt operator T: HBH which is (|{}|,)-continuous, where |{}| stands for the (Gross-measurable) norm on B, we construct an Ornstein–Uhlenbeck process : (,F,P)×[0,1](B,|{}|) as a pathwise solution of the following infinite-dimensional Langevin equation d _t =db _t +T( _t )dt with the initial data ₀=0, where b is a B-valued Brownian motion based on the abstract Wiener space (H,B,). The richness of the probability space (,F,P) then implies the following consequences: the probability space is independent of the abstract Wiener space (H,B,) (in the sense that (,F,P) does not depend on the choice of the Gross-measurable norm |{}|) and the space C _B consisting of all continuous B-valued functions on [0,1] is identical with the set of all paths of . Finally, we present a way to obtain pathwise continuous solutions :d _t =

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.     

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.     

Ein Störungssatz für abgeschlossene,lineare Operatoren

Zusammenfassung In vorliegender Note wird ein Satz von Kato [7] über die Störung eines abgeschlossenen, normal auflösbaren OperatorsT mit endlichem Null-defekt (T) durch einen streng singulären Operator verallgemeinert. Zu diesem Zweck wird für jedes 0 mit Hilfe des Kuratowskischen Nichtkompaktheitsmaßes eine KlasseC von beschränkten, linearen Operatoren eingeführt, welche sowohl die streng singulären Operatoren als auch die OperatorenS mit S enthält.Das erzielte Resultat steht in engem Zusammenhang mit den Untersuchungen von Gol'denteinn, Gohberg und Markus [5] und von Gol'denteienn und Markus [6].     

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.     

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.     

A remark on normal derivations of Hilbert-Schmidt type

LetB (H) denote the algebra of operators on the separable Hilbert spaceH. LetC ₂ denote the (Hilbert) space of Hilbert-Schmidt operators onH, with norm .₂ defined by S ₂ ² =(S,S)=tr(SS ^*). GivenA, B B (H), define the derivationC (A, B):B(H)B(H) byC(A, B)X=AX-XB. We show that C(A,B)X+S ₂ ² =C(A,B)X ₂ ² +S ₂ ² holds for allXB(H) and for everySC ₂ such thatC(A, B)S=0 if and only if reducesA, ker S reducesB, andA | S and B| ker S are unitarily equivalent normal operators. We also show that ifA, BB(H) are contractions andR(A, B)B(H)B(H) is defined byR(A, B)X=AXB-X, thenSC ₂ andR(A, B)S=0 imply R(A,B)X+S ₂ ² =R(A,B)X ₂ ² +S ₂ ² for allXB(H).     

Extreme values and the law of the iterated logarithm

Summary IfX takes values in a Banach spaceB and is in the domain of attraction of a Gaussian law onB, thenX satisfies the compact law of the iterated logarithm (LIL) with respect to a regular normalizing sequence { _n } iffX satisfies a certain integrability condition. The integrability condition is equivalent to the fact that the maximal term of the sample {X ₁, X ₂,..., X _n} does not dominate the partial sums {S _n}, and here we examine the precise influence of these maximal terms and its relation to the compactLIL. In particular, it is shown that if one deletes enough of the maximal terms there is always a compactLIL with non-trivial limit set.Supported in part by NSF Grant MCS-8219742Work done while visiting the University of Wisconsin, Madison, with partial support by NSF Grant MCS-8219742     

Uniform convexity and the distribution of the norm for a Gaussian measure

Summary We show that if a Banach space E has a norm · such that the modulus of uniform convexity is bounded below by a power function, then for each Gaussian measure on E the distribition of the norm for has a bounded density with respect to Lebesgue measure. This result is optimum in the following sense:If (a _n) is an arbitrary sequence with a _n0, there exists a uniformly convex norm N(·) on the standard Hilbert space, equivalent to the usual norm such that the modulus of convexity of this norm satisfies , and a Gaussian measure on E such that the distribution of the norm for does not have a bounded density with respect to Lebesgue measure.