On the public citation graph

A Fan-In Algorithm for Distributed Sparse Numerical Factorization

0 signed · 81 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.1016/0167-8191(86)90019-0openalex-snapshot
Parallel implementation of multifrontal schemes
inferredcites →https://doi.org/10.1016/0167-8191(88)90009-9openalex-snapshot
Parallel solution of triangular systems of equations
inferredcites →https://doi.org/10.1016/0167-8191(89)90101-4openalex-snapshot
Communication results for parallel sparse Cholesky factorization on a hypercube
inferredcites →https://doi.org/10.1137/0710032openalex-snapshot
Nested Dissection of a Regular Finite Element Mesh
inferredcites →https://doi.org/10.1137/0909021openalex-snapshot
Sparse Cholesky Factorization on a Local-Memory Multiprocessor
inferredcites →https://doi.org/10.1137/0912063openalex-snapshot
Limiting Communication in Parallel Sparse Cholesky Factorization
inferredcites →https://doi.org/10.1177/109434208700100304openalex-snapshot
Concurrent Multifrontal Methods: Shared Memory, Cache, and Frontwidth Issues
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/cpe.4330030607openalex-snapshot
Multiprocessors and run‐time compilation
inferred← citeshttps://doi.org/10.1002/num.1690090206openalex-snapshot
An organization of sparse gauss elimination for solving partial differntial equations on distributed memory machines
inferred← citeshttps://doi.org/10.1007/3-540-45591-4_70openalex-snapshot
PaStiX: A Parallel Sparse Direct Solver Based on a Static Scheduling for Mixed 1D/2D Block Distributions
inferred← citeshttps://doi.org/10.1007/3-540-48311-x_148openalex-snapshot
A Mapping and Scheduling Algorithm for Parallel Sparse Fan-In Numerical Factorization⋆
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-8369-7_8openalex-snapshot
The Fan-Both Family of Column-Based Distributed Cholesky Factorization Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4613-8369-7_9openalex-snapshot
Scalability of Sparse Direct Solvers
inferred← citeshttps://doi.org/10.1007/978-3-642-58066-6_6openalex-snapshot
Parallel Direct Solution of Sparse Linear Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-78123-0_25openalex-snapshot
Eine parallele Implementation des Karmarkar—Verfahrens
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/bf01061145openalex-snapshot
An incomplete nested dissection algorithm for parallel direct solution of finite element discretizations of partial differential equations
inferred← citeshttps://doi.org/10.1007/bf02024486openalex-snapshot
A parallel interior point algorithm for linear programming on a network of transputers
inferred← citeshttps://doi.org/10.1007/bf02087962openalex-snapshot
Parallel implementation of finite-element/newton method for solution of steady-state and transient nonlinear partial differential equations
inferred← citeshttps://doi.org/10.1007/bfb0002824openalex-snapshot
A parallel sparse LU decomposition with application to semiconductor device simulation
inferred← citeshttps://doi.org/10.1016/0167-8191(92)90014-xopenalex-snapshot
Parallel sparse Cholesky factorization on a shared memory multiprocessor
inferred← citeshttps://doi.org/10.1016/0956-0521(92)90093-xopenalex-snapshot
Software support for irregular and loosely synchronous problems
inferred← citeshttps://doi.org/10.1016/0956-0521(92)90096-2openalex-snapshot
PARTI primitives for unstructured and block structured problems
inferred← citeshttps://doi.org/10.1016/b978-0-444-88712-2.50014-7openalex-snapshot
Distributed Memory Compiler Methods for Irregular Problems – Data Copy Reuse and Runtime Partitioning1 1This work is supported by NASA contract NAS1-18605 while the authors were in residence at ICASE, NASA Langley Research Center. In addition, support for author Saltz was provided by NSF from NSF…
inferred← citeshttps://doi.org/10.1016/s0167-8191(01)00141-7openalex-snapshot
PaStiX: a high-performance parallel direct solver for sparse symmetric positive definite systems
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:1019118015711openalex-snapshot
Parallel sparse linear algebra and application to structural mechanics
inferred← citeshttps://doi.org/10.1023/a:1019122726788openalex-snapshot
Two-dimensional block partitionings for the parallel sparse Cholesky factorization
inferred← citeshttps://doi.org/10.1061/(asce)cp.1943-5487.0000019openalex-snapshot
Workload Distribution Framework for the Parallel Solution of Large Structural Models on Heterogeneous PC Clusters
inferred← citeshttps://doi.org/10.1061/40794(179)73openalex-snapshot
A Substructure Based Parallel Linear Solution Framework for Structural Systems Having Multiple Loading Cases
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.002.0006openalex-snapshot
Preface
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.1093/oso/9780198500148.003.0002openalex-snapshot
Sparse Numerical Linear Algebra: Direct Methods and Preconditioning
inferred← citeshttps://doi.org/10.1109/12.391186openalex-snapshot
Distributed memory compiler design for sparse problems
inferred← citeshttps://doi.org/10.1109/8.546247openalex-snapshot
Sequential and parallel implementations of the partitioning finite-element method
inferred← citeshttps://doi.org/10.1109/cdc.2016.7798939openalex-snapshot
Distributed asynchronous Cholesky decomposition
inferred← citeshttps://doi.org/10.1109/dmcc.1991.633089openalex-snapshot
Parti Procedures for Realistic Loops
inferred← citeshttps://doi.org/10.1109/fmpc.1995.380450openalex-snapshot
On mapping data and computation for parallel sparse Cholesky factorization
inferred← citeshttps://doi.org/10.1109/icpp.1993.170openalex-snapshot
Supernodal Sparse Cholesky Factorization on Distributed-Memory Multiprocessors
inferred← citeshttps://doi.org/10.1109/icpp.1994.177openalex-snapshot
Scheduling Strategies for Sparse Cholesky Factorization on a Shared Virtual Memory Parallel Computer
inferred← citeshttps://doi.org/10.1109/ipdpsw.2014.9openalex-snapshot
Taking Advantage of Hybrid Systems for Sparse Direct Solvers via Task-Based Runtimes
inferred← citeshttps://doi.org/10.1109/ipps.1995.395916openalex-snapshot
A general purpose sparse matrix parallel solvers package
inferred← citeshttps://doi.org/10.1109/shpcc.1994.296660openalex-snapshot
Memory-adaptive parallel sparse Cholesky factorization
inferred← citeshttps://doi.org/10.1109/superc.1990.130025openalex-snapshot
Techniques for improving the performance of sparse matrix factorization on multiprocessor workstations
inferred← citeshttps://doi.org/10.1109/superc.1992.236710openalex-snapshot
Performance of distributed sparse Cholesky factorization with pre-scheduling
inferred← citeshttps://doi.org/10.1109/superc.1994.344345openalex-snapshot
A scalable parallel algorithm for sparse Cholesky factorization
inferred← citeshttps://doi.org/10.1137/080739987openalex-snapshot
Parallel Hybrid Preconditioning: Incomplete Factorization with Selective Sparse Approximate Inversion
inferred← citeshttps://doi.org/10.1137/0912063openalex-snapshot
Limiting Communication in Parallel Sparse Cholesky Factorization
inferred← citeshttps://doi.org/10.1137/0913049openalex-snapshot
A Grid-Based Subtree-Subcube Assignment Strategy for Solving Partial Differential Equations on Hypercubes
inferred← citeshttps://doi.org/10.1137/0914074openalex-snapshot
A Mapping Algorithm for Parallel Sparse Cholesky Factorization
inferred← citeshttps://doi.org/10.1137/1033099openalex-snapshot
Parallel Algorithms for Sparse Linear Systems
inferred← citeshttps://doi.org/10.1137/1034004openalex-snapshot
The Multifrontal Method for Sparse Matrix Solution: Theory and Practice
inferred← citeshttps://doi.org/10.1177/1094342015580139openalex-snapshot
Acceleration of GPU-based Krylov solvers via data transfer reduction
inferred← citeshttps://doi.org/10.5555/110382.110441openalex-snapshot
Techniques for improving the performance of sparse matrix factorization on multiprocessor workstations
inferred← citeshttps://doi.org/10.5555/602770.602898openalex-snapshot
A scalable parallel algorithm for 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.