Physics, Mathematics and Computers

Size: px
Start display at page:

Download "Physics, Mathematics and Computers"

Transcription

1 Physics, Mathematics and Computers Better algorithms + Better tools = Better science! Fernando Pérez Department of Applied Mathematics University of Colorado, Boulder. U. C. Berkeley May 16, 2007

2 Outline Physics/Math MRA IPython Parallel Other projects 1 Physics and Mathematics F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 2 / 45

3 Outline Physics/Math MRA IPython Parallel Other projects 1 Physics and Mathematics 2 Numerical Multiresolution Algorithms F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 2 / 45

4 Outline Physics/Math MRA IPython Parallel Other projects 1 Physics and Mathematics 2 Numerical Multiresolution Algorithms 3 Computing with Python and IPython F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 2 / 45

5 Outline Physics/Math MRA IPython Parallel Other projects 1 Physics and Mathematics 2 Numerical Multiresolution Algorithms 3 Computing with Python and IPython 4 The future: IPython and parallel computing F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 2 / 45

6 Outline Physics/Math MRA IPython Parallel Other projects 1 Physics and Mathematics 2 Numerical Multiresolution Algorithms 3 Computing with Python and IPython 4 The future: IPython and parallel computing 5 Other projects of interest F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 2 / 45

7 Outline Physics/Math MRA IPython Parallel Other projects 1 Physics and Mathematics 2 Numerical Multiresolution Algorithms 3 Computing with Python and IPython 4 The future: IPython and parallel computing 5 Other projects of interest F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 3 / 45

8 My background: theoretical physics, numerics Physics Lattice QCD (Quantum Chromo Dynamics): quarks and gluons. Classical chaos: classical 3-body Coulomb system. Quantum chaos: a quantum version of Lyapunov exponents. F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 4 / 45

9 My background: theoretical physics, numerics Physics Lattice QCD (Quantum Chromo Dynamics): quarks and gluons. Classical chaos: classical 3-body Coulomb system. Quantum chaos: a quantum version of Lyapunov exponents. Applied Mathematics Algorithm design for computational physics. Strong connection between the physics and the numerics. F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 4 / 45

10 My background: theoretical physics, numerics Physics Lattice QCD (Quantum Chromo Dynamics): quarks and gluons. Classical chaos: classical 3-body Coulomb system. Quantum chaos: a quantum version of Lyapunov exponents. Applied Mathematics Algorithm design for computational physics. Strong connection between the physics and the numerics. Computing Tools I picked up as I needed them. I ended up writing many of them, because they didn t exist... or what existed was not good enough. F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 4 / 45

11 Why am I here? Evolution of intent Particle physics, quantum chaos: extremely theoretical. Applied Mathematics: ideas that are actually applicable. Computing: shattered my prejudice against practicality. F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 5 / 45

12 Why am I here? Evolution of intent Particle physics, quantum chaos: extremely theoretical. Applied Mathematics: ideas that are actually applicable. Computing: shattered my prejudice against practicality. Consistency of background Physics: a solid understanding of nature s basic mechanisms. Math: robust approaches to extract valid, reliable answers. Computing: build practical tools that support the scientific effort. F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 5 / 45

13 Why am I here? Evolution of intent Particle physics, quantum chaos: extremely theoretical. Applied Mathematics: ideas that are actually applicable. Computing: shattered my prejudice against practicality. Consistency of background Physics: a solid understanding of nature s basic mechanisms. Math: robust approaches to extract valid, reliable answers. Computing: build practical tools that support the scientific effort. Why neuroscience? The life sciences are now quantitiative. A fascinating multiscale problem. Very well suited to my background (renormalization, wavelets,...) F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 5 / 45

14 Some physical problems of interest Their natural formulation is a (Partial) Differential Equation (PDE): Poisson: gravity, electricity,... 2 u = f Schrödinger: quantum mechanics ( 1 ) V ψ = Eψ Navier-Stokes (modified form): fluids αv µ 2 v + p = f v = 0 A good fraction of the world s (scientific) computing time is spent on these. F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 6 / 45

15 What are we after? Immediate Goals Accurate and reliable methods of solution... that work efficiently (time and storage)... in more than one dimension... and for a wide class of problems. F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 7 / 45

16 What are we after? Immediate Goals Accurate and reliable methods of solution... that work efficiently (time and storage)... in more than one dimension... and for a wide class of problems. Overall program A robust formulation: apply integral operators instead of inverting differential ones (don t divide by zero!). Build approximations with finite but controlled precision. Develop multiscale, fully adaptive algorithms... That generalize naturally to more than one dimension. F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 7 / 45

17 Why do we need fast algorithms? F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 8 / 45

18 Why do we need fast algorithms? Because computers are getting bigger and faster! F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 8 / 45

19 Why do we need fast algorithms? Because computers are getting bigger and faster! F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 8 / 45

20 Why do we need fast algorithms? Because computers are getting bigger and faster! F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 8 / 45

21 Why do we need fast algorithms? Because computers are getting bigger and faster! F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 8 / 45

22 Why do we need fast algorithms? Because computers are getting bigger and faster! F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 8 / 45

23 Why do we need fast algorithms? Because computers are getting bigger and faster! How do you get a fast algorithm? Compress: factorize, find an alternate representation, approximate, decouple. F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 8 / 45

24 Multiresolution algorithms in multiple dimensions Key mathematical ideas: 1 Multiresolution analysis (wavelets): sparse representations (compress). 2 Separated representations: reduction of dimensionality cost (approximate, decouple). F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 9 / 45

25 Multiresolution algorithms in multiple dimensions Key mathematical ideas: 1 Multiresolution analysis (wavelets): sparse representations (compress). 2 Separated representations: reduction of dimensionality cost (approximate, decouple). Group effort over many years (1988-today): 1 Gregory Beylkin, Lucas Monzón, Christopher Kurcz - CU Boulder 2 Martin Mohlenkamp - Ohio University 3 Robert Harrison, George Fann, Takeshi Yanai, Zhengting Gan - ORNL 4 Vani Cheruvu - (now at NCAR) 5 Robert Cramer - (now at Raytheon) F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 9 / 45

26 Outline Physics/Math MRA IPython Parallel Other projects Functions Operators d = 1 recap 1 Physics and Mathematics 2 Numerical Multiresolution Algorithms 3 Computing with Python and IPython 4 The future: IPython and parallel computing 5 Other projects of interest F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 10 / 45

27 Functions Operators d = 1 recap A specific example: Poisson s equation The solution to 2 φ(r) = ρ(r) can be written in integral form as Z φ(r) = Z G(r,r )ρ(r )d 3 r = 1 r r ρ(r )d 3 r. F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 11 / 45

28 Functions Operators d = 1 recap A specific example: Poisson s equation The solution to 2 φ(r) = ρ(r) can be written in integral form as Z φ(r) = Z G(r,r )ρ(r )d 3 r = 1 r r ρ(r )d 3 r. We need: A way of representing ρ(r ) and G(r,r ) efficiently (very different problems) A way of applying the integral (a generalized multiplication). This is a full 3-dimensional problem. We d like a method that easily generalizes to other G(r,r ) functions. F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 11 / 45

29 Functions Operators d = 1 recap Multiresolution analysis, intuitively Imagine a simple signal f(t) you want to study: F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 12 / 45

30 Functions Operators d = 1 recap Multiresolution analysis, intuitively Imagine a simple signal f(t) you want to study: At each scale n, divide the unit interval [0,1] into 2 n binary subintervals: F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 12 / 45

31 Multiresolution basics (2) And compute: Average values of function at level n : space V n. Differences between successive levels: space W n = V n+1 V n.

32 Multiresolution basics (2) And compute: Average values of function at level n : space V n. Differences between successive levels: space W n = V n+1 V n. f(t) can studied (compressed, denoised,...) from {V 0,W 0,W 1,...} : V2 V4 V9-full W2 W4 W Note: the coefficients in W n are small and localized around changes.

33 Functions: adaptive, controlled accuracy decompositions Nnod = 12, ǫ = 1.0e 10, Nblocks = 21

34 Functions: adaptive, controlled accuracy decompositions Nnod = 12, ǫ = 1.0e 10, Nblocks = 21 Nnod = 10, ǫ = 5.0e 11, Nblocks = 634

35 Sparse operators Sparse: having few non-zero entries (compressible fast good!). Instead of applying this:

36 Sparse operators Sparse: having few non-zero entries (compressible fast good!). Instead of applying this: We apply this (blue is zero, not done):

37 Functions Operators d = 1 recap Adaptive natural-scale application A graphical representation F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 16 / 45

38 Functions Operators d = 1 recap For one dimension (d = 1), lessons learned The Good 1 Multiwavelets sparse operators fast algorithms. 2 Accuracy is guaranteed by construction. 3 We efficiently handle multi-scale interactions. 4 Hierarchical, adaptive algorithm. F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 17 / 45

39 Functions Operators d = 1 recap For one dimension (d = 1), lessons learned The Good 1 Multiwavelets sparse operators fast algorithms. 2 Accuracy is guaranteed by construction. 3 We efficiently handle multi-scale interactions. 4 Hierarchical, adaptive algorithm. The Bad This approach does not directly extend to d > 1. F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 17 / 45

40 Operators(d > 1): Gaussians to the rescue Use Gaussians for approximations M 1 r r w m e τ m r r 2, m=1 with controlled accuracy ε: The problem factorizes partially: a practical solution for d > 1! φ ijk = N i j k =1G ii,jj,kk ρ i j k = M m=1 w m F m i ii j F m jj k F m kk ρ i j k

41 Functions Operators d = 1 recap What is all of this good for? In computational physics Electrostatics, scattering, quantum mechanics, fluids,... Quantum mechanics (many electron atoms): A very nasty multidimensional problem. Collaborations with ORNL and Ohio U: a generic toolkit (MADNESS). F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 19 / 45

42 Functions Operators d = 1 recap What is all of this good for? In computational physics Electrostatics, scattering, quantum mechanics, fluids,... Quantum mechanics (many electron atoms): A very nasty multidimensional problem. Collaborations with ORNL and Ohio U: a generic toolkit (MADNESS). Applications in neuroscience? This is speculative!!! Hierarchical modeling: Multiresolution operator representations effective multiscale theories. Novel approaches for high-dimensional datasets. PDE - based algorithms for image processing. Wavelet-based representations of fmri objects for algorithmic work....? I hope to talk to some of you today about this. F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 19 / 45

43 Outline Physics/Math MRA IPython Parallel Other projects 1 Physics and Mathematics 2 Numerical Multiresolution Algorithms 3 Computing with Python and IPython 4 The future: IPython and parallel computing 5 Other projects of interest F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 20 / 45

44 Python in scientific computing Free, interactive, highly portable language. Extremely readable syntax ( executable pseudo-code ). Rich built-in types: lists, sets, dictionaries (hash tables), strings,... Very comprehensive standard library (batteries included): Text processing, networking protocols, threading, GUIs,... Standard libraries for Matlab/IDL-like arrays. Easy to wrap existing C, C++ and FORTRAN codes: Great code reuse! F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 21 / 45

45 Python is growing in scientific computing Neuroimaging article by J. Millman and M. Brett

46 Data analysis for epilepsy surgery John Hunter, Pediatric Neurology, U. Chicago

47 Correlation analysis of seizure data

48 Final location of epileptic foci for surgery

49 Why do I use Python? Very complex algorithms: rich types and easy object model. Exploratory interactive work: IPython. Visualization: 2D and 3D Numerics: numpy, scipy, in-house Fortran/C codes Access to lots of third-party libraries (GUIs, networking,...) We need these things in scientific computing... but we don t want to write them ourselves! F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 26 / 45

50 IPython: better interactive work Why write this? Scientific computing is inherently exploratory. A good interactive environment is a necessity. F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 27 / 45

51 IPython: better interactive work Why write this? Scientific computing is inherently exploratory. A good interactive environment is a necessity. 1 A better Python shell: object introspection, system access,... 2 An embeddable interpreter: allow any program to be probed interactively. 3 A flexible component: base layer for other interactive systems. 4 High-level distributed/parallel computing. 5 A component we can plug into GUIs, browser shells, etc. F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 27 / 45

52 Matlab-like usage F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 28 / 45

53 Sophisticated 3d visualizations with VTK F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 29 / 45

54 Who uses IPython? IPython is available for all Linux distributions, OS X and Windows. SAGE: open source mathematics, very ambitious project (U. Washington). PyRAF: astronomical image analysis (Space Telescope Science Institute). CASA: Common Astronomy Software Applications (National Radio Astronomy Observatory). Ganga: job control for the LHCb and ATLAS experiments at CERN. PyMAD: a neutron spectrometer at the Institut Laue Langevin (Grenoble). Pymerase: microarray gene expression databases. Many others... F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 30 / 45

55 Why the popularity? Write a useful tool... That is highly customizable. F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 31 / 45

56 Why the popularity? Write a useful tool... That is highly customizable. Keep a lively community and grow it: Mailing lists, wiki-based website. Developers in the US and Europe. User-contributed articles and videos... F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 31 / 45

57 Why the popularity? Write a useful tool... That is highly customizable. Keep a lively community and grow it: Mailing lists, wiki-based website. Developers in the US and Europe. User-contributed articles and videos... Listen to the needs of users (esp. major projects): Add functionality they need. Adapt and evolve the design as needed. F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 31 / 45

58 Why the popularity? Write a useful tool... That is highly customizable. Keep a lively community and grow it: Mailing lists, wiki-based website. Developers in the US and Europe. User-contributed articles and videos... Listen to the needs of users (esp. major projects): Add functionality they need. Adapt and evolve the design as needed. F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 31 / 45

59 Why the popularity? Write a useful tool... That is highly customizable. Keep a lively community and grow it: Mailing lists, wiki-based website. Developers in the US and Europe. User-contributed articles and videos... Listen to the needs of users (esp. major projects): Add functionality they need. Adapt and evolve the design as needed. The lesson? Solve your problem well, with enough generality and flexibility... and you ll solve a lot more than just your problem. F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 31 / 45

60 Outline Physics/Math MRA IPython Parallel Other projects 1 Physics and Mathematics 2 Numerical Multiresolution Algorithms 3 Computing with Python and IPython 4 The future: IPython and parallel computing 5 Other projects of interest F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 32 / 45

61 Parallel computing: why should we care? F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 33 / 45

62 Parallel computing: why should we care? Because reality looks like this: F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 33 / 45

63 We can t escape thermodynamics

64 We can t escape thermodynamics The vendor s solutions: Multicore chips: even in your laptop. Graphics cards for general computing: > 128 processors per card. High-density clusters: SiCortex (> 5000 processors in a cabinet).

65 Parallel programming? There are plenty of bad news It is in general, extremely difficult. Scientific productivity plummets with enormous up-front efforts. Development, debugging, running is hard and cumbersome. With propietary tools, licensing costs can go through the roof. F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 35 / 45

66 Parallel programming? There are plenty of bad news It is in general, extremely difficult. Scientific productivity plummets with enormous up-front efforts. Development, debugging, running is hard and cumbersome. With propietary tools, licensing costs can go through the roof. But not all is doom and gloom Many problems are embarrassingly parallel: uncoupled components. This is common in neuroscience: Analyze many scans in an fmri run. Global parameter search in generative models. SPM has plenty of opportunity for easy massive speedups. Even not-so-embarrassingly parallel problems can be tractable with the right tools. F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 35 / 45

67 Network-aware IPython F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 36 / 45

68 Distributed/parallel computing Think of Python as the CPU But these souped-up kernels let you talk to it conveniently. F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 37 / 45

69 What does IPython offer here? Easy reuse and distribution of existing serial ( normal ) codes. High-level abstractions for embarrassingly parallel problems. Out-of-the box task farming tools. Task farming system is low-latency can be integrated into more complex codes. Implement any approach to parallelism you want: Task farming. Traditional Message Passing (MPI). Integrate hybrid codes. Actively developed (Colorado, Berkeley). F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 38 / 45

70 Outline Physics/Math MRA IPython Parallel Other projects 1 Physics and Mathematics 2 Numerical Multiresolution Algorithms 3 Computing with Python and IPython 4 The future: IPython and parallel computing 5 Other projects of interest F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 39 / 45

71 FluidLab: a MayaVi based CFD visualization tool With: K. Julien, P. Schmitt and B. Barrow (Applied Math, U. Colorado).

72 FluidLab: an Envisage project. Envisage: plugin-based system for scientific application development.

73 Graphics cards for numerics Why? Graphics cards ( GPUs ) are basically very fast, highly parallel computers... F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 42 / 45

74 Graphics cards for numerics Why? Graphics cards ( GPUs ) are basically very fast, highly parallel computers... Problem: the unequally spaced FFT (Fast Fourier Transform) Very painful, but we got our part working. Recent hardware makes life a lot easier. Much less of a square peg (numerical algorithm) into a round hole (a 3d graphics language). F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 42 / 45

75 Graphics cards for numerics Why? Graphics cards ( GPUs ) are basically very fast, highly parallel computers... Problem: the unequally spaced FFT (Fast Fourier Transform) Very painful, but we got our part working. Recent hardware makes life a lot easier. Much less of a square peg (numerical algorithm) into a round hole (a 3d graphics language). Possibilities for neuroscience? Real-time analysis of EEG/ECoG data (K. Koepsell, R. Canolty). Speed up FFT and linear-algebra based algorithms. F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 42 / 45

76 In closing... Better algorithms: From the physics to the mathematics: correct and robust. Multi-scale interactions. Hierarchical models and effective theories. High dimensional problems. F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 43 / 45

77 In closing... Better algorithms: From the physics to the mathematics: correct and robust. Multi-scale interactions. Hierarchical models and effective theories. High dimensional problems. Better computational tools: Exploratory computing. Integration with GUIs, the internet, low-level codes,... Improved access to parallel resources. F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 43 / 45

78 In closing... Better algorithms: From the physics to the mathematics: correct and robust. Multi-scale interactions. Hierarchical models and effective theories. High dimensional problems. Better computational tools: Exploratory computing. Integration with GUIs, the internet, low-level codes,... Improved access to parallel resources. A culture of open and reproducible computational research: Transparent workflows. Flexible tools with interchangeable components. F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 43 / 45

79 In closing... Better algorithms: From the physics to the mathematics: correct and robust. Multi-scale interactions. Hierarchical models and effective theories. High dimensional problems. Better computational tools: Exploratory computing. Integration with GUIs, the internet, low-level codes,... Improved access to parallel resources. A culture of open and reproducible computational research: Transparent workflows. Flexible tools with interchangeable components. F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 43 / 45

80 In closing... Ultimately Better algorithms: From the physics to the mathematics: correct and robust. Multi-scale interactions. Hierarchical models and effective theories. High dimensional problems. Better computational tools: Exploratory computing. Integration with GUIs, the internet, low-level codes,... Improved access to parallel resources. A culture of open and reproducible computational research: Transparent workflows. Flexible tools with interchangeable components. Better algorithms + better tools = better science! F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 43 / 45

81 EXTRA SLIDES just in case... F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 44 / 45

82 Sparsity also in the m direction? The Gaussian expansion gave us separation of directions... at the cost of a new internal degree of freedom, the separation index m. Do we really need all these terms? F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 45 / 45

83 Sparsity also in the m direction? The Gaussian expansion gave us separation of directions... at the cost of a new internal degree of freedom, the separation index m. Do we really need all these terms? NO: the 2-scale differences cancel most of them! F. P. (App. Math - CU Boulder) Physics, Mathematics and Computers Berkeley 45 / 45

Adaptive Application of Green s Functions:

Adaptive Application of Green s Functions: Adaptive Application of Green s Functions: Fast algorithms for integral transforms, with a bit of QM Fernando Pérez With: Gregory Beylkin (Colorado) and Martin Mohlenkamp (Ohio University) Department of

More information

Representation of operators in MADNESS (Multiresolution ADaptive Numerical Environment for Scientific Simulation)

Representation of operators in MADNESS (Multiresolution ADaptive Numerical Environment for Scientific Simulation) Representation of operators in MADNESS (Multiresolution ADaptive Numerical Environment for Scientific Simulation) Gregory Beylkin University of Colorado at Boulder IPAM: Big Data Meets Computation workshop

More information

A Tutorial on Wavelets and their Applications. Martin J. Mohlenkamp

A Tutorial on Wavelets and their Applications. Martin J. Mohlenkamp A Tutorial on Wavelets and their Applications Martin J. Mohlenkamp University of Colorado at Boulder Department of Applied Mathematics mjm@colorado.edu This tutorial is designed for people with little

More information

Introduction to numerical computations on the GPU

Introduction to numerical computations on the GPU Introduction to numerical computations on the GPU Lucian Covaci http://lucian.covaci.org/cuda.pdf Tuesday 1 November 11 1 2 Outline: NVIDIA Tesla and Geforce video cards: architecture CUDA - C: programming

More information

Compute the behavior of reality even if it is impossible to observe the processes (for example a black hole in astrophysics).

Compute the behavior of reality even if it is impossible to observe the processes (for example a black hole in astrophysics). 1 Introduction Read sections 1.1, 1.2.1 1.2.4, 1.2.6, 1.3.8, 1.3.9, 1.4. Review questions 1.1 1.6, 1.12 1.21, 1.37. The subject of Scientific Computing is to simulate the reality. Simulation is the representation

More information

Statistical Clustering of Vesicle Patterns Practical Aspects of the Analysis of Large Datasets with R

Statistical Clustering of Vesicle Patterns Practical Aspects of the Analysis of Large Datasets with R Statistical Clustering of Vesicle Patterns Mirko Birbaumer Rmetrics Workshop 3th July 2008 1 / 23 Statistical Clustering of Vesicle Patterns Practical Aspects of the Analysis of Large Datasets with R Mirko

More information

Computational Methods for Nonlinear Systems

Computational Methods for Nonlinear Systems Computational Methods for Nonlinear Systems Cornell Physics 682 / CIS 629 James P. Sethna Christopher R. Myers Computational Methods for Nonlinear Systems Graduate computational science laboratory course

More information

A CUDA Solver for Helmholtz Equation

A CUDA Solver for Helmholtz Equation Journal of Computational Information Systems 11: 24 (2015) 7805 7812 Available at http://www.jofcis.com A CUDA Solver for Helmholtz Equation Mingming REN 1,2,, Xiaoguang LIU 1,2, Gang WANG 1,2 1 College

More information

INTENSIVE COMPUTATION. Annalisa Massini

INTENSIVE COMPUTATION. Annalisa Massini INTENSIVE COMPUTATION Annalisa Massini 2015-2016 Course topics The course will cover topics that are in some sense related to intensive computation: Matlab (an introduction) GPU (an introduction) Sparse

More information

Structured matrix factorizations. Example: Eigenfaces

Structured matrix factorizations. Example: Eigenfaces Structured matrix factorizations Example: Eigenfaces An extremely large variety of interesting and important problems in machine learning can be formulated as: Given a matrix, find a matrix and a matrix

More information

Classical Monte Carlo Simulations

Classical Monte Carlo Simulations Classical Monte Carlo Simulations Hyejin Ju April 17, 2012 1 Introduction Why do we need numerics? One of the main goals of condensed matter is to compute expectation values O = 1 Z Tr{O e βĥ} (1) and

More information

Integrating Open-Source Statistical Packages with ArcGIS

Integrating Open-Source Statistical Packages with ArcGIS Esri International User Conference San Diego, California Technical Workshops 7-25-12 Integrating Open-Source Statistical Packages with ArcGIS Mark V. Janikas, Ph. D. Xing Kang Outline Introduction to Spatial

More information

An Integrative Model for Parallelism

An Integrative Model for Parallelism An Integrative Model for Parallelism Victor Eijkhout ICERM workshop 2012/01/09 Introduction Formal part Examples Extension to other memory models Conclusion tw-12-exascale 2012/01/09 2 Introduction tw-12-exascale

More information

Physics 584 Computational Methods

Physics 584 Computational Methods Physics 584 Computational Methods Introduction to Matlab and Numerical Solutions to Ordinary Differential Equations Ryan Ogliore April 18 th, 2016 Lecture Outline Introduction to Matlab Numerical Solutions

More information

ECE521 W17 Tutorial 1. Renjie Liao & Min Bai

ECE521 W17 Tutorial 1. Renjie Liao & Min Bai ECE521 W17 Tutorial 1 Renjie Liao & Min Bai Schedule Linear Algebra Review Matrices, vectors Basic operations Introduction to TensorFlow NumPy Computational Graphs Basic Examples Linear Algebra Review

More information

ALMA Development Program

ALMA Development Program ALMA Development Program Jeff Kern CASA Team Lead Atacama Large Millimeter/submillimeter Array Expanded Very Large Array Robert C. Byrd Green Bank Telescope Very Long Baseline Array Opportunities for Software

More information

QuTiP: Quantum Toolbox in Python. Circuit-QED

QuTiP: Quantum Toolbox in Python. Circuit-QED Lecture on QuTiP: Quantum Toolbox in Python with case studies in Circuit-QED Robert Johansson RIKEN In collaboration with Paul Nation Korea University 1 Content Introduction to QuTiP Case studies in circuit-qed

More information

CONTEMPORARY ANALYTICAL ECOSYSTEM PATRICK HALL, SAS INSTITUTE

CONTEMPORARY ANALYTICAL ECOSYSTEM PATRICK HALL, SAS INSTITUTE CONTEMPORARY ANALYTICAL ECOSYSTEM PATRICK HALL, SAS INSTITUTE Copyright 2013, SAS Institute Inc. All rights reserved. Agenda (Optional) History Lesson 2015 Buzzwords Machine Learning for X Citizen Data

More information

Introduction, basic but important concepts

Introduction, basic but important concepts Introduction, basic but important concepts Felix Kubler 1 1 DBF, University of Zurich and Swiss Finance Institute October 7, 2017 Felix Kubler Comp.Econ. Gerzensee, Ch1 October 7, 2017 1 / 31 Economics

More information

Future Directions in Tensor-Based Computation and Modeling 1

Future Directions in Tensor-Based Computation and Modeling 1 Workshop on Future Directions in Tensor-Based Computation and Modeling 1 National Science Foundation Arlington, Virginia February 20-21, 2009 Program Organizer: Charles Van Loan (Department of Computer

More information

The D-Wave 2X Quantum Computer Technology Overview

The D-Wave 2X Quantum Computer Technology Overview The D-Wave 2X Quantum Computer Technology Overview D-Wave Systems Inc. www.dwavesys.com Quantum Computing for the Real World Founded in 1999, D-Wave Systems is the world s first quantum computing company.

More information

Computational Methods for Nonlinear Systems

Computational Methods for Nonlinear Systems Computational Methods for Nonlinear Systems Cornell Physics 682 / CIS 629 Chris Myers Computational Methods for Nonlinear Systems Graduate computational science laboratory course developed by Myers & Sethna

More information

GPU acceleration of Newton s method for large systems of polynomial equations in double double and quad double arithmetic

GPU acceleration of Newton s method for large systems of polynomial equations in double double and quad double arithmetic GPU acceleration of Newton s method for large systems of polynomial equations in double double and quad double arithmetic Jan Verschelde joint work with Xiangcheng Yu University of Illinois at Chicago

More information

CSE332: Data Structures & Parallelism Lecture 2: Algorithm Analysis. Ruth Anderson Winter 2018

CSE332: Data Structures & Parallelism Lecture 2: Algorithm Analysis. Ruth Anderson Winter 2018 CSE332: Data Structures & Parallelism Lecture 2: Algorithm Analysis Ruth Anderson Winter 2018 Today Algorithm Analysis What do we care about? How to compare two algorithms Analyzing Code Asymptotic Analysis

More information

High-Performance Scientific Computing

High-Performance Scientific Computing High-Performance Scientific Computing Instructor: Randy LeVeque TA: Grady Lemoine Applied Mathematics 483/583, Spring 2011 http://www.amath.washington.edu/~rjl/am583 World s fastest computers http://top500.org

More information

Computational Physics, 3rd Ed

Computational Physics, 3rd Ed Surveys All of CP, Separate Digital & ebook Versions Computational Physics, 3rd Ed Problem Solving with Python Rubin H Landau, Manuel J Paez & Cristian Bordeianu Wiley-VCH Verlag GmbH & Co., 2015 (buy

More information

COMS 6100 Class Notes

COMS 6100 Class Notes COMS 6100 Class Notes Daniel Solus September 20, 2016 1 General Remarks The Lecture notes submitted by the class have been very good. Integer division seemed to be a common oversight when working the Fortran

More information

GPU Acceleration of Cutoff Pair Potentials for Molecular Modeling Applications

GPU Acceleration of Cutoff Pair Potentials for Molecular Modeling Applications GPU Acceleration of Cutoff Pair Potentials for Molecular Modeling Applications Christopher Rodrigues, David J. Hardy, John E. Stone, Klaus Schulten, Wen-Mei W. Hwu University of Illinois at Urbana-Champaign

More information

Scripting Languages Fast development, extensible programs

Scripting Languages Fast development, extensible programs Scripting Languages Fast development, extensible programs Devert Alexandre School of Software Engineering of USTC November 30, 2012 Slide 1/60 Table of Contents 1 Introduction 2 Dynamic languages A Python

More information

CSE332: Data Structures & Parallelism Lecture 2: Algorithm Analysis. Ruth Anderson Winter 2018

CSE332: Data Structures & Parallelism Lecture 2: Algorithm Analysis. Ruth Anderson Winter 2018 CSE332: Data Structures & Parallelism Lecture 2: Algorithm Analysis Ruth Anderson Winter 2018 Today Algorithm Analysis What do we care about? How to compare two algorithms Analyzing Code Asymptotic Analysis

More information

Outline Oxana Smirnova, Particle Physics 2

Outline Oxana Smirnova, Particle Physics 2 Outline 2016-09-26 Oxana Smirnova, Particle Physics 2 2016-09-26 Oxana Smirnova, Particle Physics 3 Short-list of open questions for LHC Can gravity be included in a theory with the other three interactions?

More information

CSE332: Data Structures & Parallelism Lecture 2: Algorithm Analysis. Ruth Anderson Winter 2019

CSE332: Data Structures & Parallelism Lecture 2: Algorithm Analysis. Ruth Anderson Winter 2019 CSE332: Data Structures & Parallelism Lecture 2: Algorithm Analysis Ruth Anderson Winter 2019 Today Algorithm Analysis What do we care about? How to compare two algorithms Analyzing Code Asymptotic Analysis

More information

Analysis and synthesis: a complexity perspective

Analysis and synthesis: a complexity perspective Analysis and synthesis: a complexity perspective Pablo A. Parrilo ETH ZürichZ control.ee.ethz.ch/~parrilo Outline System analysis/design Formal and informal methods SOS/SDP techniques and applications

More information

TR A Comparison of the Performance of SaP::GPU and Intel s Math Kernel Library (MKL) for Solving Dense Banded Linear Systems

TR A Comparison of the Performance of SaP::GPU and Intel s Math Kernel Library (MKL) for Solving Dense Banded Linear Systems TR-0-07 A Comparison of the Performance of ::GPU and Intel s Math Kernel Library (MKL) for Solving Dense Banded Linear Systems Ang Li, Omkar Deshmukh, Radu Serban, Dan Negrut May, 0 Abstract ::GPU is a

More information

Lecture 2: Linear regression

Lecture 2: Linear regression Lecture 2: Linear regression Roger Grosse 1 Introduction Let s ump right in and look at our first machine learning algorithm, linear regression. In regression, we are interested in predicting a scalar-valued

More information

Python & Numpy A tutorial

Python & Numpy A tutorial Python & Numpy A tutorial Devert Alexandre School of Software Engineering of USTC 13 February 2012 Slide 1/38 Table of Contents 1 Why Python & Numpy 2 First steps with Python 3 Fun with lists 4 Quick tour

More information

Parallel Sparse Tensor Decompositions using HiCOO Format

Parallel Sparse Tensor Decompositions using HiCOO Format Figure sources: A brief survey of tensors by Berton Earnshaw and NVIDIA Tensor Cores Parallel Sparse Tensor Decompositions using HiCOO Format Jiajia Li, Jee Choi, Richard Vuduc May 8, 8 @ SIAM ALA 8 Outline

More information

(Multiscale) Modelling With SfePy

(Multiscale) Modelling With SfePy (Multiscale) Modelling With SfePy Random Remarks... Robert Cimrman & Eduard Rohan & others Department of Mechanics & New Technologies Research Centre University of West Bohemia Plzeň, Czech Republic PANM

More information

Linear Classifiers and the Perceptron

Linear Classifiers and the Perceptron Linear Classifiers and the Perceptron William Cohen February 4, 2008 1 Linear classifiers Let s assume that every instance is an n-dimensional vector of real numbers x R n, and there are only two possible

More information

JOVIAL JUPYTER OVERRIDE FOR ASTRONOMICAL LIBRARIES. MAURICIO ARAYA, CAMILO VALENZUELA, HUMBERTO FARÍAS, MAURICIO SOLAR, et al.

JOVIAL JUPYTER OVERRIDE FOR ASTRONOMICAL LIBRARIES. MAURICIO ARAYA, CAMILO VALENZUELA, HUMBERTO FARÍAS, MAURICIO SOLAR, et al. JOVIAL JUPYTER OVERRIDE FOR ASTRONOMICAL LIBRARIES MAURICIO ARAYA, CAMILO VALENZUELA, HUMBERTO FARÍAS, MAURICIO SOLAR, et al. mauricio.araya@usm.cl WHAT IS JOVIAL? Jupyter-based service for astronomical

More information

NumPy 1.5. open source. Beginner's Guide. v g I. performance, Python based free open source NumPy. An action-packed guide for the easy-to-use, high

NumPy 1.5. open source. Beginner's Guide. v g I. performance, Python based free open source NumPy. An action-packed guide for the easy-to-use, high NumPy 1.5 Beginner's Guide An actionpacked guide for the easytouse, high performance, Python based free open source NumPy mathematical library using realworld examples Ivan Idris.; 'J 'A,, v g I open source

More information

Solving PDEs with CUDA Jonathan Cohen

Solving PDEs with CUDA Jonathan Cohen Solving PDEs with CUDA Jonathan Cohen jocohen@nvidia.com NVIDIA Research PDEs (Partial Differential Equations) Big topic Some common strategies Focus on one type of PDE in this talk Poisson Equation Linear

More information

DATA SCIENCE SIMPLIFIED USING ARCGIS API FOR PYTHON

DATA SCIENCE SIMPLIFIED USING ARCGIS API FOR PYTHON DATA SCIENCE SIMPLIFIED USING ARCGIS API FOR PYTHON LEAD CONSULTANT, INFOSYS LIMITED SEZ Survey No. 41 (pt) 50 (pt), Singapore Township PO, Ghatkesar Mandal, Hyderabad, Telengana 500088 Word Limit of the

More information

Diffusion Wavelets and Applications

Diffusion Wavelets and Applications Diffusion Wavelets and Applications J.C. Bremer, R.R. Coifman, P.W. Jones, S. Lafon, M. Mohlenkamp, MM, R. Schul, A.D. Szlam Demos, web pages and preprints available at: S.Lafon: www.math.yale.edu/~sl349

More information

Heterogeneous programming for hybrid CPU-GPU systems: Lessons learned from computational chemistry

Heterogeneous programming for hybrid CPU-GPU systems: Lessons learned from computational chemistry Heterogeneous programming for hybrid CPU-GPU systems: Lessons learned from computational chemistry and Eugene DePrince Argonne National Laboratory (LCF and CNM) (Eugene moved to Georgia Tech last week)

More information

Karsten Vennemann, Seattle. QGIS Workshop CUGOS Spring Fling 2015

Karsten Vennemann, Seattle. QGIS Workshop CUGOS Spring Fling 2015 Karsten Vennemann, Seattle 2015 a very capable and flexible Desktop GIS QGIS QGIS Karsten Workshop Vennemann, Seattle slide 2 of 13 QGIS - Desktop GIS originally a GIS viewing environment QGIS for the

More information

A Glimpse at Scipy FOSSEE. June Abstract This document shows a glimpse of the features of Scipy that will be explored during this course.

A Glimpse at Scipy FOSSEE. June Abstract This document shows a glimpse of the features of Scipy that will be explored during this course. A Glimpse at Scipy FOSSEE June 010 Abstract This document shows a glimpse of the features of Scipy that will be explored during this course. 1 Introduction SciPy is open-source software for mathematics,

More information

PHP-Einführung - Lesson 4 - Object Oriented Programming. Alexander Lichter June 27, 2017

PHP-Einführung - Lesson 4 - Object Oriented Programming. Alexander Lichter June 27, 2017 PHP-Einführung - Lesson 4 - Object Oriented Programming Alexander Lichter June 27, 2017 Content of this lesson 1. Recap 2. Why OOP? 3. Git gud - PHPStorm 4. Include and Require 5. Classes and objects 6.

More information

Among various open-source GIS programs, QGIS can be the best suitable option which can be used across partners for reasons outlined below.

Among various open-source GIS programs, QGIS can be the best suitable option which can be used across partners for reasons outlined below. Comparison of Geographic Information Systems (GIS) software As of January 2018, WHO has reached an agreement with ESRI (an international supplier of GIS software) for an unlimited use of ArcGIS Desktop

More information

Baryon resonance production at. LIU Beijiang (IHEP, CAS) For the BESIII collaboration ATHOS3/PWA8 2015, GWU

Baryon resonance production at. LIU Beijiang (IHEP, CAS) For the BESIII collaboration ATHOS3/PWA8 2015, GWU Baryon resonance production at LIU Beijiang (IHEP, CAS) For the BESIII collaboration ATHOS3/PWA8 2015, GWU Spectrum of Nucleon Resonances **** *** ** * N Spectrum 10 5 7 3 Δ Spectrum 7 3 7 5 Particle Data

More information

Computational and Statistical Tradeoffs via Convex Relaxation

Computational and Statistical Tradeoffs via Convex Relaxation Computational and Statistical Tradeoffs via Convex Relaxation Venkat Chandrasekaran Caltech Joint work with Michael Jordan Time-constrained Inference o Require decision after a fixed (usually small) amount

More information

Please bring the task to your first physics lesson and hand it to the teacher.

Please bring the task to your first physics lesson and hand it to the teacher. Pre-enrolment task for 2014 entry Physics Why do I need to complete a pre-enrolment task? This bridging pack serves a number of purposes. It gives you practice in some of the important skills you will

More information

CHE210D Principles of Modern Molecular Simulation Methods

CHE210D Principles of Modern Molecular Simulation Methods CHE210D Principles of Modern Molecular Simulation Methods Instructor: M. Scott Shell Spring Quarter 2012 TuTh 12:30-1:45pm in Eng II 1519 www.engr.ucsb.edu/~shell/che210d The goals of this course This

More information

Power Supply Quality Analysis Using S-Transform and SVM Classifier

Power Supply Quality Analysis Using S-Transform and SVM Classifier Journal of Power and Energy Engineering, 2014, 2, 438-447 Published Online April 2014 in SciRes. http://www.scirp.org/journal/jpee http://dx.doi.org/10.4236/jpee.2014.24059 Power Supply Quality Analysis

More information

A GUI FOR EVOLVE ZAMS

A GUI FOR EVOLVE ZAMS A GUI FOR EVOLVE ZAMS D. R. Schlegel Computer Science Department Here the early work on a new user interface for the Evolve ZAMS stellar evolution code is presented. The initial goal of this project is

More information

Physics 202 Laboratory 5. Linear Algebra 1. Laboratory 5. Physics 202 Laboratory

Physics 202 Laboratory 5. Linear Algebra 1. Laboratory 5. Physics 202 Laboratory Physics 202 Laboratory 5 Linear Algebra Laboratory 5 Physics 202 Laboratory We close our whirlwind tour of numerical methods by advertising some elements of (numerical) linear algebra. There are three

More information

Linear Algebra. PHY 604: Computational Methods in Physics and Astrophysics II

Linear Algebra. PHY 604: Computational Methods in Physics and Astrophysics II Linear Algebra Numerical Linear Algebra We've now seen several places where solving linear systems comes into play Implicit ODE integration Cubic spline interpolation We'll see many more, including Solving

More information

Massively parallel electronic structure calculations with Python software. Jussi Enkovaara Software Engineering CSC the finnish IT center for science

Massively parallel electronic structure calculations with Python software. Jussi Enkovaara Software Engineering CSC the finnish IT center for science Massively parallel electronic structure calculations with Python software Jussi Enkovaara Software Engineering CSC the finnish IT center for science GPAW Software package for electronic structure calculations

More information

Some thoughts about energy efficient application execution on NEC LX Series compute clusters

Some thoughts about energy efficient application execution on NEC LX Series compute clusters Some thoughts about energy efficient application execution on NEC LX Series compute clusters G. Wellein, G. Hager, J. Treibig, M. Wittmann Erlangen Regional Computing Center & Department of Computer Science

More information

Lazy matrices for contraction-based algorithms

Lazy matrices for contraction-based algorithms Lazy matrices for contraction-based algorithms Michael F. Herbst michael.herbst@iwr.uni-heidelberg.de https://michael-herbst.com Interdisziplinäres Zentrum für wissenschaftliches Rechnen Ruprecht-Karls-Universität

More information

Exercise Sheet 1. 1 Probability revision 1: Student-t as an infinite mixture of Gaussians

Exercise Sheet 1. 1 Probability revision 1: Student-t as an infinite mixture of Gaussians Exercise Sheet 1 1 Probability revision 1: Student-t as an infinite mixture of Gaussians Show that an infinite mixture of Gaussian distributions, with Gamma distributions as mixing weights in the following

More information

Nuclear Energy Density Functional

Nuclear Energy Density Functional UNEDF Project: Towards a Universal Nuclear Energy Density Functional Atomic nucleus Piotr Magierski Warsaw University of Technology/University of Washington Nuclear Landscape 126 superheavy nuclei protons

More information

Scikit-learn. scikit. Machine learning for the small and the many Gaël Varoquaux. machine learning in Python

Scikit-learn. scikit. Machine learning for the small and the many Gaël Varoquaux. machine learning in Python Scikit-learn Machine learning for the small and the many Gaël Varoquaux scikit machine learning in Python In this meeting, I represent low performance computing Scikit-learn Machine learning for the small

More information

Lecture 4: Training a Classifier

Lecture 4: Training a Classifier Lecture 4: Training a Classifier Roger Grosse 1 Introduction Now that we ve defined what binary classification is, let s actually train a classifier. We ll approach this problem in much the same way as

More information

High-performance Technical Computing with Erlang

High-performance Technical Computing with Erlang High-performance Technical Computing with Erlang Alceste Scalas Giovanni Casu Piero Pili Center for Advanced Studies, Research and Development in Sardinia ACM ICFP 2008 Erlang Workshop September 27th,

More information

Lesson 16: Technology Trends and Research

Lesson 16: Technology Trends and Research http://www.esri.com/library/whitepapers/pdfs/integrated-geoenabled-soa.pdf GEOG DL582 : GIS Data Management Lesson 16: Technology Trends and Research Overview Learning Objective Questions: 1. Why is integration

More information

4th year Project demo presentation

4th year Project demo presentation 4th year Project demo presentation Colm Ó héigeartaigh CASE4-99387212 coheig-case4@computing.dcu.ie 4th year Project demo presentation p. 1/23 Table of Contents An Introduction to Quantum Computing The

More information

Discretization of PDEs and Tools for the Parallel Solution of the Resulting Systems

Discretization of PDEs and Tools for the Parallel Solution of the Resulting Systems Discretization of PDEs and Tools for the Parallel Solution of the Resulting Systems Stan Tomov Innovative Computing Laboratory Computer Science Department The University of Tennessee Wednesday April 4,

More information

Taylor Series: Notes for CSCI3656

Taylor Series: Notes for CSCI3656 Taylor Series: Notes for CSCI3656 Liz Bradley Department of Computer Science University of Colorado Boulder, Colorado, USA 80309-0430 c 2002 lizb@cs.colorado.edu Research Report on Curricula and Teaching

More information

Randomized Selection on the GPU. Laura Monroe, Joanne Wendelberger, Sarah Michalak Los Alamos National Laboratory

Randomized Selection on the GPU. Laura Monroe, Joanne Wendelberger, Sarah Michalak Los Alamos National Laboratory Randomized Selection on the GPU Laura Monroe, Joanne Wendelberger, Sarah Michalak Los Alamos National Laboratory High Performance Graphics 2011 August 6, 2011 Top k Selection on GPU Output the top k keys

More information

Why Complexity is Different

Why Complexity is Different Why Complexity is Different Yaneer Bar-Yam (Dated: March 21, 2017) One of the hardest things to explain is why complex systems are actually different from simple systems. The problem is rooted in a set

More information

Factor Analysis (10/2/13)

Factor Analysis (10/2/13) STA561: Probabilistic machine learning Factor Analysis (10/2/13) Lecturer: Barbara Engelhardt Scribes: Li Zhu, Fan Li, Ni Guan Factor Analysis Factor analysis is related to the mixture models we have studied.

More information

Black Holes, Holography, and Quantum Information

Black Holes, Holography, and Quantum Information Black Holes, Holography, and Quantum Information Daniel Harlow Massachusetts Institute of Technology August 31, 2017 1 Black Holes Black holes are the most extreme objects we see in nature! Classically

More information

An Introduction to Computer Simulation Methods

An Introduction to Computer Simulation Methods An Introduction to Computer Simulation Methods Applications to Physical Systems Second Edition Harvey Gould Department of Physics Clark University Jan Tobochnik Department of Physics Kalamazoo College

More information

CRYSTAL in parallel: replicated and distributed (MPP) data. Why parallel?

CRYSTAL in parallel: replicated and distributed (MPP) data. Why parallel? CRYSTAL in parallel: replicated and distributed (MPP) data Roberto Orlando Dipartimento di Chimica Università di Torino Via Pietro Giuria 5, 10125 Torino (Italy) roberto.orlando@unito.it 1 Why parallel?

More information

Linear Regression. Robot Image Credit: Viktoriya Sukhanova 123RF.com

Linear Regression. Robot Image Credit: Viktoriya Sukhanova 123RF.com Linear Regression These slides were assembled by Eric Eaton, with grateful acknowledgement of the many others who made their course materials freely available online. Feel free to reuse or adapt these

More information

SPARSE SOLVERS POISSON EQUATION. Margreet Nool. November 9, 2015 FOR THE. CWI, Multiscale Dynamics

SPARSE SOLVERS POISSON EQUATION. Margreet Nool. November 9, 2015 FOR THE. CWI, Multiscale Dynamics SPARSE SOLVERS FOR THE POISSON EQUATION Margreet Nool CWI, Multiscale Dynamics November 9, 2015 OUTLINE OF THIS TALK 1 FISHPACK, LAPACK, PARDISO 2 SYSTEM OVERVIEW OF CARTESIUS 3 POISSON EQUATION 4 SOLVERS

More information

Fast Multipole Methods: Fundamentals & Applications. Ramani Duraiswami Nail A. Gumerov

Fast Multipole Methods: Fundamentals & Applications. Ramani Duraiswami Nail A. Gumerov Fast Multipole Methods: Fundamentals & Applications Ramani Duraiswami Nail A. Gumerov Week 1. Introduction. What are multipole methods and what is this course about. Problems from physics, mathematics,

More information

How to write maths (well)

How to write maths (well) How to write maths (well) Dr Euan Spence 29 September 2017 These are the slides from a talk I gave to the new first-year students at Bath, annotated with some of the things I said (which appear in boxes

More information

Accelerating linear algebra computations with hybrid GPU-multicore systems.

Accelerating linear algebra computations with hybrid GPU-multicore systems. Accelerating linear algebra computations with hybrid GPU-multicore systems. Marc Baboulin INRIA/Université Paris-Sud joint work with Jack Dongarra (University of Tennessee and Oak Ridge National Laboratory)

More information

Announcements. Problem Set 6 due next Monday, February 25, at 12:50PM. Midterm graded, will be returned at end of lecture.

Announcements. Problem Set 6 due next Monday, February 25, at 12:50PM. Midterm graded, will be returned at end of lecture. Turing Machines Hello Hello Condensed Slide Slide Readers! Readers! This This lecture lecture is is almost almost entirely entirely animations that that show show how how each each Turing Turing machine

More information

Dedalus: An Open-Source Spectral Magnetohydrodynamics Code

Dedalus: An Open-Source Spectral Magnetohydrodynamics Code Dedalus: An Open-Source Spectral Magnetohydrodynamics Code Keaton Burns University of California Berkeley Jeff Oishi SLAC National Accelerator Laboratory Received ; accepted ABSTRACT We developed the magnetohydrodynamic

More information

Computation of Large Sparse Aggregated Areas for Analytic Database Queries

Computation of Large Sparse Aggregated Areas for Analytic Database Queries Computation of Large Sparse Aggregated Areas for Analytic Database Queries Steffen Wittmer Tobias Lauer Jedox AG Collaborators: Zurab Khadikov Alexander Haberstroh Peter Strohm Business Intelligence and

More information

March 19 - Solving Linear Systems

March 19 - Solving Linear Systems March 19 - Solving Linear Systems Welcome to linear algebra! Linear algebra is the study of vectors, vector spaces, and maps between vector spaces. It has applications across data analysis, computer graphics,

More information

Approximate Principal Components Analysis of Large Data Sets

Approximate Principal Components Analysis of Large Data Sets Approximate Principal Components Analysis of Large Data Sets Daniel J. McDonald Department of Statistics Indiana University mypage.iu.edu/ dajmcdon April 27, 2016 Approximation-Regularization for Analysis

More information

Fast Hierarchical Clustering from the Baire Distance

Fast Hierarchical Clustering from the Baire Distance Fast Hierarchical Clustering from the Baire Distance Pedro Contreras 1 and Fionn Murtagh 1,2 1 Department of Computer Science. Royal Holloway, University of London. 57 Egham Hill. Egham TW20 OEX, England.

More information

Transforming from Geographic to Celestial Coordinates

Transforming from Geographic to Celestial Coordinates Transforming from Geographic to Celestial Coordinates Michael McEllin 1 Introduction The simplest astronomical observation of all is that the stars appear to move around the Earth (which, of course is

More information

UNVEILING THE ULTIMATE LAWS OF NATURE: DARK MATTER, SUPERSYMMETRY, AND THE LHC. Gordon Kane, Michigan Center for Theoretical Physics Warsaw, June 2009

UNVEILING THE ULTIMATE LAWS OF NATURE: DARK MATTER, SUPERSYMMETRY, AND THE LHC. Gordon Kane, Michigan Center for Theoretical Physics Warsaw, June 2009 UNVEILING THE ULTIMATE LAWS OF NATURE: DARK MATTER, SUPERSYMMETRY, AND THE LHC Gordon Kane, Michigan Center for Theoretical Physics Warsaw, June 2009 OUTLINE! Some things we ve learned about the physical

More information

Fault Tolerant Computing CS 530 Software Reliability Growth. Yashwant K. Malaiya Colorado State University

Fault Tolerant Computing CS 530 Software Reliability Growth. Yashwant K. Malaiya Colorado State University Fault Tolerant Computing CS 530 Software Reliability Growth Yashwant K. Malaiya Colorado State University 1 Software Reliability Growth: Outline Testing approaches Operational Profile Software Reliability

More information

Pysynphot: A Python Re Implementation of a Legacy App in Astronomy

Pysynphot: A Python Re Implementation of a Legacy App in Astronomy Pysynphot: A Python Re Implementation of a Legacy App in Astronomy Vicki Laidler 1, Perry Greenfield, Ivo Busko, Robert Jedrzejewski Science Software Branch Space Telescope Science Institute Baltimore,

More information

Designing Information Devices and Systems I Fall 2018 Lecture Notes Note Introduction to Linear Algebra the EECS Way

Designing Information Devices and Systems I Fall 2018 Lecture Notes Note Introduction to Linear Algebra the EECS Way EECS 16A Designing Information Devices and Systems I Fall 018 Lecture Notes Note 1 1.1 Introduction to Linear Algebra the EECS Way In this note, we will teach the basics of linear algebra and relate it

More information

Ordinary Least Squares Linear Regression

Ordinary Least Squares Linear Regression Ordinary Least Squares Linear Regression Ryan P. Adams COS 324 Elements of Machine Learning Princeton University Linear regression is one of the simplest and most fundamental modeling ideas in statistics

More information

Lecture 4: Training a Classifier

Lecture 4: Training a Classifier Lecture 4: Training a Classifier Roger Grosse 1 Introduction Now that we ve defined what binary classification is, let s actually train a classifier. We ll approach this problem in much the same way as

More information

Estimation of the Click Volume by Large Scale Regression Analysis May 15, / 50

Estimation of the Click Volume by Large Scale Regression Analysis May 15, / 50 Estimation of the Click Volume by Large Scale Regression Analysis Yuri Lifshits, Dirk Nowotka [International Computer Science Symposium in Russia 07, Ekaterinburg] Presented by: Aditya Menon UCSD May 15,

More information

Acceleration of WRF on the GPU

Acceleration of WRF on the GPU Acceleration of WRF on the GPU Daniel Abdi, Sam Elliott, Iman Gohari Don Berchoff, Gene Pache, John Manobianco TempoQuest 1434 Spruce Street Boulder, CO 80302 720 726 9032 TempoQuest.com THE WORLD S FASTEST

More information

Introductory Course at UMD with Remote Observing - Astronomy in Practice

Introductory Course at UMD with Remote Observing - Astronomy in Practice Introductory Course at UMD with Remote Observing - Astronomy in Practice Dr. Melissa N. Hayes-Gehrke Astronomy Dept., UMD 1 2016 GROWTH Education Workshop Overarching Goal Involve non-astronomy students

More information

MATH 320, WEEK 6: Linear Systems, Gaussian Elimination, Coefficient Matrices

MATH 320, WEEK 6: Linear Systems, Gaussian Elimination, Coefficient Matrices MATH 320, WEEK 6: Linear Systems, Gaussian Elimination, Coefficient Matrices We will now switch gears and focus on a branch of mathematics known as linear algebra. There are a few notes worth making before

More information

ab initio Electronic Structure Calculations

ab initio Electronic Structure Calculations ab initio Electronic Structure Calculations New scalability frontiers using the BG/L Supercomputer C. Bekas, A. Curioni and W. Andreoni IBM, Zurich Research Laboratory Rueschlikon 8803, Switzerland ab

More information

CS425: Algorithms for Web Scale Data

CS425: Algorithms for Web Scale Data CS425: Algorithms for Web Scale Data Most of the slides are from the Mining of Massive Datasets book. These slides have been modified for CS425. The original slides can be accessed at: www.mmds.org Challenges

More information

Efficient implementation of the overlap operator on multi-gpus

Efficient implementation of the overlap operator on multi-gpus Efficient implementation of the overlap operator on multi-gpus Andrei Alexandru Mike Lujan, Craig Pelissier, Ben Gamari, Frank Lee SAAHPC 2011 - University of Tennessee Outline Motivation Overlap operator

More information