The Doctoral Dissertation

Slides:



Advertisements
Similar presentations
College of Information Technology & Design
Advertisements

A Robust Super Resolution Method for Images of 3D Scenes Pablo L. Sala Department of Computer Science University of Toronto.
Image Modeling & Segmentation
A History of Numerical Analysis Ideas Alan Kaylor Cline Department of Computer Sciences The University of Texas at Austin Prepared for CS 378 History of.
Graph Laplacian Regularization for Large-Scale Semidefinite Programming Kilian Weinberger et al. NIPS 2006 presented by Aggeliki Tsoli.
MATH 685/ CSI 700/ OR 682 Lecture Notes
Asymptotic error expansion Example 1: Numerical differentiation –Truncation error via Taylor expansion.
Hidden Markov Models Theory By Johan Walters (SR 2003)
1cs542g-term Notes  Notes for last part of Oct 11 and all of Oct 12 lecture online now  Another extra class this Friday 1-2pm.
Center for Computational Biology Department of Mathematical Sciences Montana State University Collaborators: Alexander Dimitrov John P. Miller Zane Aldworth.
Recent Development on Elimination Ordering Group 1.
Propagation of error Ignoring higher order terms, the error in function, based on the uncertainty in its inputs, can be estimated by where  is the symbol.
6/20/2015List Decoding Of RS Codes 1 Barak Pinhas ECC Seminar Tel-Aviv University.
Expectation Maximization Algorithm
Expectation-Maximization (EM) Chapter 3 (Duda et al.) – Section 3.9
Structure Computation. How to compute the position of a point in 3- space given its image in two views and the camera matrices of those two views Use.
MATH 685/ CSI 700/ OR 682 Lecture Notes Lecture 10. Ordinary differential equations. Initial value problems.
Non-Linear Simultaneous Equations
Linear Prediction Problem: Forward Prediction Backward Prediction
Numerical Solutions to ODEs Nancy Griffeth January 14, 2014 Funding for this workshop was provided by the program “Computational Modeling and Analysis.
The Art of Programming Top-Down Design. The Art of Problem Solving The art of problem solving is the transformation of an English description of a problem.
Project Presentation by Eddie Smolyansky & Shilo Abramovitch Supervisor: David Erdos.
Radial Basis Function Networks
1 Linear Methods for Classification Lecture Notes for CMPUT 466/551 Nilanjan Ray.
MATRICES AND DETERMINANTS
Advanced Computer Graphics Spring 2014 K. H. Ko School of Mechatronics Gwangju Institute of Science and Technology.
Linear Systems Gaussian Elimination CSE 541 Roger Crawfis.
MATH 685/CSI 700 Lecture Notes Lecture 1. Intro to Scientific Computing.
© 2005 Yusuf Akgul Gebze Institute of Technology Department of Computer Engineering Computer Vision Geometric Camera Calibration.
Algorithms and their Applications CS2004 ( ) Dr Stephen Swift 1.2 Introduction to Algorithms.
Chapter 3 Solution of Algebraic Equations 1 ChE 401: Computational Techniques for Chemical Engineers Fall 2009/2010 DRAFT SLIDES.
Genome Rearrangements [1] Ch Types of Rearrangements Reversal Translocation
MA/CS 375 Fall MA/CS 375 Fall 2002 Lecture 31.
Solution techniques Martin Ellison University of Warwick and CEPR Bank of England, December 2005.
Scientific Computing General Least Squares. Polynomial Least Squares Polynomial Least Squares: We assume that the class of functions is the class of all.
Although this may seem a paradox, all exact science is dominated by the idea of approximation. Bertrand Russell Approximation Algorithm.
1  The Problem: Consider a two class task with ω 1, ω 2   LINEAR CLASSIFIERS.
Today’s class Numerical differentiation Roots of equation Bracketing methods Numerical Methods, Lecture 4 1 Prof. Jinbo Bi CSE, UConn.
Final Exam Review CS479/679 Pattern Recognition Dr. George Bebis 1.
Chapter 2-OPTIMIZATION G.Anuradha. Contents Derivative-based Optimization –Descent Methods –The Method of Steepest Descent –Classical Newton’s Method.
Section 9.3 Systems of Linear Equations in Several Variables Objectives: Solving systems of linear equations using Gaussian elimination.
Advanced Artificial Intelligence Lecture 8: Advance machine learning.
Numerical Analysis – Data Fitting Hanyang University Jong-Il Park.
Center for Computational Biology Department of Mathematical Sciences Montana State University Collaborators: Alexander Dimitrov John P. Miller Zane Aldworth.
Numerical Analysis CC413 Propagation of Errors. 2 In numerical methods, the calculations are not made with exact numbers. How do these inaccuracies propagate.
5.1 Solving Systems of Linear Equations by Graphing
Chapter 2 Linear Equations and Functions. Sect. 2.1 Functions and their Graphs Relation – a mapping or pairing of input values with output values domain.
Section 8 Numerical Analysis CSCI E-24 José Luis Ramírez Herrán October 20, 2015.
Quadrature – Concepts (numerical integration) Don Allen.
Symbolic/numeric exact rational linear system solver Bryan Youse, B. David Saunders University of Delaware, Newark, Delaware Outlook [1] Zhendong Wan.
PIVOTING The pivot or pivot element is the element of a matrix, or an array, which is selected first by an algorithm (e.g. Gaussian elimination, simplex.
EEE 431 Computational Methods in Electrodynamics
LINEAR CLASSIFIERS The Problem: Consider a two class task with ω1, ω2.
*current controlled assessment plans are unknown
Chapter 10: Solving Linear Systems of Equations
Estimating 2-view relationships
The Simplex Method: Nonstandard Problems
MATH 175: NUMERICAL ANALYSIS II
6.2 Grid Search of Chi-Square Space
Programming Concepts and Database
X y y = x2 - 3x Solutions of y = x2 - 3x y x –1 5 –2 –3 6 y = x2-3x.
ECE 576 POWER SYSTEM DYNAMICS AND STABILITY
Artificial Intelligence 10. Neural Networks
Shape-based Registration
Implicit and Explicit Runge-Kutta methods
Joint Optimization of Multiple Behavioral and Implementation Properties of Digital IIR Filter Designs Magesh Valliappan, Brian L. Evans, and Mohamed Gzara.
Calibration and homographies
What are optimization methods?
Recursive Implementation of Anisotropic Filtering
Numerical Modeling Ramaz Botchorishvili
Presentation transcript:

The Doctoral Dissertation How Can We Determine Numerical Quality in Software? The Doctoral Dissertation of Thomas Rowan

“Functional Stability Analysis Of Numerical Algorithms” Thomas Harvey Rowan: “Functional Stability Analysis Of Numerical Algorithms” Doctoral Dissertation Department of Computer Sciences The University of Texas at Austin 1990

What is meant by numerical quality?

(i.e. having slightly different input) What is meant by numerical quality? The computed solution (i.e. the output) is the exact solution to a close problem (i.e. having slightly different input)

(i.e. having slightly different input) What is meant by numerical quality? The computed solution (i.e. the output) is the exact solution to a close problem (i.e. having slightly different input) This is called “numerical stability”

Input: a pair of lines in the plane

Input: a pair of lines in the plane Output: the intersection (if any)

well conditioned problem This is what we seek: A poor solution to a well conditioned problem

Notice the difficulty: We have to guarantee that ? ? Notice the difficulty: We have to guarantee that the approximate solution is not the solution to ANY close problem

Idea: Search the input space attempting to maximize the ratio of the forward error to the condition number.

Idea: Search the input space attempting to maximize the ratio of the forward error to the condition number. Details, details: How do you get the forward error? How do you get the condition number?

Would you like to find the maximum of this?

Nelder Mead Simplex Algorithm: The crawling spider

high high high high

Simplex difficulties: Huge use of storage (n2) Equivalent weight to all variables

Simplex difficulties: Huge use of storage (n2) Equivalent weight to all variables Subplex: Determine small subspaces likely to be most useful for determining minimum

the Subplex Algorithm to locate minima of The idea is to use the Subplex Algorithm to locate minima of (the negative of) the backward error INSTAB SUBPLEX Backward Error code code extra precision

Does it work?

Does it work? Tried on known unstable algorithms Tried on known stable algorithms Tried on unknown algorithms

Does it work? Tried on known unstable algorithms Identified all as unstable Tried on known stable algorithms Found no false positives Tried on unknown algorithms Discovered unstable algorithms

Backword error estimate for Gaussian elimination

Anything left to do? Two papers to write Translation into C++ or Matlab More experiments Refinements to INSTAB or SUBPLEX