Higher Order Regularization & Error Bounds in Inverse Theory: Tikhonov & Iterative Methods, Study notes of Mathematics

A lecture note from a seminar in mathematics class at the university of california, berkeley, taught by thomas shores. The notes cover the topics of tikhonov regularization and iterative methods in the context of inverse theory. Specifically, the notes focus on higher order tikhonov regularization, the tgsvd and gcv methods, and error bounds. The document also includes examples and instructions for recovering the slowness function from a given function.

Typology: Study notes

Pre 2010

Uploaded on 08/31/2009

koofers-user-h6w
koofers-user-h6w 🇺🇸

9 documents

1 / 45

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Chapter 5: Tikhonov Regularization
Chapter 6: Iterative Methods A Brief Discussion
Math 4/896: Seminar in Mathematics
Topic: Inverse Theory
Instructor: Thomas Shores
Department of Mathematics
Lecture 22, April 4, 2006
AvH 10
Instructor: Thomas Shores Department of Mathematics Math 4/896: Seminar in Mathematics Topic: Inverse Theory
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22
pf23
pf24
pf25
pf26
pf27
pf28
pf29
pf2a
pf2b
pf2c
pf2d

Partial preview of the text

Download Higher Order Regularization & Error Bounds in Inverse Theory: Tikhonov & Iterative Methods and more Study notes Mathematics in PDF only on Docsity!

Chapter 5: Tikhonov Regularization Chapter 6: Iterative Methods  A Brief Discussion

Math 4/896: Seminar in Mathematics

Topic: Inverse Theory

Instructor: Thomas Shores Department of Mathematics

Lecture 22, April 4, 2006 AvH 10

Chapter 5: Tikhonov Regularization Chapter 6: Iterative Methods  A Brief Discussion Error Bounds

Outline

Chapter 5: Tikhonov Regularization Chapter 6: Iterative Methods  A Brief Discussion Error Bounds

Higher Order Regularization

Basic Idea We can think of the regularization term α^2 ‖m‖^22 as favoring minimizing the 0-th order derivative of a function m (x) under the hood. Alternatives: Minimize a matrix approximation to m′^ (x). This is a rst order method. Minimize a matrix approximation to m′′^ (x). This is a second order method. These lead to new minimization problems: to minimize

‖G m − d‖^22 + α^2 ‖Lm‖^22.

How do we resolve this problem as we did with L = I?

Chapter 5: Tikhonov Regularization Chapter 6: Iterative Methods  A Brief Discussion Error Bounds

Higher Order Regularization

Basic Idea We can think of the regularization term α^2 ‖m‖^22 as favoring minimizing the 0-th order derivative of a function m (x) under the hood. Alternatives: Minimize a matrix approximation to m′^ (x). This is a rst order method. Minimize a matrix approximation to m′′^ (x). This is a second order method. These lead to new minimization problems: to minimize

‖G m − d‖^22 + α^2 ‖Lm‖^22.

How do we resolve this problem as we did with L = I?

Chapter 5: Tikhonov Regularization Chapter 6: Iterative Methods  A Brief Discussion Error Bounds

Higher Order Regularization

Basic Idea We can think of the regularization term α^2 ‖m‖^22 as favoring minimizing the 0-th order derivative of a function m (x) under the hood. Alternatives: Minimize a matrix approximation to m′^ (x). This is a rst order method. Minimize a matrix approximation to m′′^ (x). This is a second order method. These lead to new minimization problems: to minimize

‖G m − d‖^22 + α^2 ‖Lm‖^22.

How do we resolve this problem as we did with L = I?

Example Matrices

We will explore approximations to rst and second derivatives at the board.

Application to Higher Order Regularization

The minimization problem is equivalent to the problem ( G T^ G + α^2 LT^ L

m = G T^ d

which has solution forms

mα,L =

∑^ p

j= 1

γ j^2 γ^2 j + α^2

UTj d

λj

Xj +

∑^ n

j=p+ 1

UTj d

Xj

Filter factors: fj =

γ j^2 γ^2 j + α^2

, j = 1 ,... , p, fj = 1 , j = p + 1 ,... , n.

Thus

mα,L =

∑^ n

j= 1

fj

UTj d

λj

Xj.

Chapter 5: Tikhonov Regularization Chapter 6: Iterative Methods  A Brief Discussion Error Bounds

Vertical Seismic Proling Example

The Experiment: Place sensors at vertical depths zj , j = 1 ,... , n, in a borehole, then: Generate a seizmic wave at ground level, t = 0. Measure arrival times dj = t (zj ), j = 1 ,... , n. Now try to recover the slowness function s (z), given

t (z) =

∫ (^) z

0

s (ξ) d ξ =

0

s (ξ) H (z − ξ) d ξ

It should be easy: s (z) = t′^ (z). Hmmm.....or is it?

Do Example 4-5 from the CD.

Chapter 5: Tikhonov Regularization Chapter 6: Iterative Methods  A Brief Discussion Error Bounds

Vertical Seismic Proling Example

The Experiment: Place sensors at vertical depths zj , j = 1 ,... , n, in a borehole, then: Generate a seizmic wave at ground level, t = 0. Measure arrival times dj = t (zj ), j = 1 ,... , n. Now try to recover the slowness function s (z), given

t (z) =

∫ (^) z

0

s (ξ) d ξ =

0

s (ξ) H (z − ξ) d ξ

It should be easy: s (z) = t′^ (z). Hmmm.....or is it?

Do Example 4-5 from the CD.

Chapter 5: Tikhonov Regularization Chapter 6: Iterative Methods  A Brief Discussion Error Bounds

Vertical Seismic Proling Example

The Experiment: Place sensors at vertical depths zj , j = 1 ,... , n, in a borehole, then: Generate a seizmic wave at ground level, t = 0. Measure arrival times dj = t (zj ), j = 1 ,... , n. Now try to recover the slowness function s (z), given

t (z) =

∫ (^) z

0

s (ξ) d ξ =

0

s (ξ) H (z − ξ) d ξ

It should be easy: s (z) = t′^ (z). Hmmm.....or is it?

Do Example 4-5 from the CD.

Chapter 5: Tikhonov Regularization Chapter 6: Iterative Methods  A Brief Discussion Error Bounds

Vertical Seismic Proling Example

The Experiment: Place sensors at vertical depths zj , j = 1 ,... , n, in a borehole, then: Generate a seizmic wave at ground level, t = 0. Measure arrival times dj = t (zj ), j = 1 ,... , n. Now try to recover the slowness function s (z), given

t (z) =

∫ (^) z

0

s (ξ) d ξ =

0

s (ξ) H (z − ξ) d ξ

It should be easy: s (z) = t′^ (z). Hmmm.....or is it?

Do Example 4-5 from the CD.

Chapter 5: Tikhonov Regularization Chapter 6: Iterative Methods  A Brief Discussion Error Bounds

Model Resolution

Model Resolution Matrix: As usual, Rm,α,L = G \G. Comment 1. Comment 2. Comment 3.

Chapter 5: Tikhonov Regularization Chapter 6: Iterative Methods  A Brief Discussion Error Bounds

Model Resolution

Model Resolution Matrix: As usual, Rm,α,L = G \G. Comment 1. Comment 2. Comment 3.

Chapter 5: Tikhonov Regularization Chapter 6: Iterative Methods  A Brief Discussion Error Bounds

Model Resolution

Model Resolution Matrix: As usual, Rm,α,L = G \G. Comment 1. Comment 2. Comment 3.