On the public citation graph
CALU: A Communication Optimal LU Factorization Algorithm
0 signed · 94 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/cpe.728openalex-snapshot
The LINPACK Benchmark: past, present and future
inferredcites →https://doi.org/10.1016/j.jpdc.2004.03.021openalex-snapshot
Communication lower bounds for distributed-memory matrix multiplication
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/j.parco.2009.12.005openalex-snapshot
Towards dense linear algebra for hybrid GPU accelerated manycore systems
inferredcites →https://doi.org/10.1090/s0025-5718-1980-0572859-4openalex-snapshot
Iterative Refinement Implies Numerical Stability for Gaussian Elimination
inferredcites →https://doi.org/10.1093/comjnl/3.1.28openalex-snapshot
Solution of Simultaneous Linear Equations using a Magnetic-Tape Store
inferredcites →https://doi.org/10.1109/grid.2005.1542729openalex-snapshot
Highly latency tolerant Gaussian elimination
inferredcites →https://doi.org/10.1109/ipdps.2010.5470348openalex-snapshot
Adapting communication-avoiding LU and QR factorizations to multicore architectures
inferredcites →https://doi.org/10.1109/tc.1985.1676570openalex-snapshot
Analysis of Pairwise Pivoting in Gaussian Elimination
inferredcites →https://doi.org/10.1137/0610012openalex-snapshot
Large Growth Factors in Gaussian Elimination with Pivoting
inferredcites →https://doi.org/10.1137/0611023openalex-snapshot
Average-Case Stability of Gaussian Elimination
inferredcites →https://doi.org/10.1137/080731992openalex-snapshot
Communication-optimal Parallel and Sequential QR and LU Factorizations
inferredcites →https://doi.org/10.1137/090769156openalex-snapshot
Minimizing Communication in Numerical Linear Algebra
inferredcites →https://doi.org/10.1137/1.9780898718027openalex-snapshot
Accuracy and Stability of Numerical Algorithms
inferredcites →https://doi.org/10.1137/s0895479896297744openalex-snapshot
Locality of Reference in LU Decomposition with Partial Pivoting
inferredcites →https://doi.org/10.1145/1377612.1377615openalex-snapshot
Updating an LU Factorization with Pivoting
inferredcites →https://doi.org/10.1147/rd.416.0737openalex-snapshot
Recursion leads to automatic variable blocking for dense linear-algebra algorithms
inferredcites →https://doi.org/10.1155/1996/483083openalex-snapshot
Design and Implementation of the ScaLAPACK LU, QR, and Cholesky Factorization Routines
inferredcites →https://doi.org/10.5555/1413370.1413400openalex-snapshot
Communication avoiding Gaussian elimination
inferredcites →https://doi.org/10.5860/choice.35-3919openalex-snapshot
Applied numerical linear algebra
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.3306openalex-snapshot
A survey of recent developments in parallel implementations of Gaussian elimination
inferred← citeshttps://doi.org/10.1002/cpe.4055openalex-snapshot
Solving dense symmetric indefinite systems using GPUs
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.4729openalex-snapshot
A dissection solver with kernel detection for symmetric finite element matrices on shared memory computers
inferred← citeshttps://doi.org/10.1007/978-3-030-85665-6_33openalex-snapshot
Fault-Tolerant LU Factorization Is Low Cost
inferred← citeshttps://doi.org/10.1007/978-3-031-06156-1_44openalex-snapshot
Application-Based Fault Tolerance for Numerical Linear Algebra at Large Scale
inferred← citeshttps://doi.org/10.1007/978-3-319-07518-1_5openalex-snapshot
Performance Predictions of Multilevel Communication Optimal LU and QR Factorizations on Hierarchical Platforms
inferred← citeshttps://doi.org/10.1007/978-3-319-17353-5_14openalex-snapshot
Modeling 1D Distributed-Memory Dense Kernels for an Asynchronous Multifrontal Sparse Solver
inferred← citeshttps://doi.org/10.1007/978-3-319-27308-2_15openalex-snapshot
A Randomized LU-based Solver Using GPU and Intel Xeon Phi Accelerators
inferred← citeshttps://doi.org/10.1007/978-3-319-32149-3_9openalex-snapshot
Dense Symmetric Indefinite Factorization on GPU Accelerated Architectures
inferred← citeshttps://doi.org/10.1007/978-3-319-49631-3_4openalex-snapshot
Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra
inferred← citeshttps://doi.org/10.1007/978-3-642-32820-6_55openalex-snapshot
Avoiding Communication through a Multilevel LU Factorization
inferred← citeshttps://doi.org/10.1007/s00450-011-0169-xopenalex-snapshot
Designing and dynamically load balancing hybrid LU for multi/many-core
inferred← citeshttps://doi.org/10.1007/s10444-023-10061-zopenalex-snapshot
Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions
inferred← citeshttps://doi.org/10.1007/s10543-015-0547-zopenalex-snapshot
A parallel algorithm for calculation of determinants and minors using arbitrary precision arithmetic
inferred← citeshttps://doi.org/10.1007/s42514-026-00275-0openalex-snapshot
Exploiting intra-core heterogeneity for high-performance dense linear algebra on Huawei Ascend 910 NPUs
inferred← citeshttps://doi.org/10.1016/j.jpdc.2015.06.007openalex-snapshot
Mixing LU and QR factorization algorithms to design high-performance dense linear algebra solvers
inferred← citeshttps://doi.org/10.1016/j.jpdc.2019.03.004openalex-snapshot
A communication-avoiding 3D algorithm for sparse LU factorization on heterogeneous systems
inferred← citeshttps://doi.org/10.1016/j.parco.2015.10.003openalex-snapshot
Recursion based parallelization of exact dense linear algebra routines for Gaussian elimination
inferred← citeshttps://doi.org/10.1016/j.procs.2012.04.003openalex-snapshot
A Class of Communication-avoiding Algorithms for Solving General Dense Linear Systems on CPU/GPU Parallel Machines
inferred← citeshttps://doi.org/10.1017/s0962492914000038openalex-snapshot
Communication lower bounds and optimal algorithms for numerical linear algebra
inferred← citeshttps://doi.org/10.1017/s0962492916000015openalex-snapshot
Linear algebra software for large-scale accelerated multicore computing
inferred← citeshttps://doi.org/10.1093/nar/gkx1313openalex-snapshot
HipMCL: a high-performance parallel implementation of the Markov clustering algorithm for large-scale networks
inferred← citeshttps://doi.org/10.1093/oso/9780198788348.001.0001openalex-snapshot
Parallel Scientific Computation
inferred← citeshttps://doi.org/10.1093/oso/9780198788348.003.0003openalex-snapshot
The fast Fourier transform
inferred← citeshttps://doi.org/10.1093/oso/9780198788348.003.0004openalex-snapshot
Sparse matrix–vector multiplication
inferred← citeshttps://doi.org/10.1093/oso/9780198788348.005.0001openalex-snapshot
Auxiliary BSPedupack functions
inferred← citeshttps://doi.org/10.1093/oso/9780198788348.005.0002openalex-snapshot
A quick reference guide to BSPlib
inferred← citeshttps://doi.org/10.1098/rsta.2019.0066openalex-snapshot
Numerical algorithms for high-performance computational science
inferred← citeshttps://doi.org/10.1109/access.2018.2841005openalex-snapshot
An Efficient Matrix Equation Parallel Direct Solver for Higher-Order Method of Moments in Solution of Complex Electromagnetic Problems
inferred← citeshttps://doi.org/10.1109/bigdatasecurity-hpsc-ids.2016.59openalex-snapshot
Exploiting Redundant Computation in Communication-Avoiding Algorithms for Algorithm-Based Fault Tolerance
inferred← citeshttps://doi.org/10.1109/cluster59342.2025.11186492openalex-snapshot
Parallel Tall-and-Skinny QR Factorization Based on LU-CholeskyQR Algorithm
inferred← citeshttps://doi.org/10.1109/hipc.2013.6799105openalex-snapshot
A Branch-and-Bound algorithm using multiple GPU-based LP solvers
inferred← citeshttps://doi.org/10.1109/icpads.2016.0144openalex-snapshot
suCAQR: A Simplified Communication-Avoiding QR Factorization Solver Using the TBLAS Framework
inferred← citeshttps://doi.org/10.1109/ipdps.2013.98openalex-snapshot
Implementing a Blocked Aasen's Algorithm with a Dynamic Scheduler on Multicore Architectures
inferred← citeshttps://doi.org/10.1109/ipdps.2014.108openalex-snapshot
Designing LU-QR Hybrid Solvers for Performance and Stability
inferred← citeshttps://doi.org/10.1109/ipdps.2018.00100openalex-snapshot
A Communication-Avoiding 3D LU Factorization Algorithm for Sparse Matrices
inferred← citeshttps://doi.org/10.1109/scalah56622.2022.00010openalex-snapshot
Threshold Pivoting for Dense LU Factorization
inferred← citeshttps://doi.org/10.1109/tpds.2019.2906891openalex-snapshot
Coordinated DMA: Improving the DRAM Access Efficiency for Matrix Multiplication
inferred← citeshttps://doi.org/10.1137/080731992openalex-snapshot
Communication-optimal Parallel and Sequential QR and LU Factorizations
inferred← citeshttps://doi.org/10.1137/090769156openalex-snapshot
Minimizing Communication in Numerical Linear Algebra
inferred← citeshttps://doi.org/10.1137/120863691openalex-snapshot
LU Factorization with Panel Rank Revealing Pivoting and Its Communication Avoiding Version
inferred← citeshttps://doi.org/10.1137/120876605openalex-snapshot
Stable and Efficient Spectral Divide and Conquer Algorithms for the Symmetric Eigenvalue Decomposition and the SVD
inferred← citeshttps://doi.org/10.1137/130920629openalex-snapshot
Compressed Threshold Pivoting for Sparse Symmetric Indefinite Systems
inferred← citeshttps://doi.org/10.1137/13092157xopenalex-snapshot
Communication Avoiding Rank Revealing QR Factorization with Column Pivoting
inferred← citeshttps://doi.org/10.1137/130929060openalex-snapshot
Communication-Avoiding Symmetric-Indefinite Factorization
inferred← citeshttps://doi.org/10.1137/130930376openalex-snapshot
Communication Avoiding ILU0 Preconditioner
inferred← citeshttps://doi.org/10.1137/16m1074527openalex-snapshot
Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting
inferred← citeshttps://doi.org/10.1145/2395116.2395121openalex-snapshot
Graph expansion and communication costs of fast matrix multiplication
inferred← citeshttps://doi.org/10.1145/2486159.2486198openalex-snapshot
Communication efficient gaussian elimination with partial pivoting using a shape morphing data layout
inferred← citeshttps://doi.org/10.1145/2897188openalex-snapshot
Trade-Offs Between Synchronization, Communication, and Computation in Parallel Linear Algebra Computations
inferred← citeshttps://doi.org/10.1145/3577193.3593731openalex-snapshot
Using Additive Modifications in LU Factorization Instead of Pivoting
inferred← citeshttps://doi.org/10.1145/3581784.3607050openalex-snapshot
PanguLU: A Scalable Regular Two-Dimensional Block-Cyclic Sparse Direct Solver on Distributed Heterogeneous Systems
inferred← citeshttps://doi.org/10.1145/3699714openalex-snapshot
Generalizing Random Butterfly Transforms to Arbitrary Matrix Sizes
inferred← citeshttps://doi.org/10.1145/3712285.3759895openalex-snapshot
KAMI: Communication-Avoiding General Matrix Multiplication within a Single GPU
inferred← citeshttps://doi.org/10.1177/1094342016665471openalex-snapshot
A survey on software methods to improve the energy efficiency of parallel computing
inferred← citeshttps://doi.org/10.2139/ssrn.5580116openalex-snapshot
Pivot probabilities and norm effects in Gaussian elimination for $\beta$-ensembles
inferred← citeshttps://doi.org/10.3989/arbor.2013.764n6007openalex-snapshot
Alan Turing y los orígenes de la eliminación gaussiana moderna
inferred← citeshttps://doi.org/10.48550/arxiv.1303.5837openalex-snapshot
Multilevel communication optimal LU and QR factorizations for hierarchical platforms
inferred← citeshttps://doi.org/10.48550/arxiv.1511.08528openalex-snapshot
Gaussian Elimination with Randomized Complete Pivoting
inferred← citeshttps://doi.org/10.70675/29c38ac9z6d86z424dz8dcez148daedf433bopenalex-snapshot
Memory-aware Algorithms and Scheduling Techniques for Matrix Computattions
inferred← citeshttps://doi.org/10.70675/2c802f33z5cebz433azb2cfzbeaee3f7ff31openalex-snapshot
Application-based fault tolerance for numerical linear algebra at large scale
inferred← citeshttps://doi.org/10.70675/6f1a93dbz0cbdz430bz880az81241f5266e4openalex-snapshot
Méthodes de sous-espace de krylov élargis et préconditionneurs pour réduire les communications
inferred← citeshttps://doi.org/10.70675/a673e28ez23fez485azab08zfce658e4b4a1openalex-snapshot
Solving dense linear systems on accelerated multicore architectures
inferred← citeshttps://doi.org/10.70675/d568f732zf598z481aza8fcz023fecb8cd1copenalex-snapshot
A parallel iterative solver for large sparse linear systems enhanced with randomization and GPU accelerator, and its resilience to soft errors
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.