A new method for TSVD regularization truncated parameter selection (Q460202): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 5 users not shown) | |||
Property / review text | |||
Summary: The truncated singular value decomposition (TSVD) regularization applied in ill-posed problem is studied. Through mathematical analysis, a new method for truncated parameter selection which is applied in TSVD regularization is proposed. In the new method, all the local optimal truncated parameters are selected first by taking into account the interval estimation of the observation noises; then the optimal truncated parameter is selected from the local optimal ones. While comparing the new method with the traditional generalized cross-validation (GCV) and \(L\) curve methods, a random ill-posed matrices simulation approach is developed in order to make the comparison as statistically meaningful as possible. Simulation experiments have shown that the solutions applied with the new method have the smallest mean square errors, and the computational cost of the new algorithm is the least. | |||
Property / review text: Summary: The truncated singular value decomposition (TSVD) regularization applied in ill-posed problem is studied. Through mathematical analysis, a new method for truncated parameter selection which is applied in TSVD regularization is proposed. In the new method, all the local optimal truncated parameters are selected first by taking into account the interval estimation of the observation noises; then the optimal truncated parameter is selected from the local optimal ones. While comparing the new method with the traditional generalized cross-validation (GCV) and \(L\) curve methods, a random ill-posed matrices simulation approach is developed in order to make the comparison as statistically meaningful as possible. Simulation experiments have shown that the solutions applied with the new method have the smallest mean square errors, and the computational cost of the new algorithm is the least. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65F22 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 35R30 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6354447 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q59023100 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2013/161834 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2064667708 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A mollification regularization method for a fractional-diffusion inverse heat conduction problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reconstruction of initial wave field of a nonsteady-state wave propagation from limited measurements at a specific spatial point based on stochastic inversion / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A determination of an abrupt motion of the sea bottom by using snapshot data of water waves / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5515676 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Accelerated Landweber iterations for the solution of ill-posed equations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ridge Regression: Biased Estimation for Nonorthogonal Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some insights into the regularization of ill-posed problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Augmented Arnoldi-Tikhonov regularization methods for solving large-scale linear ill-posed systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Truncated Singular Value Decomposition Solutions to Discrete Ill-Posed Problems with Ill-Determined Numerical Rank / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Analysis of Discrete Ill-Posed Problems by Means of the L-Curve / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Random simulation and GPS decorrelation. / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 03:22, 9 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A new method for TSVD regularization truncated parameter selection |
scientific article |
Statements
A new method for TSVD regularization truncated parameter selection (English)
0 references
13 October 2014
0 references
Summary: The truncated singular value decomposition (TSVD) regularization applied in ill-posed problem is studied. Through mathematical analysis, a new method for truncated parameter selection which is applied in TSVD regularization is proposed. In the new method, all the local optimal truncated parameters are selected first by taking into account the interval estimation of the observation noises; then the optimal truncated parameter is selected from the local optimal ones. While comparing the new method with the traditional generalized cross-validation (GCV) and \(L\) curve methods, a random ill-posed matrices simulation approach is developed in order to make the comparison as statistically meaningful as possible. Simulation experiments have shown that the solutions applied with the new method have the smallest mean square errors, and the computational cost of the new algorithm is the least.
0 references
0 references
0 references
0 references
0 references