FINDING ITERATIVE ALGORITHMS FOR SOLVING GENERALIZED COUPLED SYLVESTER TENSOR EQUATIONS

DOI10.17654/0972555522003OpenAlexW4200240750WikidataQ114049350 ScholiaQ114049350MaRDI QIDQ5074005FDOQ5074005

Author name not available (Why is that?)

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

zbMATH Keywords

gradient based iterative methodgeneralized coupled Sylvester tensor equationshierarchical identification principalmodified gradient based iterative method

Mathematics Subject Classification ID

Numerical methods for matrix equations (65F45)

Cites Work

• Tensor Decompositions and Applications
• Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure
• Parallel iterative methods for sparse linear systems
• Eigenvalues of a real supersymmetric tensor
• Hierarchical least squares identification methods for multivariable systems
• Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
• Preconditioned Hermitian and skew-Hermitian splitting methods for non-Hemitian positive semidefinite 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 Iterative Solutions of General Coupled Matrix Equations
• Gradient based iterative algorithms for solving a class of matrix equations
• On inexact Hermitian and skew-Hermitian splitting methods for non-Hermitian positive definite linear systems
• Schur-decomposition for 3D matrix equations and its application in solving radiative discrete ordinates equations discretized by Chebyshev collocation spectral method
• On the reducibility of centrosymmetric matices - applications in engineering problems
• Solving sparse non-negative tensor equations: algorithms and applications
• Centrosymmetric (Cross-Symmetric) Matrices, Their Basic Properties, Eigenvalues, and Eigenvectors
• Tensor eigenvalues and their applications
• Robust Partial Pole Assignment for Vibrating Systems With Aerodynamic Effects
• A mixed collocation-finite difference method for 3D microscopic heat transport problems
• A gradient based iterative solutions for Sylvester tensor equations
• Numerical Computation for Orthogonal Low-Rank Approximation of Tensors
• Tensor Analysis
• 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
• 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.
• Convergence analysis of an SVD-based algorithm for the best rank-1 tensor approximation
• SVD-Based Algorithms for the Best Rank-1 Approximation of a Symmetric Tensor
• Numerical algorithms for solving discrete Lyapunov tensor equation
• Title not available (Why is that?)

Cited In (4)

• Iterative algorithms for solving some tensor equations
• Tensor product-type methods for solving Sylvester tensor equations
• Title not available (Why is that?)
• Some iterative approaches for Sylvester tensor equations. I: A tensor format of truncated loose simpler GMRES

This page was built for publication: FINDING ITERATIVE ALGORITHMS FOR SOLVING GENERALIZED COUPLED SYLVESTER TENSOR EQUATIONS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5074005)