Fast bilinear algorithms for symmetric tensor contractions
From MaRDI portal
Publication:2246165
DOI10.1515/cmam-2019-0075zbMath1473.65360MaRDI QIDQ2246165
Edgar Solomonik, James W. Demmel
Publication date: 16 November 2021
Published in: Computational Methods in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/cmam-2019-0075
68Q25: Analysis of algorithms and problem complexity
15B57: Hermitian, skew-Hermitian, and related matrices
65Y20: Complexity and performance of numerical algorithms
65Y04: Numerical algorithms for computer arithmetic, etc.
Related Items
Uses Software
Cites Work
- Tensor Decompositions and Applications
- Tensor-Train Decomposition
- Tensor numerical methods in scientific computing
- A practical introduction to tensor networks: Matrix product states and projected entangled pair states
- \texttt{NWChem}: a comprehensive and scalable open-source solution for large scale molecular simulations
- Matrix multiplication via arithmetic progressions
- Rank and optimal computation of generic tensors
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- Fast structured matrix computations: tensor rank and Cohn-Umans method
- Gaussian elimination is not optimal
- Tensor Numerical Methods in Quantum Chemistry
- Exploiting Symmetry in Tensors for High Performance: Multiplication with Symmetric Tensors
- Fast algorithms for hierarchically semiseparable matrices
- How Can We Speed Up Matrix Multiplication?
- Basic Linear Algebra Subprograms for Fortran Usage
- Multiplying matrices faster than coppersmith-winograd
- Strassen's Algorithm for Tensor Contraction
- On Jordan Algebras of Linear Transformations
