Results 21 to 30 of about 2,183 (141)

Sufficient conditions for symmetric matrices to have exactly one positive eigenvalue

open access: yesSpecial Matrices, 2020
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

open access: yesSpecial Matrices, 2020
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

Linear maps of positive partial transpose matrices and singular value inequalities

open access: yes, 2020
Linear maps Φ : Mn → Mk are called m -PPT if [Φ(Ai j)]i, j=1 are positive partial transpose matrices for all positive semi-definite matrices [Ai j]i, j=1 ∈ Mm(Mn) .
Xiaohui Fu, Pan-Shun Lau, T. Tam
semanticscholar   +1 more source

Anti‐inflammatory and immunomodulating effects of clarithromycin in patients with cystic fibrosis lung disease

open access: yesMediators of Inflammation, Volume 13, Issue 2, Page 111-117, 2004., 2004
BACKGROUND and aim: Macrolide antibiotics are widely used in the treatment of suppurative lung diseases including cystic fibrosis (CF), the most common inherited fatal disease in the Caucasian population. This condition is characterized by secondary Pseudomonas infection resulting in neutrophil infiltration within the airways.
Alexander L. Pukhalsky   +5 more
wiley   +1 more source

Corrigendum to “Achievable Multiplicity partitions in the Inverse Eigenvalue Problem of a graph” [Spec. Matrices 2019; 7:276-290.]

open access: yesSpecial Matrices, 2020
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 note on the spectra of tridiagonal matrices

open access: yesInternational Journal of Mathematics and Mathematical Sciences, Volume 2004, Issue 30, Page 1575-1579, 2004., 2004
Using orthogonal polynomials, we give a different approach to some recent results on tridiagonal matrices.
C. M. da Fonseca, J. Petronilho
wiley   +1 more source

Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments

open access: yesSpecial Matrices, 2019
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

On real or integral skew Laplacian spectrum of digraphs

open access: yes, 2020
For a simple connected graph G with n vertices and m edges, let −→ G be a digraph obtained by giving an arbitrary direction to the edges of G . In this paper, we consider the skew Laplacian matrix of a digraph −→ G and we obtain the skew Laplacian ...
S. Pirzada   +2 more
semanticscholar   +1 more source

Perturbed spectra of defective matrices

open access: yesJournal of Applied Mathematics, Volume 2003, Issue 3, Page 115-140, 2003., 2003
This paper is devoted to the perturbation theory for defective matrices. We consider the asymptotic expansions of the perturbed spectrum when a matrix A is changed to A + tE, where E ≠ 0 and t > 0 is a small parameter. In particular, we analyse the rational exponents that may occur when the matrix E varies over the sphere ‖E‖ = ρ > 0.
Mihail Konstantinov   +2 more
wiley   +1 more source

A note on the three-way generalization of the Jordan canonical form

open access: yesOpen Mathematics, 2018
The limit point 𝓧 of an approximating rank-R sequence of a tensor Ƶ can be obtained by fitting a decomposition (S, T, U) ⋅ 𝓖 to Ƶ. The decomposition of the limit point 𝓧 = (S, T, U) ⋅ 𝓖 with 𝓖 = blockdiag(𝓖1, … , 𝓖m) can be seen as a three order ...
Cui Lu-Bin, Li Ming-Hui
doaj   +1 more source

Home - About - Disclaimer - Privacy