On solutions of matrix equations and

With the help of the Kronecker map, a complete, general and explicit solution to the Yakubovich matrix equation V−AVF=BW, with F in an arbitrary form, is proposed. The solution is neatly expressed by the controllability matrix of the matrix pair (A,B), a symmetric operator matrix and an observability matrix. Some equivalent forms of this solution are also presented. Based on these results, explicit solutions to the so-called Kalman–Yakubovich equation and Stein equation are also established. In addition, based on the proposed solution of the Yakubovich matrix equation, a complete, general and explicit solution to the so-called Yakubovich-conjugate matrix is also established by means of real representation. Several equivalent forms are also provided. One of these solutions is neatly expressed by two controllability matrices, two observability matrices and a symmetric operator matrix.     

Closed-form solutions to the nonhomogeneous Yakubovich-conjugate matrix equation

Some closed-form solutions are provided for the nonhomogeneous Yakubovich-conjugate matrix equation with X and Y being unknown matrices. The presented solutions can offer all the degrees of freedom which is represented by an arbitrarily chosen parameter matrix. The primary feature of the solutions is that the matrices F and R are not restricted to be in any canonical form, or may be even unknown a priori. One of the solutions is neatly expressed in terms of controllability matrices and observability matrices.     

On equivalence and explicit solutions of a class of matrix equations

It is shown in this paper that three types of matrix equations AX−XF=BY,AX−EXF=BY and which have wide applications in control systems theory, are equivalent to the matrix equation with their coefficient matrices satisfying some relations. Based on right coprime factorization to , explicit solutions to the equation are proposed and thus explicit solutions to the former three types of matrix equations can be immediately established. With the special structure of the proposed solutions, necessary conditions to the nonsingularity of matrix X are also obtained. The proposed solutions give an ultimate and unified formula for the explicit solutions to these four types of linear matrix equations.     

Null controllability for the parabolic equation with a complex principal part

The paper is devoted to a study of the null controllability for the semilinear parabolic equation with a complex principal part. For this purpose, we establish a key weighted identity for partial differential operators (with real functions α and β), by which we develop a universal approach, based on global Carleman estimate, to deduce not only the desired explicit observability estimate for the linearized complex Ginzburg-Landau equation, but also all the known controllability/observability results for the parabolic, hyperbolic, Schrödinger and plate equations that are derived via Carleman estimates.     

A generalization of Fibonacci and Lucas matrices

We define the matrix of type s, whose elements are defined by the general second-order non-degenerated sequence and introduce the notion of the generalized Fibonacci matrix , whose nonzero elements are generalized Fibonacci numbers. We observe two regular cases of these matrices (s=0 and s=1). Generalized Fibonacci matrices in certain cases give the usual Fibonacci matrix and the Lucas matrix. Inverse of the matrix is derived. In partial case we get the inverse of the generalized Fibonacci matrix and later known results from [Gwang-Yeon Lee, Jin-Soo Kim, Sang-Gu Lee, Factorizations and eigenvalues of Fibonaci and symmetric Fibonaci matrices, Fibonacci Quart. 40 (2002) 203–211; P. Staˇnicaˇ, Cholesky factorizations of matrices associated with r-order recurrent sequences, Electron. J. Combin. Number Theory 5 (2) (2005) #A16] and [Z. Zhang, Y. Zhang, The Lucas matrix and some combinatorial identities, Indian J. Pure Appl. Math. (in press)]. Correlations between the matrices , and the generalized Pascal matrices are considered. In the case a=0,b=1 we get known result for Fibonacci matrices [Gwang-Yeon Lee, Jin-Soo Kim, Seong-Hoon Cho, Some combinatorial identities via Fibonacci numbers, Discrete Appl. Math. 130 (2003) 527–534]. Analogous result for Lucas matrices, originated in [Z. Zhang, Y. Zhang, The Lucas matrix and some combinatorial identities, Indian J. Pure Appl. Math. (in press)], can be derived in the partial case a=2,b=1. Some combinatorial identities involving generalized Fibonacci numbers are derived.     

Regular matrices and their strong preservers over semirings

An m×n matrix A over a semiring is called regular if there is an n×m matrix G over such that AGA=A. We study the problem of characterizing those linear operators T on the matrices over a semiring such that T(X) is regular if and only if X is. Complete characterizations are obtained for many semirings including the Boolean algebra, the nonnegative reals, the nonnegative integers and the fuzzy scalars.     

LSQR iterative common symmetric solutions to matrix equations AXB = E and CXD = F

A new matrix based iterative method is presented to compute common symmetric solution or common symmetric least-squares solution of the pair of matrix equations AXB = E and CXD = F. By this iterative method, for any initial matrix X₀, a solution X^∗ can be obtained within finite iteration steps if exact arithmetic was used, and the solution X^∗ with the minimum Frobenius norm can be obtained by choosing a special kind of initial matrix. In addition, the unique nearest common symmetric solution or common symmetric least-squares solution to given matrix in Frobenius norm can be obtained by first finding the minimum Frobenius norm common symmetric solution or common symmetric least-squares solution of the new pair of matrix equations. The given numerical examples show that the matrix based iterative method proposed in this paper has faster convergence than the iterative methods proposed in [1] and [2] to solve the same problems.     

Limit theorems for branching Markov processes

We establish almost sure limit theorems for a branching symmetric Hunt process in terms of the principal eigenvalue and the ground state of an associated Schrödinger operator. Here the branching rate and the branching mechanism can be state-dependent. In particular, the branching rate can be a measure belonging to a certain Kato class and is allowed to be singular with respect to the symmetrizing measure for the underlying Hunt process X. The almost sure limit theorems are established under the assumption that the associated Schrödinger operator of X has a spectral gap. Such an assumption is satisfied if the underlying process X is a Brownian motion, a symmetric α-stable-like process on or a relativistic symmetric stable process on .     

On solutions of matrix equation XF−AX=C and XF-A\widetilde{X}=C over quaternion field

By means of Kronecker map and complex representation of a quaternion matrix, some explicit solutions to the quaternion matrix equations XF?AX=C and $XF-A\widetilde{X}=C$ are established. One of the solutions is neatly expressed by a symmetric matrix, a controllability matrix and an observability matrix. In addition, two practical algorithms for these two equations are given.     

On the nonlinear matrix equation

Based on fixed point theorems for monotone and mixed monotone operators in a normal cone, we prove that the nonlinear matrix equation always has a unique positive definite solution. A conjecture which is proposed in [X.G. Liu, H. Gao, On the positive definite solutions of the matrix equation X^s±A^TX^-tA=I_n, Linear Algebra Appl. 368 (2003) 83–97] is solved. Multi-step stationary iterative method is proposed to compute the unique positive definite solution. Numerical examples show that this iterative method is feasible and effective.     

A condition for the nonsymmetric saddle point matrix being diagonalizable and having real and positive eigenvalues

This paper discusses the spectral properties of the nonsymmetric saddle point matrices of the form with A symmetric positive definite, B full rank, and C symmetric positive semidefinite. A new sufficient condition is obtained so that is diagonalizable with all its eigenvalues real and positive. This condition is weaker than that stated in the recent paper [J. Liesen, A note on the eigenvalues of saddle point matrices, Technical Report 10-2006, Institute of Mathematics, TU Berlin, 2006].     

An iterative algorithm for the least squares bisymmetric solutions of the matrix equations

In this paper, an iterative algorithm is constructed to solve the minimum Frobenius norm residual problem: min over bisymmetric matrices. By this algorithm, for any initial bisymmetric matrix X₀, a solution X^* can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of initial matrix. Furthermore, in the solution set of the above problem, the unique optimal approximation solution to a given matrix in the Frobenius norm can be derived by finding the least norm bisymmetric solution of a new corresponding minimum Frobenius norm problem. Given numerical examples show that the iterative algorithm is quite effective in actual computation.     

On linear combinations of two tripotent, idempotent, and involutive matrices

Let A=c₁A₁+c₂A₂, wherec₁, c₂ are nonzero complex numbers and (A₁,A₂) is a pair of two n×n nonzero matrices. We consider the problem of characterizing all situations where a linear combination of the form A=c₁A₁+c₂A₂ is (i) a tripotent or an involutive matrix when are commuting involutive or commuting tripotent matrices, respectively, (ii) an idempotent matrix when are involutive matrices, and (iii) an involutive matrix when are involutive or idempotent matrices.     

On the Drazin inverse of the sum of two operators and its application to operator matrices

Given two bounded linear operators F,G on a Banach space X such that G²F=GF²=0, we derive an explicit expression for the Drazin inverse of F+G. For this purpose, firstly, we obtain a formula for the resolvent of an auxiliary operator matrix in the form . From the provided representation of D(F+G) several special cases are considered. In particular, we recover the case GF=0 studied by Hartwig et al. [R.E. Hartwig, G. Wang, Y. Wei, Some additive results on Drazin inverse, Linear Algebra Appl. 322 (2001) 207-217] for matrices and by Djordjevi? and Wei [D.S. Djordjevi?, Y. Wei, Additive results for the generalized Drazin inverse, J. Aust. Math. Soc. 73 (1) (2002) 115-126] for operators. Finally, we apply our results to obtain representations for the Drazin inverse of operator matrices in the form which are extensions of some cases given in the literature.     

A symmetric inverse eigenvalue problem in structural dynamic model updating

In this paper, we first give the representation of the general solution of the following inverse eigenvalue problem (IEP): Given X∈R^n×p and a diagonal matrix Λ∈R^p×p, find real-valued symmetric (2r+1)-diagonal matrices M and K such that MXΛ=KX. We then consider an optimal approximation problem: Given real-valued symmetric (2r+1)-diagonal matrices M_a,K_a∈R^n×n, find such that where S_MK is the solution set of IEP. We show that the optimal approximation solution is unique and derive an explicit formula for it.     

Catalan matrix and related combinatorial identities

We introduce the notion of the Catalan matrix whose non-zero elements are expressions which contain the Catalan numbers arranged into a lower triangular Toeplitz matrix. Inverse of the Catalan matrix is derived. Correlations between the matrix and the generalized Pascal matrix are considered. Some combinatorial identities involving Catalan numbers, binomial coefficients and the generalized hypergeometric function are derived using these correlations. Moreover, an additional explicit representation of the Catalan number, as well as an explicit representation of the sum of the first m Catalan numbers are given.     

Singular-value-like decomposition for complex matrix triples

The classical singular value decomposition for a matrix A∈C^m×n is a canonical form for A that also displays the eigenvalues of the Hermitian matrices AA^∗ and A^∗A. In this paper, we develop a corresponding decomposition for A that provides the Jordan canonical forms for the complex symmetric matrices and . More generally, we consider the matrix triple , where are invertible and either complex symmetric or complex skew-symmetric, and we provide a canonical form under transformations of the form , where X,Y are nonsingular.