Solvability of the Sylvester tensor equation
From MaRDI portal
Cites work
- A projection method and Kronecker product preconditioner for solving Sylvester tensor equations
- Backward error and perturbation bounds for high order Sylvester tensor equation
- Block tensor unfoldings
- Block tensors and symmetric embeddings
- Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure
- Iterative solutions of generalized Sylvester quaternion tensor equations
- Krylov subspace methods for linear systems with tensor product structure
- Numerical algorithms for solving discrete Lyapunov tensor equation
- On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations.
- Preconditioned Hermitian and skew-Hermitian splitting methods for non-Hemitian positive semidefinite linear systems
- Schur-decomposition for 3D matrix equations and its application in solving radiative discrete ordinates equations discretized by Chebyshev collocation spectral method
- Tensor Decompositions and Applications
- Tensor form of GPBiCG algorithm for solving the generalized Sylvester quaternion tensor equations
This page was built for publication: Solvability of the Sylvester tensor equation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6839928)