Related papers: A new proof of an equality associated with submatr…
In applications of linear algebra including nuclear physics and structural dynamics, there is a need to deal with uncertainty in the matrices. We focus on matrices that depend on a set of parameters $\omega$ and we are interested in the…
Applications related to artificial intelligence, machine learning, and system identification simulations essentially use eigenvectors. Calculating eigenvectors for very large matrices using conventional methods is compute-intensive and…
This paper establishes new upper bounds for the right eigenvalues of monic matrix polynomials over the quaternion division algebra. The noncommutative nature of quaternion multiplication presents fundamental challenges in eigenvalue…
We prove a conjecture of Dekimpe, De Rock and Penninckx concerning the existence of eigenvalues one in certain elements of finite groups acting irreducibly on a real vector space of odd dimension. This yields a sufficient condition for a…
In this paper motivated by the celebrated fundamental theorem of algebra and its standard proof utilizing Liouville's Theorem, we prove the fundamental theorem of algebra type results for both commutative and noncommutative polynomials in…
Matrix-valued Cauchy bi-orthogonal polynomials were proposed in this paper, together with its quasideterminant expression. It is shown that the coefficients in four-term recurrence relation for matrix-valued Cauchy bi-orthogonal polynomials…
We prove a conjecture of Dekimpe, De Rock and Penninckx concerning the existence of eigenvalues one in certain elements of finite groups acting irreducibly on a real vector space of odd dimension. This yields a sufficient condition for a…
We study and derive algorithms for nonlinear eigenvalue problems, where the system matrix depends on the eigenvector, or several eigenvectors (or their corresponding invariant subspace). The algorithms are derived from an implicit…
In this short note, we present a novel method for computing exact lower and upper bounds of eigenvalues of a symmetric tridiagonal interval matrix. Compared to the known methods, our approach is fast, simple to present and to implement, and…
To locate all eigenvalues of a matrix more precisely, we exclude some sets which do not include any eigenvalue of the matrix from the well-known Brauer set to give two new Brauer-type eigenvalue inclusion sets. And it is also shown that the…
In this paper we prove the optimal convergence of a standard adaptive scheme based on edge finite elements for the approximation of the solutions of the eigenvalue problem associated with Maxwell's equations. The proof uses the known…
We present an Oppenheim type determinantal inequality for positive definite block matrices. Recently, Lin [Linear Algebra Appl. 452 (2014) 1--6] proved a remarkable extension of Oppenheim type inequality for block matrices, which solved a…
In this paper, I study the simple eigenvectors of two hypomorphic matrices using linear algebra. I give new proofs of results of Godsil and MaKay.
Preconditioned iterative methods for numerical solution of large matrix eigenvalue problems are increasingly gaining importance in various application areas, ranging from material sciences to data mining. Some of them, e.g., those using…
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…
Eigenvector continuation is a computational method that finds the extremal eigenvalues and eigenvectors of a Hamiltonian matrix with one or more control parameters. It does this by projection onto a subspace of eigenvectors corresponding to…
In this article we prove convergence of adaptive finite element methods for second order elliptic eigenvalue problems. We consider Lagrange finite elements of any degree and prove convergence for simple as well as multiple eigenvalues under…
We describe recent work of Kim in arXiv:1210.5190 to show that operator convex functions associated with quasi-entropies can be used to prove a large class of new matrix inequalities in the tri-partite and bi-partite setting by taking a…
Let $A, B$ and $X$ be $n\times n$ matrices such that $A, B$ are positive semidefinite. We present some refinements of the matrix Cauchy-Schwarz inequality by using some integration techniques and various refinements of the Hermite--Hadamard…
We bring in some new notions associated with $2\times 2$ block positive semidefinite matrices. These notions concern the inequalities between the singular values of the off diagonal blocks and the eigenvalues of the arithmetic mean or…