Rewriting the book on Earthquake Locations Ethan Coon (APAM) Felix Waldhauser (LDEO)

Slides:

Advertisements

Similar presentations

Copyright 2011, Data Mining Research Laboratory Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining Xintian Yang, Srinivasan.

Advertisements

2.4 Writing the Equation of a Line

O(N 1.5 ) divide-and-conquer technique for Minimum Spanning Tree problem Step 1: Divide the graph into  N sub-graph by clustering. Step 2: Solve each.

Rheological implications for localization of strain in rock Ethan Coon (APAM) Marc Spiegelman (LDEO/APAM) Peter Kelemen (LDEO)

Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 CHAPTER 4 - PART 2 GRAPHS 1.

First introduced in 1977 Lots of mathematical derivation Problem : given a set of data (data is incomplete or having missing values). Goal : assume the.

A Unified View of Kernel k-means, Spectral Clustering and Graph Cuts

Single station location Multiple station location

K-means Clustering. What is clustering? Why would we want to cluster? How would you determine clusters? How can you do this efficiently?

Newton's Method for Functions of Several Variables

Iterative Methods for Solving Linear Systems of Equations ( part of the course given for the 2 nd grade at BGU, ME )

EOC Practice #18 SPI EOC Practice #18 Solve systems of linear equations/inequalities in two variables.

Surface wave tomography： part3: waveform inversion, adjoint tomography

ITERATIVE TECHNIQUES FOR SOLVING NON-LINEAR SYSTEMS (AND LINEAR SYSTEMS)

6-1 Solving Systems by Graphing

Distance Approximating Trees in Graphs

Warm-Up 12/05 165° + 360k° 525°; – 195°. Rigor: You will learn how graph points and simple graphs with polar coordinates. Relevance: You will be able.

Linear Prediction Coding of Speech Signal Jun-Won Suh.

Solving Systems of 3 or More Variables Why a Matrix? In previous math classes you solved systems of two linear equations using the following method:

FUNDAMENTALS of ENGINEERING SEISMOLOGY LOCATING EARTHQUAKES.

Clustering Methods K- means. K-means Algorithm Assume that K=3 and initially the points are assigned to clusters as follows. C 1 ={x 1,x 2,x 3 }, C 2.

Fuzzy BSB-neuro-model. «Brain-State-in-a-Box Model» (BSB-model) Dynamic of BSB-model: (1) Activation function: (2) 2.

Math /4.2/4.3 – Solving Systems of Linear Equations 1.

Solving Linear Inequalities Lesson 5.5 linear inequality: _________________________________ ________________________________________________ solution of.

LINEARIZATION AND NEWTON’S METHOD Section 4.5. Linearization Algebraically, the principle of local linearity means that the equation of the tangent.

1 Section 5.3 Linear Systems of Equations. 2 THREE EQUATIONS WITH THREE VARIABLES Consider the linear system of three equations below with three unknowns.

1 Beginning & Intermediate Algebra – Math 103 Math, Statistics & Physics.

Lecture 6 - Single Variable Problems & Systems of Equations CVEN 302 June 14, 2002.

Lloyd Algorithm K-Means Clustering. Gene Expression Susumu Ohno: whole genome duplications The expression of genes can be measured over time. Identifying.

ELG5377 Adaptive Signal Processing Lecture 15: Recursive Least Squares (RLS) Algorithm.

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.

The Implementation of Genetic Algorithms to Locate Highest Elevation By Harry Beddo.

Algebra 1 Section 7.1 Solve systems of linear equations by graphing Recall: linear equation in 2 variables ax + by = c The solution to a system of equations.

Algebra 1 Section 7.6 Solve systems of linear inequalities The solution to a system of linear inequalities in two variable is a set of ordered pairs making.

5.1 Solving Systems of Linear Equations by Graphing

4.5: Linear Approximations, Differentials and Newton’s Method Greg Kelly, Hanford High School, Richland, Washington.

P2 Chapter 8 CIE Centre A-level Pure Maths © Adam Gibson.

Linear Approximations. In this section we’re going to take a look at an application not of derivatives but of the tangent line to a function. Of course,

Objectives: Graph (and write) inequalities on a number line.

Graphing Linear Equations

4.5: Linear Approximations, Differentials and Newton’s Method

6-6 Systems of Linear Inequalities

One-layer neural networks Approximation problems

4.5: Linear Approximations, Differentials and Newton’s Method

6.1 Solving Systems of Linear Equations by Graphing

Iterative Methods Good for sparse matrices Jacobi Iteration

هل يمكن أن نكون جيل الأرض الأخير؟

2.4 Writing the Equation of a Line

HOW TO NAVIGATE A LINEAR GRAPH IN SCIENCE OR MATH!

Warm Up Graph y = 4x and 16, $10’s and 7 $20’s.

Department of Computer Science University of York

2.4 Writing the Equation of a Line

9.3 – Graphing Linear Equations

8/29/12 Writing the Equation of a Line

Clustering 77B Recommender Systems

Objective Graph and solve systems of linear inequalities in two variables.

Floyd’s Algorithm (shortest-path problem)

Quiz 2.1 Review Whiteboards

3.8 Newton’s Method How do you find a root of the following function without a graphing calculator? This is what Newton did.

5.1 Solving Systems of Equations by Graphing

4.5: Linear Approximations, Differentials and Newton’s Method

Warm Up Graph y = 4x and 16, $10’s and 7 $20’s.

 = N  N matrix multiplication N = 3 matrix N = 3 matrix N = 3 matrix

Systems of Equations Solve by Graphing.

4.5: Linear Approximations, Differentials and Newton’s Method

4 minutes Warm-Up Solve and graph. 1) 2).

Integrated Math One Module 5 Test Review.

Graph Linear Inequalities in Two Variables

2.4 Writing the Equation of a Line

Notes Over 6.1 Graphing a Linear Inequality Graph the inequality.

Presentation transcript:

Rewriting the book on Earthquake Locations Ethan Coon (APAM) Felix Waldhauser (LDEO)

Day One The science: Earthquake relocation The math: Deriving a linear system hypoDD: an algorithm for relocation Day Two Solving the linear system Results and scaling Future work

hypoDD Algorithm Read in initial location data (initial guesses) Form cross-correlations for available pairs of waveforms Use Clustering algorithm to form graph of earthquake pairs Form matrix of the arrival time derivatives (simple model) Compute weights based on measurement quality and distance between events Linear solve for changes in earthquake locations ~ 20 iterations for convergence with changing weights ~ 80% of clock time (on system of ~ 1k events) PETSC !