On the public citation graph
Fine-Grained Multithreading for the Multifrontal $QR$ Factorization of Sparse Matrices
0 signed · 73 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)1099-1506(199607/08)3:4<275::aid-nla83>3.0.co;2-7openalex-snapshot
Multifrontal QR Factorization in a Multiprocessor Environment
inferredcites →https://doi.org/10.1007/3-540-61142-8_588openalex-snapshot
Scotch: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs
inferredcites →https://doi.org/10.1007/3-540-70734-4_16openalex-snapshot
MUMPS: A General Purpose Distributed Memory Sparse Solver
inferredcites →https://doi.org/10.1007/978-3-642-11261-4_11openalex-snapshot
Collecting Performance Data with PAPI-C
inferredcites →https://doi.org/10.1007/978-3-642-28145-7_23openalex-snapshot
Fine Granularity Sparse QR Factorization for Multicore Based Systems
inferredcites →https://doi.org/10.1007/s101070100263openalex-snapshot
Benchmarking optimization software with performance profiles
inferredcites →https://doi.org/10.1016/0024-3795(80)90159-7openalex-snapshot
Solution of sparse linear least squares problems using givens rotations
inferredcites →https://doi.org/10.1016/0024-3795(87)90111-xopenalex-snapshot
Householder reflections versus givens rotations in sparse orthogonal decomposition
inferredcites →https://doi.org/10.1016/0167-8191(94)00092-oopenalex-snapshot
Parallel sparse QR factorization on shared memory architectures
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(03)00099-1openalex-snapshot
Impact of reordering on the memory of a multifrontal solver
inferredcites →https://doi.org/10.1109/ipdps.2010.5470443openalex-snapshot
Tile QR factorization with parallel panel processing for multicore architectures
inferredcites →https://doi.org/10.1109/pdp.2010.67openalex-snapshot
hwloc: A Generic Framework for Managing Hardware Affinities in HPC Applications
inferredcites →https://doi.org/10.1137/0611010openalex-snapshot
The Role of Elimination Trees in Sparse Factorization
inferredcites →https://doi.org/10.1137/0907081openalex-snapshot
On General Row Merging Schemes for Sparse Givens Transformations
inferredcites →https://doi.org/10.1137/0910005openalex-snapshot
A Storage-Efficient $WY$ Representation for Products of Householder Transformations
inferredcites →https://doi.org/10.1137/1.9780898719611openalex-snapshot
Numerical Linear Algebra for High-Performance Computers
inferredcites →https://doi.org/10.1137/1.9781611971484openalex-snapshot
Numerical Methods for Least Squares Problems
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/1024074.1024079openalex-snapshot
A column approximate minimum degree ordering algorithm
inferredcites →https://doi.org/10.1145/2049662.2049663openalex-snapshot
The university of Florida sparse matrix collection
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/6497.6499openalex-snapshot
A compact row storage scheme for Cholesky factors using elimination trees
inferredcites →https://doi.org/10.1145/7921.11325openalex-snapshot
On the storage requirement in the out-of-core multifrontal method for sparse factorization
inferredcites →https://doi.org/10.1177/109434200001400303openalex-snapshot
A Portable Programming Interface for Performance Evaluation on Modern Processors
inferredcites →https://doi.org/10.12694/scpe.v1i1.66openalex-snapshot
Asynchrony in parallel computing: from dataflow to multithreading
inferredcites →https://doi.org/10.5860/choice.34-1602openalex-snapshot
Numerical methods for least squares problems
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/nla.2059openalex-snapshot
Numerical recovery strategies for parallel resilient Krylov linear solvers
inferred← citeshttps://doi.org/10.1007/978-3-319-58943-5_14openalex-snapshot
Exploiting a Parametrized Task Graph Model for the Parallelization of a Sparse Direct Multifrontal Solver
inferred← citeshttps://doi.org/10.1007/978-3-319-58943-5_7openalex-snapshot
Task-Based Sparse Hybrid Linear Solver for Distributed Memory Heterogeneous Architectures
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/978-3-642-40047-6_53openalex-snapshot
Multifrontal QR Factorization for Multicore Architectures over Runtime Systems
inferred← citeshttps://doi.org/10.1016/j.camwa.2015.10.009openalex-snapshot
Parallel direct solver for solving systems of linear equations resulting from finite element method on multi-core desktops and workstations
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.cma.2017.08.043openalex-snapshot
Discrete least-squares finite element methods
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.future.2022.05.013openalex-snapshot
Performance analysis of task-based multi-frontal sparse linear solvers: Structure matters
inferred← citeshttps://doi.org/10.1016/j.jpdc.2020.03.002openalex-snapshot
Reordering sparse matrices into block-diagonal column-overlapped form
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.1017/s0962492916000076openalex-snapshot
A survey of direct methods for sparse linear systems
inferred← citeshttps://doi.org/10.1080/03155986.2018.1559428openalex-snapshot
A regularized interior-point method for constrained linear least squares
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.2015.27openalex-snapshot
Task-Based Multifrontal QR Solver for GPU-Accelerated Multicore Architectures
inferred← citeshttps://doi.org/10.1109/icpads.2015.67openalex-snapshot
Fast and Accurate Simulation of Multithreaded Sparse Linear Algebra Solvers
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/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/tpds.2019.2953852openalex-snapshot
Accelerating Sparse Cholesky Factorization on Sunway Manycore Architecture
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/19m1306166openalex-snapshot
Parallel QR Factorization of Block-Tridiagonal Matrices
inferred← citeshttps://doi.org/10.1137/20m1318808openalex-snapshot
SemiAutomatic Task Graph Construction for $\mathcal{H}$-Matrix Arithmetic
inferred← citeshttps://doi.org/10.1137/20m1348261openalex-snapshot
Extensions of the Augmented Block Cimmino Method to the Solution of Full Rank Rectangular Systems
inferred← citeshttps://doi.org/10.1137/20m1373475openalex-snapshot
Hierarchical Orthogonal Factorization: Sparse Square Matrices
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/3004280openalex-snapshot
Parallel Minimum Norm Solution of Sparse Block Diagonal Column Overlapped Underdetermined 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/3494527openalex-snapshot
A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems
inferred← citeshttps://doi.org/10.1177/1094342019899997openalex-snapshot
Iteratively solving sparse linear system based on PaRSEC task scheduling
inferred← citeshttps://doi.org/10.13140/rg.2.1.2846.6803openalex-snapshot
NLP.py: An Object-Oriented Environment for Large-Scale Optimization
inferred← citeshttps://doi.org/10.2172/1237520openalex-snapshot
Task Parallel Incomplete Cholesky Factorization using 2D Partitioned-Block Layout
inferred← citeshttps://doi.org/10.5753/eradrs.2020.10778openalex-snapshot
Mecanismo de Detecção de Tarefas Anômalas Para a Análise de Desempenho de Aplicações com Tarefas Irregulares
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/9ea74bb0zcd35z4136zb61fz140e8e1ff3ecopenalex-snapshot
On the design of sparse hybrid linear solvers for modern parallel architectures
inferred← citeshttps://doi.org/10.70675/a283919az0167z4cf1z9a2fz438b513bf749openalex-snapshot
Hybrid direct and interactive solvers for sparse indefinite and overdetermined systems on future exascale architectures
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
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.