Combinatorial characterization of the null spaces of symmetric H-matrices (Q1887495): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: mctoolbox / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.laa.2004.05.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999971919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Positive Semidefinite Matrices with Known Null Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Solution Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum‐weight‐basis preconditioners / rank
 
Normal rank
Property / cites work
 
Property / cites work: On factor width and symmetric \(H\)-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voltage graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating all graph coverings by permutation voltage assignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic graph theory without orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minors of an incidence matrix and Smith normal form / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Quality of Spectral Separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the notion of balance of a signed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of conjugate gradients for solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Accuracy of Floating Point Summation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative test for \(H\)-matrix / 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 the Iterative Criterion for Generalized Diagonally Dominant Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of Sparse Indefinite Systems of Linear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Criteria for balance in abelian gain graphs, with applications to piecewise-linear geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signed graphs / rank
 
Normal rank

Latest revision as of 15:27, 7 June 2024

scientific article
Language Label Description Also known as
English
Combinatorial characterization of the null spaces of symmetric H-matrices
scientific article

    Statements

    Combinatorial characterization of the null spaces of symmetric H-matrices (English)
    0 references
    0 references
    0 references
    26 November 2004
    0 references
    The paper provides: a) a combinatorial characterization of the null spaces of three families of symmetric matrices (symmetric diagonally dominant \(M\)-matrices (SDDM matrices), symmetric diagonally dominant matrices (SDD matrices) and symmetric \(H\)-matrices with non-negative diagonal entries (\( H^{+}\) matrices), and b) efficient algorithms, which rely on this combinatorial characterization, to construct bases for the null spaces of such matrices. Finally, the paper shows how to use these results to accurately determine the rank of SDD matrices and how to solve singular linear systems whose coefficient matrices are SDD.
    0 references
    combinatorial matrix theory
    0 references
    signed graphs
    0 references
    gain graphs
    0 references
    factor width
    0 references
    null space
    0 references
    matroids
    0 references
    singular linear systems
    0 references
    symmetric diagonally dominant \(M\)-matrices
    0 references
    symmetric \(H\)-matrices
    0 references
    algorithms
    0 references
    rank
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references