Deriving the Sparse Cholesky Elimination Tree for Matrix Factorization
Here I derive the elimination tree for the (right-looking) sparse Cholesky algorithm for computing A = LL^T for lower triangular L and sparse matrices A. This tree forms the foundation for most…
Read the full articleYou might also wanna read
Decomposition and Successive Decomposition Methods and Algorithms for Nonconvex Optimization
Existing results on decomposition methods and algorithms for nonconvex problems are minimal. Parallel decomposition algorithms do not exist
Orthogonal Approximate Message Passing for Double Linear Transformation Model
The double linear transformation (DLT) model $\boldsymbol{Y}=\boldsymbol{A}\boldsymbol{X}\boldsymbol{B}+\boldsymbol{N}$ is widely used in si
Accelerating GPU Inference of Large Language Models with Moderately Unstructured Sparse Weight Matrices
arXiv:2607.08786v1 Announce Type: new Abstract: With the growing deployment of large language models (LLMs), LLM inference cost has become a
Achieving 232x Speedup on GPU QR Factorization: A Contest Retrospective
Table of Contents Intro Contest in short Problem intro Why this problem is auto-research-able Learning Enough to Ask Better Questions (Optio
sankalp.bearblog.dev·8d ago
Improved Deterministic Algorithm for Approximate Minimum Spanning Trees in Doubling Metrics
The minimum spanning tree (MST) problem is one of the most basic optimization problems on metric spaces and graphs. We study the problem of
arxiv.org·20h agoSparse Phase Retrieval for Clustered-Sparse Signals: A Graph Cut-Based Truncated Flow Approach
This paper proposes a robust graph cut truncated flow (GCTF) algorithm to tackle the clustered-sparse phase retrieval problem. The GCTF algo
Comments
Sign in to join the conversation.
No comments yet. Be the first.