Results 41 to 50 of about 3,534,092 (344)
A recursive condition for the symmetric nonnegative inverse eigenvalue problem
Revista Integración, 2017 In this paper we present a sufficient ondition and a necessary condition for Symmetri Nonnegative Inverse Eigenvalue Problem. This condition is independent of the existing realizability criteria.
Elvis Ronald Valero +2 more
doaj +1 more source
Non symmetric random walk on infinite graph [PDF]
Opuscula Mathematica, 2011 We investigate properties of a non symmetric Markov's chain on an infinite graph. We show the connection with matrix valued random walk polynomials which satisfy the orthogonality formula with respect to non a symmetric matrix valued measure.
Marcin J. Zygmunt
doaj +1 more source
The derivative of an orthogonal matrix of eigenvectors of a symmetric matrix
Linear Algebra and its Applications, 1997 AbstractThe authors supply the derivative of an orthogonal matrix of eigenvectors of a real symmetric matrix. To illustrate the applicability of their result they consider a real symmetric random matrix for which a more or less standard convergence in distribution is assumed to hold.
Kollo, T., Neudecker, H.
openaire +4 more sources
International Journal of Mathematics and Mathematical Sciences, 2009 In this paper we present equivalent characterizations of k-Kernel symmetric Matrices. Necessary and sufficient conditions are determined for a matrix to be k-Kernel Symmetric. We give some basic results of kernel symmetric matrices.
A. R. Meenakshi, D. Jaya Shree
doaj +1 more source
Cauchy's interlace theorem and lower bounds for the spectral radius
International Journal of Mathematics and Mathematical Sciences, 2000 We present a short and simple proof of the well-known Cauchy interlace theorem. We use the theorem to improve some lower bound estimates for the spectral radius of a real symmetric matrix.
A. McD. Mercer, Peter R. Mercer
doaj +1 more source
Generating Polynomials and Symmetric Tensor Decompositions [PDF]
, 2015 This paper studies symmetric tensor decompositions. For symmetric tensors, there exist linear relations of recursive patterns among their entries. Such a relation can be represented by a polynomial, which is called a generating polynomial.
Nie, Jiawang
core +1 more source
Symmetric matrix pencils: codimension counts and the solution of a pair of matrix equations
, 2014 The set of all solutions to the homogeneous system of matrix equations (X-T A + AX, X-T B + BX) = (0, 0), where (A, B) is a pair of symmetric matrices of the same size, is characterized.
Andrii Dmytryshyn +2 more
semanticscholar +1 more source
Unitary equivalence to a complex symmetric matrix: a modulus criterion [PDF]
, 2010 We develop a procedure for determining whether a square complex matrix is unitarily equivalent to a complex symmetric (i.e., self-transpose) matrix. Our approach has several advantages over existing methods.
S. Garcia, Daniel E. Poore, M. Wyse
semanticscholar +1 more source
Journal of Computational and Applied Mathematics, 1991 AbstractA significant number of matrix eigenvalue problems, quadratic or linear, are best reformulated as pencils (A, M) in which both A and M are real and symmetric. Some examples are given and then the canonical forms are re-examined to explain the role of the sign characteristic attached to real eigenvalues. In addition we examine the limitations on
openaire +2 more sources
The distribution of symmetric matrix quotients
Journal of Multivariate Analysis, 2003 AbstractPhillips (J. Multivariate Anal. 16 (1985) 157) generalizes Cramer's (Mathematical Methods of Statistics, Princeton University Press, Princeton, NJ, 1946) inversion formula for the distribution of a quotient of two scalar random variables to the matrix quotient case. However, he gives the result for the asymmetric matrix quotient case. This note
Arjun K. Gupta, D. G. Kabe
openaire +2 more sources