On the public citation graph
Design of a Multicore Sparse Cholesky Factorization Using DAGs
0 signed · 124 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.1002/(sici)1096-9128(200002/03)12:2/3<69::aid-cpe472>3.0.co;2-wopenalex-snapshot
Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering
inferredcites →https://doi.org/10.1006/jpdc.1996.0107openalex-snapshot
Cilk: An Efficient Multithreaded Runtime System
inferredcites →https://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
inferredcites →https://doi.org/10.1007/978-3-540-75755-9_1openalex-snapshot
The Impact of Multicore on Math Software
inferredcites →https://doi.org/10.1007/bf01407861openalex-snapshot
Task scheduling for parallel sparse Cholesky factorization
inferredcites →https://doi.org/10.1007/bf01407878openalex-snapshot
Solution of sparse positive definite systems on a shared-memory multiprocessor
inferredcites →https://doi.org/10.1007/bfb0031609openalex-snapshot
Sparse matrix ordering with Scotch
inferredcites →https://doi.org/10.1016/0167-8191(86)90019-0openalex-snapshot
Parallel implementation of multifrontal schemes
inferredcites →https://doi.org/10.1016/j.future.2003.07.007openalex-snapshot
Parallel and fully recursive multifrontal sparse Cholesky
inferredcites →https://doi.org/10.1016/j.future.2003.07.011openalex-snapshot
Solving unsymmetric sparse systems of linear equations with PARDISO
inferredcites →https://doi.org/10.1016/j.parco.2008.10.002openalex-snapshot
A class of parallel tiled linear algebra algorithms for multicore architectures
inferredcites →https://doi.org/10.1016/s0167-8191(01)00141-7openalex-snapshot
PaStiX: a high-performance parallel direct solver for sparse symmetric positive definite systems
inferredcites →https://doi.org/10.1088/1742-6596/125/1/012079openalex-snapshot
Evaluation of SuperLU on multicore architectures
inferredcites →https://doi.org/10.1088/1742-6596/180/1/012037openalex-snapshot
Numerical linear algebra on emerging architectures: The PLASMA and MAGMA projects
inferredcites →https://doi.org/10.1093/acprof:oso/9780198508380.001.0001openalex-snapshot
Direct Methods for Sparse Matrices
inferredcites →https://doi.org/10.1109/clustr.2008.4663765openalex-snapshot
A dependency-aware task-based programming environment for multi-core architectures
inferredcites →https://doi.org/10.1137/0914048openalex-snapshot
A Supernodal Cholesky Factorization Algorithm for Shared-Memory Multiprocessors
inferredcites →https://doi.org/10.1137/1033099openalex-snapshot
Parallel Algorithms for Sparse Linear Systems
inferredcites →https://doi.org/10.1137/s0895479897317685openalex-snapshot
An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination
inferredcites →https://doi.org/10.1137/s0895479899358194openalex-snapshot
A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
inferredcites →https://doi.org/10.1137/s1064827595287997openalex-snapshot
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
inferredcites →https://doi.org/10.1145/1067967.1067969openalex-snapshot
A fully portable high performance minimal storage hybrid format Cholesky algorithm
inferredcites →https://doi.org/10.1145/1326548.1326550openalex-snapshot
Parallel unsymmetric-pattern multifrontal sparse LU with column preordering
inferredcites →https://doi.org/10.1145/1499096.1499098openalex-snapshot
An out-of-core sparse Cholesky solver
inferredcites →https://doi.org/10.1145/356044.356047openalex-snapshot
The Multifrontal Solution of Indefinite Sparse Symmetric Linear
inferredcites →https://doi.org/10.1145/992200.992202openalex-snapshot
MA57---a code for the solution of sparse symmetric definite and indefinite systems
inferredcites →https://doi.org/10.5286/raltr.2008029openalex-snapshot
A DAG-based parallel Cholesky factorization for multicore systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4684496openalex-extracted
Fully Parallel and Pipelined Sparse Direct Solver for Large Symmetric Indefinite Finite Element Problems
inferred← citeshttps://doi.org/10.2139/ssrn.4814522openalex-extracted
Fully Parallel and Pipelined Sparse Direct Solver for Large Symmetric Indefinite Finite Element Problems
inferred← citeshttps://doi.org/10.1002/cpe.3158openalex-snapshot
Supernodal sparse Cholesky factorization on graphics processing units
inferred← citeshttps://doi.org/10.1002/nla.2103openalex-snapshot
A comparative study of null‐space factorizations for sparse symmetric saddle point systems
inferred← citeshttps://doi.org/10.1002/nla.2130openalex-snapshot
Wilkinson's inertia‐revealing factorization and its application to sparse matrices
inferred← citeshttps://doi.org/10.1002/nme.4367openalex-snapshot
A fast method for binary programming using first‐order derivatives, with application to topology optimization with buckling constraints
inferred← citeshttps://doi.org/10.1007/978-3-030-36592-9_7openalex-snapshot
Multithreaded Multifrontal Sparse Cholesky Factorization Using Threading Building Blocks
inferred← citeshttps://doi.org/10.1007/978-3-031-25820-6_4openalex-snapshot
Sparse Cholesky Solver: The Symbolic Phase
inferred← citeshttps://doi.org/10.1007/978-3-031-25820-6_5openalex-snapshot
Sparse Cholesky Solver: The Factorization Phase
inferred← citeshttps://doi.org/10.1007/978-3-031-39698-4_49openalex-snapshot
Parallel Cholesky Factorization for Banded Matrices Using OpenMP Tasks
inferred← citeshttps://doi.org/10.1007/978-3-031-95709-3_6openalex-snapshot
HSL@60: A Brief History of the HSL Mathematical Software Library
inferred← citeshttps://doi.org/10.1007/978-3-319-78024-5_18openalex-snapshot
Experiments with Sparse Cholesky Using a Parametrized Task Graph Implementation
inferred← citeshttps://doi.org/10.1007/978-3-319-90026-1_4openalex-snapshot
Sparse Direct Solution on Parallel Computers
inferred← citeshttps://doi.org/10.1007/s00791-014-0226-7openalex-snapshot
$${{\fancyscript{H}}} $$ H -LU factorization on many-core systems
inferred← citeshttps://doi.org/10.1007/s10543-022-00930-2openalex-snapshot
Solving large linear least squares problems with linear equality constraints
inferred← citeshttps://doi.org/10.1007/s10589-016-9886-1openalex-snapshot
A dual gradient-projection method for large-scale strictly convex quadratic problems
inferred← citeshttps://doi.org/10.1007/s10766-015-0369-2openalex-snapshot
Integrating Transactions into the Data-Driven Multi-threading Model Using the TFlux Platform
inferred← citeshttps://doi.org/10.1007/s10846-016-0367-7openalex-snapshot
Efficient Cholesky Factor Recovery for Column Reordering in Simultaneous Localisation and Mapping
inferred← citeshttps://doi.org/10.1007/s11075-018-0478-2openalex-snapshot
A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
inferred← citeshttps://doi.org/10.1007/s11075-021-01245-zopenalex-snapshot
A null-space approach for large-scale symmetric saddle point systems with a small and non zero (2, 2) block
inferred← citeshttps://doi.org/10.1007/s11075-023-01681-zopenalex-snapshot
Approximating sparse Hessian matrices using large-scale linear least squares
inferred← citeshttps://doi.org/10.1016/j.camwa.2024.10.017openalex-snapshot
Fully parallel and pipelined sparse direct solver for large symmetric indefinite finite element problems
inferred← citeshttps://doi.org/10.1016/j.cpc.2022.108637openalex-snapshot
Fine-grained heterogeneous parallel direct solver for finite element problems
inferred← citeshttps://doi.org/10.1016/j.media.2015.03.005openalex-snapshot
Skuller: A volumetric shape registration algorithm for modeling skull deformities
inferred← citeshttps://doi.org/10.1016/j.parco.2014.02.003openalex-snapshot
A study of shared-memory parallelism in a multifrontal solver
inferred← citeshttps://doi.org/10.1016/j.parco.2015.09.004openalex-snapshot
On the scalability of inexact balancing domain decomposition by constraints with overlapped coarse/fine corrections
inferred← citeshttps://doi.org/10.1017/s0962492916000076openalex-snapshot
A survey of direct methods for sparse linear systems
inferred← citeshttps://doi.org/10.1021/acsnano.2c12257openalex-snapshot
Determination of 2D Particle Size Distributions in Plasmonic Nanoparticle Colloids via Analytical Ultracentrifugation: Application to Gold Bipyramids
inferred← citeshttps://doi.org/10.1039/d4nr02516dopenalex-snapshot
Continuous flow synthesis and simulation-supported investigation of tunable plasmonic gold patchy nanoparticles
inferred← citeshttps://doi.org/10.1061/(asce)wr.1943-5452.0000596openalex-snapshot
Quest for a New Solver for EPANET 2
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/dfm.2011.14openalex-snapshot
Integrating Transactions into the Data-Driven Multi-threading Model Using the TFlux Platform
inferred← citeshttps://doi.org/10.1109/espm256814.2022.00006openalex-snapshot
A Selective Nesting Approach for the Sparse Multi-threaded Cholesky Factorization
inferred← citeshttps://doi.org/10.1109/hipc.2014.7116880openalex-snapshot
Reducing elimination tree height for parallel LU factorization of sparse unsymmetric matrices
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/ia349570.2019.00014openalex-snapshot
Stretching Jacobi: Two-Stage Pivoting in Block-Based Factorization
inferred← citeshttps://doi.org/10.1109/icips67876.2025.11332062openalex-snapshot
Decomposition and Coordination-Based Parallel Power Flow Calculation for Large-Scale Multi-Regional Interconnected Power System
inferred← citeshttps://doi.org/10.1109/icpp.2014.57openalex-snapshot
A Runtime Approach to Dynamic Resource Allocation for Sparse Direct Solvers
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/ipdpsw.2014.9openalex-snapshot
Taking Advantage of Hybrid Systems for Sparse Direct Solvers via Task-Based Runtimes
inferred← citeshttps://doi.org/10.1109/ipdpsw.2016.41openalex-snapshot
A Comparison of High-Level Programming Choices for Incomplete Sparse Factorization Across Different Architectures
inferred← citeshttps://doi.org/10.1109/sbac-pad.2014.24openalex-snapshot
Leveraging Task-Parallelism with OmpSs in ILUPACK's Preconditioned CG Method
inferred← citeshttps://doi.org/10.1109/scw63240.2024.00098openalex-snapshot
GPU Accelerated Sparse Cholesky Factorization
inferred← citeshttps://doi.org/10.1109/tpami.2019.2933209openalex-snapshot
Parallel and Scalable Heat Methods for Geodesic Distance Computation
inferred← citeshttps://doi.org/10.1137/1.9781611975215.8openalex-snapshot
Fast and effective reordering of columns within supernodes using partition refinement
inferred← citeshttps://doi.org/10.1137/15m1010117openalex-snapshot
An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling
inferred← citeshttps://doi.org/10.1137/15m1013511openalex-snapshot
Multilevel Balancing Domain Decomposition at Extreme Scales
inferred← citeshttps://doi.org/10.1137/16m1062454openalex-snapshot
Reordering Strategy for Blocking Optimization in Sparse Linear Solvers
inferred← citeshttps://doi.org/10.1137/16m1065380openalex-snapshot
On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
inferred← citeshttps://doi.org/10.1137/20m1318808openalex-snapshot
SemiAutomatic Task Graph Construction for $\mathcal{H}$-Matrix Arithmetic
inferred← citeshttps://doi.org/10.1137/20m1368070openalex-snapshot
Fast Implementation of the Traveling-Salesman-Problem Method for Reordering Columns within Supernodes
inferred← citeshttps://doi.org/10.1145/2513109.2513113openalex-snapshot
Pivoting strategies for tough sparse indefinite systems
inferred← citeshttps://doi.org/10.1145/2629641openalex-snapshot
A Parallel Sparse Direct Solver via Hierarchical DAG Scheduling
inferred← citeshttps://doi.org/10.1145/2898348openalex-snapshot
Implementing Multifrontal Sparse Solvers for Multicore Architectures with Sequential Task Flow Runtime Systems
inferred← citeshttps://doi.org/10.1145/3014057openalex-snapshot
The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems
inferred← citeshttps://doi.org/10.1145/3314221.3314646openalex-snapshot
Sparse computation data dependence simplification for efficient compiler-generated inspectors
inferred← citeshttps://doi.org/10.1145/3412559openalex-snapshot
Strengths and Limitations of Stretching for Least-squares Problems with Some Dense Rows
inferred← citeshttps://doi.org/10.1145/3630051openalex-snapshot
HPS Cholesky: Hierarchical Parallelized Supernodal Cholesky with Adaptive Parameters
inferred← citeshttps://doi.org/10.1145/3837072openalex-snapshot
A Computational Study of Low-Precision Incomplete Cholesky Factorization Preconditioners for Sparse Linear Least-Squares Problems
inferred← citeshttps://doi.org/10.1155/2017/3021591openalex-snapshot
Sparse Cholesky Factorization on FPGA Using Parameterized Model
inferred← citeshttps://doi.org/10.1177/1094342019888567openalex-snapshot
Parallelization of the solve phase in a task-based Cholesky solver using a sequential task flow model
inferred← citeshttps://doi.org/10.1587/transfun.e96.a.833openalex-snapshot
Parallel Sparse Cholesky Factorization on a Heterogeneous Platform
inferred← citeshttps://doi.org/10.2172/1237520openalex-snapshot
Task Parallel Incomplete Cholesky Factorization using 2D Partitioned-Block Layout
inferred← citeshttps://doi.org/10.3233/apc200059openalex-snapshot
Acceleration of Hydro Poro-Elastic Damage Simulation in a Shared-Memory Environment1
inferred← citeshttps://doi.org/10.3390/a6040702openalex-snapshot
New Parallel Sparse Direct Solvers for Multicore Architectures
inferred← citeshttps://doi.org/10.48550/arxiv.1405.2636openalex-snapshot
Taking advantage of hybrid systems for sparse direct solvers via task-based runtimes
inferred← citeshttps://doi.org/10.48550/arxiv.1807.10852openalex-snapshot
Sparse Matrix Code Dependence Analysis Simplification at Compile Time
inferred← citeshttps://doi.org/10.5286/raltr.2010031openalex-snapshot
A modern analyse phase for sparse tree-based direct methods
inferred← citeshttps://doi.org/10.6035/14028.2017.193547openalex-snapshot
Performance and Energy Optimization of the Iterative Solution of Sparse Linear Systems on Multicore Processors
inferred← citeshttps://doi.org/10.70675/42fab030zaf8ez47cbzaa74ze8aacaa9883eopenalex-snapshot
Programmation des architectures hétérogènes à l'aide de tâches divisibles ou modulables
inferred← citeshttps://doi.org/10.70675/c56ebd34z7627z4f75zb277z9249c079eca5openalex-snapshot
Scaling the solution of large sparse linear systems using multifrontal methods on hybrid shared-distributed memory architectures
inferred← citeshttps://doi.org/10.70675/f03dcd69za905z4dc5za2d4zd420c3f7370fopenalex-snapshot
Utilisation de la compression low-rank pour réduire la complexité des solveurs creux parallèles basés sur des techniques de factorisation directes.
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.