Estimation of the Multivariate Normal Precision Matrix under the Entropy Loss

Let X ₁, , X _n (n > p) be a random sample from multivariate normal distribution N _p (, ), where R ^p and is a positive definite matrix, both and being unknown. We consider the problem of estimating the precision matrix ^–1. In this paper it is shown that for the entropy loss, the best lower-triangular affine equivariant minimax estimator of ^–1 is inadmissible and an improved estimator is explicitly constructed. Note that our improved estimator is obtained from the class of lower-triangular scale equivariant estimators.     

Fracture Model for a Thin Layer of a Fibrous Composite

A model for a flat isolated layer of a unidirectional fibrous composite with a regular structure is constructed to investigate the possible variants of its failure development. An integrodifferential equation for determining the forces in fibers is obtained. Primary attention is focused on examining the failure process after the rupture of one fiber. This causes a drastic redistribution of stresses, which can lead to a failure of adjacent fibers owing to the increased load on them, to an interfacial shear fracture, and to the matrix cracking. It is shown that the development of layer failure is determined by the strength of fibers, the crack resistance of the matrix in axial tension and transverse shear, and also by the adhesion strength of the matrix-fiber interface. The sufficient conditions of applicability of the brittle fracture model are formulated.     

On perturbations of matrix pencils with real spectra, a revisit

This paper continues earlier studies by Bhatia and Li on eigenvalue perturbation theory for diagonalizable matrix pencils having real spectra. A unifying framework for creating crucial perturbation equations is developed. With the help of a recent result on generalized commutators involving unitary matrices, new and much sharper bounds are obtained.

     

A note on the spectrum of an upper triangular operator matrix

Let be a upper triangular operator matrix acting on the Banach space . We investigate the set of the operators for which , where denotes the spectrum.

     

Quadruple systems of the projective special linear group PSL(2,q), q ≡ 1 (mod 4)

We determine the distribution of quadruple systems among the orbits of 4‐element subsets under the action of PSL(2,q) on the projective line when q ≡ 1 (mod 4). © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 339–351, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10043     

The solvability conditions for inverse eigenproblem of symmetric and anti‐persymmetric matrices and its approximation

The problem of generating a matrix A with specified eigen‐pair, where A is a symmetric and anti‐persymmetric matrix, is presented. An existence theorem is given and proved. A general expression of such a matrix is provided. We denote the set of such matrices by ??????_Eⁿ. The optimal approximation problem associated with ??????_Eⁿ is discussed, that is: to find the nearest matrix to a given matrix A* by A∈??????_Eⁿ. The existence and uniqueness of the optimal approximation problem is proved and the expression is provided for this nearest matrix. Copyright © 2002 John Wiley & Sons, Ltd.     

The Constrained Solutions of Two Matrix Equations

We study the symmetric positive semidefinite solution of the matrix equation AX ₁ A ^T + BX ₂ B ^T = C, where A is a given real m×n matrix, B is a given real m×p matrix, and C is a given real m×m matric, with m, n, p positive integers; and the bisymmetric positive semidefinite solution of the matrix equation D ^T XD = C, where D is a given real n×m matrix, C is a given real m×m matrix, with m, n positive integers. By making use of the generalized singular value decomposition, we derive general analytic formulae, and present necessary and sufficient conditions for guaranteeing the existence of these solutions. Received December 17, 1999, Revised January 10, 2001, Accepted March 5, 2001     

A Fast, Direct Algorithm for the Lippmann–Schwinger Integral Equation in Two Dimensions

The state-of-the-art, large-scale numerical simulations of the scattering problem for the Helmholtz equation in two dimensions rely on iterative solvers for the Lippmann–Schwinger integral equation, with an optimal CPU time O(m ³ log(m)) for an m-by-m wavelength problem. We present a method to solve the same problem directly, as opposed to iteratively, with the obvious advantage in efficiency for multiple right-hand sides corresponding to distinct incident waves. Analytically, this direct method is a hierarchical, recursive scheme consisting of the so-called splitting and merging processes. Algebraically, it amounts to a recursive matrix decomposition, for a cost of O(m ³), of the discretized Lippmann–Schwinger operator. With this matrix decomposition, each back substitution requires only O(m ² log(m)); therefore, a scattering problem with m incident waves can be solved, altogether, in O(m ³ log(m)) flops.     

Jordan标准形定理的初等变换证明

本文对 Jordan标准形定理给出了一种使用初等变换的证明 ,直观意义明显、易于理解 ,可用于线性代数教学 .