Tensors in computations

DOI10.1017/S0962492921000076OpenAlexW3169240678WikidataQ114116569 ScholiaQ114116569MaRDI QIDQ5887832

Lek-Heng Lim

Publication date: 14 April 2023

Published in: Acta Numerica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.08090

zbMATH Keywords

numerical analysistensorsresearch exposition

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Multilinear algebra, tensor calculus (15A69) Numerical linear algebra (65F99)

Related Items

Low-rank tensor methods for partial differential equations ⋮ Tensor- and spinor-valued random fields with applications to continuum physics and cosmology ⋮ Minimality of tensors of fixed multilinear rank ⋮ The condition number of singular subspaces, revisited ⋮ Approximate real symmetric tensor rank ⋮ Spectral asymptotics for contracted tensor ensembles ⋮ Numerical stability and tensor nuclear norm ⋮ Improved uniqueness conditions of solution for multilinear pagerank and its application ⋮ A Krylov-Schur-like method for computing the best rank-\((r_1,r_2,r_3)\) approximation of large and sparse tensors

Uses Software

• mctoolbox
• Stony Brook
• MNIST
• nwSpGr
• ImageNet

Cites Work

• Canonical forms for congruence of matrices and \(T\)-palindromic matrix pencils: a tribute to H. W. Turnbull and A. C. Aitken
• Likelihood approximation by numerical integration on sparse grids
• A practical introduction to tensor networks: Matrix product states and projected entangled pair states
• On the computational complexity of membership problems for the completely positive cone and its dual
• Foundations of quantum theory. From classical concepts to operator algebras
• The complexity of computing the permanent
• Symmetric tensor decomposition
• A basis theory primer.
• A proof of the set-theoretic version of the salmon conjecture
• A discrete transform and decompositions of distribution spaces
• A new polynomial-time algorithm for linear programming
• An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
• Kernel methods in machine learning
• Explorations in harmonic analysis. With applications to complex function theory and the Heisenberg group
• Tensor products of Sobolev-Besov spaces and applications to approximation from the hyperbolic cross
• Approximation theory in tensor product spaces
• An application of simultaneous diophantine approximation in combinatorial optimization
• Tensor product of operads and iterated loop spaces
• A characterization of subsystems in physics
• A mathematical condition for a sublattice of a propositional system to represent a physical subsystem, with a physical interpretation
• Relations between exact and approximate bilinear algorithms. Applications
• The symbiotic relationship of combinatorics and matrix theory
• Schatten-von Neumann classes of multilinear forms
• Manifolds, tensor analysis, and applications.
• Multilinear algebra. 2nd ed
• \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
• Constantes de Grothendieck et fonctions de type positif sur les sphères
• \(L^p\) estimates on the bilinear Hilbert transform for \(2<p<\infty\)
• Stable bundles, representation theory and Hermitian operators
• Numerical integration using sparse grids
• On Calderón's conjecture
• On the structure of tensor products of \(\ell_ p\)-spaces
• Pontryagin duality in the theory of topological vector spaces and in topological algebra
• Mathematical problems for the next century
• Multilinear Calderón-Zygmund theory
• Fast structured matrix computations: tensor rank and Cohn-Umans method
• A one round protocol for tripartite Diffie-Hellman
• Hyperdeterminants
• Theorems on multidimensional Laplace transform for solution of boundary value problems
• Separable systems of Stäckel
• On the second eigenvalue of hypergraphs
• A unified approach to polynomially solvable cases of integer ``non-separable quadratic optimization
• Diagonal matrix scaling is NP-hard
• On tensors of border rank \(l\) in \({\mathbb C}^{m\times n\times l}\)
• A brief history of NP-completeness, 1954--2012
• Shiing-Shen Chern: a great geometer of 20th century
• Grothendieck constant is norm of Strassen matrix multiplication tensor
• Non-separable bidimensional wavelet bases
• Generating polynomials and symmetric tensor decompositions
• Finding the homology of submanifolds with high confidence from random samples
• On the analytical separation of variables solution for a class of partial integro-differential equations
• On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients
• Tensor algebras and harmonic analysis
• Gaussian elimination is not optimal
• Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity
• Fast multiplication of large numbers
• Unitäre Transformationen großer Matrizen
• Integer multiplication in time \(O(n\log n)\)
• A Mathematical View of Interior-Point Methods in Convex Optimization
• Discrete decompositions for bilinear operators and almost diagonal conditions
• On the mathematical foundations of learning
• Self-Scaled Barriers for Irreducible Symmetric Cones
• Condition
• Compact bilinear operators and commutators
• Introduction to Smooth Manifolds
• An Algebraic Geometric Approach to Separation of Variables
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• Lost in the tensors: Einstein's struggles with covariance principles 1912–1916
• Modern Computer Arithmetic
• On the geometry of tensor network states
• Numerical Integration in Multiple Dimensions with Designed Quadrature
• Fast wavelet transforms and numerical algorithms I
• New Approach to the Theory of Superexchange Interactions
• The border rank of the multiplication of $2\times 2$ matrices is seven
• Support Vector Machines
• Quantum Computing and Entanglement for Mathematicians
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classical and Multilinear Harmonic Analysis
• The Golden Ticket
• Candidate Multilinear Maps from Ideal Lattices
• The Moment Problem
• On the tensor rank of $3\times 3$ permanent and determinant
• Fermionen, Bosonen, Photonen, Korrelationen und Verschränkung
• Classical Fourier Analysis
• The analytic rank of tensors and its applications
• Solving linear programs in the current matrix multiplication time
• Separation of Variables and Superintegrability
• Tensors: Asymptotic Geometry and Developments 2016–2018
• Tensor Categories
• Graph-Induced Multilinear Maps from Lattices
• Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
• Geometry and Complexity Theory
• Grothendieck’s Theorem, past and present
• Most Tensor Problems Are NP-Hard
• Quantum Computing
• An Introduction to General Relativity and Cosmology
• Calculation of Gauss Quadrature Rules
• On the Minimum Computation Time of Functions
• Tensor Product Bases and Tensor Diagonals
• A Note on Separation of Variables
• Convex separable optimization is not much harder than linear optimization
• The solution of boundary value problems by a double Laplace transformation
• A Theory of Cross-Spaces. (AM-26)
• A logical calculus of the ideas immanent in nervous activity
• Produits tensoriels topologiques et espaces nucléaires
• Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
• General Relativity
• A fast algorithm for particle simulations
• On the hardness of approximating the chromatic number
• Faster Integer Multiplication
• Symmetry, Representations, and Invariants
• Relative bilinear complexity and matrix multiplication.
• Some NP-complete problems in quadratic and nonlinear programming
• Approximate Solutions for the Bilinear Form Computational Problem
• The Spectra of Infinite Hypertrees
• Sums of even powers of real linear forms
• Tensor Geometry
• Stability of a Method for Multiplying Complex Matrices with Three Real Matrix Multiplications
• Characteristic Classes. (AM-76)
• Linearly independent sets of isotropic Cartesian tensors of ranks up to eight
• Ill-Conditioned Eigensystems and the Computation of the Jordan Canonical Form
• The honeycomb model of $GL_n(\mathbb C)$ tensor products I: Proof of the saturation conjecture
• A Brief on Tensor Analysis
• On G _p -Classes of Trilinear Forms
• Radial Basis Functions
• The Cotton tensor in Riemannian spacetimes
• A Multilinear Singular Value Decomposition
• The Invariant Theory of Matrices
• Nuclear norm of higher-order tensors
• Tensor Analysis
• The role of the rigged Hilbert space in quantum mechanics
• Accuracy and Stability of Numerical Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item