【24h】

On Perturbation bounds for HR decomposition

机译:人力资源分解的扰动范围

获取原文

摘要

In [1], Bunser-Gerstner showed that almost every complex square matrix A cart be decomposed into a product of a so-called pseudo-Hermitian matrix H and an upper triangular matrix:A=HR and gave the necessary conditions for the existence and the uniqueness of HR decomposition. Let J = diag(±1 ) be a signature matrix. Let A be the set of those matrices A for which the leading principal minors of A* J A have the same signs as the corresponding minors of J, R. Bhatia in [2] showed that for any A∈A has a decomposition A= HR,where R is the upper triangular matrices whose diagonal entries are all positive, H satisfies H*JH = J.Let A and A = A + E have the decomposition A = HR and A=HR, R. Bhatia [2] obtained ‖(H)-H‖F≤√(2cond(H)‖R-1 ‖‖(A)-A‖F, (1)‖( R )-R‖F≤(2)cond ( R ) ‖H-1‖‖(A)-A‖F. (2)Where cond(X) =‖1X‖‖X-1‖,‖X‖is the spectral norm, ‖X‖F is the Frobenius norm. Adopting the technique used in [3,4], in this paper we first establish some new first-order bounds of the HR decomposition for A +tG = H(t)R(t), [t]≤ε if ε is small enough that the leading principal minors of (A + tG)T J(A + tG) have the same signs as the corresponding minors of J, and get H(O) = GR-1- H R(O)R-1, (3)R(0) = Jup(R-1 GT JH + Hr jGR-1)R. (4)In particular, when △A = εG, A +△A has the decomposition A +△A = (H + △H)(R + △R) with △H = εH(0) + O(ε2), △R =εk(0) + 0(ε2).Using the row scaling on the perturbation analysis for the sensitivity of R , the more tighter bound than(2) we obtain is‖R(O)‖F/‖R‖F≤KR(A) ‖G‖F/‖H‖F (5)where KR(A)≡inf D∈Dn KR(A,D)≡inf D∈Dn 1+ξ2 K2(D-1 R) ,D =diag(δ1,δ2,…,δn) ~ l) the set of all n×n real positive definitive diagonal matrices and δD - max δj/δi,δi> 0. And ‖H(0)‖F/‖H‖F ≤KH(A)‖G‖F/‖H‖F (6)is also more tighter than (1) for the sensitivity of H. Where K H(A) ≡inf KH(A,D)≡inf 1+δD2 K2(HD-1) ‖R-1‖‖2‖G‖2.The condition estimates for the HR decomposition can also be derived by (5) and (6).
机译:在[1]中,Bunser-Gerstner显示,几乎每个复杂的方形矩阵都被分解成所谓的伪麦克马特矩阵H和上三角矩阵:A = HR并为存在和提供了必要的条件人力资源分解的唯一性。让J = Diag(±1)是签名矩阵。让A的集合A * JA的领先主机具有与J,R.BHATIA的相应成本相同的符号,[2]显示,对于任何A,A1A具有分解A = HR其中R是对角线条目均为正的上三角矩阵,H满足H * JH = J.Let A和A = A + E具有分解A = HR和A = HR,R.BHATIA [2]获得‖ (H)-H‖F≤√(2公吨(H)‖R-1‖‖(a)-a‖f,(1)‖(r)-r‖f≤(2)cond(r)‖ 1‖‖(a)-a‖f。(2)其中cond(x)=‖1x‖‖x-1‖,‖x‖is光谱规范,‖x‖f是Frobenius规范。采用使用的技术在[3,4]中,在本文中,我们首先建立一些新的一阶界限为+ Tg = h(t)r(t),[t]≤ε,如果ε足够小,则导致(A + TG)TJ(A + TG)的主机具有与J的相应成本相同的迹象,并获得H(O)= GR-1-HR(O)R-1,(3)R(0 )= JUP(R-1 GT JH + HR JGR-1)R.(4)特别是当△A=εg时,A +△A具有分解A +△A=(H +△H)(R + △r)与△h= εh(0)+ o(ε2),△r=εk(0)+ 0(ε2)。在扰动分析上的行缩放r,r的敏感性分析,比(2)更严格地缩窄,我们获得了is‖r (o)‖f/‖r‖f≤kr(a)‖g‖f/‖h‖f(5)其中kr(a)≡infd∈dnkr(a,d)≡infdədn1+ ξ2k2(d-1 r),d = diag(Δ1,Δ2,...,Δn)〜l)所有n×n真正正则对角线矩阵的集合和Δd - maxΔj/Δi,Δi> 0.和‖ H(0)‖F/‖H‖F≤kh(a)‖g‖f/‖h‖f(6)也比(1)更紧密,对于H的敏感性。其中Kh(a)≡infkh (a,d)≡≡≡= +Δd2k2(HD-1)‖R-1‖‖2‖g‖2。HR分解的条件估计也可以通过(5)和(6)来源。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号