Keith Dalbey, PhD. Sandia National Labs, Dept 1441 Optimization & Uncertainty Quantification

Similar documents
Segmentation of Casting Defects in X-Ray Images Based on Fractal Dimension

IP Network Design by Modified Branch Exchange Method

Image Enhancement in the Spatial Domain. Spatial Domain

Optical Flow for Large Motion Using Gradient Technique

Concomitants of Upper Record Statistics for Bivariate Pseudo Weibull Distribution

MapReduce Optimizations and Algorithms 2015 Professor Sasu Tarkoma

Color Interpolation for Single CCD Color Camera

Controlled Information Maximization for SOM Knowledge Induced Learning

A modal estimation based multitype sensor placement method

A Novel Automatic White Balance Method For Digital Still Cameras

Journal of World s Electrical Engineering and Technology J. World. Elect. Eng. Tech. 1(1): 12-16, 2012

Methods for history matching under geological constraints Jef Caers Stanford University, Petroleum Engineering, Stanford CA , USA

17/5/2009. Introduction

10/29/2010. Rendering techniques. Global Illumination. Local Illumination methods. Today : Global Illumination Modules and Methods

High performance CUDA based CNN image processor

SCR R&D and control development combining GT-SUITE and TNO models. GTI user-conference

A Two-stage and Parameter-free Binarization Method for Degraded Document Images

i-pcgrid Workshop 2016 April 1 st 2016 San Francisco, CA

Prof. Feng Liu. Fall /17/2016

Detection and Recognition of Alert Traffic Signs

Any modern computer system will incorporate (at least) two levels of storage:

Assessment of Track Sequence Optimization based on Recorded Field Operations

Method of controlling access to intellectual switching nodes of telecommunication networks and systems

Monte Carlo Techniques for Rendering

Point-Biserial Correlation Analysis of Fuzzy Attributes

An Unsupervised Segmentation Framework For Texture Image Queries

Lecture # 04. Image Enhancement in Spatial Domain

On Error Estimation in Runge-Kutta Methods

A Recommender System for Online Personalization in the WUM Applications

Fifth Wheel Modelling and Testing

A Shape-preserving Affine Takagi-Sugeno Model Based on a Piecewise Constant Nonuniform Fuzzification Transform

Frequency Domain Approach for Face Recognition Using Optical Vanderlugt Filters

Prediction of Time Series Using RBF Neural Networks: A New Approach of Clustering

Information Retrieval. CS630 Representing and Accessing Digital Information. IR Basics. User Task. Basic IR Processes

Effective Missing Data Prediction for Collaborative Filtering

A Memory Efficient Array Architecture for Real-Time Motion Estimation

ADDING REALISM TO SOURCE CHARACTERIZATION USING A GENETIC ALGORITHM

LOSSLESS audio coding is used in such applications as

Gravitational Shift for Beginners

And Ph.D. Candidate of Computer Science, University of Putra Malaysia 2 Faculty of Computer Science and Information Technology,

New Algorithms for Daylight Harvesting in a Private Office

A New Finite Word-length Optimization Method Design for LDPC Decoder

Illumination methods for optical wear detection

Towards Adaptive Information Merging Using Selected XML Fragments

Transmission Lines Modeling Based on Vector Fitting Algorithm and RLC Active/Passive Filter Design

Goal. Rendering Complex Scenes on Mobile Terminals or on the web. Rendering on Mobile Terminals. Rendering on Mobile Terminals. Walking through images

An Optimised Density Based Clustering Algorithm

Topic -3 Image Enhancement

Color Correction Using 3D Multiview Geometry

Modelling, simulation, and performance analysis of a CAN FD system with SAE benchmark based message set

PROBABILITY-BASED OPTIMAL PATH PLANNING FOR TWO-WHEELED MOBILE ROBOTS

Research Article. Regularization Rotational motion image Blur Restoration

Physical simulation for animation

Comparisons of Transient Analytical Methods for Determining Hydraulic Conductivity Using Disc Permeameters

Hierarchically Clustered P2P Streaming System

Decision Support for Rule and Technique Discovery in an Uncertain Environment

ANN Models for Coplanar Strip Line Analysis and Synthesis

Cellular Neural Network Based PTV

Strictly as per the compliance and regulations of:

CS 450: COMPUTER GRAPHICS RASTERIZING CONICS SPRING 2016 DR. MICHAEL J. REALE

A VECTOR PERTURBATION APPROACH TO THE GENERALIZED AIRCRAFT SPARE PARTS GROUPING PROBLEM

POMDP: Introduction to Partially Observable Markov Decision Processes Hossein Kamalzadeh, Michael Hahsler

FINITE ELEMENT MODEL UPDATING OF AN EXPERIMENTAL VEHICLE MODEL USING MEASURED MODAL CHARACTERISTICS

Lecture 27: Voronoi Diagrams

Elastohydrodynamic Lubrication Analysis of Journal Bearings Using CAD

Multi-azimuth Prestack Time Migration for General Anisotropic, Weakly Heterogeneous Media - Field Data Examples

Haptic Glove. Chan-Su Lee. Abstract. This is a final report for the DIMACS grant of student-initiated project. I implemented Boundary

How Easy is Matching 2D Line Models Using Local Search?

Statistics of Images. Ioannis Rekleitis

MULTI-TEMPORAL AND MULTI-SENSOR IMAGE MATCHING BASED ON LOCAL FREQUENCY INFORMATION

University of Hertfordshire Department of Mathematics. Some comments on the approximation of the radial basis functions in the dual reciprocity method

User Group testing report

Topological Characteristic of Wireless Network

Linear Ensembles of Word Embedding Models

Obstacle Avoidance of Autonomous Mobile Robot using Stereo Vision Sensor

Scaling Location-based Services with Dynamically Composed Location Index

INCORPORATION OF ADVANCED NUMERICAL FIELD ANALYSIS TECHNIQUES IN THE INDUSTRIAL TRANSFORMER DESIGN PROCESS

a Not yet implemented in current version SPARK: Research Kit Pointer Analysis Parameters Soot Pointer analysis. Objectives

4.2. Co-terminal and Related Angles. Investigate

Adaptation of TDMA Parameters Based on Network Conditions

MODELING TOOL FAILURES IN SEMICONDUCTOR FAB SIMULATION. Oliver Rose. Institute of Computer Science University of Würzburg Würzburg, 97074, GERMANY.

Conservation Law of Centrifugal Force and Mechanism of Energy Transfer Caused in Turbomachinery

n If S is in convex position, then thee ae exactly k convex k-gons detemined by subsets of S. In geneal, howeve, S may detemine fa fewe convex k-gons.

AUTOMATED LOCATION OF ICE REGIONS IN RADARSAT SAR IMAGERY

POLYMER PARTS PRODUCTION SIMULATION FOR DOMESTIC REFRIGERATORS

Link Prediction in Heterogeneous Networks Based on Tensor Factorization

HISTOGRAMS are an important statistic reflecting the

AN ANALYSIS OF COORDINATED AND NON-COORDINATED MEDIUM ACCESS CONTROL PROTOCOLS UNDER CHANNEL NOISE

A MULTIRESOLUTION AND OPTIMIZATION-BASED IMAGE MATCHING APPROACH: AN APPLICATION TO SURFACE RECONSTRUCTION FROM SPOT5-HRS STEREO IMAGERY

A ROI Focusing Mechanism for Digital Cameras

Experimental and numerical simulation of the flow over a spillway

(1) W tcp = (3) N. Assuming 1 P r 1. = W r (4) a 1/(k+1) W 2/(k+1)

Two-Dimensional Coding for Advanced Recording

Directional Stiffness of Electronic Component Lead

Fast quality-guided flood-fill phase unwrapping algorithm for three-dimensional fringe pattern profilometry

NODAL AND LOOP ANALYSIS TECHNIQUES

Communication vs Distributed Computation: an alternative trade-off curve

An Assessment of the Efficiency of Close-Range Photogrammetry for Developing a Photo-Based Scanning Systeminthe Shams Tabrizi Minaret in Khoy City

vaiation than the fome. Howeve, these methods also beak down as shadowing becomes vey signicant. As we will see, the pesented algoithm based on the il

A Neural Network Model for Storing and Retrieving 2D Images of Rotated 3D Object Using Principal Components

Transcription:

SAND 0-50 C Effective & Efficient Handling of Ill - Conditioned Coelation atices in Kiging & adient Enhanced Kiging Emulatos hough Pivoted Cholesky Factoization Keith Dalbey, PhD Sandia National Labs, Dept 44 Optimization & Uncetainty Quantification David Day, PhD, Dept 44, Numeical Analysis ak Hoemmen, Dept 46, Scalable Algoithms Apil, 0 Sandia National Laboatoies is a multi-pogam laboatoy managed and opeated by Sandia Copoation, a wholly owned subsidiay of Lockheed atin Copoation, fo the U.S. Depatment of Enegy s National Nuclea Secuity Administation unde contact DE-AC04-94AL85000

Outline Intoduction Kiging Emulatos adient Enhanced Kiging (EK) Ways to Handle Ill-Conditioning Pivoted Cholesky fo Kiging Pivoted Cholesky fo EK Pivoted Cholesky Details esults Conclusions Cuent / Futue Wok

Intoduction Emulatos built fom small amount of build data can be used as fast suogates fo computationally epensive simulatos Kiging/P emulatos ae popula because they poduce: Best guess estimate that intepolates build data (as long as coelation mati,, is eal symmetic and positive definite) & Estimate of pediction eo away fom build points. But pooly spaced o lage amounts of build data can make ill-conditioned (ead as numeically singula) which voids the waanty so we need to handle ill-conditioned adient Enhanced Kiging (EK) is becoming popula because of new simulation techniques (e.g. Automatic Diffeentiation, yan Stakey) that poduce function value + gadient fo cost of about o fewe function values (highe info/cost atio)

Kiging Emulatos Also known as aussian Pocess Emulatos Bayes Linea ethod BLUP BLUE Diffeences among them ae mino. All have: unadjusted mean (fequently a least squaes fit) coection/adjustment to mean based on data estimated distibution about adjusted mean of possible tue sufaces

g g y Va g y E ˆ Coelation paametes,, elated to coelation lengths, L, by d =/( L d ) Kiging Emulatos d d j d d j j, ep, i j j i i i j i i j j i g,,,,, N N ˆ

Pos: oe info (equations) pe cost uch bette conditioned fo same # of equations Cons: uch wose conditioned fo same numbe of points N N N,,,,,, How?: Deive with assumptions simila to egula Kiging o eplace adient Enhanced Kiging (EK)

I J I J J I J I adient Enhanced Kiging (EK)

Some Options: Ways to Handle Ill-Conditioning Shink coelation lengths, L: but adjusted mean may degeneate into unadjusted mean too quickly Add nugget to diagonal of : but causes Kiging o EK to appoimate (smooth) instead of intepolate (ask youself if eally need to intepolate, you might not) Use mitue coelation model: weighted sum of Shot L and with Long L (weight () s too) L Use good subset of available build data: will intepolate subset you keep but how do you efficiently select good subset? New Answe: Pivoted Cholesky Factoization (checks diffeent optimal subset fo each candidate L o ) S with

Pivoted Cholesky fo Kiging Pivoted Cholesky sots equations in accoding to how much new infomation they contain. When soted, equations with moe infomation come befoe equations with less infomation Can then use LAPACK cond() estimate and bisection seach to efficiently detemine how many low info equations need to be dopped off the end Dopped equations ae ones that contain the least new info and so ae easiest to pedict Caig Lucas, LAPACK-Style Codes fo Level and 3 Pivoted Cholesky Factoizations, LAPACK Woking Note 6, 004 Lucas level 3 can (and often does) default to level and is not cost competitive with highly optimized level 3 LAPACK (non-pivoted) Cholesky fo lage matices

Pivoted Cholesky fo EK can be much lage than so Pivoted Cholesky on is vey slow (compaed to LAPACK s Cholesky) Pivoted Cholesky on also pefes deivative equations (highe infomation content) ove esponse values (bad because function values ae moe eliable than deivatives) Solution: Do pivoted Cholesky on not, then apply same odeing to whole points (a point s function value immediately followed by its deivatives) in LAPACK Cholesky on eodeed Cholesky cost by facto of (+) 3. hen do. educes Pivoted

Pivoted Cholesky Details Adaptive least squaes tend ode If using maimum likelihood to choose, need to optimize the pe equation log likelihood obj log ˆ only contains infomation about and inputs, it does not contain infomation about outputs so discontinuity in output not taken into consideation (but can compae diffeence between pedicted and actual discaded using ahalanobis distance*) det log log det N N Pivoted Cholesky can be used fo sample design * Using ahalanobis distance was suggested by ony O Hagan

EK esults fo osenbock

EK esults fo osenbock

Conclusions Pivoted Cholesky can handle ill-conditioning of Kiging s coelation mati by efficiently selecting an optimal subset of available build data points Dopped points ae ones that contain the least new infomation and so ae easiest to pedict Pivoted Cholesky can be used: to detect discontinuities in the esponse fo sample design to detemine good set of Long coelation lengths in mitue model Kiging / P

Cuent / Futue Wok aussian Pocess guided Adaptive mitue Impotance Sampling (PAIS, doesn t need to intepolate, does need all data so add nugget to handle ill-conditioning) to be pesented husday 9:30-9:55 A in S67 by Laua Swile & at Quality & Poductivity eseach Confeence June 4-7, 0 Synopsis: A tool fo managing V&V / UQ activities and data UI font end fo SVN epositoy that implements fomal best pactices pocess (including incemental eview and appoval, assessment, etc.) fo V&V and UQ P. Knupp and A. Ubina, "A Design fo a V&V and UQ Discovey Pocess," SAND0-6677, Sandia National Laboatoies, 0.

Calculating Pobability of Failue with PAIS Impotance Sampling educes onte Calo s eo vaiance by dawing moe samples fom impotant egions & appopiately down-weighting I unknown so optimal impotance density is unknown aussian Pocess Adaptive Impotance Sampling uses seies of impoving P appoimations of, in a mitue appoimation of, itue impotance sampling is not much wose than impotance sampling fom the best of the mitue components [Owen & Zhou 000] j-th component P appoimation is eal valued Epected Indicato is the point-wise potion of P s aussian CDF past the failue theshold

Hebie Function

PAIS On Hebie Function

PAIS On Hebie Function

Synopsis Sceen Shot