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.     

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 matrix equations and

With the help of the concept of Kronecker map, an explicit solution for the matrix equation X−AXF=C is established. This solution is neatly expressed by a symmetric operator matrix, a controllability matrix and an observability matrix. In addition, the matrix equation is also studied. An explicit solution for this matrix equation is also proposed by means of the real representation of a complex matrix. This solution is neatly expressed by a symmetric operator matrix, two controllability matrices and two observability matrices.     

Perturbation analysis of the matrix equation

Consider the nonlinear matrix equation X-A^*X^-pA=Q with 0<p1. This paper shows that there exists a unique positive definite solution to the equation. A perturbation bound and the backward error of an approximate solution to this solution is evaluated. We also obtain explicit expressions of the condition number for the unique positive definite solution. The theoretical results are illustrated by numerical examples.     

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.     

Solution of a nonsymmetric algebraic Riccati equation from a two-dimensional transport model

For the steady-state solution of an integral-differential equation from a two-dimensional model in transport theory, we shall derive and study a nonsymmetric algebraic Riccati equation B^--XF^--F⁺X+XB⁺X=0, where , and with a nonnegative matrix P, positive diagonal matrices D^±, and nonnegative parameters f, and . We prove the existence of the minimal nonnegative solution X^∗ under the physically reasonable assumption , and study its numerical computation by fixed-point iteration, Newton’s method and doubling. We shall also study several special cases; e.g. when and P is low-ranked, then is low-ranked and can be computed using more efficient iterative processes in U and V. Numerical examples will be given to illustrate our theoretical results.     

Polynomial Pell's equation-II

The polynomial Pell's equation is X²−DY²=1, where D is a polynomial with integer coefficients and the solutions X,Y must be polynomials with integer coefficients. Let D=A²+2C be a polynomial in , where . Then for a prime, a necessary and sufficient condition for which the polynomial Pell's equation has a nontrivial solution is obtained. Furthermore, all solutions to the polynomial Pell's equation satisfying the above condition are determined.     

Existence for nonlinear evolution inclusions with nonlocal retarded initial conditions

In this paper, we prove a sufficient condition for the global existence of bounded C⁰-solutions for a class of nonlinear functional differential evolution equation of the form where X is a real Banach space, A is the infinitesimal generator of a nonlinear compact semigroup, is a nonempty, convex, weakly compact valued, and almost strongly–weakly u.s.c. multi-function, and is nonexpansive.     

Completely positive mappings and mean matrices

Some functions f:R⁺→R⁺ induce mean of positive numbers and the matrix monotonicity gives a possibility for means of positive definite matrices. Moreover, such a function f can define a linear mapping on matrices (which is basic in the constructions of monotone metrics). The present subject is to check the complete positivity of in the case of a few concrete functions f. This problem has been motivated by applications in quantum information.     

Successive iteration and positive symmetric solution for a Sturm–Liouville-like four-point boundary value problem with a -Laplacian operator

In this paper, we consider the following Sturm–Liouville-like four-point p-Laplacian boundary value problem with the nonlinear term f depending on the first-order derivative subject to the boundary conditions By using a monotone iterative technique, the existence of symmetric positive solutions and corresponding iterative schemes are obtained.     

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.     

Thompson metric method for solving a class of nonlinear matrix equation

Based on the elegant properties of the Thompson metric, we prove that the general nonlinear matrix equation X^q-A^∗F(X)A=Q(q>1) always has a unique positive definite solution. An iterative method is proposed to compute the unique positive definite solution. We show that the iterative method is more effective as q increases. A perturbation bound for the unique positive definite solution is derived in the end.     

Further results on iterative methods for computing generalized inverses

In this paper, we reconsider the iterative method X_k=X_k−1+βY(I−AX_k−1), k=1,2,…,β∈C?{0} for computing the generalized inverse over Banach spaces or the generalized Drazin inverse a^d of a Banach algebra element a, reveal the intrinsic relationship between the convergence of such iterations and the existence of or a^d, and present the error bounds of the iterative methods for approximating or a^d. Moreover, we deduce some necessary and sufficient conditions for iterative convergence to or a^d.     

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.     

Alternating proximal algorithms for linearly constrained variational inequalities: Application to domain decomposition for PDE’s

Let X,Y,Z be real Hilbert spaces, let f:X→R∪{+∞}, g:Y→R∪{+∞} be closed convex functions and let A:X→Z, B:Y→Z be linear continuous operators. Let us consider the constrained minimization problem Given a sequence (γ_n) which tends toward 0 as n→+∞, we study the following alternating proximal algorithm where α and ν are positive parameters. It is shown that if the sequence (γ_n) tends moderately slowly toward 0, then the iterates of (A) weakly converge toward a solution of (P). The study is extended to the setting of maximal monotone operators, for which a general ergodic convergence result is obtained. Applications are given in the area of domain decomposition for PDE’s.     

Ranges of densely defined generalized pseudomonotone perturbations of maximal monotone operators

Let X be a real reflexive Banach space and be maximal monotone. Let be quasibounded, finitely continuous and generalized pseudomonotone with X′⊂D(B), where X′ is a dense subspace of X such that X′∩D(A)≠∅. Let S⊂X∗. Conditions are given under which and intS⊂intR(A+B). Results of Browder concerning everywhere defined continuous and bounded operators B are improved. Extensions of this theory are also given using the degree theory of the last two authors concerning densely defined perturbations of nonlinear maximal monotone operators which satisfy a generalized (S₊)-condition. Applications of this extended theory are given involving nonlinear parabolic problems on cylindrical domains.