On factor width and symmetric \(H\)-matrices (Q2484241): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4326384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cone of positive semidefinite matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of diagonally dominant matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Iterative Criterion for Generalized Diagonally Dominant Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Solution Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative criterion for \(H\)-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On recurring theorems on diagonal dominance / rank
 
Normal rank

Latest revision as of 13:39, 10 June 2024

scientific article
Language Label Description Also known as
English
On factor width and symmetric \(H\)-matrices
scientific article

    Statements

    On factor width and symmetric \(H\)-matrices (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 August 2005
    0 references
    The factor width of a real symmetric matrix \(A\) is the smallest integer \(k\) such that there exists a real rectangular matrix \(V\) such that \(A=VV^T\) and each column of \(V\) contains at most \(k\) nonzero entries. It is proven that the set of symmetric real matrices with factor width at most two coincides with the class of generalized diagonally dominant matrices (the so-called \(H\)-matrices) with nonnegative diagonals. Some bounds of the factor width are also obtained.
    0 references
    0 references
    factor width
    0 references
    \(H\)-matrix
    0 references
    generalized diagonally dominant matrix
    0 references
    combinatorial matrix theory
    0 references
    bounds
    0 references
    0 references