Related papers: Eigenvector of a matrix in $SO_3(\mathbb{R})$

$\newcommand{\Vector}[1]{\bar{#1}{}}$ $\newcommand{\Basis}[1]{\bar{\bar{#1}}{}}$ $\newcommand{\RC}{{}_*{}^*-}$ Let $\Basis e$ be a basis of vector space $V$ over non-commutative $D$-algebra $A$. Endomorhism $\Vector{\Basis eb}$ of vector…

Let $k$ be a field and $n,a,b$ natural numbers. A matrix pencil $P$ is given by $n$ matrices of the same size with coefficients in $k$, say by $(b\times a)$-matrices, or, equivalently, by $n$ linear transformations $\alpha_i\:k^a \to k^b$…

If $A$ is an $n \times n$ Hermitian matrix with eigenvalues $\lambda_1(A),\dots,\lambda_n(A)$ and $i,j = 1,\dots,n$, then the $j^{\mathrm{th}}$ component $v_{i,j}$ of a unit eigenvector $v_i$ associated to the eigenvalue $\lambda_i(A)$ is…

Let $A$ be a fixed complex matrix and let $u,v$ be two vectors. The eigenvalues of matrices $A+\tau uv^\top $ $(\tau\in\mathbb{R})$ form a system of intersecting curves. The dependence of the intersections on the vectors $u,v$ is studied.

The Redheffer matrix $A_n \in \mathbb{R}^{n \times n}$ is defined by setting $A_{ij} = 1$ if $j=1$ or $i$ divides $j$ and 0 otherwise. One of its many interesting properties is that $\det(A_n) = O(n^{1/2 + \varepsilon})$ is equivalent to…

We find the eigenvalues and eigenvectors of the n by n matrix with (i,j) entry \binom(i-1,n-j), establishing a conjecture of Peele and Stanica. Curiously, the eigenvectors can be chosen to form a matrix which is its own inverse.

We give faster algorithms and improved sample complexities for estimating the top eigenvector of a matrix $\Sigma$ -- i.e. computing a unit vector $x$ such that $x^T \Sigma x \ge (1-\epsilon)\lambda_1(\Sigma)$: Offline Eigenvector…

The eigenvalue problem for an irreducible non negative matrix $A=[a_{ij}]$ in the max-algebra is the form $A \otimes x = \lambda x$ where $(A \otimes x)_i = \max (a_{ij}x_j), x=(x_1,x_2, \dots, x_n)^t $ and $\lambda $ refers to maximum…

For a given $3 \times 3$ real matrix $A$, the eigenvalue complementarity problem relative to the Lorentz cone consists of finding a real number $\lambda$ and a nonzero vector $x \in \mathbb{R}^3$ such that $x^T(A-\lambda I)x=0$ and both $x$…

We consider square matrices over $\mathbb{C}$ satisfying an identity relating their eigenvalues and the corresponding eigenvectors re-proved and discussed by Denton, Parker, Tao and Zhang, called the eigenvector-eigenvalue identity. We…

Unlike an irreducible $Z$-matrices, a weakly irreducible $Z$-tensor $\mathcal{A}$ can have more than one eigenvector associated with the least H-eigenvalue. We show that there are finitely many eigenvectors of $\mathcal{A}$ associated with…

We show that any 3-component octonionic vector which is purely imaginary, but not quaternionic, is an eigenvector of a 6-parameter family of Hermitian octonionic matrices, with imaginary eigenvalue equal to the associator of its elements.

A number $\lambda \in \mathbb C $ is called an {\it eigenvalue} of the matrix polynomial $P(z)$ if there exists a nonzero vector $x \in \mathbb C^n$ such that $P(\lambda)x = 0$. Note that each finite eigenvalue of $P(z)$ is a zero of the…

We previously showed that the real eigenvalues of 3x3 octonionic Hermitian matrices form two separate families, each containing 3 eigenvalues, and each leading to an orthonormal decomposition of the identity matrix, which would normally…

Riordan matrices are infinite lower triangular matrices determined by a pair of formal power series over the real or complex field. These matrices have been mainly studied as combinatorial objects with an emphasis placed on the algebraic or…

In the recent paper \cite{1}, Denton et al. provided the eigenvector-eigenvalue identity for Hermitian matrices, and a survey was also given for such identity in the literature. The main aim of this paper is to present the identity related…

The eigenvector-eigenvalue identities are expanded to include general mixing parameters. Some simple relations are obtained and they reveal an intricate texture of connections between the eigenvalues and the mixing parameters. Permutation…

Let $G$ be a graph with vertex set $V=\{v_{1},\dots,v_{n}\}$ and adjacency matrix $A.$ For a subset $S$ of $V$ let $\e=(x_{1},\,\dots,\,x_{n})^{\tt T}$ be the characteristic vector of $S,$ that is, $x_{\ell}=1$ if $v_{\ell}\in S$ and…

Let K be an arbitrary (commutative) field and L be an algebraic closure of it. Let V be a linear subspace of M_n(K), with n>2. We show that if every matrix of V has at most one eigenvalue in K, then dim V<=1+n(n-1)/2. If every matrix of V…

In this short note we prove that a matrix $A\in\mathbb{R}^{n,n}$ is self-adjoint if and only if it is equivariant with respect to the action of a group $\Gamma\subset {\bf O}(n)$ which is isomorphic to $\otimes_{k=1}^n\mathbf{Z}_2$.…