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

Raziyeh Erfanifar; Masoud Hajarian

doi:10.1007/s40314-024-02602-z

ScienceGate Book Chapters

JOURNAL ARTICLE

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

Raziyeh Erfanifar Masoud Hajarian

Year: 2024 Journal: Computational and Applied Mathematics Vol: 43 (2) Publisher: Springer Science+Business Media

DOI: 10.1007/s40314-024-02602-z

Get Full-Text PDF Get Analytical Report

Keywords:

Tensor product Product (mathematics) Nonlinear system Mathematical physics Physics Einstein Tensor (intrinsic definition) Combinatorics Mathematics Pure mathematics Quantum mechanics Geometry

Metrics

Cited By

3.57

FWCI (Field Weighted Citation Impact)

Refs

0.88

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Tensor decomposition and applications

Physical Sciences → Mathematics → Computational Mathematics

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

Metrics

Citation History

Topics

Related Documents

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

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

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

$${\mathcal M}_{n+1} \ne {\mathcal M}_n$$

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

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

Metrics

Citation History

Topics

Related Documents

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

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

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

$${\mathcal M}_{n+1} \ne {\mathcal M}_n$$

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

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

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

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