Another Example: the Hubble Space Telescope

Size: px
Start display at page:

Download "Another Example: the Hubble Space Telescope"

Transcription

1 296 DIP Chapter and 2: Introduction and Integral Equations Motivation: Why Inverse Problems? A large-scale example, coming from a collaboration with Università degli Studi di Napoli Federico II in Naples. From measurements of the magnetic field above Vesuvius, we determine the activity inside the volcano. Measurements on the surface Reconstruction inside the volcano 296 DIP Chapter and 2: Introduction and Integral Equations 2 Another Example: the Hubble Space Telescope For several years, the HST produced blurred images.

2 296 DIP Chapter and 2: Introduction and Integral Equations 3 Inverse Problems... typically arise when one wants to compute information about some interior properties using exterior measurements. Inverse Problem One of these is known Input System Known but with errors Output 296 DIP Chapter and 2: Introduction and Integral Equations 4 Inverse Problems: Examples A quite generic formulation: input system dω = output Ω Image restoration scenery lens image Tomography X-ray source object damping Seismology seismic wave layers reflections

3 296 DIP Chapter and 2: Introduction and Integral Equations 5 Discrete Ill-Posed Problems Our generic ill-posed problem: A Fredholm integral equation of the first kind K(s, t) f dt = g(s), s. Definition of a discrete ill-posed problem (DIP):. a square or over-determined system of linear algebraic equations A x = b or min x A x b 2 2. whose coefficient matrix A has a huge condition number, and 3. comes from the discretization of an inverse/ill-posed problem. 296 DIP Chapter and 2: Introduction and Integral Equations 6 Computational Issues The plots below show solutions x to the DIP A x = b..5 x 6 Gaussian elimination 2.5 Truncated SVD TSVD solution Exact solution Standard numerical methods (x = A\b) produce useless results. Specialized methods (this course) produce reasonable results.

4 296 DIP Chapter and 2: Introduction and Integral Equations 7 The Mechanisms of Ill-Conditioned Problems Consider a linear system with coefficient matrix and right-hand side ( ). A =.7., b =.25 = A There is no vector x such that A x = b. The least squares solution, which solves the problem is given by x LS = ( ) min x A x b 2, A x LS b 2 =.22. Far from exact solution (, ) T yet the residual is small. 296 DIP Chapter and 2: Introduction and Integral Equations 8 Other Solutions with Small Residual Two other solutions with a small residual are ( ).65 x = A x b 2 =.3 ( ) x = A x b 2 = All the solutions x LS, x and x have small residuals, yet they are far from the exact solution! The matrix A is ill conditioned. Small perturbations of the data (here: b) can lead to large perturbations of the solution. A small residual does not imply a good solution. (All this is well known stuff from matrix computations.)

5 296 DIP Chapter and 2: Introduction and Integral Equations 9 Stabilization! It turns out that we can modify the problem such that the solution is more stable, i.e., less sensitive to perturbations. Example: enforce an upper bound on the solution norm x 2 : min x A x b 2 subject to x 2 δ. The solution x δ depends in a nonlinear way on δ: ( ) ( ).8.84 x. =, x =.5.54 ( ) ( ) x.385 =, x = By supplying the correct additional information we can compute a good approximate solution DIP Chapter and 2: Introduction and Integral Equations Inverse Problems Ill-Conditioned Problems Whenever we solve an inverse problem on a computer, we face difficulties because the computational problems are ill conditioned. The purpose of my lectures are:. To explain why ill-conditioned computations always arise when solving inverse problems. 2. To explain the fundamental mechanisms underlying the ill conditioning. 3. To explain how we can modify the problem in order to stabilize the solution. 4. To show how this can be done efficiently on a computer. Regularization methods is at the heart of all this.

6 296 DIP Chapter and 2: Introduction and Integral Equations Inverse Problems are Ill-Posed Problems Hadamard s definition of a well-posed problem (early 2th century):. the problem must have a solution, 2. the solution must be unique, and 3. it must depend continuously on data and parameters. If the problem violates any of these requirements, it is ill posed. Condition can be fixed by reformulating/redefining the solution. Condition 2 can be fixed by additional requirements to the solution, e.g., that of minimum norm. Condition 3 is harder to fix because it implies that arbitrarily small perturbations of data and parameters can produce arbitrarily large perturbations of the solution. 296 DIP Chapter and 2: Introduction and Integral Equations 2 Model Problem: Gravity Surveying Unknown mass density distribution f at depth d below surface, from to on t axis. Measurements of vertical component of gravitational field g(s) at surface, from to on the s axis. g(s) s d f t θ

7 296 DIP Chapter and 2: Introduction and Integral Equations 3 Setting Up the Integral Equation The value of g(s) due to the part dt on the t axis dg = sin θ r 2 f dt, where r = d 2 + (s t) 2. Using that sin θ = d/r, we get sin θ r 2 f dt = d f dt. (d 2 + (s t) 2 ) 3/2 The total value of g(s) for s is therefore g(s) = This is the forward problem. d f dt. (d 2 + (s t) 2 ) 3/2 296 DIP Chapter and 2: Introduction and Integral Equations 4 Our Integral Equation Fredholm integral equation of the first kind: d f dt = g(s), s. (d 2 + (s t) 2 ) 3/2 The kernel K, which represents the model, is K(s, t) = h(s t) = d (d 2 + (s t) 2 ) 3/2, and the right-hand side g is what we are able to measure. From K and g we want to compute f, i.e., an inverse problem.

8 296 DIP Chapter and 2: Introduction and Integral Equations 5 Numerical Examples f g(s) 2 d =.25 d =.5 d = Observations: The signal/ data g(s) is a smoothed version of the source f. The deeper the source, the weaker the signal. The discontinuity in f is not visible in g(s). 296 DIP Chapter and 2: Introduction and Integral Equations 6 Fredholm Integral Equations of the First Kind Our generic inverse problem: K(s, t) f dt = g(s), s. Here, the kernel K(s, t) and the right-hand side g(s) are known functions, while f is the unknown function. In multiple dimensions, this equation takes the form Ω t K(s, t) f dt = g(s), s Ω s. An important special case: K(s, t) = h(s t) deconvolution: h(s t) f dt = g(s), s (and similarly in more dimensions).

9 296 DIP Chapter and 2: Introduction and Integral Equations 7 Another Example: -D Image Restoration Kernel K: point spread function for an infinitely long slit of width one wavelength. Independent variables t and s are the angles of the incoming and scattered light. 4 2 Regularization Tools: shaw Surface plot of A; D image reconstruction ( ) 2 K(s, t) = (cos(s) + cos) 2 sin(u) u π/2 π/2 u = π (sin(s) + sin) K(s, t) f dt = g(s), π/2 s π/2 296 DIP Chapter and 2: Introduction and Integral Equations 8 Yet Another Example: Second Derivative Plot of K(s,t) second derivate problem Kernel K: Green s function for the second derivative s(t ), s < t K(s, t) = t(s ), s t s t Regularization Tools: deriv2. Not differentiable across the line t = s. K(s, t) f dt = g(s), s Solution: f = g, t.

10 296 DIP Chapter and 2: Introduction and Integral Equations 9 The Riemann-Lebesgue Lemma Consider the function f = sin(2πp t), p =, 2,... then for p and arbitrary K we have g(s) = K(s, t) f dt. Smoothing: high frequencies are damped in the mapping f g. Hence, the mapping from g to f must amplify the high frequencies. Therefore we can expect difficulties when trying to reconstruct f from noisy data g. 296 DIP Chapter and 2: Introduction and Integral Equations 2 Illustration of the Riemann-Lebesgue Lemma Gravity problem with f = sin(2πp t), p =, 2, 4, and 8. f p g p (s) p = p = 2 p = 4 p = 8.5 Higher frequencies are dampen more than low frequencies.

11 296 DIP Chapter and 2: Introduction and Integral Equations 2 Difficulties with High Frequencies In this example δg(s) = K(s, t) δf dt and δg 2 =.. δf p δg p (s), δg p 2 = p = p = 2 p = 4 p = 8.5 Higher frequencies are amplified more in the reconstruction process. 296 DIP Chapter and 2: Introduction and Integral Equations 22 Why do We Care? Why bother about these (strange) issues? Ill-posed problems model a variety of real applications: Medical imaging (brain scanning, etc.) Geophysical prospecting (search for oil, land-mines, etc.) Image deblurring (astronomy, CSI a, etc.) Deconvolution of instrument s response. We can only hope to compute useful solutions to these problems if we fully understand their inherent difficulties... and how these difficulties carry over to the discretized problems involved in a computer solution, and how to deal with them in a satisfactory way. a Crime Scene Investigation.

12 296 DIP Chapter and 2: Introduction and Integral Equations 23 Some Important Questions How to discretize the inverse problem; here, the integral equation? Why is the matrix in the discretized problem always so ill conditioned? Why can we still compute an approximate solution? How can we compute it stably and efficiently? Is additional information available? How can we incorporate it in the solution scheme? How should we implement the numerical scheme? How do we solve large-scale problems? 296 DIP Chapter and 2: Introduction and Integral Equations 24 The Singular Value Expansion (SVE) For any square integrable kernel K holds K(s, t) = µ i u i (s) v i, i= where u i, u j = v i, v j = δ ij, and µ µ 2 µ The fundamental relation and the expansions f = K(s, t) v i dt = µ i u i (s), i =, 2,... v i, f v i and g(s) = i= lead to the expression for the solution: u i, g f = v i. µ i i= u i, g u i (s) i=

13 296 DIP Chapter and 2: Introduction and Integral Equations 25 The Singular Values Ordering Norm of kernel Hence, K 2 µ µ 2 µ 3. K(s, t) 2 ds dt = µ i = O(i q ), q > /2 i.e., the µ i decay faster than i /2. We have: µ 2 i. If the derivatives of order,..., q exist and are continuous, then µ i is approximately O(i q /2 ). i= Second derivative: µ i i 2 ( moderately ill posed ). -D image reconstruction: µ i e 2i ( severely ill posed ). 296 DIP Chapter and 2: Introduction and Integral Equations 26 Example of SVE (Degenerate) We can occasionally calculate the SVE analytically. Example (s + 2t) f dt = g(s), s. For this kernel K(s, t) = s + 2t we have µ = µ 2 = 2/ 3, µ 3 = µ 4 =... =. u (s) = / 2, u 2 (s) = 3/2 s v = 3/2 t, v 2 = / 2. A solution exists only if g range(k) = span{u, u 2 }, i.e., if g is of the form g(s) = c + c 2 s.

14 296 DIP Chapter and 2: Introduction and Integral Equations 27 The Smoothing Effect The smoother the kernel K, the faster the µ i decay to zero: If the derivatives of order,..., q exist and are continuous, then µ i is approximately O(i q /2 ). The smaller the µ i, the more oscillations (or zero-crossings) in the singular functions u i and v i. v 5 v 6 v 7 v 8 v v 2 v 3 v Since v i µ i u i (s), higher frequencies are damped more than lower frequencies (smoothing) in the forward problem. 296 DIP Chapter and 2: Introduction and Integral Equations 28 The Picard Condition In order that there exists a square integrable solution f to the integral equation, the right-hand side g must satisfy ( ) 2 ui, g <. i= µ i Equivalent condition: g range(k). In plain words: the absolute value of the coefficients (u i, g) must decay faster than the singular values µ i! Main difficulty: a noisy g does not satisfy the PC!

15 296 DIP Chapter and 2: Introduction and Integral Equations 29 Illustration of the Picard Condition 5 g f(s) No noise in g(s) Noise in g(s) µ i u i, g u i, g / µ i The violation of the Picard condition is the simple explanation of the instability of linear inverse problems in the form of first-kind Fredholm integral equations. SVE analysis + Picard plot insight remedy algorithms. 296 DIP Chapter and 2: Introduction and Integral Equations 3 A Problem with no Solution Ursell (974) presented the following innocently-looking problem: f dt =, s. s + t + This problem has no square integrable solution! Expand right-hand side g(s) = in terms of the singular functions: g k (s) = k u i, g u i (s); g g k 2 for k. i= Now consider f k s+t+ dt = g k(s), whose solution f k is f k = k i= u i, g σ i v i. Clearly f k 2 is finite for all k ; but f k 2 for k.

16 296 DIP Chapter and 2: Introduction and Integral Equations 3 Ursell Problem Numerical Results g g k f k f f 2 5 f 3 5 f f 5 2 x 4 f 6 2 x 5 f 7 2 x 6 f DIP Chapter and 2: Introduction and Integral Equations 32 Analytic SVEs are Rare A few cases where analytic SVEs are available, e.g., the Radon transform. But in most applications we must use numerical methods for analysis and solution of the integral equation. The rest of these lectures are devoted to numerical methods! Our analysis has given us an understanding of the difficulties we are facing and they will manifest themselves again in any numerical approach we re using to solve the integral equation.

Computational Optical Imaging - Optique Numerique. -- Deconvolution --

Computational Optical Imaging - Optique Numerique. -- Deconvolution -- Computational Optical Imaging - Optique Numerique -- Deconvolution -- Winter 2014 Ivo Ihrke Deconvolution Ivo Ihrke Outline Deconvolution Theory example 1D deconvolution Fourier method Algebraic method

More information

Numerical Methods For Image Restoration

Numerical Methods For Image Restoration Numerical Methods For Image Restoration CIRAM Alessandro Lanza University of Bologna, Italy Faculty of Engineering CIRAM Outline 1. Image Restoration as an inverse problem 2. Image degradation models:

More information

The Image Deblurring Problem

The Image Deblurring Problem page 1 Chapter 1 The Image Deblurring Problem You cannot depend on your eyes when your imagination is out of focus. Mark Twain When we use a camera, we want the recorded image to be a faithful representation

More information

1 Review of Least Squares Solutions to Overdetermined Systems

1 Review of Least Squares Solutions to Overdetermined Systems cs4: introduction to numerical analysis /9/0 Lecture 7: Rectangular Systems and Numerical Integration Instructor: Professor Amos Ron Scribes: Mark Cowlishaw, Nathanael Fillmore Review of Least Squares

More information

1. Introduction. Consider the computation of an approximate solution of the minimization problem

1. Introduction. Consider the computation of an approximate solution of the minimization problem A NEW TIKHONOV REGULARIZATION METHOD MARTIN FUHRY AND LOTHAR REICHEL Abstract. The numerical solution of linear discrete ill-posed problems typically requires regularization, i.e., replacement of the available

More information

Some stability results of parameter identification in a jump diffusion model

Some stability results of parameter identification in a jump diffusion model Some stability results of parameter identification in a jump diffusion model D. Düvelmeyer Technische Universität Chemnitz, Fakultät für Mathematik, 09107 Chemnitz, Germany Abstract In this paper we discuss

More information

Understanding Poles and Zeros

Understanding Poles and Zeros MASSACHUSETTS INSTITUTE OF TECHNOLOGY DEPARTMENT OF MECHANICAL ENGINEERING 2.14 Analysis and Design of Feedback Control Systems Understanding Poles and Zeros 1 System Poles and Zeros The transfer function

More information

P164 Tomographic Velocity Model Building Using Iterative Eigendecomposition

P164 Tomographic Velocity Model Building Using Iterative Eigendecomposition P164 Tomographic Velocity Model Building Using Iterative Eigendecomposition K. Osypov* (WesternGeco), D. Nichols (WesternGeco), M. Woodward (WesternGeco) & C.E. Yarman (WesternGeco) SUMMARY Tomographic

More information

Automatic parameter setting for Arnoldi-Tikhonov methods

Automatic parameter setting for Arnoldi-Tikhonov methods Automatic parameter setting for Arnoldi-Tikhonov methods S. Gazzola, P. Novati Department of Mathematics University of Padova, Italy March 16, 2012 Abstract In the framework of iterative regularization

More information

Automatic parameter setting for Arnoldi-Tikhonov methods

Automatic parameter setting for Arnoldi-Tikhonov methods Automatic parameter setting for Arnoldi-Tikhonov methods S. Gazzola, P. Novati Department of Mathematics University of Padova, Italy Abstract In the framework of iterative regularization techniques for

More information

Nonlinear Algebraic Equations Example

Nonlinear Algebraic Equations Example Nonlinear Algebraic Equations Example Continuous Stirred Tank Reactor (CSTR). Look for steady state concentrations & temperature. s r (in) p,i (in) i In: N spieces with concentrations c, heat capacities

More information

Applications to Data Smoothing and Image Processing I

Applications to Data Smoothing and Image Processing I Applications to Data Smoothing and Image Processing I MA 348 Kurt Bryan Signals and Images Let t denote time and consider a signal a(t) on some time interval, say t. We ll assume that the signal a(t) is

More information

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

More information

Lecture 5: Singular Value Decomposition SVD (1)

Lecture 5: Singular Value Decomposition SVD (1) EEM3L1: Numerical and Analytical Techniques Lecture 5: Singular Value Decomposition SVD (1) EE3L1, slide 1, Version 4: 25-Sep-02 Motivation for SVD (1) SVD = Singular Value Decomposition Consider the system

More information

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

More information

8. Linear least-squares

8. Linear least-squares 8. Linear least-squares EE13 (Fall 211-12) definition examples and applications solution of a least-squares problem, normal equations 8-1 Definition overdetermined linear equations if b range(a), cannot

More information

Lecture Notes to Accompany. Scientific Computing An Introductory Survey. by Michael T. Heath. Chapter 10

Lecture Notes to Accompany. Scientific Computing An Introductory Survey. by Michael T. Heath. Chapter 10 Lecture Notes to Accompany Scientific Computing An Introductory Survey Second Edition by Michael T. Heath Chapter 10 Boundary Value Problems for Ordinary Differential Equations Copyright c 2001. Reproduction

More information

Parabolic Equations. Chapter 5. Contents. 5.1.2 Well-Posed Initial-Boundary Value Problem. 5.1.3 Time Irreversibility of the Heat Equation

Parabolic Equations. Chapter 5. Contents. 5.1.2 Well-Posed Initial-Boundary Value Problem. 5.1.3 Time Irreversibility of the Heat Equation 7 5.1 Definitions Properties Chapter 5 Parabolic Equations Note that we require the solution u(, t bounded in R n for all t. In particular we assume that the boundedness of the smooth function u at infinity

More information

Unified Lecture # 4 Vectors

Unified Lecture # 4 Vectors Fall 2005 Unified Lecture # 4 Vectors These notes were written by J. Peraire as a review of vectors for Dynamics 16.07. They have been adapted for Unified Engineering by R. Radovitzky. References [1] Feynmann,

More information

Lecture 5 Least-squares

Lecture 5 Least-squares EE263 Autumn 2007-08 Stephen Boyd Lecture 5 Least-squares least-squares (approximate) solution of overdetermined equations projection and orthogonality principle least-squares estimation BLUE property

More information

What is Linear Programming?

What is Linear Programming? Chapter 1 What is Linear Programming? An optimization problem usually has three essential ingredients: a variable vector x consisting of a set of unknowns to be determined, an objective function of x to

More information

3.2 Sources, Sinks, Saddles, and Spirals

3.2 Sources, Sinks, Saddles, and Spirals 3.2. Sources, Sinks, Saddles, and Spirals 6 3.2 Sources, Sinks, Saddles, and Spirals The pictures in this section show solutions to Ay 00 C By 0 C Cy D 0. These are linear equations with constant coefficients

More information

FIELDS-MITACS Conference. on the Mathematics of Medical Imaging. Photoacoustic and Thermoacoustic Tomography with a variable sound speed

FIELDS-MITACS Conference. on the Mathematics of Medical Imaging. Photoacoustic and Thermoacoustic Tomography with a variable sound speed FIELDS-MITACS Conference on the Mathematics of Medical Imaging Photoacoustic and Thermoacoustic Tomography with a variable sound speed Gunther Uhlmann UC Irvine & University of Washington Toronto, Canada,

More information

Several Views of Support Vector Machines

Several Views of Support Vector Machines Several Views of Support Vector Machines Ryan M. Rifkin Honda Research Institute USA, Inc. Human Intention Understanding Group 2007 Tikhonov Regularization We are considering algorithms of the form min

More information

Mechanics 1: Conservation of Energy and Momentum

Mechanics 1: Conservation of Energy and Momentum Mechanics : Conservation of Energy and Momentum If a certain quantity associated with a system does not change in time. We say that it is conserved, and the system possesses a conservation law. Conservation

More information

Lecture 14. Point Spread Function (PSF)

Lecture 14. Point Spread Function (PSF) Lecture 14 Point Spread Function (PSF), Modulation Transfer Function (MTF), Signal-to-noise Ratio (SNR), Contrast-to-noise Ratio (CNR), and Receiver Operating Curves (ROC) Point Spread Function (PSF) Recollect

More information

Linköping University Electronic Press

Linköping University Electronic Press Linköping University Electronic Press Report Well-posed boundary conditions for the shallow water equations Sarmad Ghader and Jan Nordström Series: LiTH-MAT-R, 0348-960, No. 4 Available at: Linköping University

More information

State of Stress at Point

State of Stress at Point State of Stress at Point Einstein Notation The basic idea of Einstein notation is that a covector and a vector can form a scalar: This is typically written as an explicit sum: According to this convention,

More information

Lecture 7: Finding Lyapunov Functions 1

Lecture 7: Finding Lyapunov Functions 1 Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.243j (Fall 2003): DYNAMICS OF NONLINEAR SYSTEMS by A. Megretski Lecture 7: Finding Lyapunov Functions 1

More information

Solving Linear Systems, Continued and The Inverse of a Matrix

Solving Linear Systems, Continued and The Inverse of a Matrix , Continued and The of a Matrix Calculus III Summer 2013, Session II Monday, July 15, 2013 Agenda 1. The rank of a matrix 2. The inverse of a square matrix Gaussian Gaussian solves a linear system by reducing

More information

Numerical methods for American options

Numerical methods for American options Lecture 9 Numerical methods for American options Lecture Notes by Andrzej Palczewski Computational Finance p. 1 American options The holder of an American option has the right to exercise it at any moment

More information

Moving Least Squares Approximation

Moving Least Squares Approximation Chapter 7 Moving Least Squares Approimation An alternative to radial basis function interpolation and approimation is the so-called moving least squares method. As we will see below, in this method the

More information

Lecture L22-2D Rigid Body Dynamics: Work and Energy

Lecture L22-2D Rigid Body Dynamics: Work and Energy J. Peraire, S. Widnall 6.07 Dynamics Fall 008 Version.0 Lecture L - D Rigid Body Dynamics: Work and Energy In this lecture, we will revisit the principle of work and energy introduced in lecture L-3 for

More information

Lecture L3 - Vectors, Matrices and Coordinate Transformations

Lecture L3 - Vectors, Matrices and Coordinate Transformations S. Widnall 16.07 Dynamics Fall 2009 Lecture notes based on J. Peraire Version 2.0 Lecture L3 - Vectors, Matrices and Coordinate Transformations By using vectors and defining appropriate operations between

More information

5.4 The Heat Equation and Convection-Diffusion

5.4 The Heat Equation and Convection-Diffusion 5.4. THE HEAT EQUATION AND CONVECTION-DIFFUSION c 6 Gilbert Strang 5.4 The Heat Equation and Convection-Diffusion The wave equation conserves energy. The heat equation u t = u xx dissipates energy. The

More information

Linear Algebra and TI 89

Linear Algebra and TI 89 Linear Algebra and TI 89 Abdul Hassen and Jay Schiffman This short manual is a quick guide to the use of TI89 for Linear Algebra. We do this in two sections. In the first section, we will go over the editing

More information

Chapter 10. Key Ideas Correlation, Correlation Coefficient (r),

Chapter 10. Key Ideas Correlation, Correlation Coefficient (r), Chapter 0 Key Ideas Correlation, Correlation Coefficient (r), Section 0-: Overview We have already explored the basics of describing single variable data sets. However, when two quantitative variables

More information

THE PROBLEM OF finding localized energy solutions

THE PROBLEM OF finding localized energy solutions 600 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 45, NO. 3, MARCH 1997 Sparse Signal Reconstruction from Limited Data Using FOCUSS: A Re-weighted Minimum Norm Algorithm Irina F. Gorodnitsky, Member, IEEE,

More information

Vector and Matrix Norms

Vector and Matrix Norms Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty

More information

Name: Section Registered In:

Name: Section Registered In: Name: Section Registered In: Math 125 Exam 3 Version 1 April 24, 2006 60 total points possible 1. (5pts) Use Cramer s Rule to solve 3x + 4y = 30 x 2y = 8. Be sure to show enough detail that shows you are

More information

PHYSICAL QUANTITIES AND UNITS

PHYSICAL QUANTITIES AND UNITS 1 PHYSICAL QUANTITIES AND UNITS Introduction Physics is the study of matter, its motion and the interaction between matter. Physics involves analysis of physical quantities, the interaction between them

More information

PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 4: LINEAR MODELS FOR CLASSIFICATION

PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 4: LINEAR MODELS FOR CLASSIFICATION PATTERN RECOGNITION AND MACHINE LEARNING CHAPTER 4: LINEAR MODELS FOR CLASSIFICATION Introduction In the previous chapter, we explored a class of regression models having particularly simple analytical

More information

Nonlinear Iterative Partial Least Squares Method

Nonlinear Iterative Partial Least Squares Method Numerical Methods for Determining Principal Component Analysis Abstract Factors Béchu, S., Richard-Plouet, M., Fernandez, V., Walton, J., and Fairley, N. (2016) Developments in numerical treatments for

More information

LS.6 Solution Matrices

LS.6 Solution Matrices LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions

More information

160 CHAPTER 4. VECTOR SPACES

160 CHAPTER 4. VECTOR SPACES 160 CHAPTER 4. VECTOR SPACES 4. Rank and Nullity In this section, we look at relationships between the row space, column space, null space of a matrix and its transpose. We will derive fundamental results

More information

Using the Theory of Reals in. Analyzing Continuous and Hybrid Systems

Using the Theory of Reals in. Analyzing Continuous and Hybrid Systems Using the Theory of Reals in Analyzing Continuous and Hybrid Systems Ashish Tiwari Computer Science Laboratory (CSL) SRI International (SRI) Menlo Park, CA 94025 Email: ashish.tiwari@sri.com Ashish Tiwari

More information

7 Gaussian Elimination and LU Factorization

7 Gaussian Elimination and LU Factorization 7 Gaussian Elimination and LU Factorization In this final section on matrix factorization methods for solving Ax = b we want to take a closer look at Gaussian elimination (probably the best known method

More information

Similarity and Diagonalization. Similar Matrices

Similarity and Diagonalization. Similar Matrices MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that

More information

with functions, expressions and equations which follow in units 3 and 4.

with functions, expressions and equations which follow in units 3 and 4. Grade 8 Overview View unit yearlong overview here The unit design was created in line with the areas of focus for grade 8 Mathematics as identified by the Common Core State Standards and the PARCC Model

More information

3. Interpolation. Closing the Gaps of Discretization... Beyond Polynomials

3. Interpolation. Closing the Gaps of Discretization... Beyond Polynomials 3. Interpolation Closing the Gaps of Discretization... Beyond Polynomials Closing the Gaps of Discretization... Beyond Polynomials, December 19, 2012 1 3.3. Polynomial Splines Idea of Polynomial Splines

More information

Solving Simultaneous Equations and Matrices

Solving Simultaneous Equations and Matrices Solving Simultaneous Equations and Matrices The following represents a systematic investigation for the steps used to solve two simultaneous linear equations in two unknowns. The motivation for considering

More information

Digital Imaging and Multimedia. Filters. Ahmed Elgammal Dept. of Computer Science Rutgers University

Digital Imaging and Multimedia. Filters. Ahmed Elgammal Dept. of Computer Science Rutgers University Digital Imaging and Multimedia Filters Ahmed Elgammal Dept. of Computer Science Rutgers University Outlines What are Filters Linear Filters Convolution operation Properties of Linear Filters Application

More information

ANALYTICAL METHODS FOR ENGINEERS

ANALYTICAL METHODS FOR ENGINEERS UNIT 1: Unit code: QCF Level: 4 Credit value: 15 ANALYTICAL METHODS FOR ENGINEERS A/601/1401 OUTCOME - TRIGONOMETRIC METHODS TUTORIAL 1 SINUSOIDAL FUNCTION Be able to analyse and model engineering situations

More information

Grade level: secondary Subject: mathematics Time required: 45 to 90 minutes

Grade level: secondary Subject: mathematics Time required: 45 to 90 minutes TI-Nspire Activity: Paint Can Dimensions By: Patsy Fagan and Angela Halsted Activity Overview Problem 1 explores the relationship between height and volume of a right cylinder, the height and surface area,

More information

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1. MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

More information

We shall turn our attention to solving linear systems of equations. Ax = b

We shall turn our attention to solving linear systems of equations. Ax = b 59 Linear Algebra We shall turn our attention to solving linear systems of equations Ax = b where A R m n, x R n, and b R m. We already saw examples of methods that required the solution of a linear system

More information

by the matrix A results in a vector which is a reflection of the given

by the matrix A results in a vector which is a reflection of the given Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the y-axis We observe that

More information

8.2. Solution by Inverse Matrix Method. Introduction. Prerequisites. Learning Outcomes

8.2. Solution by Inverse Matrix Method. Introduction. Prerequisites. Learning Outcomes Solution by Inverse Matrix Method 8.2 Introduction The power of matrix algebra is seen in the representation of a system of simultaneous linear equations as a matrix equation. Matrix algebra allows us

More information

Blind Deconvolution of Barcodes via Dictionary Analysis and Wiener Filter of Barcode Subsections

Blind Deconvolution of Barcodes via Dictionary Analysis and Wiener Filter of Barcode Subsections Blind Deconvolution of Barcodes via Dictionary Analysis and Wiener Filter of Barcode Subsections Maximilian Hung, Bohyun B. Kim, Xiling Zhang August 17, 2013 Abstract While current systems already provide

More information

How To Prove The Dirichlet Unit Theorem

How To Prove The Dirichlet Unit Theorem Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if

More information

Mesh Discretization Error and Criteria for Accuracy of Finite Element Solutions

Mesh Discretization Error and Criteria for Accuracy of Finite Element Solutions Mesh Discretization Error and Criteria for Accuracy of Finite Element Solutions Chandresh Shah Cummins, Inc. Abstract Any finite element analysis performed by an engineer is subject to several types of

More information

MODULE VII LARGE BODY WAVE DIFFRACTION

MODULE VII LARGE BODY WAVE DIFFRACTION MODULE VII LARGE BODY WAVE DIFFRACTION 1.0 INTRODUCTION In the wave-structure interaction problems, it is classical to divide into two major classification: slender body interaction and large body interaction.

More information

9.4. The Scalar Product. Introduction. Prerequisites. Learning Style. Learning Outcomes

9.4. The Scalar Product. Introduction. Prerequisites. Learning Style. Learning Outcomes The Scalar Product 9.4 Introduction There are two kinds of multiplication involving vectors. The first is known as the scalar product or dot product. This is so-called because when the scalar product of

More information

Lecture 3. Linear Programming. 3B1B Optimization Michaelmas 2015 A. Zisserman. Extreme solutions. Simplex method. Interior point method

Lecture 3. Linear Programming. 3B1B Optimization Michaelmas 2015 A. Zisserman. Extreme solutions. Simplex method. Interior point method Lecture 3 3B1B Optimization Michaelmas 2015 A. Zisserman Linear Programming Extreme solutions Simplex method Interior point method Integer programming and relaxation The Optimization Tree Linear Programming

More information

Orbits of the Lennard-Jones Potential

Orbits of the Lennard-Jones Potential Orbits of the Lennard-Jones Potential Prashanth S. Venkataram July 28, 2012 1 Introduction The Lennard-Jones potential describes weak interactions between neutral atoms and molecules. Unlike the potentials

More information

Lecture Notes 2: Matrices as Systems of Linear Equations

Lecture Notes 2: Matrices as Systems of Linear Equations 2: Matrices as Systems of Linear Equations 33A Linear Algebra, Puck Rombach Last updated: April 13, 2016 Systems of Linear Equations Systems of linear equations can represent many things You have probably

More information

1 2 3 1 1 2 x = + x 2 + x 4 1 0 1

1 2 3 1 1 2 x = + x 2 + x 4 1 0 1 (d) If the vector b is the sum of the four columns of A, write down the complete solution to Ax = b. 1 2 3 1 1 2 x = + x 2 + x 4 1 0 0 1 0 1 2. (11 points) This problem finds the curve y = C + D 2 t which

More information

Copyright 2011 Casa Software Ltd. www.casaxps.com. Centre of Mass

Copyright 2011 Casa Software Ltd. www.casaxps.com. Centre of Mass Centre of Mass A central theme in mathematical modelling is that of reducing complex problems to simpler, and hopefully, equivalent problems for which mathematical analysis is possible. The concept of

More information

Journal of Engineering Science and Technology Review 2 (1) (2009) 76-81. Lecture Note

Journal of Engineering Science and Technology Review 2 (1) (2009) 76-81. Lecture Note Journal of Engineering Science and Technology Review 2 (1) (2009) 76-81 Lecture Note JOURNAL OF Engineering Science and Technology Review www.jestr.org Time of flight and range of the motion of a projectile

More information

3. Reaction Diffusion Equations Consider the following ODE model for population growth

3. Reaction Diffusion Equations Consider the following ODE model for population growth 3. Reaction Diffusion Equations Consider the following ODE model for population growth u t a u t u t, u 0 u 0 where u t denotes the population size at time t, and a u plays the role of the population dependent

More information

Linear Programming. March 14, 2014

Linear Programming. March 14, 2014 Linear Programming March 1, 01 Parts of this introduction to linear programming were adapted from Chapter 9 of Introduction to Algorithms, Second Edition, by Cormen, Leiserson, Rivest and Stein [1]. 1

More information

NMR Measurement of T1-T2 Spectra with Partial Measurements using Compressive Sensing

NMR Measurement of T1-T2 Spectra with Partial Measurements using Compressive Sensing NMR Measurement of T1-T2 Spectra with Partial Measurements using Compressive Sensing Alex Cloninger Norbert Wiener Center Department of Mathematics University of Maryland, College Park http://www.norbertwiener.umd.edu

More information

Example 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum. asin. k, a, and b. We study stability of the origin x

Example 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum. asin. k, a, and b. We study stability of the origin x Lecture 4. LaSalle s Invariance Principle We begin with a motivating eample. Eample 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum Dynamics of a pendulum with friction can be written

More information

8.1. Cramer s Rule for Solving Simultaneous Linear Equations. Introduction. Prerequisites. Learning Outcomes. Learning Style

8.1. Cramer s Rule for Solving Simultaneous Linear Equations. Introduction. Prerequisites. Learning Outcomes. Learning Style Cramer s Rule for Solving Simultaneous Linear Equations 8.1 Introduction The need to solve systems of linear equations arises frequently in engineering. The analysis of electric circuits and the control

More information

1 Error in Euler s Method

1 Error in Euler s Method 1 Error in Euler s Method Experience with Euler s 1 method raises some interesting questions about numerical approximations for the solutions of differential equations. 1. What determines the amount of

More information

TMA4213/4215 Matematikk 4M/N Vår 2013

TMA4213/4215 Matematikk 4M/N Vår 2013 Norges teknisk naturvitenskapelige universitet Institutt for matematiske fag TMA43/45 Matematikk 4M/N Vår 3 Løsningsforslag Øving a) The Fourier series of the signal is f(x) =.4 cos ( 4 L x) +cos ( 5 L

More information

HYBRID FIR-IIR FILTERS By John F. Ehlers

HYBRID FIR-IIR FILTERS By John F. Ehlers HYBRID FIR-IIR FILTERS By John F. Ehlers Many traders have come to me, asking me to make their indicators act just one day sooner. They are convinced that this is just the edge they need to make a zillion

More information

1 if 1 x 0 1 if 0 x 1

1 if 1 x 0 1 if 0 x 1 Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

More information

Positive Feedback and Oscillators

Positive Feedback and Oscillators Physics 3330 Experiment #6 Fall 1999 Positive Feedback and Oscillators Purpose In this experiment we will study how spontaneous oscillations may be caused by positive feedback. You will construct an active

More information

jorge s. marques image processing

jorge s. marques image processing image processing images images: what are they? what is shown in this image? What is this? what is an image images describe the evolution of physical variables (intensity, color, reflectance, condutivity)

More information

AN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS

AN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS AN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS Revised Edition James Epperson Mathematical Reviews BICENTENNIAL 0, 1 8 0 7 z ewiley wu 2007 r71 BICENTENNIAL WILEY-INTERSCIENCE A John Wiley & Sons, Inc.,

More information

13 MATH FACTS 101. 2 a = 1. 7. The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions.

13 MATH FACTS 101. 2 a = 1. 7. The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions. 3 MATH FACTS 0 3 MATH FACTS 3. Vectors 3.. Definition We use the overhead arrow to denote a column vector, i.e., a linear segment with a direction. For example, in three-space, we write a vector in terms

More information

Høgskolen i Narvik Sivilingeniørutdanningen STE6237 ELEMENTMETODER. Oppgaver

Høgskolen i Narvik Sivilingeniørutdanningen STE6237 ELEMENTMETODER. Oppgaver Høgskolen i Narvik Sivilingeniørutdanningen STE637 ELEMENTMETODER Oppgaver Klasse: 4.ID, 4.IT Ekstern Professor: Gregory A. Chechkin e-mail: chechkin@mech.math.msu.su Narvik 6 PART I Task. Consider two-point

More information

CS3220 Lecture Notes: QR factorization and orthogonal transformations

CS3220 Lecture Notes: QR factorization and orthogonal transformations CS3220 Lecture Notes: QR factorization and orthogonal transformations Steve Marschner Cornell University 11 March 2009 In this lecture I ll talk about orthogonal matrices and their properties, discuss

More information

ALGEBRAIC EIGENVALUE PROBLEM

ALGEBRAIC EIGENVALUE PROBLEM ALGEBRAIC EIGENVALUE PROBLEM BY J. H. WILKINSON, M.A. (Cantab.), Sc.D. Technische Universes! Dsrmstedt FACHBEREICH (NFORMATiK BIBL1OTHEK Sachgebieto:. Standort: CLARENDON PRESS OXFORD 1965 Contents 1.

More information

Ill-Posed Problems in Probability and Stability of Random Sums. Lev B. Klebanov, Tomasz J. Kozubowski, and Svetlozar T. Rachev

Ill-Posed Problems in Probability and Stability of Random Sums. Lev B. Klebanov, Tomasz J. Kozubowski, and Svetlozar T. Rachev Ill-Posed Problems in Probability and Stability of Random Sums By Lev B. Klebanov, Tomasz J. Kozubowski, and Svetlozar T. Rachev Preface This is the first of two volumes concerned with the ill-posed problems

More information

AP PHYSICS C Mechanics - SUMMER ASSIGNMENT FOR 2016-2017

AP PHYSICS C Mechanics - SUMMER ASSIGNMENT FOR 2016-2017 AP PHYSICS C Mechanics - SUMMER ASSIGNMENT FOR 2016-2017 Dear Student: The AP physics course you have signed up for is designed to prepare you for a superior performance on the AP test. To complete material

More information

IMPROVEMENT OF DIGITAL IMAGE RESOLUTION BY OVERSAMPLING

IMPROVEMENT OF DIGITAL IMAGE RESOLUTION BY OVERSAMPLING ABSTRACT: IMPROVEMENT OF DIGITAL IMAGE RESOLUTION BY OVERSAMPLING Hakan Wiman Department of Photogrammetry, Royal Institute of Technology S - 100 44 Stockholm, Sweden (e-mail hakanw@fmi.kth.se) ISPRS Commission

More information

Lecture L2 - Degrees of Freedom and Constraints, Rectilinear Motion

Lecture L2 - Degrees of Freedom and Constraints, Rectilinear Motion S. Widnall 6.07 Dynamics Fall 009 Version.0 Lecture L - Degrees of Freedom and Constraints, Rectilinear Motion Degrees of Freedom Degrees of freedom refers to the number of independent spatial coordinates

More information

SOLVING LINEAR SYSTEMS

SOLVING LINEAR SYSTEMS SOLVING LINEAR SYSTEMS Linear systems Ax = b occur widely in applied mathematics They occur as direct formulations of real world problems; but more often, they occur as a part of the numerical analysis

More information

Solving simultaneous equations using the inverse matrix

Solving simultaneous equations using the inverse matrix Solving simultaneous equations using the inverse matrix 8.2 Introduction The power of matrix algebra is seen in the representation of a system of simultaneous linear equations as a matrix equation. Matrix

More information

Advanced CFD Methods 1

Advanced CFD Methods 1 Advanced CFD Methods 1 Prof. Patrick Jenny, FS 2014 Date: 15.08.14, Time: 13:00, Student: Federico Danieli Summary The exam took place in Prof. Jenny s office, with his assistant taking notes on the answers.

More information

Least-Squares Intersection of Lines

Least-Squares Intersection of Lines Least-Squares Intersection of Lines Johannes Traa - UIUC 2013 This write-up derives the least-squares solution for the intersection of lines. In the general case, a set of lines will not intersect at a

More information

Convolution. 1D Formula: 2D Formula: Example on the web: http://www.jhu.edu/~signals/convolve/

Convolution. 1D Formula: 2D Formula: Example on the web: http://www.jhu.edu/~signals/convolve/ Basic Filters (7) Convolution/correlation/Linear filtering Gaussian filters Smoothing and noise reduction First derivatives of Gaussian Second derivative of Gaussian: Laplacian Oriented Gaussian filters

More information

Inner Product Spaces

Inner Product Spaces Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and

More information

The Heat Equation. Lectures INF2320 p. 1/88

The Heat Equation. Lectures INF2320 p. 1/88 The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)

More information

A linear combination is a sum of scalars times quantities. Such expressions arise quite frequently and have the form

A linear combination is a sum of scalars times quantities. Such expressions arise quite frequently and have the form Section 1.3 Matrix Products A linear combination is a sum of scalars times quantities. Such expressions arise quite frequently and have the form (scalar #1)(quantity #1) + (scalar #2)(quantity #2) +...

More information

Current Density Impedance Imaging with Complete Electrode Model

Current Density Impedance Imaging with Complete Electrode Model Current Density Impedance Imaging with Complete Electrode Model Alexandru Tamasan jointly with A. Nachman & J. Veras University of Central Florida Work supported by NSF BIRS Workshop on Hybrid Methods

More information

NOTES ON LINEAR TRANSFORMATIONS

NOTES ON LINEAR TRANSFORMATIONS NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all

More information