An iterative algorithm to solve the generalized Sylvester tensor equations (Q5134967)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

An iterative algorithm to solve the generalized Sylvester tensor equations

scientific article; zbMATH DE number 7275244

Language	Label	Description	Also known as
default for all languages	No label defined
English	An iterative algorithm to solve the generalized Sylvester tensor equations	scientific article; zbMATH DE number 7275244

Statements

instance of

scholarly article

0 references

title

An iterative algorithm to solve the generalized Sylvester tensor equations (English)

0 references

published in

Linear and Multilinear Algebra

0 references

publication date

18 November 2020

0 references

zbMATH Keywords

tensor equations

0 references

conjugate gradient least squares algorithm

0 references

Einstein product

0 references

convergence analysis

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/03081087.2018.1536732

0 references

cites work

Gradient based iterative algorithms for solving a class of matrix equations

0 references

Iterative least-squares solutions of coupled sylvester matrix equations

0 references

A Hessenberg-Schur method for the problem AX + XB= C

0 references

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\)

0 references

A new method for the bisymmetric minimum norm solution of the consistent matrix equations \(A_1XB_1 = C_1\), \(A_2XB_2 = C_2\)

0 references

A projection method and Kronecker product preconditioner for solving Sylvester tensor equations

0 references

On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations.

0 references

Backward error and perturbation bounds for high order Sylvester tensor equation

0 references

Moore–Penrose inverse of tensors via Einstein product

0 references

Existence and computation of low Kronecker-rank approximations for large linear systems of tensor product structure

0 references

Schur-decomposition for 3D matrix equations and its application in solving radiative discrete ordinates equations discretized by Chebyshev collocation spectral method

0 references

Further results on generalized inverses of tensors via the Einstein product

0 references

Iterative algorithms for solving some tensor equations

0 references

On Hermitian solutions of the split quaternion matrix equation \(AXB+CXD=E\)

0 references

A fast algorithm for the spectral radii of weakly reducible nonnegative tensors.

0 references

\(Z\)-eigenvalue inclusion theorems for tensors

0 references

Criteria for strong \(H\)-tensors

0 references

An \(H\)-tensor based iterative scheme for identifying the positive definiteness of multivariate homogeneous forms

0 references

A practical method for computing the largest \(M\)-eigenvalue of a fourth-order partially symmetric tensor

0 references

Column sufficient tensors and tensor complementarity problems

0 references

On computing minimal \(H\)-eigenvalue of sign-structured tensors

0 references

A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test.

0 references

Simultaneous decomposition of quaternion matrices involving \(\eta\)-Hermicity with applications

0 references

A canonical form for pencils of matrices with applications to asymptotic linear programs

0 references

Hermitian and Nonnegative Definite Solutions of Linear Matrix Equations

0 references

A system of matrix equations and its applications

0 references

Solvability conditions and general solution for mixed Sylvester equations

0 references

Ranks and the least-norm of the general solution to a system of quaternion matrix equations

0 references

Solving multilinear systems via tensor inversion

0 references

Methods of conjugate gradients for solving linear systems

0 references

An iterative algorithm for the least Frobenius norm least squares solution of a class of generalized coupled Sylvester-transpose linear matrix equations

0 references

Q5820853

0 references

Q4868585

0 references

Identifiers

zbMATH Open document ID

1453.65084

0 references

DOI

10.1080/03081087.2018.1536732

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi An iterative algorithm to solve the generalized Sylvester tensor equations