矩阵多项式块克罗内克ℓ-化条件的研究
The conditioning of block Kronecker $\ell$-ifications of matrix polynomials
AI总结:
本文研究了块克罗内克伴随形式的ℓ-化条件,证明在适当缩放下,其条件数与原多项式相近,且优于弗罗贝尼乌斯伴随形式。
摘要:
本文研究了块克罗内克伴随形式的ℓ-化条件,证明在适当缩放下,其条件数与原多项式相近,且优于弗罗贝尼乌斯伴随形式。
英文摘要:
A strong $\ell$-ification of a matrix polynomial $P(λ)=\sum A_iλ^i$ of degree $d$ is a matrix polynomial $\mathcal{L}(λ)$ of degree $\ell$ having the same finite and infinite elementary divisors, and the same numbers of left and right minimal indices as $P(λ)$. Strong $\ell$-ifications can be used to transform the polynomial eigenvalue problem associated with $P(λ)$ into an equivalent polynomial eigenvalue problem associated with a larger matrix polynomial $\mathcal{L}(λ)$ of lower degree. Typically $\ell=1$ and, in this case, $\mathcal{L}(λ)$ receives the name of strong linearization. However, there exist some situations, e.g., the preservation of algebraic structures, in which it is more convenient to replace strong linearizations by other low degree matrix polynomials. In this work, we investigate the eigenvalue conditioning of $\ell$-ifications from a family of matrix polynomials recently identified and studied by Dopico, Pérez and Van Dooren, the so-called block Kronecker companion forms. We compare the conditioning of these $\ell$-ifications with that of the matrix polynomial $P(λ)$, and show that they are about as well conditioned as the original polynomial, provided we scale $P(λ)$ so that $\max\{\|A_i\|_2\}=1$, and the quantity $\min\{\|A_0\|_2,\|A_d\|_2\}$ is not too small. Moreover, under the scaling assumption $\max\{\|A_i\|_2\}=1$, we show that any block Kronecker companion form, regardless of its degree or block structure, is about as well-conditioned as the well-known Frobenius companion forms. Our theory is illustrated by numerical examples.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。