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

@@ Property / cites work @@
+Q3210767
@@ Property / cites work: Q3210767 / rank @@
+Normal rank
@@ Property / cites work @@
+A Comparison of Sparsity Orderings for Obtaining a Pivotal Sequence in Gaussian Elimination
+Normal rank
@@ Property / cites work @@
+Q3740904
@@ Property / cites work: Q3740904 / rank @@
+Normal rank
@@ Property / cites work @@
+A Structurally Stable Modification of Hellerman–Rarick’s ${\text{P}}^4 $ Algorithm for Reordering Unsymmetric Sparse Matrices
+Normal rank
@@ Property / cites work @@
+Reinversion with the preassigned pivot procedure
@@ Property / cites work: Reinversion with the preassigned pivot procedure / rank @@
+Normal rank
@@ Property / cites work @@
+The Elimination form of the Inverse and its Application to Linear Programming
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf02025533
+Normal rank
@@ Property / OpenAlex ID @@
+W2026150508
@@ Property / OpenAlex ID: W2026150508 / rank @@
+Normal rank