Ordering algorithms for irreducible sparse linear systems (Q1309854): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3210767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of Sparsity Orderings for Obtaining a Pivotal Sequence in Gaussian Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3740904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Structurally Stable Modification of Hellerman–Rarick’s ${\text{P}}^4 $ Algorithm for Reordering Unsymmetric Sparse Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reinversion with the preassigned pivot procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Elimination form of the Inverse and its Application to Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank

Revision as of 11:05, 22 May 2024

scientific article
Language Label Description Also known as
English
Ordering algorithms for irreducible sparse linear systems
scientific article

    Statements

    Identifiers