Q-less QR decomposition in inner product spaces
From MaRDI portal
Publication:5962490
Recommendations
Cites work
- scientific article; zbMATH DE number 3174491 (Why is no real title available?)
- scientific article; zbMATH DE number 2166998 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A projection method and Kronecker product preconditioner for solving Sylvester tensor equations
- A projection method to solve linear systems in tensor format
- Algorithm 844
- Algorithm 862
- Algorithm 941: \texttt{htucker} -- a Matlab toolbox for tensors in hierarchical Tucker format
- Algorithms for Numerical Analysis in High Dimensions
- Computing symmetric rank-revealing decompositions via triangular factorization
- Efficient MATLAB Computations with Sparse and Factored Tensors
- Error Analysis of the Quasi-Gram--Schmidt Algorithm
- Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure
- Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix
- Krylov subspace methods for linear systems with tensor product structure
- Low-rank tensor Krylov subspace methods for parametrized linear systems
- Numerical multilinear algebra and its applications
- On the \(\star\)-Sylvester equation \(AX\pm X^{\star} B^{\star} = C\)
- Tensor Decompositions and Applications
- Tensor spaces and numerical tensor calculus
Cited in
(4)
Describes a project that uses
Uses Software
This page was built for publication: Q-less QR decomposition in inner product spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962490)