An iterative algorithm to solve the generalized Sylvester tensor equations
From MaRDI portal
Publication:5134967
DOI10.1080/03081087.2018.1536732zbMath1453.65084OpenAlexW2898384941WikidataQ114641367 ScholiaQ114641367MaRDI QIDQ5134967
Publication date: 18 November 2020
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2018.1536732
Related Items (23)
Hermitian and skew-Hermitian splitting methods for solving a tensor equation ⋮ The iterative solution of a class of tensor equations via Einstein product with a tensor inequality constraint ⋮ Noise-tolerant continuous-time Zhang neural networks for time-varying Sylvester tensor equations ⋮ On RGI algorithms for solving Sylvester tensor equations ⋮ ITERATIVE ALGORITHMS FOR THE SYMMETRIC AND LEAST-SQUARES SYMMETRIC SOLUTION OF A TENSOR EQUATION ⋮ Paige's algorithm for solving a class of tensor least squares problem ⋮ Tensor product-type methods for solving Sylvester tensor equations ⋮ An efficient iterative method for solving a class of constrained tensor least squares problem ⋮ HOBi-CGSTAB and HOBi-CRSTAB methods for solving some tensor equations ⋮ The least squares solution with the minimal norm to a system of mixed generalized Sylvester reduced biquaternion tensor equations ⋮ A fast and efficient Newton-Shultz-type iterative method for computing inverse and Moore-Penrose inverse of tensors ⋮ Developing iterative algorithms to solve Sylvester tensor equations ⋮ An iterative scheme for identifying the positive semi-definiteness of even-order real symmetric H-tensor ⋮ Numerical study on Moore-Penrose inverse of tensors via Einstein product ⋮ A gradient based iterative method and associated preconditioning technique for solving the large multilinear systems ⋮ Improved finite-time solutions to time-varying Sylvester tensor equation via zeroing neural networks ⋮ Iterative methods for solving Sylvester transpose tensor equation \(\mathcal A\star_N\mathcal X\star_M\mathcal{B}+\mathcal{C}\star_M\mathcal X^T\star_N\mathcal{D}=\mathcal{E} \) ⋮ Projection schemes based on Hessenberg process for Sylvester tensor equation with low-rank right-hand side ⋮ Absolute value equations with tensor product structure: unique solvability and numerical solution. ⋮ Linearizable Eigenvector Nonlinearities ⋮ Tensor Bi-CR Methods for Solutions of High Order Tensor Equation Accompanied by Einstein Product ⋮ A preconditioned tensor splitting iteration method and associated global correction technique for solving multilinear systems ⋮ Preconditioned TBiCOR and TCORS algorithms for solving the Sylvester tensor equation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An \(H\)-tensor based iterative scheme for identifying the positive definiteness of multivariate homogeneous forms
- On the Hermitian positive definite solutions of nonlinear matrix equation \(X^s + \sum_{i = 1}^m A_i^\ast X^{- t_i} A_i = Q\)
- A system of matrix equations and its applications
- \(Z\)-eigenvalue inclusion theorems for tensors
- Criteria for strong \(H\)-tensors
- On computing minimal \(H\)-eigenvalue of sign-structured tensors
- Column sufficient tensors and tensor complementarity problems
- Schur-decomposition for 3D matrix equations and its application in solving radiative discrete ordinates equations discretized by Chebyshev collocation spectral method
- Ranks and the least-norm of the general solution to a system of quaternion matrix equations
- On Hermitian solutions of the split quaternion matrix equation \(AXB+CXD=E\)
- Simultaneous decomposition of quaternion matrices involving \(\eta\)-Hermicity with applications
- Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure
- A canonical form for pencils of matrices with applications to asymptotic linear programs
- An iterative algorithm for the least Frobenius norm least squares solution of a class of generalized coupled Sylvester-transpose linear matrix equations
- A new method for the bisymmetric minimum norm solution of the consistent matrix equations \(A_1XB_1 = C_1\), \(A_2XB_2 = C_2\)
- A projection method and Kronecker product preconditioner for solving Sylvester tensor equations
- Iterative least-squares solutions of coupled sylvester matrix equations
- Solvability conditions and general solution for mixed Sylvester equations
- Moore–Penrose inverse of tensors via Einstein product
- On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations
- Solving Multilinear Systems via Tensor Inversion
- Backward error and perturbation bounds for high order Sylvester tensor equation
- A practical method for computing the largestM-eigenvalue of a fourth-order partially symmetric tensor
- A Hessenberg-Schur method for the problem AX + XB= C
- Hermitian and Nonnegative Definite Solutions of Linear Matrix Equations
- A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test
- A fast algorithm for the spectral radii of weakly reducible nonnegative tensors
- Gradient based iterative algorithms for solving a class of matrix equations
- Further results on generalized inverses of tensors via the Einstein product
- Iterative algorithms for solving some tensor equations
- Methods of conjugate gradients for solving linear systems
This page was built for publication: An iterative algorithm to solve the generalized Sylvester tensor equations
