pith. sign in

arxiv: 1210.5731 · v1 · pith:5VGFRVBBnew · submitted 2012-10-21 · 🧮 math.NA · cs.NA

On the top-Stein equation X=AX^top B+C

classification 🧮 math.NA cs.NA
keywords equationsteinconditionspartalgorithmanalyzecdotconsider
0
0 comments X
read the original abstract

We consider the $\top$-Stein equation $X = AX^\top B + C$, where the operator $(\cdot)^\top$ denotes the transpose ($\top$) of a matrix. In the first part of this paper, we analyze necessary and sufficient conditions for the existence and uniqueness of the solution $X$. In the second part, a numerical algorithm for solving $\top$-Stein equation is given under the solvability conditions.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.