On the public citation graph

Highly Parallel Sparse Cholesky Factorization

https://doi.org/10.1137/0913067
0 signed · 84 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.1007/3-540-19487-8_17openalex-snapshot
Parallel solution of sparse linear systems
inferredcites →https://doi.org/10.1007/978-1-4613-0535-4_4openalex-snapshot
A Project for Developing a Linear Algebra Library for High-Performance Computers
inferredcites →https://doi.org/10.1016/0020-0190(88)90191-3openalex-snapshot
Some nested dissection order is nearly optimal
inferredcites →https://doi.org/10.1016/b978-1-4832-3187-7.50018-0openalex-snapshot
A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS
inferredcites →https://doi.org/10.1073/pnas.79.8.2554openalex-snapshot
Neural networks and physical systems with emergent collective computational abilities.
inferredcites →https://doi.org/10.1109/sfcs.1991.185355openalex-snapshot
Dynamic scheduling on parallel machines
inferredcites →https://doi.org/10.1109/tc.1982.1675979openalex-snapshot
A Data Structure for Parallel L/U Decomposition
inferredcites →https://doi.org/10.1137/0201013openalex-snapshot
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
inferredcites →https://doi.org/10.1137/0205021openalex-snapshot
Algorithmic Aspects of Vertex Elimination on Graphs
inferredcites →https://doi.org/10.1137/0218023openalex-snapshot
Fast Parallel Algorithms for Chordal Graphs
inferredcites →https://doi.org/10.1137/0611010openalex-snapshot
The Role of Elimination Trees in Sparse Factorization
inferredcites →https://doi.org/10.1137/0710032openalex-snapshot
Nested Dissection of a Regular Finite Element Mesh
inferredcites →https://doi.org/10.1137/0715006openalex-snapshot
On the Application of the Minimum Degree Algorithm to Finite Element Systems
inferredcites →https://doi.org/10.1137/0909021openalex-snapshot
Sparse Cholesky Factorization on a Local-Memory Multiprocessor
inferredcites →https://doi.org/10.1137/0909057openalex-snapshot
On the Complexity of Sparse $QR$ and $LU$ Factorization of Finite-Element Matrices
inferredcites →https://doi.org/10.1137/0910038openalex-snapshot
Spanning Balanced Trees in Boolean Cubes
inferredcites →https://doi.org/10.1137/0910070openalex-snapshot
A Fast Algorithm for Reordering Sparse Matrices for Parallel Factorization
inferredcites →https://doi.org/10.1142/9789814537742openalex-snapshot
Scientific Applications of the Connection Machine
inferredcites →https://doi.org/10.1145/356004.356006openalex-snapshot
A New Implementation of Sparse Gaussian Elimination
inferredcites →https://doi.org/10.1145/356044.356047openalex-snapshot
The Multifrontal Solution of Indefinite Sparse Symmetric Linear
inferredcites →https://doi.org/10.1145/4021.4025openalex-snapshot
Data-flow algorithms for parallel matrix computation
inferredcites →https://doi.org/10.1177/109434208700100403openalex-snapshot
Progress in Sparse Matrix Methods for Large Linear Systems On Vector Supercomputers
inferredcites →https://doi.org/10.21236/ada326885openalex-snapshot
Fast Sparse Matrix Factorization on Modern Workstations
inferredcites →https://doi.org/10.2307/2007640openalex-snapshot
Computer Solution of Large Sparse Positive Definite Systems.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781119903895.ch4openalex-snapshot
Large‐Scale Algebraic Equations
inferred← citeshttps://doi.org/10.1002/nla.2597openalex-snapshot
Fast Solution of Sylvester‐Structured Systems for Spatial Source Separation of the Cosmic Microwave Background
inferred← citeshttps://doi.org/10.1007/3-540-63138-0_22openalex-snapshot
Parallel sparse Cholesky factorization
inferred← citeshttps://doi.org/10.1007/978-1-4613-3400-2_4openalex-snapshot
Scalable Parallel Algorithms for Sparse Linear Systems
inferred← citeshttps://doi.org/10.1007/978-1-4613-8369-7_1openalex-snapshot
An Introduction to Chordal Graphs and Clique Trees
inferred← citeshttps://doi.org/10.1007/978-1-4613-8369-7_10openalex-snapshot
Sparse Matrix Factorization on SIMD Parallel Computers
inferred← citeshttps://doi.org/10.1007/978-3-031-97596-7_27openalex-snapshot
Algorithm for Restoring the Electrical Resistivity of a Medium with Plane-Parallel and Coaxial-Cylindrical Interface Boundaries Based on Lateral Logging Sounding Data
inferred← citeshttps://doi.org/10.1007/978-3-7643-7984-1_12openalex-snapshot
Root-Finding with Eigen-Solving
inferred← citeshttps://doi.org/10.1007/978-94-011-5412-3_3openalex-snapshot
Parallel Direct Methods for Sparse Linear Systems
inferred← citeshttps://doi.org/10.1007/bf00155801openalex-snapshot
Sparse QR factorization on a massively parallel computer
inferred← citeshttps://doi.org/10.1016/0895-7177(93)90121-eopenalex-snapshot
Recurrent neural networks for LU decomposition and Cholesky factorization
inferred← citeshttps://doi.org/10.1016/j.camwa.2004.03.022openalex-snapshot
Additive preconditioning and aggregation in matrix computations
inferred← citeshttps://doi.org/10.1016/j.cma.2005.02.030openalex-snapshot
Parallel iterative solution for the Helmholtz equation with exact non-reflecting boundary conditions
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00027-7openalex-snapshot
Minimum communication cost reordering for parallel sparse Cholesky factorization
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00077-0openalex-snapshot
Developments and trends in the parallel solution of linear systems
inferred← citeshttps://doi.org/10.1016/s0168-2024(99)80012-5openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s1570-8659(00)07002-2openalex-snapshot
Gaussian elimination for the solution of linear systems of equations
inferred← citeshttps://doi.org/10.1017/s096249290000235xopenalex-snapshot
Parallel numerical linear algebra
inferred← citeshttps://doi.org/10.1017/s0962492916000076openalex-snapshot
A survey of direct methods for sparse linear systems
inferred← citeshttps://doi.org/10.1023/a:1022032830105openalex-snapshot
Finding Optimal Ordering of Sparse Matrices for Column-Oriented Parallel Cholesky Factorization
inferred← citeshttps://doi.org/10.1080/00207160008804948openalex-snapshot
On evaluating elimination tree based parallel sparse cholesky factorizations
inferred← citeshttps://doi.org/10.1093/oso/9780198500148.003.0002openalex-snapshot
Sparse Numerical Linear Algebra: Direct Methods and Preconditioning
inferred← citeshttps://doi.org/10.1109/71.598277openalex-snapshot
Highly scalable parallel algorithms for sparse matrix factorization
inferred← citeshttps://doi.org/10.1109/fmpc.1992.234896openalex-snapshot
Massively parallel sparse LU factorization
inferred← citeshttps://doi.org/10.1109/fmpc.1995.380454openalex-snapshot
A high performance sparse Cholesky factorization algorithm for scalable parallel computers
inferred← citeshttps://doi.org/10.1109/hpcsim.2013.6641446openalex-snapshot
Modular design of data-parallel graph algorithms
inferred← citeshttps://doi.org/10.1109/ia3.2018.00008openalex-snapshot
A Block-Oriented, Parallel and Collective Approach to Sparse Indefinite Preconditioning on GPUs
inferred← citeshttps://doi.org/10.1109/icpads.1994.590074openalex-snapshot
On evaluating parallel sparse Cholesky factorizations
inferred← citeshttps://doi.org/10.1109/ipdps.2000.846067openalex-snapshot
On optimal fill-preserving orderings of sparse matrices for parallel Cholesky factorizations
inferred← citeshttps://doi.org/10.1109/ipdps53621.2022.00121openalex-snapshot
HDagg: Hybrid Aggregation of Loop-carried Dependence Iterations in Sparse Matrix Computations
inferred← citeshttps://doi.org/10.1109/sc.2018.00065openalex-snapshot
ParSy: Inspection and Transformation of Sparse Matrix Computations for Parallelism
inferred← citeshttps://doi.org/10.1109/shpcc.1994.296661openalex-snapshot
Performance of panel and block approaches to sparse Cholesky factorization on the iPSC/860 and Paragon multicomputers
inferred← citeshttps://doi.org/10.1109/superc.1992.236711openalex-snapshot
Towards a fast implementation of spectral nested dissection
inferred← citeshttps://doi.org/10.1109/superc.1994.344344openalex-snapshot
Improved load distribution in parallel sparse Cholesky factorization
inferred← citeshttps://doi.org/10.1109/tcad.2025.3576332openalex-snapshot
Real-Time Compensation Framework for Large-Scale ReRAM-Based Sparse LU Factorization
inferred← citeshttps://doi.org/10.1109/tsg.2016.2600256openalex-snapshot
A Two-Layered Parallel Static Security Assessment for Large-Scale Grids Based on GPU
inferred← citeshttps://doi.org/10.1137/0914074openalex-snapshot
A Mapping Algorithm for Parallel Sparse Cholesky Factorization
inferred← citeshttps://doi.org/10.1137/0915085openalex-snapshot
An Efficient Block-Oriented Approach to Parallel Sparse Cholesky Factorization
inferred← citeshttps://doi.org/10.1137/0916054openalex-snapshot
Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer
inferred← citeshttps://doi.org/10.1137/0916085openalex-snapshot
Distributed Sparse Gaussian Elimination and Orthogonal Factorization
inferred← citeshttps://doi.org/10.1137/1033099openalex-snapshot
Parallel Algorithms for Sparse Linear Systems
inferred← citeshttps://doi.org/10.1137/20m1315683openalex-snapshot
Sparse Hierarchical Preconditioners Using Piecewise Smooth Approximations of Eigenvectors
inferred← citeshttps://doi.org/10.1137/s0895479803386354openalex-snapshot
On Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations
inferred← citeshttps://doi.org/10.1137/s1064827594272086openalex-snapshot
Using a Massively Parallel Processor to Solve Large Sparse Linear Programs by an Interior-Point Method
inferred← citeshttps://doi.org/10.1137/s1064827594276412openalex-snapshot
Data-Parallel Sparse Factorization
inferred← citeshttps://doi.org/10.1145/1187436.1210588openalex-snapshot
Partitioning planar graphs with costs and weights
inferred← citeshttps://doi.org/10.1145/1277500.1277522openalex-snapshot
The schur aggregation for solving linear systems of equations
inferred← citeshttps://doi.org/10.1145/165939.165977openalex-snapshot
Parallel direct solution of large sparse systems in finite element computations
inferred← citeshttps://doi.org/10.1145/1993316.1993501openalex-snapshot
The tao of parallelism in algorithms
inferred← citeshttps://doi.org/10.1145/1993498.1993501openalex-snapshot
The tao of parallelism in algorithms
inferred← citeshttps://doi.org/10.1145/3314221.3314646openalex-snapshot
Sparse computation data dependence simplification for efficient compiler-generated inspectors
inferred← citeshttps://doi.org/10.1201/9781584888239-c17openalex-snapshot
Algebraic and Numerical Algorithms
inferred← citeshttps://doi.org/10.1201/9781584888239-c18openalex-snapshot
Applications of FFT and Structured Matrices
inferred← citeshttps://doi.org/10.1201/b11644-3openalex-snapshot
Combinatorial Problems in Solving Linear Systems
inferred← citeshttps://doi.org/10.1201/b16812-13openalex-snapshot
Algebraic Algorithms*
inferred← citeshttps://doi.org/10.2172/5217041openalex-snapshot
On finding minimum-diameter clique trees
inferred← citeshttps://doi.org/10.26083/tuprints-00017951openalex-snapshot
Irregularity mitigation and portability abstractions for accelerated sparse matrix factorization
inferred← citeshttps://doi.org/10.48550/arxiv.1311.3731openalex-snapshot
Chapter 10: Algebraic Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1807.10852openalex-snapshot
Sparse Matrix Code Dependence Analysis Simplification at Compile Time
inferred← citeshttps://doi.org/10.5555/602770.602897openalex-snapshot
Improved load distribution in parallel sparse Cholesky factorization
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.