Inverse Problems. Example Direct problem given polynomial find zeros Inverse problem given zeros find polynomial.

Slides:



Advertisements
Similar presentations
Interpolation A standard idea in interpolation now is to find a polynomial pn(x) of degree n (or less) that assumes the given values; thus (1) We call.
Advertisements

Ch 5.7: Series Solutions Near a Regular Singular Point, Part II
Venkataramanan Balakrishnan Purdue University Applications of Convex Optimization in Systems and Control.
Asymptotic error expansion Example 1: Numerical differentiation –Truncation error via Taylor expansion.
1 Chapter 4 Interpolation and Approximation Lagrange Interpolation The basic interpolation problem can be posed in one of two ways: The basic interpolation.
Lecture #13 Stability under slow switching & state-dependent switching João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched.
Steepest Decent and Conjugate Gradients (CG). Solving of the linear equation system.
Claudia Lizet Navarro Hernández PhD Student Supervisor: Professor S.P.Banks April 2004 Monash University Australia April 2004 The University of Sheffield.
Instructor : Dr. Saeed Shiry
INVERSE PROBLEMS and REGULARIZATION THEORY – Part II AIP 2011 Texas A&M University MAY 22, 2011 CHUCK GROETSCH Every restriction corresponds to a law of.
1 L-BFGS and Delayed Dynamical Systems Approach for Unconstrained Optimization Xiaohui XIE Supervisor: Dr. Hon Wah TAM.
A posteriori Error Estimate - Adaptive method Consider the boundary value problem Weak form Discrete Equation Error bounds ( priori error )
Parks-McClellan FIR Filter Design
Minimaxity & Admissibility Presenting: Slava Chernoi Lehman and Casella, chapter 5 sections 1-2,7.
Structural Stability, Catastrophe Theory, and Applied Mathematics
SYSTEMS Identification
1 Introduction to Kernels Max Welling October (chapters 1,2,3,4)
REGULARIZATION THEORY OF INVERSE PROBLEMS - A BRIEF REVIEW - Michele Piana, Dipartimento di Matematica, Università di Genova.
Regularization by Galerkin Methods Hans Groot. 2 Overview In previous talks about inverse problems: well-posedness worst-case errors regularization strategies.
Scientific Computing Algorithm Convergence and Root Finding Methods.
Numerical Computations in Linear Algebra. Mathematically posed problems that are to be solved, or whose solution is to be confirmed on a digital computer.
0 Optimal solutions to geodetic inverse problems in statistical and numerical aspects Jianqing Cai Geodätisches Institut, Universität Stuttgart Session.
MATH 685/CSI 700 Lecture Notes Lecture 1. Intro to Scientific Computing.
difficult if we consider Didn’t you say it’s a very
SVD: Singular Value Decomposition
Chapter 4 Interpolation and Approximation. 4.1 Lagrange Interpolation The basic interpolation problem can be posed in one of two ways: The basic interpolation.
Integration of 3-body encounter. Figure taken from
1. Interpolating polynomials Polynomial of degree n,, is a linear combination of Definitions: (interval, continuous function, abscissas, and polynomial)
Orthogonalization via Deflation By Achiya Dax Hydrological Service Jerusalem, Israel
1. 2  A Hilbert space H is a real or complex inner product space that is also a complete metric space with respect to the distance function induced.
University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2014 Professor Brandon A. Jones Lecture 26: Singular Value Decomposition.
7. Introduction to the numerical integration of PDE. As an example, we consider the following PDE with one variable; Finite difference method is one of.
Kernel adaptive filtering Lecture slides for EEL6502 Spring 2011 Sohan Seth.
1 Markov Decision Processes Infinite Horizon Problems Alan Fern * * Based in part on slides by Craig Boutilier and Daniel Weld.
Unstable-particles pair production in modified perturbation theory in NNLO M.L.Nekrasov IHEP, Protvino.
AUTOMATIC CONTROL THEORY II Slovak University of Technology Faculty of Material Science and Technology in Trnava.
SYSTEMS Identification Ali Karimpour Assistant Professor Ferdowsi University of Mashhad Reference: “System Identification Theory For The User” Lennart.
COMMUTATION RELATIONS and STABILITY of SWITCHED SYSTEMS Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng., Univ. of.
Numerical methods 1 An Introduction to Numerical Methods For Weather Prediction by Mariano Hortal office 122.
Feedback Stabilization of Nonlinear Singularly Perturbed Systems MENG Bo JING Yuanwei SHEN Chao College of Information Science and Engineering, Northeastern.
Lecture #12 Controller realizations for stable switching João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched Systems.
Advanced Engineering Mathematics, 7 th Edition Peter V. O’Neil © 2012 Cengage Learning Engineering. All Rights Reserved. CHAPTER 4 Series Solutions.
LMS Algorithm in a Reproducing Kernel Hilbert Space Weifeng Liu, P. P. Pokharel, J. C. Principe Computational NeuroEngineering Laboratory, University of.
1 Chapter 7 Numerical Methods for the Solution of Systems of Equations.
1 What happens to the location estimator if we minimize with a power other that 2? Robert J. Blodgett Statistic Seminar - March 13, 2008.
Ordinary Differential Equations
Linear Systems Numerical Methods. 2 Jacobi Iterative Method Choose an initial guess (i.e. all zeros) and Iterate until the equality is satisfied. No guarantee.
Machine Learning Chapter 7. Computational Learning Theory Tom M. Mitchell.
1 Chapter 4 Interpolation and Approximation Lagrange Interpolation The basic interpolation problem can be posed in one of two ways: The basic interpolation.
2D Complex-Valued Eikonal Equation Peijia Liu Department of Mathematics The University of Texas at Austin.
1 Kernel-class Jan Recap: Feature Spaces non-linear mapping to F 1. high-D space 2. infinite-D countable space : 3. function space (Hilbert.
1 Spring 2003 Prof. Tim Warburton MA557/MA578/CS557 Lecture 25.
A Binary Linear Programming Formulation of the Graph Edit Distance Presented by Shihao Ji Duke University Machine Learning Group July 17, 2006 Authors:
Chapter 4: Linear Multistep Methods Example: 3ed order Adams–Bashforth method Example: 2ed order Adams–Bashforth method Example: 2ed order backward difference.
Eigenvalues, Zeros and Poles
Answers for Review Questions for Lectures 1-4. Review Lectures 1-4 Problems Question 2. Derive a closed form for the estimate of the solution of the equation.
Autonomous Cyber-Physical Systems: Dynamical Systems
Remainder of a Taylor Polynomial
Welcome to the Kernel-Club
Stability Analysis of Linear Systems
Roland Tóth, Federico Felici, Peter Heuberger, and Paul Van den Hof
MATH 175: Numerical Analysis II
Ch5 Initial-Value Problems for ODE
Totally Asynchronous Iterative Algorithms
Multiple features Linear Regression with multiple variables
Multiple features Linear Regression with multiple variables
Chapter 2 A Survey of Simple Methods and Tools
2.2 Fixed-Point Iteration
Generalized Finite Element Methods
Presentation transcript:

Inverse Problems

Example Direct problem given polynomial find zeros Inverse problem given zeros find polynomial

Well-posedness A problem is well posed if Existence - there exists a solution of the problem Uniqueness - there is at most one solution of the problem Stability - the solution depends continuously on the data

Example (ill-posed problem) Operator Norm problem is not stable Perturb by error in data error in solution Inverse problem Given, compute such that, ie.,

The worst-case error linear bounded Banach stronger norm Inverse problem Given, compute such that In general, we do not have the data … … but the perturbed data …

The worst-case error linear bounded Banach stronger norm Worst case error: Assume - - extra information for solutions and

The worst-case error (example) stronger norm It can then be shown:

Regularisation Theory - compact operator - one to one - For, we would want to solveWe actually know... Problem!

Find an approximation for Aim Idea: Construct a suitable bounded approximation of - small error (hopefully not much worse than the worst case error!) - depends continuously on Approximation

Regularisation Strategy Idea: Construct a suitable bounded approximation of Definition: A regularisation strategy is a family of linear and bounded operators such that Theorem: (due to being compact) 1- is not uniformly bounded 2- Convergence is not uniform, but point wise

Error End problem...Perturbed problem... approximations of

Error End problem... When Perturbed problem... approximations of

Minimization

Regularisation Strategy Idea: Construct a suitable bounded approximation of Definition: A regularisation strategy is a family of linear and bounded operators such that

The worst-case error (example) stronger norm It can then be shown:

Example of a regularisation strategy Regularisation strategy:

Example of a regularisation strategy It can be shown, for a priori information Choose Then… asymptotically optimal

Filtering compact singular system for is the solution of It can be shown orthonormal systems such that singular values of and

Filtering is the solution of Regularisation strategy (Filtering): regularizing filter : when

Tykhonov Regularisation compact singular system for

Rewrite : Landweber Iteration Iterative process Then where

Landweber Iteration compact and defines a regularization strategy It can be shown… Choices for accuracy of : large stability of : small an optimal choice can be made…

Conclusion -Worst case error - Regularisation strategies - Filtering - Tykhonov Regularisation - Landweber Iteration