Q-less QR decomposition in inner product spaces
DOI10.1016/j.laa.2015.08.035zbMath1391.65102OpenAlexW1733387414MaRDI QIDQ5962490
No author found.
Publication date: 12 February 2016
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2015.08.035
tensortruncationGram-Schmidt orthogonalizationlinear equationKronecker productQR decompositionmultilinear algebracolumn pivotinglarge-scale problemlow-rank representation
Vector and tensor algebra, theory of invariants (15A72) Matrix equations and identities (15A24) Iterative numerical methods for linear systems (65F10) Algebraic systems of matrices (15A30) Multilinear algebra, tensor calculus (15A69) Orthogonalization in numerical linear algebra (65F25)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- On the \(\star\)-Sylvester equation \(AX\pm X^{\star} B^{\star} = C\)
- Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix
- Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure
- A projection method and Kronecker product preconditioner for solving Sylvester tensor equations
- Numerical multilinear algebra and its applications
- Computing Symmetric Rank-Revealing Decompositions via Triangular Factorization
- Krylov Subspace Methods for Linear Systems with Tensor Product Structure
- Tensor Spaces and Numerical Tensor Calculus
- Low-Rank Tensor Krylov Subspace Methods for Parametrized Linear Systems
- Algorithm 862
- Efficient MATLAB Computations with Sparse and Factored Tensors
- Algorithm 941
- A projection method to solve linear systems in tensor format
- Algorithm 844
- Error Analysis of the Quasi-Gram--Schmidt Algorithm
- Algorithms for Numerical Analysis in High Dimensions
This page was built for publication: Q-less QR decomposition in inner product spaces
