On Pre-Conditioning of Matrices
On Pre-Conditioning of Matrices
复制标题
关于矩阵的预处理
DOI:
--
复制
发表时间:
1960
期刊:
影响因子:
--
通讯作者:
E. E. Osborne
中科院分区:
文献类型:
--
作者:
E. E. Osborne
Some of the difficulties encountered in the problem of obtaining the elgenvalues and eigenvectors of a matrix appear to be due to the fact tha t its eigenvalues are small compared to its norm. Examples provided in section 3 tend to verify this statement. In section 2 the possibility of applying norm-reducing similarity transformations to A is briefly considered, leading to a decision to restrict the transforming matrices to being diagonal. To justify this, examples are given in section 3. These indicate tha t floating-point matrix computations involving the selection of pivotal elements and the formation of inner products may be benefited. Such transformations by diagonal matrices also provide a means for scaling a matrix for fixed-point computations. In section 4, an iterative process is presented and its convergence is proved. In what follows, let A be an n th order matrix with complex elements and with eigenvalues h~(A) (i = 1, 2, . . , n) . The symbol II x II is used to denote the Euclidean norm