On the public citation graph

Exploiting Structural Symmetry in Unsymmetric Sparse Symbolic Factorization

0 signed · 43 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1038/scientificamerican0984-60openalex-snapshot

Data Structures and Algorithms

inferredcites →https://doi.org/10.1137/0134014openalex-snapshot

Algorithmic Aspects of Vertex Elimination on Directed Graphs

inferredcites →https://doi.org/10.1137/0201008openalex-snapshot

The Transitive Reduction of a Directed Graph

inferredcites →https://doi.org/10.1137/0611010openalex-snapshot

The Role of Elimination Trees in Sparse Factorization

inferredcites →https://doi.org/10.1137/0909058openalex-snapshot

Sparse Partial Pivoting in Time Proportional to Arithmetic Operations

inferredcites →https://doi.org/10.1145/356004.356006openalex-snapshot

A New Implementation of Sparse Gaussian Elimination

inferredcites →https://doi.org/10.1145/62038.62043openalex-snapshot

Sparse matrix test problems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/1099-1506(200010/12)7:7/8<649::aid-nla217>3.0.co;2-wopenalex-snapshot

A parallel linear system solver for circuit simulation problems

inferred← citeshttps://doi.org/10.1007/3-540-47840-x_11openalex-snapshot

A Framework for Efficient Sparse LU Factorization in a Cluster Based Platform

inferred← citeshttps://doi.org/10.1007/978-1-4613-8369-7_4openalex-snapshot

Structural Representations of Schur Complements in Sparse Matrices

inferred← citeshttps://doi.org/10.1007/978-3-031-25820-6_6openalex-snapshot

Sparse LU Factorizations

inferred← citeshttps://doi.org/10.1016/0010-4655(96)00020-3openalex-snapshot

A review of frontal methods for solving linear systems

inferred← citeshttps://doi.org/10.1016/j.anucene.2020.107976openalex-snapshot

Study on algorithms for solving depletion sparse matrix based on DESCAR module

inferred← citeshttps://doi.org/10.1016/j.tcs.2017.03.034openalex-snapshot

Mixed and componentwise condition numbers for matrix decompositions

inferred← citeshttps://doi.org/10.1016/s0377-0427(00)00399-xopenalex-snapshot

Refining an approximate inverse

inferred← citeshttps://doi.org/10.1017/s0962492916000076openalex-snapshot

A survey of direct methods for sparse linear systems

inferred← citeshttps://doi.org/10.1088/1742-6596/180/1/012015openalex-snapshot

Factorization-based sparse solvers and preconditioners

inferred← citeshttps://doi.org/10.1109/ipdps.2012.63openalex-snapshot

New Scheduling Strategies and Hybrid Programming for a Parallel Right-looking Sparse LU Factorization Algorithm on Multicore Cluster Systems

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/tpds.2021.3090316openalex-snapshot

gSoFa: Scalable Sparse Symbolic LU Factorization on GPUs

inferred← citeshttps://doi.org/10.1137/050629343openalex-snapshot

Symbolic and Exact Structure Prediction for Sparse Gaussian Elimination with Partial Pivoting

inferred← citeshttps://doi.org/10.1137/050638102openalex-snapshot

Parallel Symbolic Factorization for Sparse LU with Static Pivoting

inferred← citeshttps://doi.org/10.1137/050643581openalex-snapshot

Algorithmic Aspects of Elimination Trees for Sparse Unsymmetric Matrices

inferred← citeshttps://doi.org/10.1137/0914016openalex-snapshot

Exploiting Structural Symmetry in a Sparse Partial Pivoting Code

inferred← citeshttps://doi.org/10.1137/16m105890xopenalex-snapshot

Preconditioning of Linear Least Squares by Robust Incomplete Factorization for Implicitly Held Normal Equations

inferred← citeshttps://doi.org/10.1137/s0895479800375370openalex-snapshot

An Unsymmetrized Multifrontal LU Factorization

inferred← citeshttps://doi.org/10.1137/s089547980139604xopenalex-snapshot

Improved Symbolic and Numerical Factorization Algorithms for Unsymmetric Sparse Matrices

inferred← citeshttps://doi.org/10.1137/s089547980240563xopenalex-snapshot

The Theory of Elimination Trees for Sparse Unsymmetric Matrices

inferred← citeshttps://doi.org/10.1137/s0895479887139455openalex-snapshot

Predicting Structure in Sparse Matrix Computations

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.1145/1089014.1089017openalex-snapshot

An overview of SuperLU

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/3712285.3759792openalex-snapshot

Caracal: A GPU-Resident Sparse LU Solver with Lightweight Fine-Grained Scheduling

inferred← citeshttps://doi.org/10.1145/3731599.3767440openalex-snapshot

Performance-Portable Symbolic Factorization through Common Graph Operations

inferred← citeshttps://doi.org/10.1145/377792.377823openalex-snapshot

A parallel algorithm for sparse symbolic LU factorization without pivoting on out—of—core matrices

inferred← citeshttps://doi.org/10.1145/992200.992205openalex-snapshot

A column pre-ordering strategy for the unsymmetric-pattern multifrontal method

inferred← citeshttps://doi.org/10.1201/9781315119335-61openalex-snapshot

Elimination Structures in Scientific Computing

inferred← citeshttps://doi.org/10.1201/9781420010572.ch40openalex-snapshot

Sparse Matrix Methods

inferred← citeshttps://doi.org/10.1201/b16113-62openalex-snapshot

Sparse Matrix Methods

inferred← citeshttps://doi.org/10.26599/tst.2020.9010019openalex-snapshot

Improved approximate minimum degree ordering method and its application for electrical power network analysis and computation

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.