Quantifying conformation fluctuation induced uncertainty in bio-molecular systems

Size: px
Start display at page:

Download "Quantifying conformation fluctuation induced uncertainty in bio-molecular systems"

Transcription

1 Quantifying conformation fluctuation induced uncertainty in bio-molecular systems Guang Lin, Dept. of Mathematics & School of Mechanical Engineering, Purdue University Collaborative work with Huan Lei, Xiu Yang, Bin Zhang, Nathan Baker, PNNL 2015 IMA Hot Topics Workshop on Uncertainty Quantification in Materials Modeling, Purdue University, West Lafayette, IN, Aug. 31, arxiv: This work is supported by DOE grant for the Collaboratory on Mathematics for Mesoscopic Modeling of Materials (CM4)

2 Construct stochastic model of conformation fluctuation Numerical methods to construct the surrogated model Numerical Example: SASA of individual/total residues Background & Motivation A biomolecule in equilibrium: static or dynamic? Target properties: deterministic or stochastic? Figure: Tube diagram of the molecule Trypsin inhibitor (PDB code: 5pti) under equilibrium. Quantifying the influence of conformational uncertainty in biomolecular solvation

3 Outline Construct stochastic model of conformation fluctuation Numerical methods to construct the surrogated model Numerical Example: SASA of individual/total residues 1 Construct stochastic model of conformation fluctuation 2 Numerical methods to construct the surrogated model 3 Numerical Example: SASA of individual/total residues Quantifying the influence of conformational uncertainty in biomolecular solvation

4 Construct stochastic model of conformation fluctuation Numerical methods to construct the surrogated model Numerical Example: SASA of individual/total residues Construct the stochastic model Approximate the potential energy of molecule fluctuation by V (R, R) = γ (r ij r ij ) 2 h(r c r ij ) 2 i<j R T = [ r T 1 r T 2 r T N ] - equilibrium position; R T = [ r T 1 rt 2 rt N ] - instantaneous position; γ - elastic coefficient; r c - cut-off distance. Define the Hessian matrix H 11 H 12 H 1N H 21 H 22 H 2N H =.,H ij = H N1 H N2 H NN 2 V X i X j 2 V Y i X j 2 V Z i X j 2 V X i Y j 2 V Y i Y j 2 V Z i Y j 2 V X i Z j 2 V Y i Z j 2 V Z i Z j Fluctuation correlation between the residues i and j Ri R T k B T [ j = H 1 ] γ ij Quantifying the influence of conformational uncertainty in biomolecular solvation

5 Construct stochastic model of conformation fluctuation Numerical methods to construct the surrogated model Numerical Example: SASA of individual/total residues Full stochastic model Eigenvalue decomposition H = WΛW T, Λ = diag(λ 1,, λ 3N 6 ) λ i - the i-th nonzero eigenvalues of H, w i - i-th eigenvector of H. Correlation matrix C can be determined by C ij R i R T j C = k BT γ WΛ 1 W = UU T, Stochastic conformation states are generated by R(ξ) = R + R(ξ) R(ξ) = Uξ ξ - 3N 6 dimensional standard normal random vector. Target property X (ξ) := X (R(ξ)). Quantifying the influence of conformational uncertainty in biomolecular solvation

6 Construct stochastic model of conformation fluctuation Numerical methods to construct the surrogated model Numerical Example: SASA of individual/total residues Reduced stochastic model For local property X {p} on residue p, R X {p} could be sparse, i.e., X {p} R j = 0 if X {p} on residue p is independent of R j. Correlation matrix C can be reduced to C C ij = C ij h(r p c r ip )h(r p c r jp ), r pi = r p r i, r pj = r p r j, r p c - cut-off distance for X {p}. Residue label C C {p} Residue label Figure: Sketch of a typical reduced correlation matrix. C {p} = U {p} U {p}t, R {p} (ξ {p} ) = R {p} + U {p} ξ {p}, N d = 3 h(rc p r ip ), i X {p} (ξ {p} ) := X {p} (R(ξ {p} )) ξ {p} : d-dimensional normal random vector Quantifying the influence of conformational uncertainty in biomolecular solvation

7 Outline Construct stochastic model of conformation fluctuation Numerical methods to construct the surrogated model Numerical Example: SASA of individual/total residues 1 Construct stochastic model of conformation fluctuation 2 Numerical methods to construct the surrogated model 3 Numerical Example: SASA of individual/total residues Quantifying the influence of conformational uncertainty in biomolecular solvation

8 Generalized polynomial chaos (gpc) expansion in uncertainty quantification (UQ) (Ghanem and Spanos 1991; Xiu and Karniadakis, 2002) Quantity of interest, e.g., force, velocity, etc. truncation error i.i.d. random variables For input samples 1

9 Construct stochastic model of conformation fluctuation Numerical methods to construct the surrogated model Numerical Example: SASA of individual/total residues Generalized Polynomial Chaos Generalized Polynomial Chaos (gpc) helps to represent uncertainty. In practice, we truncate the gpc expansion up to polynomial order P X (ξ) X (ξ) = P α =0 c α ψ α (ξ) Construct gpc expansion: probabilistic collocation methods (e.g, tensor product, sparse grid method, etc.) Q X (ξ)ψ α (ξ)dp(ξ) X i ψ α (ξ i )w i, i=1 where X i - collocation point, w i - weight. Major challenge: For high dimensional system: large number of collocation points (e.g. d = 27, P = 2, Q = tensor product points) sensitive to numerical error accompanied with X Quantifying the influence of conformational uncertainty in biomolecular solvation

10 Construct stochastic model of conformation fluctuation Numerical methods to construct the surrogated model Numerical Example: SASA of individual/total residues Brief introduction to compressive sensing Consider a linear system Ψ M N c N 1 = u M 1. Ψ c = u When M < N, the system is underdetermined, it is possible to obtain c if c is a sparse vector. We may obtain it by solving the following optimization problem: Ψc + e = u, where e 2 ɛ, we modify (P h,0 ) as (P h,ɛ ) : min c c h subject to Ψc u 2 ɛ. 1. E.J. Candès, J. Romberg, T. Tao, IEEE Trans. Inform. Theory, D.L. Donoho, M. Elad, V.N. Temlyakov, IEEE Trans. Inform. Theory, Quantifying the influence of conformational uncertainty in biomolecular solvation

11 Construct stochastic model of conformation fluctuation Numerical methods to construct the surrogated model Numerical Example: SASA of individual/total residues Application to generalized polynomial chaos Consider a gpc expansion X (ξ) = α c αψ α (ξ). By sampling ξ, we obtain: N X (ξ 1 ) c α ψ α (ξ 1 ), α=0 N X (ξ 2 ) c α ψ α (ξ 2 ), α=0 which can be cast into the linear system: i.e., ψ 0 (ξ 1 ) ψ 1 (ξ 1 ) ψ N (ξ 1 ) c 0 X (ξ 1 ) ψ 0 (ξ 2 ) ψ 1 (ξ 2 ) ψ N (ξ 2 ) c X (ξ 2 )., ψ 0 (ξ M ) ψ 1 (ξ M ) ψ N (ξ M ) X (ξ M ) Ψc + e = X, where e is related to the truncation error. c N Quantifying the influence of conformational uncertainty in biomolecular solvation

12 Construct stochastic model of conformation fluctuation Numerical methods to construct the surrogated model Numerical Example: SASA of individual/total residues Critical Problem The sparsity of the gpc expansion is unknown a priori. Quantifying the influence of conformational uncertainty in biomolecular solvation

13 Sparsity exact sparse nearly sparse 1

14 Sparsity exact sparse norm : norm : Example: is called -sparse if nearly sparse is sparse if Example: best - sparse approximation of 1

15 Compressive Sensing in UQ Classical works: Donoho, Candes, Tao, Romberg, Boyd Orthonormal polynomial systems: Rauhut and Ward Application in UQ: Doostan and Owhadi Bayesian model uncertainty method: Karagiannis, Lin Mixed Shrinkage Prior procedure: Karagiannis, Konomi, Lin Sampling strategy: Rauhut and Ward 2012; Yan, Guo and Xiu 2012; Xu and Zhou 2014; Hampton and Doostan Enhancing sparsity: Candes, Wakin and Boyd 2008; Yang and Karniadakis 2013; Peng, Hampton and Doostan Adaptive basis selection: Jakeman, Eldred and Sargsyan Incorporating gradient information: Jakeman, Eldred and Sargsyan 2015; Lei, Yang, Zheng, Lin and Baker 2014; Peng, Hampton and Doostan

16 Increase the sparsity in the optimization Reweighted minimization (Candes, Wakin and Boyd 2008, Yang and Karniadakis 2013): It can be achieved iteratively: 4

17 Increase the sparsity intrinsically 5

18 Increase the sparsity intrinsically 6

19 Difficulties How to obtain? Understanding of the physical model How to compute the PDF of? may not be independent which may be an issue when generating new set of orthonormal polynomials. Does the matrix still have good properties? 7

20 A Special Case We consider a special case : are i.i.d. Gaussian, i.e., and the mapping is a rotation: are still i.i.d. Gaussian. are Hermite polynomials. are the value of Hermite polynomials at another set of input samples generated in the same manner (e.g., randn in MATLAB). 8

21 Example 9

22 Example 10

23 Rotation Matrix Active subspace method by Constantine, Dow and Wang (2014). Define the gradient matrix (outer product of gradient): where is symmetric and 11

24 Rotation Matrix Active subspace method by Constantine, Dow and Wang (2014). Define the gradient matrix (outer product of gradient): where is symmetric and is unknown! 12

25 Rotation matrix 13

26 Iteratively Construct Rotation Matrix Given the input sample and the output samples, the rotation matrix can be obtained iteratively to (possibly) improve its performance: In other words, where is the number of iterations. 14

27 Iteratively Construct Rotation Matrix Given the input sample and the output samples, the rotation matrix can be obtained iteratively to (possibly) improve its performance: In other words, where is the number of iterations. 15

28 Summary of the Algorithm Set iteration counter and set. 3. Construct measurement matrix as, and compute the gpc coefficients with compressive sensing method. 16

29 Summary of the Algorithm Set iteration counter and set. 3. Construct measurement matrix as, and compute the gpc coefficients with compressive sensing method. 4. Compute rotation matrix based on. 5. If is close to identity matrix or permutation matrix, stop. Otherwise, set, i.e., and go to step 3. 17

30 Outline Construct stochastic model of conformation fluctuation Numerical methods to construct the surrogated model Numerical Example: SASA of individual/total residues 1 Construct stochastic model of conformation fluctuation 2 Numerical methods to construct the surrogated model 3 Numerical Example: SASA of individual/total residues Quantifying the influence of conformational uncertainty in biomolecular solvation

31 Construct stochastic model of conformation fluctuation Numerical methods to construct the surrogated model Numerical Example: SASA of individual/total residues Solvent Accessible Surface Area of individual residues C C {p} 0.1 Figure: Molecule Trypsin inhibitor (PDB code: 5pti) under equilibrium. Probability density distribution full correlation matrix reduced correlation matrix zero off diagonal element SASA Figure: Probability density function of the Solvent accessible surface area (SASA) of the 14th residue. Quantifying the influence of conformational uncertainty in biomolecular solvation

32 Construct stochastic model of conformation fluctuation Numerical methods to construct the surrogated model Numerical Example: SASA of individual/total residues gpc coefficient gpc coefficient ξ χ Normalized eigenvalue G C gpc basis index Figure: gpc coefficients c α with respect to ξ and χ Index Figure: Eigenvalues of the gradient matrix G and the correlation matrix C. Quantifying the influence of conformational uncertainty in biomolecular solvation

33 Construct stochastic model of conformation fluctuation Numerical methods to construct the surrogated model Numerical Example: SASA of individual/total residues Relative L 2 error We compute the relative L 2 error by ε Ns N s X (ξ i ) X (ξ i ) 2 / X (ξ i ) 2 i where N s - the number of sampling data (N s = 10 6.) i Relative L 2 error 10 1 CS (ξ) p = 2 p = 3 CS (χ) p = 2 p = 3 Sp level 1 (55 samples) Sp level 2 (1513 samples) Relative L 2 error 10 1 CS (ξ) p = 2 p = 3 CS (χ) p = 2 p = 3 Sp level 1 (55 samples) Sp level 2 (1513 samples) number of sample number of sample Figure: Symbols - gpc expansions X (χ) and X (ξ) by compressive sensing method. Dash lines - Sparse grid points on level 1 and 2. Quantifying the influence of conformational uncertainty in biomolecular solvation

34 Construct stochastic model of conformation fluctuation Numerical methods to construct the surrogated model Numerical Example: SASA of individual/total residues Probability density function probability density distribution MC (10 6 samples) SP level 1 (55 samples) SP level 2 (1513 samples) CS (300 samples) MC (300 samples) SASA (a) K L divergence SP level 1 (55 samples) MC (300 samples) MC (1200 samples) CS (χ) number of sample 600 (b) Quantifying the influence of conformational uncertainty in biomolecular solvation

35 Construct stochastic model of conformation fluctuation Numerical methods to construct the surrogated model Numerical Example: SASA of individual/total residues Total SASA Relative L 2 error CS (ξ) CS (χ) SP level 1 (337 samples) < SASA N SASA gpc > CS (800 samples) CS (1600 samples) number of sample 2000 Figure: Relative L 2 error of the total SASA by gpc expansion SASA Figure: Mean error of the surrogated model for the total SASA in different regimes. Quantifying the influence of conformational uncertainty in biomolecular solvation

36 Summary Construct stochastic model of conformation fluctuation Numerical methods to construct the surrogated model Numerical Example: SASA of individual/total residues We proposed a framework based on gpc expansion to quantify the conformation fluctuation induced uncertainty in bio-molecular systems. We proposed a method to elevate the sparsity of the gpc expansion, yielding more accurate surrogated model. This method is well-suited for UQ study in bio-molecular system of high dimensionality, where sample points are often accompanied with numerical error. Quantifying the influence of conformational uncertainty in biomolecular solvation

37 Construct stochastic model of conformation fluctuation Numerical methods to construct the surrogated model Numerical Example: SASA of individual/total residues Acknowledgement We acknowledge helpful discussion from: T. Goddard, G. Karniadakis, W. Pan, G. Schenter, X. Wan, Z. Zhang, W. Zhou. We acknowledge financial support from DOE Grant for the new Collaboratory on Mathematics for Mesoscopic Modeling of Materials. Quantifying the influence of conformational uncertainty in biomolecular solvation

arxiv: v3 [math.na] 7 Dec 2018

arxiv: v3 [math.na] 7 Dec 2018 A data-driven framework for sparsity-enhanced surrogates with arbitrary mutually dependent randomness Huan Lei, 1, Jing Li, 1, Peiyuan Gao, 1 Panos Stinis, 1, 2 1, 3, and Nathan A. Baker 1 Pacific Northwest

More information

Polynomial chaos expansions for sensitivity analysis

Polynomial chaos expansions for sensitivity analysis c DEPARTMENT OF CIVIL, ENVIRONMENTAL AND GEOMATIC ENGINEERING CHAIR OF RISK, SAFETY & UNCERTAINTY QUANTIFICATION Polynomial chaos expansions for sensitivity analysis B. Sudret Chair of Risk, Safety & Uncertainty

More information

Uncertainty quantification for sparse solutions of random PDEs

Uncertainty quantification for sparse solutions of random PDEs Uncertainty quantification for sparse solutions of random PDEs L. Mathelin 1 K.A. Gallivan 2 1 LIMSI - CNRS Orsay, France 2 Mathematics Dpt., Florida State University Tallahassee, FL, USA SIAM 10 July

More information

Interpolation via weighted l 1 minimization

Interpolation via weighted l 1 minimization Interpolation via weighted l 1 minimization Rachel Ward University of Texas at Austin December 12, 2014 Joint work with Holger Rauhut (Aachen University) Function interpolation Given a function f : D C

More information

Strengthened Sobolev inequalities for a random subspace of functions

Strengthened Sobolev inequalities for a random subspace of functions Strengthened Sobolev inequalities for a random subspace of functions Rachel Ward University of Texas at Austin April 2013 2 Discrete Sobolev inequalities Proposition (Sobolev inequality for discrete images)

More information

Sparse polynomial chaos expansions in engineering applications

Sparse polynomial chaos expansions in engineering applications DEPARTMENT OF CIVIL, ENVIRONMENTAL AND GEOMATIC ENGINEERING CHAIR OF RISK, SAFETY & UNCERTAINTY QUANTIFICATION Sparse polynomial chaos expansions in engineering applications B. Sudret G. Blatman (EDF R&D,

More information

UC Irvine UC Irvine Previously Published Works

UC Irvine UC Irvine Previously Published Works UC Irvine UC Irvine Previously Published Works Title Atomic radius and charge parameter uncertainty in biomolecular solvation energy calculations Permalink https://escholarship.org/uc/item/9qx90765 Authors

More information

Pre-weighted Matching Pursuit Algorithms for Sparse Recovery

Pre-weighted Matching Pursuit Algorithms for Sparse Recovery Journal of Information & Computational Science 11:9 (214) 2933 2939 June 1, 214 Available at http://www.joics.com Pre-weighted Matching Pursuit Algorithms for Sparse Recovery Jingfei He, Guiling Sun, Jie

More information

A regularized least-squares method for sparse low-rank approximation of multivariate functions

A regularized least-squares method for sparse low-rank approximation of multivariate functions Workshop Numerical methods for high-dimensional problems April 18, 2014 A regularized least-squares method for sparse low-rank approximation of multivariate functions Mathilde Chevreuil joint work with

More information

ACTIVE SUBSPACES for dimension reduction in parameter studies

ACTIVE SUBSPACES for dimension reduction in parameter studies ACTIVE SUBSPACES for dimension reduction in parameter studies PAUL CONSTANTINE Ben L. Fryrear Assistant Professor Applied Mathematics & Statistics Colorado School of Mines activesubspaces.org @DrPaulynomial

More information

Solving the Stochastic Steady-State Diffusion Problem Using Multigrid

Solving the Stochastic Steady-State Diffusion Problem Using Multigrid Solving the Stochastic Steady-State Diffusion Problem Using Multigrid Tengfei Su Applied Mathematics and Scientific Computing Advisor: Howard Elman Department of Computer Science Sept. 29, 2015 Tengfei

More information

Stochastic Spectral Approaches to Bayesian Inference

Stochastic Spectral Approaches to Bayesian Inference Stochastic Spectral Approaches to Bayesian Inference Prof. Nathan L. Gibson Department of Mathematics Applied Mathematics and Computation Seminar March 4, 2011 Prof. Gibson (OSU) Spectral Approaches to

More information

AN INTRODUCTION TO COMPRESSIVE SENSING

AN INTRODUCTION TO COMPRESSIVE SENSING AN INTRODUCTION TO COMPRESSIVE SENSING Rodrigo B. Platte School of Mathematical and Statistical Sciences APM/EEE598 Reverse Engineering of Complex Dynamical Networks OUTLINE 1 INTRODUCTION 2 INCOHERENCE

More information

A Non-Intrusive Polynomial Chaos Method For Uncertainty Propagation in CFD Simulations

A Non-Intrusive Polynomial Chaos Method For Uncertainty Propagation in CFD Simulations An Extended Abstract submitted for the 44th AIAA Aerospace Sciences Meeting and Exhibit, Reno, Nevada January 26 Preferred Session Topic: Uncertainty quantification and stochastic methods for CFD A Non-Intrusive

More information

arxiv: v1 [math.na] 14 Sep 2017

arxiv: v1 [math.na] 14 Sep 2017 Stochastic collocation approach with adaptive mesh refinement for parametric uncertainty analysis arxiv:1709.04584v1 [math.na] 14 Sep 2017 Anindya Bhaduri a, Yanyan He 1b, Michael D. Shields a, Lori Graham-Brady

More information

Algorithms for Uncertainty Quantification

Algorithms for Uncertainty Quantification Algorithms for Uncertainty Quantification Lecture 9: Sensitivity Analysis ST 2018 Tobias Neckel Scientific Computing in Computer Science TUM Repetition of Previous Lecture Sparse grids in Uncertainty Quantification

More information

Minimal Element Interpolation in Functions of High-Dimension

Minimal Element Interpolation in Functions of High-Dimension Minimal Element Interpolation in Functions of High-Dimension J. D. Jakeman, A. Narayan, D. Xiu Department of Mathematics Purdue University West Lafayette, Indiana Random Model as a function We can consider

More information

Stochastic Collocation Methods for Polynomial Chaos: Analysis and Applications

Stochastic Collocation Methods for Polynomial Chaos: Analysis and Applications Stochastic Collocation Methods for Polynomial Chaos: Analysis and Applications Dongbin Xiu Department of Mathematics, Purdue University Support: AFOSR FA955-8-1-353 (Computational Math) SF CAREER DMS-64535

More information

Estimating functional uncertainty using polynomial chaos and adjoint equations

Estimating functional uncertainty using polynomial chaos and adjoint equations 0. Estimating functional uncertainty using polynomial chaos and adjoint equations February 24, 2011 1 Florida State University, Tallahassee, Florida, Usa 2 Moscow Institute of Physics and Technology, Moscow,

More information

Solving the steady state diffusion equation with uncertainty Final Presentation

Solving the steady state diffusion equation with uncertainty Final Presentation Solving the steady state diffusion equation with uncertainty Final Presentation Virginia Forstall vhfors@gmail.com Advisor: Howard Elman elman@cs.umd.edu Department of Computer Science May 6, 2012 Problem

More information

Fast Numerical Methods for Stochastic Computations

Fast Numerical Methods for Stochastic Computations Fast AreviewbyDongbinXiu May 16 th,2013 Outline Motivation 1 Motivation 2 3 4 5 Example: Burgers Equation Let us consider the Burger s equation: u t + uu x = νu xx, x [ 1, 1] u( 1) =1 u(1) = 1 Example:

More information

Uncertainty analysis of large-scale systems using domain decomposition

Uncertainty analysis of large-scale systems using domain decomposition Center for Turbulence Research Annual Research Briefs 2007 143 Uncertainty analysis of large-scale systems using domain decomposition By D. Ghosh, C. Farhat AND P. Avery 1. Motivation and objectives A

More information

Dinesh Kumar, Mehrdad Raisee and Chris Lacor

Dinesh Kumar, Mehrdad Raisee and Chris Lacor Dinesh Kumar, Mehrdad Raisee and Chris Lacor Fluid Mechanics and Thermodynamics Research Group Vrije Universiteit Brussel, BELGIUM dkumar@vub.ac.be; m_raisee@yahoo.com; chris.lacor@vub.ac.be October, 2014

More information

sparse and low-rank tensor recovery Cubic-Sketching

sparse and low-rank tensor recovery Cubic-Sketching Sparse and Low-Ran Tensor Recovery via Cubic-Setching Guang Cheng Department of Statistics Purdue University www.science.purdue.edu/bigdata CCAM@Purdue Math Oct. 27, 2017 Joint wor with Botao Hao and Anru

More information

Polynomial chaos expansions for structural reliability analysis

Polynomial chaos expansions for structural reliability analysis DEPARTMENT OF CIVIL, ENVIRONMENTAL AND GEOMATIC ENGINEERING CHAIR OF RISK, SAFETY & UNCERTAINTY QUANTIFICATION Polynomial chaos expansions for structural reliability analysis B. Sudret & S. Marelli Incl.

More information

A new method on deterministic construction of the measurement matrix in compressed sensing

A new method on deterministic construction of the measurement matrix in compressed sensing A new method on deterministic construction of the measurement matrix in compressed sensing Qun Mo 1 arxiv:1503.01250v1 [cs.it] 4 Mar 2015 Abstract Construction on the measurement matrix A is a central

More information

Large-Scale L1-Related Minimization in Compressive Sensing and Beyond

Large-Scale L1-Related Minimization in Compressive Sensing and Beyond Large-Scale L1-Related Minimization in Compressive Sensing and Beyond Yin Zhang Department of Computational and Applied Mathematics Rice University, Houston, Texas, U.S.A. Arizona State University March

More information

Sparse recovery for spherical harmonic expansions

Sparse recovery for spherical harmonic expansions Rachel Ward 1 1 Courant Institute, New York University Workshop Sparsity and Cosmology, Nice May 31, 2011 Cosmic Microwave Background Radiation (CMB) map Temperature is measured as T (θ, ϕ) = k k=0 l=

More information

New Coherence and RIP Analysis for Weak. Orthogonal Matching Pursuit

New Coherence and RIP Analysis for Weak. Orthogonal Matching Pursuit New Coherence and RIP Analysis for Wea 1 Orthogonal Matching Pursuit Mingrui Yang, Member, IEEE, and Fran de Hoog arxiv:1405.3354v1 [cs.it] 14 May 2014 Abstract In this paper we define a new coherence

More information

Intro BCS/Low Rank Model Inference/Comparison Summary References. UQTk. A Flexible Python/C++ Toolkit for Uncertainty Quantification

Intro BCS/Low Rank Model Inference/Comparison Summary References. UQTk. A Flexible Python/C++ Toolkit for Uncertainty Quantification A Flexible Python/C++ Toolkit for Uncertainty Quantification Bert Debusschere, Khachik Sargsyan, Cosmin Safta, Prashant Rai, Kenny Chowdhary bjdebus@sandia.gov Sandia National Laboratories, Livermore,

More information

Uncertainty Quantification and hypocoercivity based sensitivity analysis for multiscale kinetic equations with random inputs.

Uncertainty Quantification and hypocoercivity based sensitivity analysis for multiscale kinetic equations with random inputs. Uncertainty Quantification and hypocoercivity based sensitivity analysis for multiscale kinetic equations with random inputs Shi Jin University of Wisconsin-Madison, USA Shanghai Jiao Tong University,

More information

Design of Projection Matrix for Compressive Sensing by Nonsmooth Optimization

Design of Projection Matrix for Compressive Sensing by Nonsmooth Optimization Design of Proection Matrix for Compressive Sensing by Nonsmooth Optimization W.-S. Lu T. Hinamoto Dept. of Electrical & Computer Engineering Graduate School of Engineering University of Victoria Hiroshima

More information

Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise

Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published

More information

Uniqueness Conditions for A Class of l 0 -Minimization Problems

Uniqueness Conditions for A Class of l 0 -Minimization Problems Uniqueness Conditions for A Class of l 0 -Minimization Problems Chunlei Xu and Yun-Bin Zhao October, 03, Revised January 04 Abstract. We consider a class of l 0 -minimization problems, which is to search

More information

Uncertainty Quantification for multiscale kinetic equations with random inputs. Shi Jin. University of Wisconsin-Madison, USA

Uncertainty Quantification for multiscale kinetic equations with random inputs. Shi Jin. University of Wisconsin-Madison, USA Uncertainty Quantification for multiscale kinetic equations with random inputs Shi Jin University of Wisconsin-Madison, USA Where do kinetic equations sit in physics Kinetic equations with applications

More information

Generalized Orthogonal Matching Pursuit- A Review and Some

Generalized Orthogonal Matching Pursuit- A Review and Some Generalized Orthogonal Matching Pursuit- A Review and Some New Results Department of Electronics and Electrical Communication Engineering Indian Institute of Technology, Kharagpur, INDIA Table of Contents

More information

Stochastic Dimension Reduction

Stochastic Dimension Reduction Stochastic Dimension Reduction Roger Ghanem University of Southern California Los Angeles, CA, USA Computational and Theoretical Challenges in Interdisciplinary Predictive Modeling Over Random Fields 12th

More information

The Sparsest Solution of Underdetermined Linear System by l q minimization for 0 < q 1

The Sparsest Solution of Underdetermined Linear System by l q minimization for 0 < q 1 The Sparsest Solution of Underdetermined Linear System by l q minimization for 0 < q 1 Simon Foucart Department of Mathematics Vanderbilt University Nashville, TN 3784. Ming-Jun Lai Department of Mathematics,

More information

Near Ideal Behavior of a Modified Elastic Net Algorithm in Compressed Sensing

Near Ideal Behavior of a Modified Elastic Net Algorithm in Compressed Sensing Near Ideal Behavior of a Modified Elastic Net Algorithm in Compressed Sensing M. Vidyasagar Cecil & Ida Green Chair The University of Texas at Dallas M.Vidyasagar@utdallas.edu www.utdallas.edu/ m.vidyasagar

More information

Proper Generalized Decomposition for Linear and Non-Linear Stochastic Models

Proper Generalized Decomposition for Linear and Non-Linear Stochastic Models Proper Generalized Decomposition for Linear and Non-Linear Stochastic Models Olivier Le Maître 1 Lorenzo Tamellini 2 and Anthony Nouy 3 1 LIMSI-CNRS, Orsay, France 2 MOX, Politecnico Milano, Italy 3 GeM,

More information

Uncertainty Quantification via Sparse Polynomial Chaos Expansion

Uncertainty Quantification via Sparse Polynomial Chaos Expansion University of Colorado, Boulder CU Scholar Mechanical Engineering Graduate Theses & Dissertations Mechanical Engineering Spring 1-1-2015 Uncertainty Quantification via Sparse Polynomial Chaos Expansion

More information

Original Research. Sensitivity Analysis and Variance Reduction in a Stochastic NDT Problem

Original Research. Sensitivity Analysis and Variance Reduction in a Stochastic NDT Problem To appear in the International Journal of Computer Mathematics Vol. xx, No. xx, xx 2014, 1 9 Original Research Sensitivity Analysis and Variance Reduction in a Stochastic NDT Problem R. H. De Staelen a

More information

Interpolation-Based Trust-Region Methods for DFO

Interpolation-Based Trust-Region Methods for DFO Interpolation-Based Trust-Region Methods for DFO Luis Nunes Vicente University of Coimbra (joint work with A. Bandeira, A. R. Conn, S. Gratton, and K. Scheinberg) July 27, 2010 ICCOPT, Santiago http//www.mat.uc.pt/~lnv

More information

SENSITIVITY ANALYSIS IN NUMERICAL SIMULATION OF MULTIPHASE FLOW FOR CO 2 STORAGE IN SALINE AQUIFERS USING THE PROBABILISTIC COLLOCATION APPROACH

SENSITIVITY ANALYSIS IN NUMERICAL SIMULATION OF MULTIPHASE FLOW FOR CO 2 STORAGE IN SALINE AQUIFERS USING THE PROBABILISTIC COLLOCATION APPROACH XIX International Conference on Water Resources CMWR 2012 University of Illinois at Urbana-Champaign June 17-22,2012 SENSITIVITY ANALYSIS IN NUMERICAL SIMULATION OF MULTIPHASE FLOW FOR CO 2 STORAGE IN

More information

Introduction to Uncertainty Quantification in Computational Science Handout #3

Introduction to Uncertainty Quantification in Computational Science Handout #3 Introduction to Uncertainty Quantification in Computational Science Handout #3 Gianluca Iaccarino Department of Mechanical Engineering Stanford University June 29 - July 1, 2009 Scuola di Dottorato di

More information

The Sparsity Gap. Joel A. Tropp. Computing & Mathematical Sciences California Institute of Technology

The Sparsity Gap. Joel A. Tropp. Computing & Mathematical Sciences California Institute of Technology The Sparsity Gap Joel A. Tropp Computing & Mathematical Sciences California Institute of Technology jtropp@acm.caltech.edu Research supported in part by ONR 1 Introduction The Sparsity Gap (Casazza Birthday

More information

A Stochastic Collocation based. for Data Assimilation

A Stochastic Collocation based. for Data Assimilation A Stochastic Collocation based Kalman Filter (SCKF) for Data Assimilation Lingzao Zeng and Dongxiao Zhang University of Southern California August 11, 2009 Los Angeles Outline Introduction SCKF Algorithm

More information

Utilizing Adjoint-Based Techniques to Improve the Accuracy and Reliability in Uncertainty Quantification

Utilizing Adjoint-Based Techniques to Improve the Accuracy and Reliability in Uncertainty Quantification Utilizing Adjoint-Based Techniques to Improve the Accuracy and Reliability in Uncertainty Quantification Tim Wildey Sandia National Laboratories Center for Computing Research (CCR) Collaborators: E. Cyr,

More information

Uncertainty Quantification for multiscale kinetic equations with high dimensional random inputs with sparse grids

Uncertainty Quantification for multiscale kinetic equations with high dimensional random inputs with sparse grids Uncertainty Quantification for multiscale kinetic equations with high dimensional random inputs with sparse grids Shi Jin University of Wisconsin-Madison, USA Kinetic equations Different Q Boltmann Landau

More information

Uncertainty Quantification in MEMS

Uncertainty Quantification in MEMS Uncertainty Quantification in MEMS N. Agarwal and N. R. Aluru Department of Mechanical Science and Engineering for Advanced Science and Technology Introduction Capacitive RF MEMS switch Comb drive Various

More information

An Introduction to Sparse Approximation

An Introduction to Sparse Approximation An Introduction to Sparse Approximation Anna C. Gilbert Department of Mathematics University of Michigan Basic image/signal/data compression: transform coding Approximate signals sparsely Compress images,

More information

Noisy Signal Recovery via Iterative Reweighted L1-Minimization

Noisy Signal Recovery via Iterative Reweighted L1-Minimization Noisy Signal Recovery via Iterative Reweighted L1-Minimization Deanna Needell UC Davis / Stanford University Asilomar SSC, November 2009 Problem Background Setup 1 Suppose x is an unknown signal in R d.

More information

Uncertainty Quantification in Computational Models

Uncertainty Quantification in Computational Models Uncertainty Quantification in Computational Models Habib N. Najm Sandia National Laboratories, Livermore, CA, USA Workshop on Understanding Climate Change from Data (UCC11) University of Minnesota, Minneapolis,

More information

A Brief Overview of Practical Optimization Algorithms in the Context of Relaxation

A Brief Overview of Practical Optimization Algorithms in the Context of Relaxation A Brief Overview of Practical Optimization Algorithms in the Context of Relaxation Zhouchen Lin Peking University April 22, 2018 Too Many Opt. Problems! Too Many Opt. Algorithms! Zero-th order algorithms:

More information

Benjamin L. Pence 1, Hosam K. Fathy 2, and Jeffrey L. Stein 3

Benjamin L. Pence 1, Hosam K. Fathy 2, and Jeffrey L. Stein 3 2010 American Control Conference Marriott Waterfront, Baltimore, MD, USA June 30-July 02, 2010 WeC17.1 Benjamin L. Pence 1, Hosam K. Fathy 2, and Jeffrey L. Stein 3 (1) Graduate Student, (2) Assistant

More information

Application and validation of polynomial chaos methods to quantify uncertainties in simulating the Gulf of Mexico circulation using HYCOM.

Application and validation of polynomial chaos methods to quantify uncertainties in simulating the Gulf of Mexico circulation using HYCOM. Application and validation of polynomial chaos methods to quantify uncertainties in simulating the Gulf of Mexico circulation using HYCOM. Mohamed Iskandarani Matthieu Le Hénaff Carlisle Thacker University

More information

A Polynomial Chaos Approach to Robust Multiobjective Optimization

A Polynomial Chaos Approach to Robust Multiobjective Optimization A Polynomial Chaos Approach to Robust Multiobjective Optimization Silvia Poles 1, Alberto Lovison 2 1 EnginSoft S.p.A., Optimization Consulting Via Giambellino, 7 35129 Padova, Italy s.poles@enginsoft.it

More information

Compressed Sensing and Linear Codes over Real Numbers

Compressed Sensing and Linear Codes over Real Numbers Compressed Sensing and Linear Codes over Real Numbers Henry D. Pfister (joint with Fan Zhang) Texas A&M University College Station Information Theory and Applications Workshop UC San Diego January 31st,

More information

CS 229r: Algorithms for Big Data Fall Lecture 19 Nov 5

CS 229r: Algorithms for Big Data Fall Lecture 19 Nov 5 CS 229r: Algorithms for Big Data Fall 215 Prof. Jelani Nelson Lecture 19 Nov 5 Scribe: Abdul Wasay 1 Overview In the last lecture, we started discussing the problem of compressed sensing where we are given

More information

Compressed Sensing and Related Learning Problems

Compressed Sensing and Related Learning Problems Compressed Sensing and Related Learning Problems Yingzhen Li Dept. of Mathematics, Sun Yat-sen University Advisor: Prof. Haizhang Zhang Advisor: Prof. Haizhang Zhang 1 / Overview Overview Background Compressed

More information

Multipath Matching Pursuit

Multipath Matching Pursuit Multipath Matching Pursuit Submitted to IEEE trans. on Information theory Authors: S. Kwon, J. Wang, and B. Shim Presenter: Hwanchol Jang Multipath is investigated rather than a single path for a greedy

More information

arxiv: v1 [physics.comp-ph] 21 Jun 2016

arxiv: v1 [physics.comp-ph] 21 Jun 2016 Systematic parameter inference in stochastic mesoscopic modeling Huan Lei a, Xiu Yang a, Zhen Li b, George Em Karniadakis b, a Pacific Northwest National Laboratory, Richland, WA 99352, USA b Division

More information

Sparse Approximation of PDEs based on Compressed Sensing

Sparse Approximation of PDEs based on Compressed Sensing Sparse Approximation of PDEs based on Compressed Sensing Simone Brugiapaglia Department of Mathematics Simon Fraser University Retreat for Young Researchers in Stochastics September 24, 26 2 Introduction

More information

Collocation based high dimensional model representation for stochastic partial differential equations

Collocation based high dimensional model representation for stochastic partial differential equations Collocation based high dimensional model representation for stochastic partial differential equations S Adhikari 1 1 Swansea University, UK ECCM 2010: IV European Conference on Computational Mechanics,

More information

A Vector-Space Approach for Stochastic Finite Element Analysis

A Vector-Space Approach for Stochastic Finite Element Analysis A Vector-Space Approach for Stochastic Finite Element Analysis S Adhikari 1 1 Swansea University, UK CST2010: Valencia, Spain Adhikari (Swansea) Vector-Space Approach for SFEM 14-17 September, 2010 1 /

More information

Greedy Signal Recovery and Uniform Uncertainty Principles

Greedy Signal Recovery and Uniform Uncertainty Principles Greedy Signal Recovery and Uniform Uncertainty Principles SPIE - IE 2008 Deanna Needell Joint work with Roman Vershynin UC Davis, January 2008 Greedy Signal Recovery and Uniform Uncertainty Principles

More information

Uncertainty Quantification and Validation Using RAVEN. A. Alfonsi, C. Rabiti. Risk-Informed Safety Margin Characterization. https://lwrs.inl.

Uncertainty Quantification and Validation Using RAVEN. A. Alfonsi, C. Rabiti. Risk-Informed Safety Margin Characterization. https://lwrs.inl. Risk-Informed Safety Margin Characterization Uncertainty Quantification and Validation Using RAVEN https://lwrs.inl.gov A. Alfonsi, C. Rabiti North Carolina State University, Raleigh 06/28/2017 Assumptions

More information

arxiv: v2 [physics.comp-ph] 15 Sep 2015

arxiv: v2 [physics.comp-ph] 15 Sep 2015 On Uncertainty Quantification of Lithium-ion Batteries: Application to an LiC 6 /LiCoO 2 cell arxiv:1505.07776v2 [physics.comp-ph] 15 Sep 2015 Mohammad Hadigol a, Kurt Maute a, Alireza Doostan a, a Aerospace

More information

Stochastic Solvers for the Euler Equations

Stochastic Solvers for the Euler Equations 43rd AIAA Aerospace Sciences Meeting and Exhibit 1-13 January 5, Reno, Nevada 5-873 Stochastic Solvers for the Euler Equations G. Lin, C.-H. Su and G.E. Karniadakis Division of Applied Mathematics Brown

More information

Sparse Legendre expansions via l 1 minimization

Sparse Legendre expansions via l 1 minimization Sparse Legendre expansions via l 1 minimization Rachel Ward, Courant Institute, NYU Joint work with Holger Rauhut, Hausdorff Center for Mathematics, Bonn, Germany. June 8, 2010 Outline Sparse recovery

More information

Enhanced Compressive Sensing and More

Enhanced Compressive Sensing and More Enhanced Compressive Sensing and More Yin Zhang Department of Computational and Applied Mathematics Rice University, Houston, Texas, U.S.A. Nonlinear Approximation Techniques Using L1 Texas A & M University

More information

Reconstruction from Anisotropic Random Measurements

Reconstruction from Anisotropic Random Measurements Reconstruction from Anisotropic Random Measurements Mark Rudelson and Shuheng Zhou The University of Michigan, Ann Arbor Coding, Complexity, and Sparsity Workshop, 013 Ann Arbor, Michigan August 7, 013

More information

Fast Hard Thresholding with Nesterov s Gradient Method

Fast Hard Thresholding with Nesterov s Gradient Method Fast Hard Thresholding with Nesterov s Gradient Method Volkan Cevher Idiap Research Institute Ecole Polytechnique Federale de ausanne volkan.cevher@epfl.ch Sina Jafarpour Department of Computer Science

More information

Thresholds for the Recovery of Sparse Solutions via L1 Minimization

Thresholds for the Recovery of Sparse Solutions via L1 Minimization Thresholds for the Recovery of Sparse Solutions via L Minimization David L. Donoho Department of Statistics Stanford University 39 Serra Mall, Sequoia Hall Stanford, CA 9435-465 Email: donoho@stanford.edu

More information

Accepted Manuscript. SAMBA: Sparse approximation of moment-based arbitrary polynomial chaos. R. Ahlfeld, B. Belkouchi, F.

Accepted Manuscript. SAMBA: Sparse approximation of moment-based arbitrary polynomial chaos. R. Ahlfeld, B. Belkouchi, F. Accepted Manuscript SAMBA: Sparse approximation of moment-based arbitrary polynomial chaos R. Ahlfeld, B. Belkouchi, F. Montomoli PII: S0021-9991(16)30151-6 DOI: http://dx.doi.org/10.1016/j.jcp.2016.05.014

More information

Multiplicative and Additive Perturbation Effects on the Recovery of Sparse Signals on the Sphere using Compressed Sensing

Multiplicative and Additive Perturbation Effects on the Recovery of Sparse Signals on the Sphere using Compressed Sensing Multiplicative and Additive Perturbation Effects on the Recovery of Sparse Signals on the Sphere using Compressed Sensing ibeltal F. Alem, Daniel H. Chae, and Rodney A. Kennedy The Australian National

More information

Parameterized PDEs Compressing sensing Sampling complexity lower-rip CS for PDEs Nonconvex regularizations Concluding remarks. Clayton G.

Parameterized PDEs Compressing sensing Sampling complexity lower-rip CS for PDEs Nonconvex regularizations Concluding remarks. Clayton G. COMPUTATIONAL & APPLIED MATHEMATICS Parameterized PDEs Compressing sensing Sampling complexity lower-rip CS for PDEs Nonconvex regularizations Concluding remarks Polynomial approximations via compressed

More information

Sampling and low-rank tensor approximation of the response surface

Sampling and low-rank tensor approximation of the response surface Sampling and low-rank tensor approximation of the response surface tifica Alexander Litvinenko 1,2 (joint work with Hermann G. Matthies 3 ) 1 Group of Raul Tempone, SRI UQ, and 2 Group of David Keyes,

More information

of Orthogonal Matching Pursuit

of Orthogonal Matching Pursuit A Sharp Restricted Isometry Constant Bound of Orthogonal Matching Pursuit Qun Mo arxiv:50.0708v [cs.it] 8 Jan 205 Abstract We shall show that if the restricted isometry constant (RIC) δ s+ (A) of the measurement

More information

Sensing systems limited by constraints: physical size, time, cost, energy

Sensing systems limited by constraints: physical size, time, cost, energy Rebecca Willett Sensing systems limited by constraints: physical size, time, cost, energy Reduce the number of measurements needed for reconstruction Higher accuracy data subject to constraints Original

More information

Stochastic structural dynamic analysis with random damping parameters

Stochastic structural dynamic analysis with random damping parameters Stochastic structural dynamic analysis with random damping parameters K. Sepahvand 1, F. Saati Khosroshahi, C. A. Geweth and S. Marburg Chair of Vibroacoustics of Vehicles and Machines Department of Mechanical

More information

Quadrature for Uncertainty Analysis Stochastic Collocation. What does quadrature have to do with uncertainty?

Quadrature for Uncertainty Analysis Stochastic Collocation. What does quadrature have to do with uncertainty? Quadrature for Uncertainty Analysis Stochastic Collocation What does quadrature have to do with uncertainty? Quadrature for Uncertainty Analysis Stochastic Collocation What does quadrature have to do with

More information

An Empirical Chaos Expansion Method for Uncertainty Quantification

An Empirical Chaos Expansion Method for Uncertainty Quantification An Empirical Chaos Expansion Method for Uncertainty Quantification Melvin Leok and Gautam Wilkins Abstract. Uncertainty quantification seeks to provide a quantitative means to understand complex systems

More information

A Power Efficient Sensing/Communication Scheme: Joint Source-Channel-Network Coding by Using Compressive Sensing

A Power Efficient Sensing/Communication Scheme: Joint Source-Channel-Network Coding by Using Compressive Sensing Forty-Ninth Annual Allerton Conference Allerton House, UIUC, Illinois, USA September 28-30, 20 A Power Efficient Sensing/Communication Scheme: Joint Source-Channel-Network Coding by Using Compressive Sensing

More information

Addressing high dimensionality in reliability analysis using low-rank tensor approximations

Addressing high dimensionality in reliability analysis using low-rank tensor approximations Addressing high dimensionality in reliability analysis using low-rank tensor approximations K Konakli, Bruno Sudret To cite this version: K Konakli, Bruno Sudret. Addressing high dimensionality in reliability

More information

Uncertainty Propagation and Global Sensitivity Analysis in Hybrid Simulation using Polynomial Chaos Expansion

Uncertainty Propagation and Global Sensitivity Analysis in Hybrid Simulation using Polynomial Chaos Expansion Uncertainty Propagation and Global Sensitivity Analysis in Hybrid Simulation using Polynomial Chaos Expansion EU-US-Asia workshop on hybrid testing Ispra, 5-6 October 2015 G. Abbiati, S. Marelli, O.S.

More information

Dynamic response of structures with uncertain properties

Dynamic response of structures with uncertain properties Dynamic response of structures with uncertain properties S. Adhikari 1 1 Chair of Aerospace Engineering, College of Engineering, Swansea University, Bay Campus, Fabian Way, Swansea, SA1 8EN, UK International

More information

Color Scheme. swright/pcmi/ M. Figueiredo and S. Wright () Inference and Optimization PCMI, July / 14

Color Scheme.   swright/pcmi/ M. Figueiredo and S. Wright () Inference and Optimization PCMI, July / 14 Color Scheme www.cs.wisc.edu/ swright/pcmi/ M. Figueiredo and S. Wright () Inference and Optimization PCMI, July 2016 1 / 14 Statistical Inference via Optimization Many problems in statistical inference

More information

Sparse Solutions of an Undetermined Linear System

Sparse Solutions of an Undetermined Linear System 1 Sparse Solutions of an Undetermined Linear System Maddullah Almerdasy New York University Tandon School of Engineering arxiv:1702.07096v1 [math.oc] 23 Feb 2017 Abstract This work proposes a research

More information

Xu Guanlei Dalian Navy Academy

Xu Guanlei Dalian Navy Academy Xu Guanlei Dalian Navy Academy xgl_86@163.com Werner Heisenberg x p 2 So, it is called as Heisenberg's uncertainty principle 2 2 t u 1/4 2 2 ( ) 2 u u u F u du where t 2 2 2 t t f ( t) dt What will happen

More information

High-dimensional covariance estimation based on Gaussian graphical models

High-dimensional covariance estimation based on Gaussian graphical models High-dimensional covariance estimation based on Gaussian graphical models Shuheng Zhou Department of Statistics, The University of Michigan, Ann Arbor IMA workshop on High Dimensional Phenomena Sept. 26,

More information

Interpolation via weighted l 1 -minimization

Interpolation via weighted l 1 -minimization Interpolation via weighted l 1 -minimization Holger Rauhut RWTH Aachen University Lehrstuhl C für Mathematik (Analysis) Mathematical Analysis and Applications Workshop in honor of Rupert Lasser Helmholtz

More information

Research Article A Pseudospectral Approach for Kirchhoff Plate Bending Problems with Uncertainties

Research Article A Pseudospectral Approach for Kirchhoff Plate Bending Problems with Uncertainties Mathematical Problems in Engineering Volume 22, Article ID 7565, 4 pages doi:.55/22/7565 Research Article A Pseudospectral Approach for Kirchhoff Plate Bending Problems with Uncertainties Ling Guo, 2 and

More information

Exact Low-rank Matrix Recovery via Nonconvex M p -Minimization

Exact Low-rank Matrix Recovery via Nonconvex M p -Minimization Exact Low-rank Matrix Recovery via Nonconvex M p -Minimization Lingchen Kong and Naihua Xiu Department of Applied Mathematics, Beijing Jiaotong University, Beijing, 100044, People s Republic of China E-mail:

More information

Uniform Uncertainty Principle and signal recovery via Regularized Orthogonal Matching Pursuit

Uniform Uncertainty Principle and signal recovery via Regularized Orthogonal Matching Pursuit Uniform Uncertainty Principle and signal recovery via Regularized Orthogonal Matching Pursuit arxiv:0707.4203v2 [math.na] 14 Aug 2007 Deanna Needell Department of Mathematics University of California,

More information

Recent Developments in Compressed Sensing

Recent Developments in Compressed Sensing Recent Developments in Compressed Sensing M. Vidyasagar Distinguished Professor, IIT Hyderabad m.vidyasagar@iith.ac.in, www.iith.ac.in/ m vidyasagar/ ISL Seminar, Stanford University, 19 April 2018 Outline

More information

Keywords: Sonic boom analysis, Atmospheric uncertainties, Uncertainty quantification, Monte Carlo method, Polynomial chaos method.

Keywords: Sonic boom analysis, Atmospheric uncertainties, Uncertainty quantification, Monte Carlo method, Polynomial chaos method. Blucher Mechanical Engineering Proceedings May 2014, vol. 1, num. 1 www.proceedings.blucher.com.br/evento/10wccm SONIC BOOM ANALYSIS UNDER ATMOSPHERIC UNCERTAINTIES BY A NON-INTRUSIVE POLYNOMIAL CHAOS

More information

A Bregman alternating direction method of multipliers for sparse probabilistic Boolean network problem

A Bregman alternating direction method of multipliers for sparse probabilistic Boolean network problem A Bregman alternating direction method of multipliers for sparse probabilistic Boolean network problem Kangkang Deng, Zheng Peng Abstract: The main task of genetic regulatory networks is to construct a

More information

LIMITATION OF LEARNING RANKINGS FROM PARTIAL INFORMATION. By Srikanth Jagabathula Devavrat Shah

LIMITATION OF LEARNING RANKINGS FROM PARTIAL INFORMATION. By Srikanth Jagabathula Devavrat Shah 00 AIM Workshop on Ranking LIMITATION OF LEARNING RANKINGS FROM PARTIAL INFORMATION By Srikanth Jagabathula Devavrat Shah Interest is in recovering distribution over the space of permutations over n elements

More information