On the public citation graph

Solution of sparse positive definite systems on a shared-memory multiprocessor

https://doi.org/10.1007/bf01407878
0 signed · 59 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.1002/nme.1620180804openalex-snapshot
Yale sparse matrix package I: The symmetric codes
inferredcites →https://doi.org/10.1016/0024-3795(86)90167-9openalex-snapshot
Parallel Cholesky factorization on a shared-memory multiprocessor
inferredcites →https://doi.org/10.1016/0167-8191(86)90014-1openalex-snapshot
Computational models and task scheduling for parallel sparse Cholesky factorization
inferredcites →https://doi.org/10.1016/0167-8191(86)90019-0openalex-snapshot
Parallel implementation of multifrontal schemes
inferredcites →https://doi.org/10.1109/proc.1984.12823openalex-snapshot
Experience with pipelined multiple instruction streams
inferredcites →https://doi.org/10.1137/0909021openalex-snapshot
Sparse Cholesky Factorization on a Local-Memory Multiprocessor
inferredcites →https://doi.org/10.1145/214392.214398openalex-snapshot
Modification of the minimum-degree algorithm by multiple elimination
inferredcites →https://doi.org/10.1145/355826.355829openalex-snapshot
The Design of a User Interface for a Sparse Matrix Package
inferredcites →https://doi.org/10.1177/109434208700100207openalex-snapshot
Supercomputers: Value and Trends Bill Buzbee, Computer Research and Applications Group, Computing and Communications Division, Los Alamos National Laboratory, Los Alamos, New Mexico 87545
inferredcites →https://doi.org/10.2172/5868908openalex-snapshot
Sparse Cholesky factorization on a local-memory multiprocessor
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/cpe.5499openalex-snapshot
Using analysis information in the synchronization‐free GPU solution of sparse triangular systems
inferred← citeshttps://doi.org/10.1002/nag.384openalex-snapshot
ParCYCLIC: finite element modelling of earthquake liquefaction response on parallel computers
inferred← citeshttps://doi.org/10.1002/nme.1620330911openalex-snapshot
Using domain decomposition to solve symmetric, positive‐definite systems on the hypercube computer
inferred← citeshttps://doi.org/10.1007/978-1-4684-6357-6_11openalex-snapshot
Methods for Automated Problem Mapping
inferred← citeshttps://doi.org/10.1007/978-1-4899-2112-3_2openalex-snapshot
Direct Methods for Linear Equations
inferred← citeshttps://doi.org/10.1007/978-3-662-39812-8_2openalex-snapshot
Solution of Sparse Systems of Equations on Multiprocessor Architectures
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/bf01407861openalex-snapshot
Task scheduling for parallel sparse Cholesky factorization
inferred← citeshttps://doi.org/10.1007/bf02023054openalex-snapshot
Parallel sparse Gaussian elimination with partial pivoting
inferred← citeshttps://doi.org/10.1007/bf02668848openalex-snapshot
Parallel finite element modeling of earthquake ground response and liquefaction
inferred← citeshttps://doi.org/10.1007/bfb0085717openalex-snapshot
Solution of sparse systems of equations on multiprocessor architectures
inferred← citeshttps://doi.org/10.1007/s11227-023-05238-8openalex-snapshot
A GPU method for the analysis stage of the SPTRSV kernel
inferred← citeshttps://doi.org/10.1007/s11227-023-05802-2openalex-snapshot
Toward efficient structured-grid triangular solver on sunway many-core processors
inferred← citeshttps://doi.org/10.1016/0167-8191(89)90016-1openalex-snapshot
Independent set orderings for parallel matrix factorization by Gaussian elimination
inferred← citeshttps://doi.org/10.1016/0167-8191(90)90054-dopenalex-snapshot
Parallel nested dissection
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/j.compgeo.2016.07.006openalex-snapshot
Parallel finite element analysis of seismic soil structure interaction using a PC cluster
inferred← citeshttps://doi.org/10.1016/j.cosrev.2026.100901openalex-snapshot
A review of self-scheduled strategies for numerical linear algebra on GPU
inferred← citeshttps://doi.org/10.1016/j.jpdc.2021.07.013openalex-snapshot
Machine learning for optimal selection of sparse triangular system solvers on GPUs
inferred← citeshttps://doi.org/10.1016/j.parco.2021.102840openalex-snapshot
Porting hypre to heterogeneous computer architectures: Strategies and experiences
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.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.1080/10637199808947367openalex-snapshot
A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS - I CHOLESKY FACTORIZATION
inferred← citeshttps://doi.org/10.1080/10637199808947368openalex-snapshot
A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS – II TRIANGULAR SYSTEM SOLVERS AND MATRIX MULTIPLICATION
inferred← citeshttps://doi.org/10.1109/12.9742openalex-snapshot
Pairwise reduction for the direct, parallel solution of sparse, unsymmetric sets of linear equations
inferred← citeshttps://doi.org/10.1109/dmcc.1991.633214openalex-snapshot
Using Domain Decomposition to Solve Positive-Definite Systems on the Hypercube Computer
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/ipdps.2018.00101openalex-snapshot
A New GPU Algorithm to Compute a Level Set-Based Analysis for the Parallel Solution of Sparse Triangular Systems
inferred← citeshttps://doi.org/10.1109/ipdps49936.2021.00080openalex-snapshot
Speculative Parallel Reverse Cuthill-McKee Reordering on Multi- and Many-core Architectures
inferred← citeshttps://doi.org/10.1109/isca59077.2024.00035openalex-snapshot
NDSEARCH: Accelerating Graph-Traversal-Based Approximate Nearest Neighbor Search through Near Data Processing
inferred← citeshttps://doi.org/10.1109/pdp2018.2018.00034openalex-snapshot
Solving Sparse Triangular Linear Systems in Modern GPUs: A Synchronization-Free Algorithm
inferred← citeshttps://doi.org/10.1109/pdp66500.2025.00037openalex-snapshot
A synchronization-free incomplete LU factorization for GPUs with level-set analysis
inferred← citeshttps://doi.org/10.1109/sbac-pad.2019.00020openalex-snapshot
Automatic Selection of Sparse Triangular Linear System Solvers on GPUs through Machine Learning Techniques
inferred← citeshttps://doi.org/10.1109/sbac-pad63648.2024.00014openalex-snapshot
A new level-set analysis and sparse storage format for the SPTRSV in GPUs
inferred← citeshttps://doi.org/10.1109/sbac-padw.2017.15openalex-snapshot
Assessing Sparse Triangular Linear System Solvers on GPUs
inferred← citeshttps://doi.org/10.1109/tpds.2021.3074501openalex-snapshot
A Split Execution Model for SpTRSV
inferred← citeshttps://doi.org/10.1137/090757216openalex-snapshot
Design of a Multicore Sparse Cholesky Factorization Using DAGs
inferred← citeshttps://doi.org/10.1137/0911008openalex-snapshot
Aggregation Methods for Solving Sparse Triangular Systems on Multiprocessors
inferred← citeshttps://doi.org/10.1137/0914048openalex-snapshot
A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors
inferred← citeshttps://doi.org/10.1137/0914063openalex-snapshot
Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
inferred← citeshttps://doi.org/10.1137/1033099openalex-snapshot
Parallel Algorithms for Sparse Linear Systems
inferred← citeshttps://doi.org/10.1137/s0895479892236921openalex-snapshot
An Efficient Algorithm to Compute Row and Column Counts for Sparse Cholesky Factorization
inferred← citeshttps://doi.org/10.1137/s0895479897317685openalex-snapshot
An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination
inferred← citeshttps://doi.org/10.1145/318789.318820openalex-snapshot
Data traffic reduction schemes for Cholesky factorization on asynchronous multiprocessor systems
inferred← citeshttps://doi.org/10.1145/3368474.3368486openalex-snapshot
Adaptive Level Binning
inferred← citeshttps://doi.org/10.1145/99163.99170openalex-snapshot
A multi-level load balancing scheme for OR-parallel exhaustive search programs on the multi-PSI
inferred← citeshttps://doi.org/10.1145/99164.99170openalex-snapshot
A multi-level load balancing scheme for OR-parallel exhaustive search programs on the multi-PSI
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.