求解Sylvester方程的广义非对称PMHSS算法
发布时间:2018-11-29 08:23
【摘要】:正1引言考虑如下Sylvester方程:AX+XB=F(1)这里A∈C~(m×m),B∈C~(n×n),F∈C~(m×n)是复数矩阵.令A=W+iT,B=U+iV,Q,T∈R~(m×m),U,V∈R~(n×n)都是实对称矩阵,且W,U是不定的,T,V是正定的.我们假定-TW≤T,-VU≤V.对于任意矩阵W和T,WT(W≤T)意味着T-W是
[Abstract]:The introduction of positive 1 considers the following Sylvester equation: AX XB=F (1) where A 鈭,
本文编号:2364482
[Abstract]:The introduction of positive 1 considers the following Sylvester equation: AX XB=F (1) where A 鈭,
本文编号:2364482
本文链接:https://www.wllwen.com/kejilunwen/yysx/2364482.html