329 hasil
Menampilkan 1–20 · 0,25 detik · RSS
Special Matrices
Scopus
ISSN 2300-7451 · De Gruyter · 329 artikel di indeks
-
Artikel Jurnal
Signless Laplacian characterization of cones over disjoint unions of cycles, edges and isolated vertices
Two graphs are said to be Q-cospectral if they share the same signless Laplacian spectrum. A simple graph is said to be determined by its signless Laplacian spectrum (abbreviated as DQS) if there exists no other non-isomorphic simple graph with the same signless Laplacian spectrum. In this paper…
-
Artikel Jurnal
Characterization of real matrices A such that p(X) = A admits a real matrix solution for every nonconstant real polynomial p
This paper provides a complete characterization of the real matrices A for which the equation p(X) = A has a real solution X∈Mn(R) $X\in {M}_{n}\left(\mathbb{R}\right)$ for every nonconstant polynomial p∈R[x] $p\in \mathbb{R}\left[x\right]$ . We prove that this property holds if and only if every…
-
Artikel Jurnal
New norm and numerical radius bounds for accretive-dissipative operator matrices
In operator and matrix theory, obtaining sharper bounds for quantities such as the operator norm and the numerical radius is of central importance. The main goal of this paper is to present new novel bounds that work for the norm and numerical radius of accretive–dissipative operator matrices, with…
-
Artikel Jurnal
Algebraic and metric structures of the geometric mean cone
The geometric mean cone (GMC) is a higher-order generalization of the second-order cone and the rotated quadratic cone. While these lower-order cones admit well-established Euclidean Jordan algebraic representations, no analogous framework is currently known for GMCs of order three or higher. In…
-
Artikel Jurnal
When does a matrix have a square root or a log?
When does a square matrix have a square root? When does it have a log? The answers to these questions lie in its Jordan form.
-
Artikel Jurnal
Linear maps preserving the Cullis’ determinant. III
This paper is the third in the series of papers devoted to the explicit description of linear maps preserving the Cullis’ determinant of rectangular matrices of size n × k with entries belonging to an arbitrary ground field which is large enough. In this part we study the remaining case where k = 3…
-
Artikel Jurnal
On the enumeration of symmetric tridiagonal matrices with prescribed determinant over commutative finite chain rings
Determinants of structured matrices play a fundamental role in both pure and applied mathematics, with wide-ranging applications in linear algebra, combinatorics, coding theory, and numerical analysis. In this work, the enumeration of symmetric tridiagonal matrices with prescribed determinant over…
-
Artikel Jurnal
A matrix variate inverse Lomax distribution
This study presents the matrix variate inverse Lomax distribution as a generalization of the univariate inverse Lomax distribution and shows that this distribution can be derived by using matrix variate gamma distributions. We study several properties such as cumulative distribution function…
-
Artikel Jurnal
What is a proper graph Laplacian? An operator-theoretic framework for graph diffusion
We introduce an operator-theoretic definition of a proper graph Laplacian as any matrix associated with a given graph that can be expressed as the composition of a divergence and a gradient operator, with the gradient acting between graph-related spaces and annihilating constant functions. This…
-
Artikel Jurnal
Universal realizability of left half-plane spectra
A list Λ={λ1,λ2,…,λn}\Lambda =\left\{{\lambda }_{1},{\lambda }_{2},\ldots ,{\lambda }_{n}\right\} of complex numbers is said to be realizable if it is the spectrum of an entrywise nonnegative matrix AA. The list Λ\Lambda is diagonalizably realizable (Dℛ{\mathcal{D {\mathcal R} }}) if a realizing…
-
Artikel Jurnal
Distribution eigenvalues and temperature index of graphs
Let GG be a simple graph on nn vertices with degree sequence d1,…,dn{d}_{1},\ldots ,{d}_{n}. Fajtlowicz (On conjectures of Graffiti, Discrete Math. 72 (1988), 113–118) defined the temperature of a vertex vv of GG as dn−d\frac{d}{n-d}, where dd is the degree of vv. Motivated by this definition, we…
-
Artikel Jurnal
The Jordan form of a triangular matrix
We show how to obtain analytic expressions for the Jordan form of an upper triangular matrix, including that of the standardizing matrix. For example, the Jordan form of a triangular banded matrix (a banded matrix is a matrix where nonzero entries are confined to a band along the main diagonal) is…
-
Artikel Jurnal
1-Sylvester matrices
A nonzero element aa is called 1-Sylvester in a ring RR, if there exist b,c∈Rb,c\in R such that 1=ab+ca1=ab+ca. In this article, we study such elements, mainly in matrix rings over commutative rings. In particular, we study the case when b=cb=c, when bb is called an anticommutator inverse for aa.
-
Artikel Jurnal
Lower and upper bounds for the eigenvalues of a pentadiagonal matrix arising in the Hodrick-Prescott filter
This study establishes lower and upper bounds for the eigenvalues of a symmetric pentadiagonal matrix arising in the Hodrick-Prescott (HP) filter, a widely used method for trend extraction in macroeconometrics. The derivation relies on the Cauchy interlacing theorem. Based on the results, we…
-
Artikel Jurnal
On the maximal Aa -index of graphs with a prescribed number of edges
For any real number α∈[0,1]\alpha \in \left[\mathrm{0,1}], by the Aα{A}_{\alpha }-matrix of a graph GG, we mean the matrix Aα(G)=αD(G)+(1−α)A(G){A}_{\alpha }\left(G)=\alpha D\left(G)+\left(1-\alpha )A\left(G), where A(G)A\left(G) and D(G)D\left(G) are the adjacency matrix and the diagonal matrix of…
-
Artikel Jurnal
Matrices having a positive determinant and all other minors nonpositive
The class of square matrices of order nn having a positive determinant and all their minors up to order n−1n-1 nonpositive is considered. A characterization of these matrices based on the Cauchon algorithm is presented, which provides an easy test for their recognition. Furthermore, it is shown…
-
Artikel Jurnal
Explicit inverse of symmetric, tridiagonal near Toeplitz matrices with strictly diagonally dominant Toeplitz part
Let Tn=tridiag(−1,b,−1){T}_{n}={\rm{tridiag}}\left(-1,b,-1), an n×nn\times n symmetric, strictly diagonally dominant tridiagonal matrix (∣b∣>2| b| \gt 2). This article investigates tridiagonal near-Toeplitz matrices T˜n≔[t˜i,j]{\widetilde{T}}_{n}:= \left[{\widetilde{t}}_{i,j}], obtained by…
-
Artikel Jurnal
Block diagonalization of (p, q)-tridiagonal matrices
In this article, we study the block diagonalization of (p,q)\left(p,q)-tridiagonal matrices and derive closed-form expressions for the number and structure of diagonal blocks as functions of the parameters pp, qq, and nn. This reduction enables efficient computation of eigenvalues and eigenvectors…
-
Artikel Jurnal
Minimum trace norm of real symmetric and Hermitian matrices with zero diagonal
We establish tight lower bounds for the trace norm (‖⋅‖1)\left(\Vert \cdot {\Vert }_{1}) of real symmetric and Hermitian matrices with zero diagonal entries in terms of their entrywise L1{L}^{1}-norms (‖⋅‖(1))\left(\Vert \cdot {\Vert }_{\left(1)}). For the space of nonzero real symmetric matrices…
-
Artikel Jurnal
A cospectral construction for the generalized distance matrix
The generalized distance matrix of a graph is a matrix in which the (i,j)\left(i,j)th entry is a function, ff, of the distance between vertex ii and vertex jj. Depending on the choice of ff, this family of matrices includes both the adjacency matrix and the traditional distance matrix. We present a…