Derived eigenvalues of symmetric matrices, with applications to distance geometry (Q919061): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3339659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3866128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4129487 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Two-Distance Sets in Euclidean Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distances, graphs and designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3674680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph representations, two-distance sets, and equiangular lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional graphs with smallest eigenvalue -2 and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new look at the Lanczos algorithm for solving symmetric systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5556253 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5554874 / rank
 
Normal rank

Latest revision as of 10:17, 21 June 2024

scientific article
Language Label Description Also known as
English
Derived eigenvalues of symmetric matrices, with applications to distance geometry
scientific article

    Statements

    Derived eigenvalues of symmetric matrices, with applications to distance geometry (English)
    0 references
    1990
    0 references
    Let \(A\in R^{n\times n}\) and j be the all-one vector of dimension n. The derived eigenvalues of the symmetric matrix A are the zeros of \(P_ A(s)=-j^ Tadj (Is-A)j\). With this notion a new characterization for the embeddability of a finite metric space into Euclidean space is given. In more detail the particular case of two-distance sets is discussed.
    0 references
    0 references
    0 references
    0 references
    0 references
    distance geometry
    0 references
    distance matrix
    0 references
    adjacent matrix of a graph
    0 references
    derived spectrum of a graph
    0 references
    derived eigenvalues
    0 references
    symmetric matrix
    0 references
    0 references
    0 references
    0 references