On the public citation graph
Exploiting Structural Symmetry in a Sparse Partial Pivoting Code
0 signed · 46 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1137/0201008openalex-snapshot
The Transitive Reduction of a Directed Graph
inferredcites →https://doi.org/10.1137/0613017openalex-snapshot
Exploiting Structural Symmetry in Unsymmetric Sparse Symbolic Factorization
inferredcites →https://doi.org/10.1137/0906028openalex-snapshot
An Implementation of Gaussian Elimination with Partial Pivoting for Sparse Systems
inferredcites →https://doi.org/10.1137/0909058openalex-snapshot
Sparse Partial Pivoting in Time Proportional to Arithmetic Operations
inferredcites →https://doi.org/10.1145/356502.356498openalex-snapshot
Algorithm 533: NSPIV, a Fortran subroutine for sparse Gaussian elimination with partial pivoting [F4]
inferredcites →https://doi.org/10.1177/109434208700100403openalex-snapshot
Progress in Sparse Matrix Methods for Large Linear Systems On Vector Supercomputers
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/gamm.201490037openalex-snapshot
Combinatorial Aspects in Sparse Elimination Methods
inferred← citeshttps://doi.org/10.1017/s0962492916000076openalex-snapshot
A survey of direct methods for sparse linear systems
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.001.0001openalex-snapshot
Direct Methods for Sparse Matrices
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.002.0001openalex-snapshot
Glossary of Symbols
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.002.0005openalex-snapshot
Copyright Page
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0001openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0002openalex-snapshot
Sparse matrices: storage schemes and simple operations
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0003openalex-snapshot
Gaussian elimination for dense matrices: the algebraic problem
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0004openalex-snapshot
Gaussian elimination for dense matrices: numerical considerations
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0005openalex-snapshot
Gaussian elimination for sparse matrices: an introduction
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0006openalex-snapshot
Reduction to block triangular form
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0007openalex-snapshot
Local pivotal strategies for sparse matrices
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0008openalex-snapshot
Ordering sparse matrices for band solution
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0009openalex-snapshot
Orderings based on dissection
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0010openalex-snapshot
Implementing Gaussian elimination without symbolic factorize
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0011openalex-snapshot
Implementing Gaussian elimination with symbolic factorize
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0012openalex-snapshot
Gaussian elimination using trees
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0013openalex-snapshot
Graphs for symmetric and unsymmetric matrices
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0014openalex-snapshot
The solve phase
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.003.0015openalex-snapshot
Other sparsity-oriented issues
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.005.0001openalex-snapshot
Matrix and vector norms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.005.0002openalex-snapshot
Pictures of sparse matrices
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198508380.005.0003openalex-snapshot
Solutions to selected exercises
inferred← citeshttps://doi.org/10.1109/iccad66269.2025.11240789openalex-snapshot
SubtreeLU: High-Performance Parallel Sparse LU Factorization for Circuit Simulation
inferred← citeshttps://doi.org/10.1109/sc.2002.10032openalex-snapshot
A New Scheduling Algorithm for Parallel Sparse LU Factorization with Static Pivoting
inferred← citeshttps://doi.org/10.1109/tc.2014.2308202openalex-snapshot
Parallel Sparse Matrix Solution for Circuit Simulation on FPGAs
inferred← citeshttps://doi.org/10.1137/s0895479894246905openalex-snapshot
An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization
inferred← citeshttps://doi.org/10.1137/s0895479895291765openalex-snapshot
A Supernodal Approach to Sparse Partial Pivoting
inferred← citeshttps://doi.org/10.1137/s0895479897317685openalex-snapshot
An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination
inferred← citeshttps://doi.org/10.1137/s1064827502403411openalex-snapshot
A Robust and Efficient ILU that Incorporates the Growth of the Inverse Triangular Factors
inferred← citeshttps://doi.org/10.1145/1326548.1326550openalex-snapshot
Parallel unsymmetric-pattern multifrontal sparse LU with column preordering
inferred← citeshttps://doi.org/10.1145/3581784.3607050openalex-snapshot
PanguLU: A Scalable Regular Two-Dimensional Block-Cyclic Sparse Direct Solver on Distributed Heterogeneous Systems
inferred← citeshttps://doi.org/10.1145/569147.569149openalex-snapshot
Recent advances in direct methods for solving unsymmetric sparse systems of linear equations
inferred← citeshttps://doi.org/10.5555/2755753.2755798openalex-snapshot
A fast parallel sparse solver for SPICE-based circuit simulators
inferred← citeshttps://doi.org/10.5555/762761.762772openalex-snapshot
A New Scheduling Algorithm for Parallel Sparse LU Factorization with Static Pivoting
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.