Numerical stability and tensor nuclear norm
From MaRDI portal
Publication:6153359
DOI10.1007/s00211-023-01377-5arXiv2207.08769MaRDI QIDQ6153359
Publication date: 19 March 2024
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.08769
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the nuclear norm and the singular value decomposition of tensors
- Complex-valued neural networks with multi-valued neurons.
- Stability of fast algorithms for matrix multiplication
- The matrix sign decomposition and its relation to the polar decomposition
- Fast structured matrix computations: tensor rank and Cohn-Umans method
- Gaussian elimination is not optimal
- On multiplication of 2 \(\times\) 2 matrices
- Improving the Numerical Stability of Fast Matrix Multiplication
- The border rank of the multiplication of $2\times 2$ matrices is seven
- Computing the Polar Decomposition—with Applications
- Relative bilinear complexity and matrix multiplication.
- Efficient complex matrix multiplication
- Approximate Solutions for the Bilinear Form Computational Problem
- Stability of a Method for Multiplying Complex Matrices with Three Real Matrix Multiplications
- On Scaling Newton’s Method for Polar Decomposition and the Matrix Sign Function
- Nuclear norm of higher-order tensors
- Accuracy and Stability of Numerical Algorithms
- Discovering faster matrix multiplication algorithms with reinforcement learning
- Geometry and Complexity Theory
- Functions of Matrices
- Tensors in computations
This page was built for publication: Numerical stability and tensor nuclear norm