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}$$

Eisa Khosravi Dehdezi

doi:10.1007/s43069-021-00107-7

ScienceGate Book Chapters

JOURNAL ARTICLE

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}$$

Eisa Khosravi Dehdezi

Year: 2021 Journal: Operations Research Forum Vol: 2 (4) Publisher: Springer Nature

DOI: 10.1007/s43069-021-00107-7

Get Full-Text PDF Get Analytical Report

Keywords:

Star (game theory) Transpose Tensor (intrinsic definition) Mathematics Convergence (economics) Combinatorics Mathematical physics Algorithm Mathematical analysis Physics Pure mathematics Quantum mechanics Eigenvalues and eigenvectors

Metrics

Cited By

0.25

FWCI (Field Weighted Citation Impact)

Refs

0.48

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Tensor decomposition and applications

Physical Sciences → Mathematics → Computational Mathematics

Matrix Theory and Algorithms

Physical Sciences → Computer Science → Computational Theory and Mathematics

Advanced Optimization Algorithms Research

Physical Sciences → Mathematics → Numerical Analysis

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}$$

Metrics

Citation History

Topics

Related Documents

The Diophantine equation $$T_l=\mathcal {U}_n -\mathcal {U}_m$$

$$\mathcal {Z}_N \times \mathcal {Z}_M$$ Flavour Symmetry

Several efficient iterative algorithms for solving nonlinear tensor equation $${\mathcal {X}}+{\mathcal {A}}^{T}_N{\mathcal {X}}^{-1}_N{\mathcal {A}}={\mathcal {I}}$$ with Einstein product

Iteration methods for the classical split quaternion tensor equation $$\mathcal {E}_N\mathcal {X}_N\mathcal {F}=\mathcal {D}$$

An inversion-free iterative method to find the optimal approximate solution of the nonlinear tensor equation $${\mathcal {X}}- {\mathcal {B}}_n({\mathcal {X}}^{-1}+{\mathcal {A}})^{-1}_n{\mathcal {B}}^{T}={\mathcal {I}}$$

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}$$

Metrics

Citation History

Topics

Related Documents

The Diophantine equation $$T_l=\mathcal {U}_n -\mathcal {U}_m$$

$$\mathcal {Z}_N \times \mathcal {Z}_M$$ Flavour Symmetry

Several efficient iterative algorithms for solving nonlinear tensor equation $${\mathcal {X}}+{\mathcal {A}}^{T}*_N{\mathcal {X}}^{-1}*_N{\mathcal {A}}={\mathcal {I}}$$ with Einstein product

Iteration methods for the classical split quaternion tensor equation $$\mathcal {E}*_N\mathcal {X}*_N\mathcal {F}=\mathcal {D}$$

An inversion-free iterative method to find the optimal approximate solution of the nonlinear tensor equation $${\mathcal {X}}- {\mathcal {B}}*_n({\mathcal {X}}^{-1}+{\mathcal {A}})^{-1}*_n{\mathcal {B}}^{T}={\mathcal {I}}$$

Several efficient iterative algorithms for solving nonlinear tensor equation $${\mathcal {X}}+{\mathcal {A}}^{T}_N{\mathcal {X}}^{-1}_N{\mathcal {A}}={\mathcal {I}}$$ with Einstein product

Iteration methods for the classical split quaternion tensor equation $$\mathcal {E}_N\mathcal {X}_N\mathcal {F}=\mathcal {D}$$

An inversion-free iterative method to find the optimal approximate solution of the nonlinear tensor equation $${\mathcal {X}}- {\mathcal {B}}_n({\mathcal {X}}^{-1}+{\mathcal {A}})^{-1}_n{\mathcal {B}}^{T}={\mathcal {I}}$$