Line Insertions in Totally Positive Matrices

It is obvious that between any two rows (columns) of an m-by-n totally nonnegative matrix a new row (column) may be inserted to form an (m+1)-by-n (m-by-(n+1)) totally nonnegative matrix. The analogous question, in which “totally nonnegative” is replaced by “totally positive” arises, for example, in completion problems and in extension of collocation matrices, and its answer is not obvious. Here, the totally positive case is answered affirmatively, and in the process an analysis of totally positive linear systems, that may be of independent interest, is used.     

On a decision rule using dichotomies for identifying the nonnegligible parameter in certain linear models

Consider the class of linear models (with uncorrelated observation, each having variance σ²), in which it is known that at most k (location) parameters are negligible, but it is not known which are negligible. The problem is to identify the nonnegligible parameters. In this paper, for k = 1, and under certain restrictions on the model, a technique is developed for solving this problem, which has the feature of requiring (in an information theoretic sense) the minimum amount of computation. (It can “search through” 2^m objects, using m “steps.”) The technique consists of dichotomizing the set of parameters (one known subset possibly containing the nonnegligible element, and the other not), using chi-square variables. A method for computing the probability that the correct parameter is identified, is presented, and an important application to factorial search designs is established.     

Solution of the Ulam Stability Problem for Euler–Lagrange Quadratic Mappings

In 1940 S. M. Ulam proposed at the University of Wisconsin theproblem: “Give conditions in order for a linear mapping near an approximately linear mapping to exist.” In 1968 S. U. Ulam proposed the moregeneral problem: “When is it true that by changing a little the hypotheses of a theorem one can still assert that the thesis of the theorem remains true or approximately true?” In 1978 P. M. Gruber proposed theUlam type problem: “Suppose a mathematical object satisfies a certain property approximately. Is it then possible to approximate this object by objects, satisfying the property exactly?” According to P. M. Gruber this kind of stability problems is of particular interest in probability theory and in the case of functional equations of different types. In 1982–1996 we solved the above Ulam problem, or equivalently the Ulam type problem for linear mappings and established analogous stability problems. In this paper we first introduce newquadratic weighted meansandfundamental functional equationsand then solve theUlam stability problemfornon-linear Euler–Lagrange quadratic mappingsQ:X → Y, satisfying a mean equation and functional equation[formula]for all 2-dimensional vectors (x₁, x₂) X², withXa normed linear space (Y a real complete normed linear space), and any fixed pair (a₁, a₂) of realsa_iand any fixed pair (m₁, m₂) of positive realsm_i(i = 1, 2), [formula]     

Passage to the limit in Proposition I, Book I of Newton's Principia

The purpose of this paper is to analyze the way in which Newton uses his polygon model and passes to the limit in Proposition I, Book I of his Principia. It will be evident from his method that the limit of the polygon is indeed the orbital arc of the body and that his approximation of the actual continuous force situation by a series of impulses passes correctly in the limit into the continuous centripetal force situation. The analysis of the polygon model is done in two ways: (1) using the modern concepts of force, linear momentum, linear impulse, and velocity, and (2) using Newton's concepts of motive force and quantity of motion. It should be clearly understood that the term “force” without the adjective “motive,” is used in the modern sense, which is that force is a vector which is the time rate of change of the linear momentum. Newton did not use the word “force” in this modern sense. The symbol F denotes modern force. For Newton “force” was “motive force,” which is measured by the change in the quantity of motion of a body. Newton's “quantity of motion” is proportional to the magnitude of the modern vector momentum. Motive force is a scalar and the symbol F_m is used for motive force.     

A general framework of compactly supported splines and wavelets

Let {V_k} be a nested sequence of closed subspaces that constitute a multiresolution analysis of L²( ). We characterize the family Φ = {φ} where each φ generates this multiresolution analysis such that the two-scale relation of φ is governed by a finite sequence. In particular, we identify the ε Φ that has minimum support. We also characterize the collection Ψ of functions η such that each η generates the orthogonal complementary subspaces W_k of V_k, . In particular, the minimally supported ψ ε Ψ is determined. Hence, the “B-spline” and “B-wavelet” pair (, ψ) provides the most economical and computational efficient “spline” representations and “wavelet” decompositions of L² functions from the “spline” spaces V_k and “wavelet” spaces W_k, k . A very general duality principle, which yields the dual bases of both {(·−j):j and {η(·−j):j } for any η ε Ψ by essentially interchanging the pair of two-scale sequences with the pair of decomposition sequences, is also established. For many filtering applications, it is very important to select a multiresolution for which both and ψ have linear phases. Hence, “non-symmetric” and ψ, such as the compactly supported orthogonal ones introduced by Daubechies, are sometimes undesirable for these applications. Conditions on linear-phase φ and ψ are established in this paper. In particular, even-order polynomial B-splines and B-wavelets φ_m and ψ_m have linear phases, but the odd-order B-wavelet only has generalized linear phases.     

On the areas of cyclic and semicyclic polygons

We investigate the “generalized Heron polynomial” that relates the squared area of an n-gon inscribed in a circle to the squares of its side lengths. For a (2m+1)-gon or (2m+2)-gon, we express it as the defining polynomial of a certain variety derived from the variety of binary (2m−1)-forms having m−1 double roots. Thus we obtain explicit formulas for the areas of cyclic heptagons and octagons, and illuminate some mysterious features of Robbins' formulas for the areas of cyclic pentagons and hexagons. We also introduce a companion family of polynomials that relate the squared area of an n-gon inscribed in a circle, one of whose sides is a diameter, to the squared lengths of the other sides. By similar algebraic techniques we obtain explicit formulas for these polynomials for all n7.     

Euler's partition theorem and the combinatorics of ℓ-sequences

Euler's partition theorem states that the number of partitions of an integer N into odd parts is equal to the number of partitions of N in which the ratio of successive parts is greater than 1. It was shown by Bousquet-Mélou and Eriksson in [M. Bousquet-Mélou, K. Eriksson, Lecture hall partitions II, Ramanujan J. 1 (2) (1997) 165–185] that a similar result holds when “odd parts” is replaced by “parts that are sums of successive terms of an ℓ-sequence” and the ratio “1” is replaced by a root of the characteristic polynomial of the ℓ-sequence. This generalization of Euler's theorem is intrinsically different from the many others that have appeared, as it involves a family of partitions constrained by the ratio of successive parts.In this paper, we provide a surprisingly simple bijection for this result, a question suggested by Richard Stanley. In fact, we give a parametrized family of bijections, that include, as special cases, Sylvester's bijection and a bijection for the lecture hall theorem. We introduce Sylvester diagrams as a way to visualize these bijections and deduce their properties.In proving the bijections, we uncover the intrinsic role played by the combinatorics of ℓ-sequences and use this structure to give a combinatorial characterization of the partitions defined by the ratio constraint. Several open questions suggested by this work are described.     

A two-grid method based on Newton iteration for the Navier–Stokes equations

In this paper, we consider a two-grid method for resolving the nonlinearity in finite element approximations of the equilibrium Navier–Stokes equations. We prove the convergence rate of the approximation obtained by this method. The two-grid method involves solving one small, nonlinear coarse mesh system and two linear problems on the fine mesh which have the same stiffness matrix with only different right-hand side. The algorithm we study produces an approximate solution with the optimal asymptotic in h and accuracy for any Reynolds number. Numerical example is given to show the convergence of the method.     

Using successive approximations for improving the convergence of GMRES method

In this paper, our attention is concentrated on the GMRES method for the solution of the system (I–T)x=b of linear algebraic equations with a nonsymmetric matrix. We perform m pre-iterations y _l+1 =T _yl +b before starting GMRES and put y _m for the initial approximation in GMRES. We derive an upper estimate for the norm of the error vector in dependence on the mth powers of eigenvalues of the matrix T Further we study under what eigenvalues lay-out this upper estimate is the best one. The estimate shows and numerical experiments verify that it is advisable to perform pre-iterations before starting GMRES as they require fewer arithmetic operations than GMRES. Towards the end of the paper we present a numerical experiment for a system obtained by the finite difference approximation of convection-diffusion equations.     

Function of a square matrix with repeated eigenvalues

An analytical function f(A) of an arbitrary n×n constant matrix A is determined and expressed by the “fundamental formula”, the linear combination of constituent matrices. The constituent matrices Z_kh, which depend on A but not on the function f(s), are computed from the given matrix A, that may have repeated eigenvalues. The associated companion matrix C and Jordan matrix J are then expressed when all the eigenvalues with multiplicities are known. Several other related matrices, such as Vandermonde matrix V, modal matrix W, Krylov matrix K and their inverses, are also derived and depicted as in a 2-D or 3-D mapping diagram. The constituent matrices Z_kh of A are thus obtained by these matrices through similarity matrix transformations. Alternatively, efficient and direct approaches for Z_kh can be found by the linear combination of matrices, that may be further simplified by writing them in “super column matrix” forms. Finally, a typical example is provided to show the merit of several approaches for the constituent matrices of a given matrix A.     

Uniqueness of Minimal Projections in Smooth Matrix Spaces

Let X=(M(n, m), ·), where · fulfills Condition 0.3 and W=M(n, 1)+M(1, m). A formula for a minimal projection from X onto W is given in (E. W. Cheney and W. A. Light, 1985, “Approximation Theory in Tensor Product Spaces,” Lecture Notes in Mathematics, Springer-Verlag, Berlin; E. J. Halton and W. A. Light, 1985, Math. Proc. Cambridge Philos. Soc.97, 127–136; and W. A. Light, 1986, Math. Z.191, 633–643). We will show that this projection is the unique minimal projection (see Theorem 2.1).     

On a linear problem of tracing a given motion

In the present paper, we consider the problem on the optimal tracing of a given vector function with the use of a generalized projection of the trajectory of a linear plant. The deviation of a given motion is measured in the metric C ^m [0, T] of continuous vector functions of the corresponding dimension m. We suggest an efficient method for the construction of an approximate solution of this optimization problem with given accuracy.     

Triangular Matrix Representations

In this paper we develop the theory of generalized triangular matrix representation in an abstract setting. This is accomplished by introducing the concept of a set of left triangulating idempotents. These idempotents determine a generalized triangular matrix representation for an algebra. The existence of a set of left triangulating idempotents does not depend on any specific conditions on the algebras; however, if the algebra satisfies a mild finiteness condition, then such a set can be refined to a “complete” set of left triangulating idempotents in which each “diagonal” subalgebra has no nontrivial generalized triangular matrix representation. We then apply our theory to obtain new results on generalized triangular matrix representations, including extensions of several well known results.     

Browder’s Theorems through Localized SVEP

A bounded linear operator T ∈ L(X) on aBanach space X is said to satisfy “Browder’s theorem” if the Browder spectrum coincides with the Weyl spectrum. T ∈ L(X) is said to satisfy “a-Browder’s theorem” if the upper semi-Browder spectrum coincides with the approximate point Weyl spectrum. In this note we give several characterizations of operators satisfying these theorems. Most of these characterizations are obtained by using a localized version of the single-valued extension property of T. In the last part we shall give some characterizations of operators for which “Weyl’s theorem” holds.     

Extremal functions of forbidden double permutation matrices

We say a 0–1 matrix A avoids a matrix P if no submatrix of A can be transformed into P by changing some ones to zeroes. We call P an m-tuple permutation matrix if P can be obtained by replacing each column of a permutation matrix with m copies of that column. In this paper, we investigate n×n matrices that avoid P and the maximum number ex(n,P) of ones that they can have. We prove a linear bound on ex(n,P) for any 2-tuple permutation matrix P, resolving a conjecture of Keszegh [B. Keszegh, On linear forbidden matrices, J. Combin. Theory Ser. A 116 (1) (2009) 232–241]. Using this result, we obtain a linear bound on ex(n,P) for any m-tuple permutation matrix P. Additionally, we demonstrate the existence of infinitely many minimal non-linear patterns, resolving another conjecture of Keszegh from the same paper.     

A constructive approach to minimal projections in Banach spaces

Let X be a Banach space and Y a finite-dimensional subspace of X. Let P be a minimal projection of X onto Y. It is shown (Theorem 1.1) that under certain conditions there exist sequences of finite-dimensional “approximating subspaces” X_m and Y_m of X with corresponding minimal projections P_m: X_m → Y_m, such that lim_m→∞ P_m = P. Moreover, a certain related sequence of projections i_m○P_m○π_m: X → Y has cluster points in the strong operator topology, each of which is a minimal projection of X onto Y. When X = C[a, b] the result reduces to a theorem of [7.]. It is shown (Corollary 1.11) that the hypothesis of Theorem 1.1 holds in many important Banach spaces, including C[a, b], L^P[a, b] and l^P for 1 p < ∞, and c₀, the space of sequences converging to zero in the sup norm.     

Polynomial growth rates

We consider linear equations v^′=A(t)v with a polynomial asymptotic behavior, that can be stable, unstable and central. We show that this behavior is exhibited by a large class of differential equations, by giving necessary and sufficient conditions in terms of generalized “polynomial” Lyapunov exponents for the existence of polynomial behavior. In particular, any linear equation in block form in a finite-dimensional space, with three blocks having “polynomial” Lyapunov exponents respectively negative, positive, and zero, has a nonuniform version of polynomial trichotomy, which corresponds to the usual notion of trichotomy but now with polynomial growth rates. We also obtain sharp bounds for the constants in the notion of polynomial trichotomy. In addition, we establish the persistence under sufficiently small nonlinear perturbations of the stability of a nonuniform polynomial contraction.     

The rate of convergence for the cyclic projections algorithm III: Regularity of convex sets

The cyclic projections algorithm is an important method for determining a point in the intersection of a finite number of closed convex sets in a Hilbert space. That is, for determining a solution to the “convex feasibility” problem. This is the third paper in a series on a study of the rate of convergence for the cyclic projections algorithm. In the first of these papers, we showed that the rate could be described in terms of the “angles” between the convex sets involved. In the second, we showed that these angles often had a more tractable formulation in terms of the “norm” of the product of the (nonlinear) metric projections onto related convex sets.In this paper, we show that the rate of convergence of the cyclic projections algorithm is also intimately related to the “linear regularity property” of Bauschke and Borwein, the “normal property” of Jameson (as well as Bakan, Deutsch, and Li’s generalization of Jameson’s normal property), the “strong conical hull intersection property” of Deutsch, Li, and Ward, and the rate of convergence of iterated parallel projections. Such properties have already been shown to be important in various other contexts as well.     

Drapeau theorem for differential systems

Generalizing the theorem for Goursat flags, we will characterize those flags which are obtained by “rank 1 prolongation” from the space of 1 jets for 1 independent and m dependent variables.     

New results on the convergence of the conjugate gradient method

This paper is concerned with proving theoretical results related to the convergence of the conjugate gradient (CG) method for solving positive definite symmetric linear systems. Considering the inverse of the projection of the inverse of the matrix, new relations for ratios of the A‐norm of the error and the norm of the residual are provided, starting from some earlier results of Sadok (Numer. Algorithms 2005; 40 :201–216). The proofs of our results rely on the well‐known correspondence between the CG method and the Lanczos algorithm. Copyright © 2008 John Wiley & Sons, Ltd.