Results 21 to 30 of about 256 (175)
The smallest singular value of certain Toeplitz-related parametric triangular matrices
Let L be the infinite lower triangular Toeplitz matrix with first column (µ, a1, a2, ..., ap, a1, ..., ap, ...)T and let D be the infinite diagonal matrix whose entries are 1, 2, 3, . . . Let A := L + D be the sum of these two matrices.
Solary Maryam Shams +2 more
doaj +1 more source
The effect of removing a 2-downer edge or a cut 2-downer edge triangle for an eigenvalue
Edges in the graph associated with a square matrix over a field may be classified as to how their removal affects the multiplicity of an identified eigenvalue.
Toyonaga Kenji
doaj +1 more source
Inclusion regions and bounds for the eigenvalues of matrices with a known eigenpair
Let (λ, v) be a known real eigenpair of an n×n real matrix A. In this paper it is shown how to locate the other eigenvalues of A in terms of the components of v. The obtained region is a union of Gershgorin discs of the second type recently introduced by
Marsli Rachid, Hall Frank J.
doaj +1 more source
Exclusion sets in the S-type eigenvalue localization sets for tensors
In this paper, we break the index set N into disjoint subsets S and its complement, and propose two S-type exclusion sets that all the eigenvalues do not belong to them.
Zhang Yuan, Zhang Ying, Wang Gang
doaj +1 more source
Sufficient conditions for symmetric matrices to have exactly one positive eigenvalue
Let A = [aij] be a real symmetric matrix. If f : (0, ∞) → [0, ∞) is a Bernstein function, a sufficient condition for the matrix [f (aij)] to have only one positive eigenvalue is presented.
Al-Saafin Doaa, Garloff Jürgen
doaj +1 more source
On the spectrum of noisy blown-up matrices
We study the eigenvalues of large perturbed matrices. We consider a pattern matrix P, we blow it up to get a large block-matrix Bn. We can observe only a noisy version of matrix Bn. So we add a random noise Wn to obtain the perturbed matrix An = Bn + Wn.
Fazekas István, Pecsora Sándor
doaj +1 more source
We correct an error in the original Lemma 3.4 in our paper “Achievable Multiplicity partitions in the IEVP of a graph”’ [Spec. Matrices 2019; 7:276-290.]. We have re-written Section 3 accordingly.
Adm Mohammad +5 more
doaj +1 more source
A refinement of an inequality due to Ankeny and Rivlin
Let $p(z)= \sum_{\nu =0}^n a_\nu z^\nu$ be a polynomial of degree $n$, $ M(p,R):= \max_{|z|=R \ge 0} |p(z)|,$ and $M(p,1):=M(p)$. Then by well-known result due to Ankeny and Rivlin \cite{Ankeny}, we have M(p.R)≤(Rn+12)M(p), R≥1. In this paper, we sharpen
TRIPATHI, Dinesh, Dinesh Tripathi
core +1 more source
Considered are combinatorially symmetric matrices, whose graph is a given tree, in view of the fact recent analysis shows that the geometric multiplicity theory for the eigenvalues of such matrices closely parallels that for real symmetric (and complex ...
Saiago Carlos M.
doaj +1 more source
Corrigendum to “Spectra universally realizable by doubly stochastic matrices”
We correct an error in the statement and the proof of Theorem 2.1 and Corollary 2.1 in our previous study [Spec. Matrices 6 (2018), 301–309], Section 2: On nonnegative matrices similar to positive matrices.
Collao Macarena +2 more
doaj +1 more source

