Review of the Grand Inversion UCERF3.1 Tom Jordan 18 December 2012.

Slides:



Advertisements
Similar presentations
Structural reliability analysis with probability- boxes Hao Zhang School of Civil Engineering, University of Sydney, NSW 2006, Australia Michael Beer Institute.
Advertisements

1 Transportation problem The transportation problem seeks the determination of a minimum cost transportation plan for a single commodity from a number.
Modeling the Process and Life Cycle CSCI 411 Advanced Database and Project Management Monday, February 2, 2015.
Materials for Lecture 11 Chapters 3 and 6 Chapter 16 Section 4.0 and 5.0 Lecture 11 Pseudo Random LHC.xls Lecture 11 Validation Tests.xls Next 4 slides.
Acoustic design by simulated annealing algorithm
Assessment. Schedule graph may be of help for selecting the best solution Best solution corresponds to a plateau before a high jump Solutions with very.
World Health Organization
Planning under Uncertainty
FIN 685: Risk Management Topic 5: Simulation Larry Schrenk, Instructor.
Programming Assignment #3 CS-2301, B-Term Programming Assignment #3 User-defined Functions Due, November 18, 11:59 PM (Assignment adapted from C:
A new crossover technique in Genetic Programming Janet Clegg Intelligent Systems Group Electronics Department.
Stat Today: General Linear Model Assignment 1:
Steps of a sound simulation study
Simulation.
Differentiated Multimedia Web Services Using Quality Aware Transcoding S. Chandra, C.Schlatter Ellis and A.Vahdat InfoCom 2000, IEEE Journal on Selected.
Planning operation start times for the manufacture of capital products with uncertain processing times and resource constraints D.P. Song, Dr. C.Hicks.
Lecture 10 Comparison and Evaluation of Alternative System Designs.
Spring 2014 Student Performance Analysis Algebra I Standards of Learning Presentation may be paused and resumed using the arrow keys or the mouse.
The Calibration Process
1 Seventh Lecture Error Analysis Instrumentation and Product Testing.
Introduction to Simulated Annealing 22c:145 Simulated Annealing  Motivated by the physical annealing process  Material is heated and slowly cooled.
Decision analysis and Risk Management course in Kuopio
Chapter 5ELE Adaptive Signal Processing 1 Least Mean-Square Adaptive Filtering.
Elements of the Heuristic Approach
If we build an ETAS model based primarily on information from smaller earthquakes, will it work for forecasting the larger (M≥6.5) potentially damaging.
IE 594 : Research Methodology – Discrete Event Simulation David S. Kim Spring 2009.
Analysis of Simulation Results Andy Wang CIS Computer Systems Performance Analysis.
Calibration Guidelines 1. Start simple, add complexity carefully 2. Use a broad range of information 3. Be well-posed & be comprehensive 4. Include diverse.
CompuCell Software Current capabilities and Research Plan Rajiv Chaturvedi Jesús A. Izaguirre With Patrick M. Virtue.
The following minimum specified ranges should be considered: Drug substance or a finished (drug) product 80 to 120 % of the test concentration Content.
MARsite kickoff meeting December 19-20, 2012, Istanbul WP5 - TASK 2 Near real-time determination of the earthquake finite-fault source parameters and models,
Comments on UCERF 3 Art Frankel USGS For Workshop on Use of UCERF3 in the National Seismic Hazard Maps Oct , 2012.
Estimation Bias, Standard Error and Sampling Distribution Estimation Bias, Standard Error and Sampling Distribution Topic 9.
Two computations concerning fatigue damage and the Power Spectral Density Frank Sherratt.
The Basics and Pseudo Code
Neural Networks Ellen Walker Hiram College. Connectionist Architectures Characterized by (Rich & Knight) –Large number of very simple neuron-like processing.
Module 1: Statistical Issues in Micro simulation Paul Sousa.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Chapter 3 Dr. Bahaa Al-Sheikh & Eng. Mohammed Al-Sumady Intoduction to Engineering Introduction to Engineering Design 1.
Introduction to Spatial Microsimulation Dr Kirk Harland.
Fuel Cell Systems Engineering, F06 Fuel Cell Systems Engineering Systems Engineering Process.
Center for Radiative Shock Hydrodynamics Fall 2011 Review Assessment of predictive capability Derek Bingham 1.
An Adaptive-Stochastic Boussinesq Solver With Safety Critical Applications In Nuclear Reactor Engineering Andrew Hagues PhD Student – KNOO Work Package.
Solution of a Partial Differential Equations using the Method of Lines
Discrete Event Simulation & VHDL Prof. K. J. Hintz Dept. of Electrical and Computer Engineering George Mason University.
Evaluation of harvest control rules (HCRs): simple vs. complex strategies Dorothy Housholder Harvest Control Rules Workshop Bergen, Norway September 14,
The Markov Chain Monte Carlo Method Isabelle Stanton May 8, 2008 Theory Lunch.
Some General Implications of Results Because hazard estimates at a point are often dominated by one or a few faults, an important metric is the participation.
Exploring Microsimulation Methodologies for the Estimation of Household Attributes Dimitris Ballas, Graham Clarke, and Ian Turton School of Geography University.
Genetic algorithms: A Stochastic Approach for Improving the Current Cadastre Accuracies Anna Shnaidman Uri Shoshani Yerach Doytsher Mapping and Geo-Information.
Colorado Center for Astrodynamics Research The University of Colorado 1 STATISTICAL ORBIT DETERMINATION Kalman Filter with Process Noise Gauss- Markov.
Part.2.1 In The Name of GOD FAULT TOLERANT SYSTEMS Part 2 – Canonical Structures Chapter 2 – Hardware Fault Tolerance.
© P. Pongcharoen CCSI/1 Scheduling Complex Products using Genetic Algorithms with Alternative Fitness Functions P. Pongcharoen, C. Hicks, P.M. Braiden.
ChE 551 Lecture 04 Statistical Tests Of Rate Equations 1.
A PRELIMINARY EMPIRICAL ASSESSMENT OF SIMILARITY FOR COMBINATORIAL INTERACTION TESTING OF SOFTWARE PRODUCT LINES Stefan Fischer Roberto E. Lopez-Herrejon.
Statistical Concepts Basic Principles An Overview of Today’s Class What: Inductive inference on characterizing a population Why : How will doing this allow.
SEMINAR ON PRESENTED BY BRAHMABHATT BANSARI K. M. PHARM PART DEPARTMENT OF PHARMACEUTICS AND PHARMACEUTICAL TECHNOLGY L. M. COLLEGE OF PHARMACY.
F73DA2 INTRODUCTORY DATA ANALYSIS ANALYSIS OF VARIANCE.
Error calculations and error convergence Winter Semester
Hirophysics.com The Genetic Algorithm vs. Simulated Annealing Charles Barnes PHY 327.
Digital Optimization Martynas Vaidelys.
A Comparison of Simulated Annealing and Genetic Algorithm Approaches for Cultivation Model Identification Olympia Roeva.
Chapter 11: Simple Linear Regression
The Calibration Process
Boltzmann Machine (BM) (§6.4)
Energy Resources Engineering Department Stanford University, CA, USA
What to look at in fire engineering analysis
Simulated Annealing & Boltzmann Machines
Srinivas Neginhal Anantharaman Kalyanaraman CprE 585: Survey Project
Presentation transcript:

Review of the Grand Inversion UCERF3.1 Tom Jordan 18 December 2012

Grand Inversion equations for UCERF3.1

Simulated Annealing E xi*xi*xi#xi#

NO YES NO compute energy E = Σ[A ji (x i + Δx i ) – d j ] 2 + ΣH k [B kj (x j + Δx j ) – d k ] 2 initialize x i = x i *, Δx i = 0, n = 0 T ≤ T min or n = n max ? E ≤ E prev ? compute Δx i x i + Δx i ≥ 0? n = n + 1 update temperature T exit with lowest E solution compute trans. prob. P = exp[(E prev – E)/T] P > P rand ? update solution x i = x i + Δx i NO YES Grand Inversion simulated annealing algorithm for UCERF3.1 (single processor) (Page, Field & Milner, 2012) Default: Δx i = 10 –3 (rand# – 0.5) [eqk/yr] for rand# on [0,1] P rand = rand# on [0,1] Default: T = 1/n load constraints in canonical form: A ji x i = d j, B ki x i ≤ d k,, x i ≥ 0 randomly select x i H k = 0 if B kj (x j + Δx j ) ≤ d k H k = 1 if B kj (x j + Δx j ) > d k Default (characteristic branch): UCERF2 or waterlevels

Conclusions a.The GI seems to be doing what it's supposed to do, although further verification steps are recommended. –In particular, the dependence of the solutions on starting model and annealing schedule need to be investigated for the full UCERF3.1 problem configuration. b.The SA algorithm used in the parallel code differs from that used in the serial code. –Comparison tests are recommended to make sure the effects of the algorithmic differences on the solutions are understood. c.The number of constraints is substantially less than the number of model components, so the solution is nonunique. –For UCERF3.1, M = 234,188 unknowns, and N = J + K = 34,466 constraints. –The manifold of acceptable solutions cannot be evaluated using standard linear resolving power tests (owing to the inequality constraints) but can be partially explored through large suites of inversions. d.Solutions for the UCERF3.1 Zeng characteristic reference branch show problems in fits to data subsets, but these misfits appear to result from inconsistencies in the data, rather than problems in the data inversion.

Conclusions e.Averaging over large sets of solutions provides a smoother, less-compact solution vector, suitable for use as a reference solution. –The variation of rupture rates and integral measures such as slip rates from large solution sets should be used to quantify the nonuniqueness and assess its hazard implications. f.The nonuniqueness of UCERF3.1 solutions appears to be primarily local; e.g., integration over the rupture rates for different solutions yields similar slip rates, even at the level of individual fault elements. –To test this hypothesis, non-local tradeoffs in the solution set should be explored by looking for large cross-correlations among rupture rates on different fault segments. g.Owing to the stochastic nature of the SA algorithm, GI solutions are not deterministically reproducible. –Given the importance of reproducibility in hazard calculations, it may be useful to define "statistical reproducibility" using location and dispersion measures from large solution sets. The validity of this concept should be investigated using synthetic-data and real-data tests.

Specific Recommendations Energy convergence tests. E vs. n plots should be monitored for the 100-run reference-branch solution sets to see how well solutions from the serial and parallel codes converge to similar data fits using the preferred annealing schedules. Slip-rate convergence tests. The solution-set range in slip rates for all fault elements should be analyzed, and the hazard implications of elements with high variance should be evaluated. Starting-model convergence tests. Reference-branch solution sets should be computed for various types of starting models, including UCERF2, near-zero, and randomized starting models, and the solution-set ranges should be examined for hazard implications. Annealing-schedule convergence tests. Reference-branch solution sets should be computed for slower annealing schedules, and differences in the solution-set ranges from the fast-annealed reference branch should be examined for hazard implications.

Specific Recommendations Synthetic data tests. Invert synthetic data calculated from the mean vector of the solution set derived for the UCERF3.1 Zeng characteristic reference branch. The synthetic data should include the mean-solution MFDs as targets (rather than UCERF2 MFDs). Documentation. –The documentation of the serial and parallel SA algorithms in Appendix N should include the level of detail in the flowchart. Any differences with standard SA practices should be fully described, and their possible effects on the solution sets should be assessed. –Verification and reproducibility exercises should include quantitative comparisons of the solution sets from the serial and parallel codes, and the results should be documented in Appendix N.