About existence and uniqueness of the restricted total least squares estimation

Summary Total Least Squares (TLS) is an estimation method for the solutiona of the linear system when both data sets and are subject to error. The TLS-method minimizes the functional with weighting parameter . In this paper the TLS-functional is analyzed by the technique of Lagrangian multipliers. The main part of the work deals with the case when the estimatea is restricted by an inequality of the formD a–b0, D a diagonal matrix. It is shown that there exists a unique estimatea if the weighting parameter is chosen sufficiently large.     

A shift-invariant algebra of singular integral operators with oscillating coefficients

LetB be the Banach algebra of all bounded linear operators on the weighted Lebesgue spaceL ^p (T, ) with an arbitrary Muckenhoupt weight on the unit circleT, and the Banach subalgebra ofB generated by the operators of multiplication by piecewise continuous coefficients and the operatorse _h,S _T e _h, ^–1 I (hR, T) whereS _T is the Cauchy singular integral operator ande _h,(t)=exp(h(t+)/(t–)),tT. The paper is devoted to a symbol calculus, Fredholm criteria and an index formula for the operators in the algebra and its matrix analogue . These shift-invariant algebras arise naturally in studying the algebras of singular integral operators with coefficients admitting semi-almost periodic discontinuities and shifts being diffeomorphisms ofT onto itself with second Taylor derivatives.Partially supported by CONACYT grant, Cátedra Patrimonial, No. 990017-EX and by CONACYT project 32726-E, México.     

Une méthode numérique pour le calcul des points de retournement. Application à un problème aux limites non-linéaire

Summary A finite element method (P₁) with numerical integration for approximating the boundary value problem –u=e ^u is considered. It is shown that the discrete problem has a solution branch (with turning point) which converges uniformely to a solution branch of the continuous problem. Error estimates are given; for example it is found that , >0, where ₀ and _h ⁰ are critical values of the parameter for continuous and discrete problems.

     

Compact Laws of the Iterated Logarithm for B-Valued Random Variables with Two-Dimensional Indices

Let be a real separable Banach space and {X, X _{n, m}; (n, m) N ²} B-valued i.i.d. random variables. Set . In this paper, the compact law of the iterated logarithm, CLIL(D), for B-valued random variables with two-dimensional indices ranging over a subset D of N ² is studied. There is a gap between the moment conditions for CLIL(N ¹) and those for CLIL(N ²). The main result of this paper fills this gap by presenting necessary and sufficient conditions for the sequence to be almost surely conditionally compact in B, where, for 0, 1 r 2, N ^r (, ) = {(n, m) N ²; n m n exp{(log n) ^r–1 (n)}} and (·) is any positive, continuous, nondecreasing function such that (t)/(log log t) is eventually decreasing as t , for some > 0.     

Complete Subobjects of Fuzzy Sets Over MV-Algebras

A subobjects structure of the category -FSet of -fuzzy sets over a complete MV-algebra is investigated, where an -fuzzy set is a pair A = (A, ) such that A is a set and : A × A is a special map. Special subobjects (called complete) of an -fuzzy set A which can be identified with some characteristic morphisms A ^* = (L × L, ) are then investigated. It is proved that some truth-valued morphisms are characteristic morphisms of complete subobjects.     

Quadratically constrained least squares and quadratic problems

Summary We consider the following problem: Compute a vectorx such that Ax–b₂=min, subject to the constraint x₂=. A new approach to this problem based on Gauss quadrature is given. The method is especially well suited when the dimensions ofA are large and the matrix is sparse.It is also possible to extend this technique to a constrained quadratic form: For a symmetric matrixA we consider the minimization ofx ^T A x–2b ^T x subject to the constraint x₂=.Some numerical examples are given.This work was in part supported by the National Science Foundation under Grant DCR-8412314 and by the National Institute of Standards and Technology under Grant 60NANB9D0908.     

Zur Interpolation und Integration differenzierbarer periodischer Funktionen

Summary Letx ₀<x ₁<...<x _n–1<x ₀+2 be nodes having multiplicitiesv ₀,...,v _n–1, 1v _k r (0k<n). We approximate the evaluation functional ,x fixed, and the integral respectively by linear functionals of the form and determine optimal weights for the Favard classesW _r C ₂. In the even case of optimal interpolation these weights are unique except forr=1,x(x _k +x _k–1)/2 mod 2. Moreover we get periodic polynomial splinesw _{k, j} (0k<n, 0j<v _k ) of orderr such that are the optimal weights. Certain optimal quadrature formulas are shown to be of interpolatory type with respect to these splines. For the odd case of optimal interpolation we merely have obtained a partial solution.

Bojanov hat in [4, 5] ähnliche Resultate wie wir erzielt. Um Wiederholungen zu vermeiden, werden Resultate, deren Beweise man bereits in [4, 5] findet, nur zitiert     

Block elimination with one refinement solves bordered linear systems accurately

Linear systems with a fairly well-conditioned matrixM of the form , for which a black box solver forA is available, can be accurately solved by the standard process of Block Elimination, followed by just one step of Iterative Refinement, no matter how singularA may be — provided the black box has a property that is possessed by LU- and QR-based solvers with very high probability. The resulting Algorithm BE + 1 is simpler and slightly faster than T.F. Chan's Deflation Method, and just as accurate. We analyse the case where the black box is a solver not forA but for a matrix close toA. This is of interest for numerical continuation methods.Dedicated to the memory of J. H. Wilkinson     

A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations

Summary We present here a new hybrid method for the iterative solution of large sparse nonsymmetric systems of linear equations, say of the formAx=b, whereA ^{N, N} , withA nonsingular, andb ^N are given. This hybrid method begins with a limited number of steps of the Arnoldi method to obtain some information on the location of the spectrum ofA, and then switches to a Richardson iterative method based on Faber polynomials. For a polygonal domain, the Faber polynomials can be constructed recursively from the parameters in the Schwarz-Christoffel mapping function. In four specific numerical examples of non-normal matrices, we show that this hybrid algorithm converges quite well and is approximately as fast or faster than the hybrid GMRES or restarted versions of the GMRES algorithm. It is, however, sensitive (as other hybrid methods also are) to the amount of information on the spectrum ofA acquired during the first (Arnoldi) phase of this procedure.     

Brownian charges around loops

Summary Let (X _t ⁿ ) be a Poisson sequence of independent Brownian motions in ^d ,d3; Let be a compact oriented submanifold of d, of dimensiond–2 and volume ; let t be the sum of the windings of (X _s ⁿ , 0st) around ; then t/t converges in law towards a Cauchy variable of parameter /2. A similar result is valid when the winding is replaced by the integral of a harmonic 1-form in ^d .     

On the solution of singular linear systems of algebraic equations by semiiterative methods

Summary For a square matrixT ^n,n , where (I–T) is possibly singular, we investigate the solution of the linear fixed point problemx=T x+c by applying semiiterative methods (SIM's) to the basic iterationx ₀ ⁿ ,x _k T c _k–1+c(k1). Such problems arise if one splits the coefficient matrix of a linear systemA x=b of algebraic equations according toA=M–N (M nonsingular) which leads tox=M ^–1 N x+M ^–1 bT x+c. Even ifx=T x+c is consistent there are cases where the basic iteration fails to converge, namely ifT possesses eigenvalues 1 with ||1, or if =1 is an eigenvalue ofT with nonlinear elementary divisors. In these cases — and also ifx=T x+c is incompatible — we derive necessary and sufficient conditions implying that a SIM tends to a vector which can be described in terms of the Drazin inverse of (I–T). We further give conditions under which is a solution or a least squares solution of (I–T)x=c.Research supported in part by the Alexander von Humboldt-Stiftung     

Numerical stability of the cyclic Richardson iteration

Summary The success of the cyclic Richardson iteration depends on the proper ordering of the acceleration parameters. We give a rigorous error analysis to show that, with the proper ordering, the relative error in the iterative method, when properly terminated, is not larger than the error incurred in stable direct methods such as Cholesky factorization. For both the computed approximation tou=L ^–1f satisfies cond (L)u2^–t and this bound is attainable. We also show that the residual norm is bounded by L cond . This bound is attainable for a small cycle lengthN. Our analysis suggests that for a larger cycle lengthN the residuals are bounded by . We construct a theoretical example in which this bound is attainable. However we observed in all numerical tests that ultimately the residual norms were of order . We explain why in practice even the factor is never encountered. Therefore the residual stopping criterion for the Richardson iteration appears to be very reliable and the method itself appears to be stable.The author gratefully acknowledges partial support from ONR Contract N00014-85-K-0180On leave from the University of Krakow, Poland, during the spring semester 1989     

A practical termination criterion for the conjugate gradient method

The conjugate gradient method for the iterative solution of a set of linear equationsAx=b is essentially equivalent to the Lanczos method, which implies that approximations to certain eigen-values ofA can be obtained at low cost. In this paper it is shown how the smallest active eigenvalue ofA can be cheaply approximated, and the usefulness of this approximation for a practical termination criterion for the conjugate gradient method is studied. It is proved that this termination criterion is reliable in many relevant situations.     

A practical finite element approximation of a semi-definite Neumann problem on a curved domain

Summary This paper considers the finite element approximation of the semi-definite Neumann problem: –·(u)=f in a curved domain ⁿ (n=2 or 3), on and , a given constant, for dataf andg satisfying the compatibility condition . Due to perturbation of domain errors ( ^h ) the standard Galerkin approximation to the above problem may not have a solution. A remedy is to perturb the right hand side so that a discrete form of the compatibility condition holds. Using this approach we show that for a finite element space defined overD ^h , a union of elements, with approximation powerh ^k in theL ² norm and with dist (, ^h )Ch ^k , one obtains optimal rates of convergence in theH ¹ andL ² norms whether ^h is fitted ( ^h D ^h ) or unfitted ( ^h D ^h ) provided the numerical integration scheme has sufficient accuracy.Partially supported by the National Science Foundation, Grant #DMS-8501397, the Air Force Office of Scientific Research and the Office of Naval Research     

Das asymptotische Verhalten der Peanokerne einiger interpolatorischer Quadraturverfahren

Summary Interpolatory quadrature formulae consist in replacing by wherep _f denotes the interpolating polynomial off with respect to a certain knot setX. The remainder may in many cases be written as wherem=n resp. (n+1) forn even and odd, respectively. We determine the asymptotic behaviour of the Peano kernelP _X (t) forn for the quadrature formulae of Filippi, Polya and Clenshaw-Curtis.

     

On the convergence of powers of interval matrices (2)

Summary Let be a real irreduciblen×n interval matrix. Then a necessary and sufficient condition is given for the sequence of the powers of an interval matrix to converge to a matrix which is not the null matrix. In addition a criterion for is proved to decide whether the limit matrix satisfies the condition of symmetry .     

Nonlinear eigenvalue approximation

Summary For each in some domainD in the complex plane, letF() be a linear, compact operator on a Banach spaceX and letF be holomorphic in . Assuming that there is a so thatI–F() is not one-to-one, we examine two local methods for approximating the nonlinear eigenvalue . In the Newton method the smallest eigenvalue of the operator pencil [I–F(),F()] is used as increment. We show that under suitable hypotheses the sequence of Newton iterates is locally, quadratically convergent. Second, suppose 0 is an eigenvalue of the operator pencil [I–F(),I] with algebraic multiplicitym. For fixed leth() denote the arithmetic mean of them eigenvalues of the pencil [I–F(),I] which are closest to 0. Thenh is holomorphic in a neighborhood of andh()=0. Under suitable hypotheses the classical Muller's method applied toh converges locally with order approximately 1.84.     

An Improvement of an Inequality of Fiedler Leading to a New Conjecture on Nonnegative Matrices

Suppose that A is an n × n nonnegative matrix whose eigenvalues are = (A), ₂, ..., _n. Fiedler and others have shown that \det( I -A) ⁿ - ⁿ, for all > with equality for any such if and only if A is the simple cycle matrix. Let a _i be the signed sum of the determinants of the principal submatrices of A of order i × i, i=1, ..., n - 1. We use similar techniques to Fiedler to show that Fiedler's inequality can be strengthened to: for all . We use this inequality to derive the inequality that: . In the spirit of a celebrated conjecture due to Boyle-Handelman, this inequality inspires us to conjecture the following inequality on the nonzero eigenvalues of A: If ₁ = (A), ₂,...,_k are (all) the nonzero eigenvalues of A, then . We prove this conjecture for the case when the spectrum of A is real.     

Commutants and derivation ranges

In this paper we obtain some results concerning the set , where is the closure in the norm topology of the range of the inner derivation _A defined by _A (X) = AX – XA. Here stands for a Hilbert space and we prove that every compact operator in is quasinilpotent if A is dominant, where is the closure of the range of _A in the weak topology.