Tikhonov regularisation can pull the solution towards a prior guess instead of…
PHYSICS · Multi-part · Fermi University Physics · Mathematical Methods for Physics · Numerical and computational mathematics · Numerical and computational mathematics
Error, Chance and the Machine, Ch Linear systems, least squares and the singular value decomposition
Problem
Tikhonov regularisation can pull the solution towards a prior guess x0 instead of towards zero, by minimising J(x)=∥Ax−b∥2+λ2∥x−x0∥2, for a chosen regularisation parameter λ>0, where A is an m×n matrix (m≥n) of full column rank with singular value decomposition A=UΣVT: U has orthonormal columns u1,…,un, V is n×n orthogonal with columns v1,…,vn, and Σ=diag(σ1,…,σn) with σ1≥⋯≥σn>0.
((a)) Show that the minimiser xλ of J satisfies (ATA+λ21)x=ATb+λ2x0, and that its components along the vi are viTxλ=fiσiuiTb+(1−fi)viTx0,fi=σi2+λ2σi2.
((b)) State the limits of viTxλ for σi≫λ and for σi≪λ, say what the regularisation now does to a component the data cannot determine, and check that x0=0 returns the chapter's filtered sum.
((c)) An inverse problem retains three singular components with σ1=1.00, σ2=0.0500, σ3=1.00×10−4, measured data coefficients uiTb=0.500, 0.0100, 3.00×10−6 and prior components viTx0=0.400, 0.300, 0.150. For λ=2.00×10−3, compute f1,f2,f3 and the three components viTxλ to three significant figures.