FINDING ITERATIVE ALGORITHMS FOR SOLVING GENERALIZED COUPLED SYLVESTER TENSOR EQUATIONS
From MaRDI portal
Publication:5074005
DOI10.17654/0972555522003OpenAlexW4200240750WikidataQ114049350 ScholiaQ114049350MaRDI QIDQ5074005
No author found.
Publication date: 6 May 2022
Published in: JP Journal of Algebra, Number Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.17654/0972555522003
gradient based iterative methodgeneralized coupled Sylvester tensor equationshierarchical identification principalmodified gradient based iterative method
Cites Work
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- A gradient based iterative solutions for Sylvester tensor equations
- 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
- On the reducibility of centrosymmetric matices - applications in engineering problems
- Convergence analysis of an SVD-based algorithm for the best rank-1 tensor approximation
- Tensor eigenvalues and their applications
- Preconditioned Hermitian and skew-Hermitian splitting methods for non-Hemitian positive semidefinite linear systems
- Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure
- On global iterative schemes based on Hessenberg process for (ill-posed) Sylvester tensor equations
- Extending BiCG and BiCR methods to solve the Stein tensor equation
- Numerical algorithms for solving discrete Lyapunov tensor equation
- Solving sparse non-negative tensor equations: algorithms and applications
- A projection method and Kronecker product preconditioner for solving Sylvester tensor equations
- Eigenvalues of a real supersymmetric tensor
- On inexact Hermitian and skew-Hermitian splitting methods for non-Hermitian positive definite linear systems
- Iterative solutions of the generalized Sylvester matrix equations by using the hierarchical identification principle
- Iterative least-squares solutions of coupled sylvester matrix equations
- Global least squares method (Gl-LSQR) for solving general linear systems with several right-hand sides
- On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations
- SVD-Based Algorithms for the Best Rank-1 Approximation of a Symmetric Tensor
- On Iterative Solutions of General Coupled Matrix Equations
- Centrosymmetric (Cross-Symmetric) Matrices, Their Basic Properties, Eigenvalues, and Eigenvectors
- Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
- Numerical Computation for Orthogonal Low-Rank Approximation of Tensors
- Hierarchical least squares identification methods for multivariable systems
- Gradient based iterative algorithms for solving a class of matrix equations
- Robust Partial Pole Assignment for Vibrating Systems With Aerodynamic Effects
- Tensor Analysis
This page was built for publication: FINDING ITERATIVE ALGORITHMS FOR SOLVING GENERALIZED COUPLED SYLVESTER TENSOR EQUATIONS