Related papers: Solving General Joint Block Diagonalization Proble…
We consider nonnormal matrix-valued dynamical systems with discrete time. For an eigenvalue of matrix, the number of times it appears as a root of the characteristic polynomial is called the algebraic multiplicity. On the other hand, the…
The paper describes several efficient parallel implementations of the one-sided hyperbolic Jacobi-type algorithm for computing eigenvalues and eigenvectors of Hermitian matrices. By appropriate blocking of the algorithms an almost ideal…
The main aim of this paper is the study of the general solution of the exceptional Hermite differential equation with fixed partition $\lambda = (1)$ and the construction of minimal surfaces associated with this solution. We derive a linear…
This paper introduces a novel framework for matrix diagonalization, recasting it as a sequential decision-making problem and applying the power of Decision Transformers (DTs). Our approach determines optimal pivot selection during…
The standard way of solving the polynomial eigenvalue problem associated with a matrix polynomial is to embed the matrix polynomial into a matrix pencil, transforming the problem into an equivalent generalized eigenvalue problem. Such…
The supporting vectors of a matrix A are the solutions of max || x ||_2 =1 {||Ax||_2^2}. The generalized supporting vectors of matrices A_1 , . . . , A_k are the solutions of max || x ||_2 =1 {||A_1x||_2^2 + ||A_2x||_2^2 + ... +…
The real radical ideal of a system of polynomials with finitely many complex roots is generated by a system of real polynomials having only real roots and free of multiplicities. It is a central object in computational real algebraic…
In continuation to our recent work on noncommutative polynomial factorization, we consider the factorization problem for matrices of polynomials and show the following results. (1) Given as input a full rank $d\times d$ matrix $M$ whose…
We study $N \times N$ random band matrices $H = (H_{xy})$ with mean-zero complex Gaussian entries, where $x,y$ lie on the discrete torus $(\mathbb{Z} / \sqrt[d]{N} \mathbb{Z})^d$ in dimensions $d \ge 3$. The variance profile satisfies…
We introduce a new family of strong linearizations of matrix polynomials---which we call "block Kronecker pencils"---and perform a backward stability analysis of complete polynomial eigenproblems. These problems are solved by applying any…
In [19], Taslaman, Tisseur, and Zaballa show that any regular matrix polynomial $P(\lambda)$ over an algebraically closed field is spectrally equivalent to a triangular matrix polynomial of the same degree. When $P(\lambda)$ is real and…
We present a method to linearize, without approximation, a specific class of eigenvalue problems with eigenvector nonlinearities (NEPv), where the nonlinearities are expressed by scalar functions that are defined by a quotient of linear…
The assumption of independent subvectors arises in many aspects of multivariate analysis. In most real-world applications, however, we lack prior knowledge about the number of subvectors and the specific variables within each subvector.…
We consider linear matrix inequalities (LMIs) $A = A_0 + x_1 A_1 + ... + x_n A_n \succeq 0$ with the $A_i$'s being $m \times m$ symmetric matrices, with entries in a ring $\mathcal{R}$. When $\mathcal{R} = \mathbb{R}$, the feasibility…
We discuss here the application of the simultaneous block diagonalization (SBD) of matrices to the study of the stability of both complete and cluster synchronization in random (generic) networks. For both problems, we define indices that…
We present a new matrix-valued isospectral ordinary differential equation that asymptotically block-diagonalizes $n\times n$ zero-diagonal Jacobi matrices employed as its initial condition. This o.d.e.\ features a right-hand side with a…
We present a matrix version of a known method of constructing common eigenvectors of two diagonalizable commuting matrices, thus enabling their simultaneous diagonalization. The matrices may have simple eigenvalues of multiplicity greater…
The paper studies the global convergence of the block Jacobi me\-thod for symmetric matrices. Given a symmetric matrix $A$ of order $n$, the method generates a sequence of matrices by the rule $A^{(k+1)}=U_k^TA^{(k)}U_k$, $k\geq0$, where…
We draw attention to the fact that a Hermitian matrix is always diagonalizable and has real discrete spectrum whereas the Hermitian Schr{\"o}dinger Hamiltonian: $H=p^2/2\mu+V(x)$, may not be so. For instance when $V(x)=x, x^3, -x^2$, $H$…
An effective exact method is proposed for computing generalized eigenspaces of a matrix of integers or rational numbers. Keys of our approach are the use of minimal annihilating polynomials and the concept of the Jourdan-Krylov basis. A new…