[PDF][PDF] Using model selection criteria for solving discrete ill-posed problems by randomized algorithms
EG Revunova - Proc. 4th International Workshop on Inductive …, 2011 - Citeseer
Proc. 4th International Workshop on Inductive Modelling (IWIM'2011), Kyiv, 2011•Citeseer
An approach to the stable solution of discrete ill-posed problems, based on a combination of
random projection of the initial ill-conditioned matrix with ill-defined numerical rank and
pseudo-inversion of the resulting matrix. To select the dimension of the projection matrix we
propose to use model selection criteria. The results of experimental studies on the well-
known examples of discrete ill-posed problems are given. Solution error is close to the
Tikhonov regularization error, however the matrix dimension reduction due to the projection …
random projection of the initial ill-conditioned matrix with ill-defined numerical rank and
pseudo-inversion of the resulting matrix. To select the dimension of the projection matrix we
propose to use model selection criteria. The results of experimental studies on the well-
known examples of discrete ill-posed problems are given. Solution error is close to the
Tikhonov regularization error, however the matrix dimension reduction due to the projection …
Abstract
An approach to the stable solution of discrete ill-posed problems, based on a combination of random projection of the initial ill-conditioned matrix with ill-defined numerical rank and pseudo-inversion of the resulting matrix. To select the dimension of the projection matrix we propose to use model selection criteria. The results of experimental studies on the well-known examples of discrete ill-posed problems are given. Solution error is close to the Tikhonov regularization error, however the matrix dimension reduction due to the projection provides the possibility to decrease computational costs, especially at high noise levels.
Citeseer
以上显示的是最相近的搜索结果。 查看全部搜索结果