R.I.P.
👻
Ghosted
Simple, Fast and Practicable Algorithms for Cholesky, LU and QR Decomposition Using Fast Rectangular Matrix Multiplication
December 05, 2018 · Declared Dead · 🏛 arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Cristóbal Camarero
arXiv ID
1812.02056
Category
math.NA: Numerical Analysis
Cross-listed
cs.DS
Citations
8
Venue
arXiv.org
Last Checked
1 month ago
Abstract
This note presents fast Cholesky/LU/QR decomposition algorithms with $O(n^{2.529})$ time complexity when using the fastest known matrix multiplication. The algorithms have potential application, since a quickly made implementation using Strassen multiplication has lesser execution time than the employed by the GNU Scientific Library for the same task in at least a few examples. The underlaying ideas are very simple. Despite this, I have been unable to find these methods in the literature.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
📜 Similar Papers
In the same crypt — Numerical Analysis
R.I.P.
👻
Ghosted
Deep learning-based numerical methods for high-dimensional parabolic partial differential equations and backward stochastic differential equations
R.I.P.
👻
Ghosted
PDE-Net: Learning PDEs from Data
R.I.P.
👻
Ghosted
Efficient tensor completion for color image and video recovery: Low-rank tensor train
R.I.P.
👻
Ghosted
Tensor Ring Decomposition
R.I.P.
👻
Ghosted
Machine learning approximation algorithms for high-dimensional fully nonlinear partial differential equations and second-order backward stochastic differential equations
Died the same way — 👻 Ghosted
R.I.P.
👻
Ghosted
Language Models are Few-Shot Learners
R.I.P.
👻
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
👻
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
👻
Ghosted