Fast bilinear algorithms for symmetric tensor contractions (Q2246165): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: LAPACK / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Q-Chem / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1515/cmam-2019-0075 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3005004229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Jordan Algebras of Linear Transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strassen's Algorithm for Tensor Contraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor Numerical Methods in Quantum Chemistry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor numerical methods in scientific computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor Decompositions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Basic Linear Algebra Subprograms for Fortran Usage / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical introduction to tensor networks: Matrix product states and projected entangled pair states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor-Train Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Can We Speed Up Matrix Multiplication? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting Symmetry in Tensors for High Performance: Multiplication with Symmetric Tensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian elimination is not optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank and optimal computation of generic tensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: \texttt{NWChem}: a comprehensive and scalable open-source solution for large scale molecular simulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplying matrices faster than coppersmith-winograd / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for hierarchically semiseparable matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast structured matrix computations: tensor rank and Cohn-Umans method / rank
 
Normal rank

Latest revision as of 05:24, 27 July 2024

scientific article
Language Label Description Also known as
English
Fast bilinear algorithms for symmetric tensor contractions
scientific article

    Statements

    Fast bilinear algorithms for symmetric tensor contractions (English)
    0 references
    0 references
    0 references
    16 November 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    tensor contractions
    0 references
    symmetric matrices
    0 references
    symmetric tensors
    0 references
    bilinear complexity
    0 references
    0 references
    0 references
    0 references
    0 references