Further Development of the New Version of a Posteriori Choosing Regularization Parameter in Ill-Posed Problems
V. S. Sizikov
Abstract
V. S. Sizikov
Abstract
Further development of the new version of a posteriori choosing (NVAC) the regularization parameter in the Tikhonov regularization method is performed. Refined lemmas and theorems on the error and the convergence rate of the regularized solution using its sourcewise representability are proved. A numerical example is given.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Further development of the new version of a posteriori choosing (NVAC) the regularization parameter in the Tikhonov regularization method is performed. Refined lemmas and theorems on the error and the convergence rate of the regularized solution using its sourcewise representability are proved. A numerical example is given.
Key concepts: Tikhonov regularization, Backus–Gilbert method, Regularization (linguistics), A priori and a posteriori, Regularization perspectives on support vector machines, Well-posed problem, Mathematics, Rate of convergence