Eigenvalues of functions of orthogonal projectors

By representing two orthogonal projectors in a finite dimensional vector space as partitioned matrices, several characterizations concerning eigenvalues of various functions of the pair are obtained. These results substantially extend the ones already available in the literature. Additionally, some related results dealing with the functions of a pair of orthogonal projectors are provided, with the emphasis laying on the problem of invertibility.     

An Alternative Proof of the Greville Formula

A simple proof of the Greville formula for the recursive computation of the Moore–Penrose (MP) inverse of a matrix is presented. The proof utilizes no more than the elementary properties of the MP inverse.     

Newton-Like Iteration Based on a Cubic Polynomial for Structured Matrices

We recall Newtons iteration for computing the inverse or Moore–Penrose generalized inverse of a matrix. Then we specialize this approach to the case of structured matrices where all input, output and intermediate auxiliary matrices are represented in a compressed form, via their short displacement generators. We design a new Newton-like iteration based on a cubic polynomial and show its effectiveness by some numerical experiments for matrices from the Toeplitz-like class and the Cauchy-like class.     

Fast enclosure for the minimum norm least squares solution of the matrix equation AXB = C

Fast algorithms for enclosing the minimum norm least squares solution of the matrix equation AXB = C are proposed. To develop these algorithms, theories for obtaining error bounds of numerical solutions are established. The error bounds obtained by these algorithms are verified in the sense that all the possible rounding errors have been taken into account. Techniques for accelerating the enclosure and obtaining smaller error bounds are introduced. Numerical results show the properties of the proposed algorithms. Copyright © 2015 John Wiley & Sons, Ltd.     

Singular Normal Extremals and Conjugate Points for Bolza Functionals

In this paper, we study the problem of the optimal control for Bolza functionals by investigating extremals containing singular arcs. We use the Moore–Penrose generalized inverse, which allows one to determine normality criteria and sufficient conditions for the nonexistence of conjugate points.     

Properties of multilevel block -circulants

In a previous paper we characterized unilevel block α-circulants , , 0mn-1, in terms of the discrete Fourier transform of , defined by . We showed that most theoretical and computational problems concerning A can be conveniently studied in terms of corresponding problems concerning the Fourier coefficients F₀,F₁,…,F_n-1 individually. In this paper we show that analogous results hold for (k+1)-level matrices, where the first k levels have block circulant structure and the entries at the (k+1)-st level are unstructured rectangular matrices.     

On matrices over an arbitrary semiring and their generalized inverses

In this paper, we consider matrices with entries from a semiring S. We first discuss some generalized inverses of rectangular and square matrices. We establish necessary and sufficient conditions for the existence of the Moore–Penrose inverse of a regular matrix. For an m×n$m\times n$ matrix A  , an n×m$n\times m$ matrix P and a square matrix Q of order m, we present necessary and sufficient conditions for the existence of the group inverse of QAP   with the additional property that P(QAP)^#Q$P{(QAP)}^{\mathrm{\#}}Q$ is a {1,2}$\{1,2\}$ inverse of A  . The matrix product used here is the usual matrix multiplication. The result provides a method for generating elements in the set of {1,2}$\{1,2\}$ inverses of an m×n$m\times n$ matrix A starting from an initial {1} inverse of A  . We also establish a criterion for the existence of the group inverse of a regular square matrix. We then consider a semiring structure (_Mm×n(S),+,°)$({\mathbf{M}}_{m\times n}(\mathbf{S}),+,°)$ made up of m×n$m\times n$ matrices with the addition defined entry-wise and the multiplication defined as in the case of the Hadamard product of complex matrices. In the semiring (_Mm×n(S),+,°)$({\mathbf{M}}_{m\times n}(\mathbf{S}),+,°)$, we present criteria for the existence of the Drazin inverse and the Moore–Penrose inverse of an m×n$m\times n$ matrix. When S is commutative, we show that the Hadamard product preserves the Hermitian property, and provide a Schur-type product theorem for the product A°(CC^?)$A°(C{C}^{?})$ of a positive semidefinite n×n$n\times n$ matrix A   and an n×n$n\times n$ matrix C.     

Explicit solution of the operator equation

In this paper we find the explicit solution of the equation

A^*X+X^*A=B