NDLI: Efficient estimation of regularization parameters via downsampling and the singular value expansion : Downsampling regularization parameter estimation

Please wait, while we are loading the content...

Efficient estimation of regularization parameters via downsampling and the singular value expansion : Downsampling regularization parameter estimation

Interval unions

Sharp mean-square regularity results for SPDEs with fractional noise and optimal convergence rates for the numerical approximations

Linearly implicit BDF methods for nonlinear parabolic interface problems

BIT Numerical Mathematics : Volume 57, Issue 1, March 2017

BIT Numerical Mathematics : Volume 56

BIT Numerical Mathematics : Volume 55

BIT Numerical Mathematics : Volume 54

BIT Numerical Mathematics : Volume 53

BIT Numerical Mathematics : Volume 52

BIT Numerical Mathematics : Volume 51

BIT Numerical Mathematics : Volume 50

BIT Numerical Mathematics : Volume 49

BIT Numerical Mathematics : Volume 48

BIT Numerical Mathematics : Volume 47

BIT Numerical Mathematics : Volume 46

BIT Numerical Mathematics : Volume 45

BIT Numerical Mathematics : Volume 44

BIT Numerical Mathematics : Volume 43

BIT Numerical Mathematics : Volume 42

BIT Numerical Mathematics : Volume 41

BIT Numerical Mathematics : Volume 40

BIT Numerical Mathematics : Volume 39

BIT Numerical Mathematics : Volume 38

BIT Numerical Mathematics : Volume 37

Efficient estimation of regularization parameters via downsampling and the singular value expansion : Downsampling regularization parameter estimation

Content Provider	Springer Nature Link
Author	Wang, Yang Cochran, Douglas Hansen, Jakob Renaut, Rosemary A. Horst, Michael
Copyright Year	2016
Abstract	The solution, $$\varvec{x}$$ , of the linear system of equations $$A\varvec{x}\approx \varvec{b}$$ arising from the discretization of an ill-posed integral equation $$g(s)=\int H(s,t) f(t) \,dt$$ with a square integrable kernel H(s, t) is considered. The Tikhonov regularized solution $$\varvec{x}(\lambda )$$ approximating the Galerkin coefficients of f(t) is found as the minimizer of $$J(\varvec{x})=\{ \Vert A \varvec{x} -\varvec{b}\Vert _2^2 + \lambda ^2 \Vert L \varvec{x}\Vert _2^2\}$$ , where $$\varvec{b}$$ is given by the Galerkin coefficients of g(s). $$\varvec{x}(\lambda )$$ depends on the regularization parameter $$\lambda $$ that trades off between the data fidelity and the smoothing norm determined by L, here assumed to be diagonal and invertible. The Galerkin method provides the relationship between the singular value expansion of the continuous kernel and the singular value decomposition of the discrete system matrix for square integrable kernels. We prove that the kernel maintains square integrability under left and right multiplication by bounded functions and thus the relationship also extends to appropriately weighted kernels. The resulting approximation of the integral equation permits examination of the properties of the regularized solution $$\varvec{x}(\lambda )$$ independent of the sample size of the data. We prove that consistently down sampling both the system matrix and the data provides a small scale system that preserves the dominant terms of the right singular subspace of the system and can then be used to estimate the regularization parameter for the original system. When g(s) is directly measured via its Galerkin coefficients the regularization parameter is preserved across resolutions. For measurements of g(s) a scaling argument is required to move across resolutions of the systems when the regularization parameter is found using a regularization parameter estimation technique that depends on the knowledge of the variance in the data. Numerical results illustrate the theory and demonstrate the practicality of the approach for regularization parameter estimation using generalized cross validation, unbiased predictive risk estimation and the discrepancy principle applied to both the system of equations, and to the regularized system of equations.
Ending Page	529
Page Count	31
Starting Page	499
File Format	PDF
ISSN	00063835
e-ISSN	15729125
Journal	BIT Numerical Mathematics
Issue Number	2
Volume Number	57
Language	English
Publisher	Springer Netherlands
Publisher Date	2016-11-19
Publisher Place	Dordrecht
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Singular value expansion Computational Mathematics and Numerical Analysis Numeric Computing Regularization parameter estimation Mathematics Fredholm integral equations Tikhonov regularization Ill-posedness, regularization Ill-posed inverse problem Singular value decomposition
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Computer Networks and Communications Computational Mathematics Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Tikhonov regularization via flexible Arnoldi reduction

A Framework for Regularization via Operator Approximation

Estimation of the Regularization Parameter in Linear Discrete Ill-Posed Problems Using the Picard Parameter

A new framework for multi-parameter regularization

A new Tikhonov regularization method

Quadrature based collocation methods for integral equations of the first kind

Optimal a Posteriori Parameter Choice for Tikhonov Regularization for Solving Nonlinear Ill-Posed Problems

Projected nonstationary iterated Tikhonov regularization

Data based regularization for discrete deconvolution problems

Efficient estimation of regularization parameters via downsampling and the singular value expansion : Downsampling regularization parameter estimation

Similar Documents

Tikhonov regularization via flexible Arnoldi reduction

A Framework for Regularization via Operator Approximation

Estimation of the Regularization Parameter in Linear Discrete Ill-Posed Problems Using the Picard Parameter

A new framework for multi-parameter regularization

A new Tikhonov regularization method

Quadrature based collocation methods for integral equations of the first kind

Optimal a Posteriori Parameter Choice for Tikhonov Regularization for Solving Nonlinear Ill-Posed Problems

Projected nonstationary iterated Tikhonov regularization

Data based regularization for discrete deconvolution problems

Efficient estimation of regularization parameters via downsampling and the singular value expansion : Downsampling regularization parameter estimation