On single and double Soules matrices

Until now the concept of a Soules basis matrix of sign patternN consisted of an orthogonal matrix R∈R^n,n, generated in a certain way from a positive n-vector, which has the property that for any diagonal matrix Λ = diag(λ₁, … , λ_n), with λ₁ ? ? ? λ_n ? 0, the symmetric matrix A = RΛR^T has nonnegative entries only. In the present paper we introduce the notion of a pair of double Soules basis matrices of sign patternN which is a pair of matrices (P, Q), each in R^n,n, which are not necessarily orthogonal and which are generated in a certain way from two positive vectors, but such that PQ^T = I and such that for any of the aforementioned diagonal matrices Λ, the matrix A = PΛQ^T (also) has nonnegative entries only. We investigate the interesting properties which such matrices A have.As a preamble to the above investigation we show that the iterates, , generated in the course of the QR-algorithm when it is applied to A = RΛR^T, where R is a Soules basis matrix of sign pattern N, are again symmetric matrices generated by the Soules basis matrices R_k of sign pattern N which are themselves modified as the algorithm progresses.Our work here extends earlier works by Soules and Elsner et al.     

The left and right inverse eigenvalue problems of generalized reflexive and anti-reflexive matrices

Let n×n complex matrices R and S be nontrivial generalized reflection matrices, i.e., R^∗=R=R⁻¹≠±I_n, S^∗=S=S⁻¹≠±I_n. A complex matrix A with order n is said to be a generalized reflexive (or anti-reflexive ) matrix, if RAS=A (or RAS=−A). In this paper, the solvability conditions of the left and right inverse eigenvalue problems for generalized reflexive and anti-reflexive matrices are derived, and the general solutions are also given. In addition, the associated approximation solutions in the solution sets of the above problems are provided. The results in present paper extend some recent conclusions.     

A finite difference solution to a two-dimensional parabolic inverse problem

In this paper, we consider the problem of finding u = u(x, y, t) and p = p(t) which satisfy u_t = u_xx + u_yy + p(t)u + ? in R × [0, T], u(x, y, 0) = f(x, y), (x, y) ∈ R = [0, 1] × [0, 1], u is known on the boundary of R and u(x^∗, y^∗, t) = E(t), 0 < t ? T, where E(t) is known and (x^∗, y^∗) is a given point of R. Through a function transformation, the nonlinear two-dimensional diffusion problem is transformed into a linear problem, and a backward Euler scheme is constructed. It is proved by the maximum principle that the scheme is uniquely solvable, unconditionally stable and convergent in L_∞ norm. The convergence orders of u and p are of O(τ + h²). The impact of initial data errors on the numerical solution is also considered. Numerical experiments are presented to illustrate the validity of the theoretical results.     

Alexandrov’s inequality and conjectures on some Toeplitz matrices

We study determinant inequalities for certain Toeplitz-like matrices over C. For fixed n and N ? 1, let Q be the n × (n + N − 1) zero-one Toeplitz matrix with Q_ij = 1 for 0 ? j − i ? N − 1 and Q_ij = 0 otherwise. We prove that det(QQ^∗) is the minimum of det(RR^∗) over all complex matrices R with the same dimensions as Q satisfying ∣R_ij∣ ? 1 whenever Q_ij = 1 and R_ij = 0 otherwise. Although R has a Toeplitz-like band structure, it is not required to be actually Toeplitz. Our proof involves Alexandrov’s inequality for polarized determinants and its generalizations. This problem is motivated by Littlewood’s conjecture on the minimum 1-norm of N-term exponential sums on the unit circle. We also discuss polarized Bazin-Reiss-Picquet identities, some connections with k-tree enumeration, and analogous conjectured inequalities for the elementary symmetric functions of QQ^∗.     

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.     

Matrices A such that AA − AA are nonsingular

In this paper we study the class of square matrices A such that AA^† − A^†A is nonsingular, where A^† stands for the Moore-Penrose inverse of A. Among several characterizations we prove that for a matrix A of order n, the difference AA^† − A^†A is nonsingular if and only if R(A)⊕R(A^∗)=C_n,1, where R(·) denotes the range space. Also we study matrices A such that R(A)^⊥=R(A^∗).     

Minimal ranks of some quaternion matrix expressions with applications

Suppose that p(X, Y) = A − BX − X^(∗)B^(∗) − CYC^(∗) and q(X, Y) = A − BX + X^(∗)B^(∗) − CYC^(∗) are quaternion matrix expressions, where A is persymmetric or perskew-symmetric. We in this paper derive the minimal rank formula of p(X, Y) with respect to pair of matrices X and Y = Y^(∗), and the minimal rank formula of q(X, Y) with respect to pair of matrices X and Y = −Y^(∗). As applications, we establish some necessary and sufficient conditions for the existence of the general (persymmetric or perskew-symmetric) solutions to some well-known linear quaternion matrix equations. The expressions are also given for the corresponding general solutions of the matrix equations when the solvability conditions are satisfied. At the same time, some useful consequences are also developed.     

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.     

New characterizations of EP, generalized normal and generalized Hermitian elements in rings

We present a number of new characterizations of EP elements in rings with involution in purely algebraic terms. Then, we study equivalent conditions for an element a in a ring with involution to satisfy aⁿa^∗ = a^∗aⁿ or aⁿ = (a^∗)ⁿ for arbitrary n ∈ N. For n = 1, we present some new characterizations of normal and Hermitian elements in rings with involution.     

Bifurcation from stability to instability for a free boundary problem modeling tumor growth by Stokes equation

We consider a free boundary problem modeling tumor growth in fluid-like tissue. The model equations include a diffusion equation for the nutrient concentration, and the Stokes equation with a source which represents the proliferation of tumor cells. The proliferation rate μ and the cell-to-cell adhesiveness γ which keeps the tumor intact are two parameters which characterize the “aggressiveness” of the tumor. For any positive radius R there exists a unique radially symmetric stationary solution with radius r=R. For a sequence μ/γ=Mn(R) there exist symmetry-breaking bifurcation branches of solutions with free boundary r=R+εYn,0(θ)+O(ε²) (n even ?2) for small |ε|, where Yn,0 is the spherical harmonic of mode (n,0). Furthermore, the smallest Mn(R), say Mn_∗(R), is such that n_∗=n_∗(R)→∞ as R→∞. In this paper we prove that the radially symmetric stationary solution with R=RS is linearly stable if μ/γ<N_∗(RS,γ) and linearly unstable if μ/γ>N_∗(RS,γ), where N_∗(RS,γ)?Mn_∗(RS), and we prove that strict inequality holds if γ is small or if γ is large. The biological implications of these results are discussed at the end of the paper.     

A bifurcation theorem for the p-logistic equation

We consider a p-logistic equation with an equidiffusive reaction. Using variational methods and truncation techniques, we show that there is a critical parameter value λ^∗ > 0 such that for λ > λ^∗ the problem has a unique positive smooth solution, and for λ ∈ (0, λ^∗] the problem has no positive solution.     

The two-dimensional Prouhet-Tarry-Escott problem

In this paper we generalize the Prouhet-Tarry-Escott problem (PTE) to any dimension. The one-dimensional PTE problem is the classical PTE problem. We concentrate on the two-dimensional version which asks, given parameters n,k∈N, for two different multi-sets {(x₁,y₁),…,(xn,yn)}, of points from Z² such that for all d,j∈{0,…,k} with j?d. We present parametric solutions for n∈{2,3,4,6} with optimal size, i.e., with k=n−1. We show that these solutions come from convex 2n-gons with all vertices in Z² such that every line parallel to a side contains an even number of vertices and prove that such convex 2n-gons do not exist for other values of n. Furthermore we show that solutions to the two-dimensional PTE problem yield solutions to the one-dimensional PTE problem. Finally, we address the PTE problem over the Gaussian integers.     

On the Hermitian positive definite solutions of nonlinear matrix equation X + A∗XA = Q

Nonlinear matrix equation X^s + A∗X^−tA = Q, where A, Q are n × n complex matrices with Q Hermitian positive definite, has widely applied background. In this paper, we consider the Hermitian positive definite solutions of this matrix equation with two cases: s ? 1, 0 < t ? 1 and 0 < s ? 1, t ? 1. We derive necessary conditions and sufficient conditions for the existence of Hermitian positive definite solutions for the matrix equation and obtain some properties of the solutions. We also propose iterative methods for obtaining the extremal Hermitian positive definite solution of the matrix equation. Finally, we give some numerical examples to show the efficiency of the proposed iterative methods.     

On Euclidean distance matrices

If A is a real symmetric matrix and P is an orthogonal projection onto a hyperplane, then we derive a formula for the Moore-Penrose inverse of PAP. As an application, we obtain a formula for the Moore-Penrose inverse of an Euclidean distance matrix (EDM) which generalizes formulae for the inverse of a EDM in the literature. To an invertible spherical EDM, we associate a Laplacian matrix (which we define as a positive semidefinite n × n matrix of rank n − 1 and with zero row sums) and prove some properties. Known results for distance matrices of trees are derived as special cases. In particular, we obtain a formula due to Graham and Lovász for the inverse of the distance matrix of a tree. It is shown that if D is a nonsingular EDM and L is the associated Laplacian, then D⁻¹ − L is nonsingular and has a nonnegative inverse. Finally, infinitely divisible matrices are constructed using EDMs.     

On numerical ranges of the compressions of normal matrices

For an n × n normal matrix A, whose numerical range NR[A] is a k-polygon (k ? n), an n × (k − 1) isometry matrix P is constructed by a unit vector υ∈Cⁿ, and NR[P∗AP] is inscribed to NR[A]. In this paper, using the notations of NR[P∗AP] and some properties from projective geometry, an n × n diagonal matrix B and an n × (k − 2) isometry matrix Q are proposed such that NR[P∗AP] and NR[Q∗BQ] have as common support lines the edges of the k-polygon and share the same boundary points with the polygon. It is proved that the boundary of NR[P∗AP] is a differentiable curve and the boundary of the numerical range of a 3 × 3 matrix P∗AP is an ellipse, when the polygon is a quadrilateral.     

基于交替投影算法求解单变量线性约束矩阵方程问题

研究如下线性约束矩阵方程求解问题:给定A∈R~(m×n),B∈R~(n×p)和C∈R~(m×p),求矩阵X∈R(?)R~(n×n)"使得A×B=C以及相应的最佳逼近问题,其中集合R为如对称阵,Toeplitz阵等构成的线性子空间,或者对称半(ε)正定阵,(对称)非负阵等构成的闭凸集.给出了在相容条件下求解该问题的交替投影算法及算法收敛性分析.通过大量数值算例说明该算法的可行性和高效性,以及该算法较传统的矩阵形式的Krylov子空间方法(可行前提下)在迭代效率上的明显优势,本文也通过寻求加速技巧进一步提高算法的收敛速度.     

k-Potence preserving maps without the linearity and surjectivity assumptions

Let M_n be the space of all n × n complex matrices, and let Γ_n be the subset of M_n consisting of all n × n k-potent matrices. We denote by Ψ_n the set of all maps on M_n satisfying A − λB ∈ Γ_n if and only if ?(A) − λ?(B) ∈ Γ_n for every A,B ∈ M_n and λ ∈ C. It was shown that ? ∈ Ψ_n if and only if there exist an invertible matrix P ∈ M_n and c ∈ C with c^k−1 = 1 such that either ?(A) = cPAP⁻¹ for every A ∈ M_n, or ?(A) = cPA^TP⁻¹ for every A ∈ M_n.     

Existence and regularity of extremal solutions for a mean-curvature equation

We study a class of mean curvature equations −Mu=H+λup where M denotes the mean curvature operator and for p?1. We show that there exists an extremal parameter λ^∗ such that this equation admits a minimal weak solutions for all λ∈[0,λ^∗], while no weak solutions exists for λ>λ^∗ (weak solutions will be defined as critical points of a suitable functional). In the radially symmetric case, we then show that minimal weak solutions are classical solutions for all λ∈[0,λ^∗] and that another branch of classical solutions exists in a neighborhood (λ_∗−η,λ^∗) of λ^∗.