FINITE ITERATIVE ALGORITHM FOR THE COMPLEX GENERALIZED SYLVESTER TENSOR EQUATIONS
From MaRDI portal
Publication:5858026
DOI10.11948/20190178OpenAlexW3022487170MaRDI QIDQ5858026
Publication date: 9 April 2021
Published in: Journal of Applied Analysis & Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.11948/20190178
Related Items (1)
Uses Software
Cites Work
- Tensor Decompositions and Applications
- Finite iterative algorithms for extended Sylvester-conjugate matrix equations
- A gradient based iterative solutions for Sylvester tensor equations
- Viscoelastic flow in an undulating tube using spectral methods
- Schur-decomposition for 3D matrix equations and its application in solving radiative discrete ordinates equations discretized by Chebyshev collocation spectral method
- A mixed collocation-finite difference method for 3D microscopic heat transport problems
- Alternating direction method for generalized Sylvester matrix equation \(AXB + CYD = E\)
- Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure
- A preconditioned nested splitting conjugate gradient iterative method for the large sparse generalized Sylvester equation
- A projection method and Kronecker product preconditioner for solving Sylvester tensor equations
- On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations
- Krylov Subspace Methods for Linear Systems with Tensor Product Structure
- On Iterative Solutions of General Coupled Matrix Equations
- A Hessenberg-Schur method for the problem AX + XB= C
- A projection method to solve linear systems in tensor format
This page was built for publication: FINITE ITERATIVE ALGORITHM FOR THE COMPLEX GENERALIZED SYLVESTER TENSOR EQUATIONS
