The Materials Computation Center, University of Illinois Duane Johnson and Richard Martin (PIs), NSF DMR-03-25939 www.mcc.uiuc.edu Computer science-based.

Slides:



Advertisements
Similar presentations
A Large-Grained Parallel Algorithm for Nonlinear Eigenvalue Problems Using Complex Contour Integration Takeshi Amako, Yusaku Yamamoto and Shao-Liang Zhang.
Advertisements

Numerical Solution of Linear Equations
3D Geometry for Computer Graphics
The Materials Computation Center, University of Illinois Duane Johnson and Richard Martin (PIs), NSF DMR OBJECTIVE: Accelerate.
Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
Interpolation By Radial Basis Function ( RBF ) By: Reihane Khajepiri, Narges Gorji Supervisor: Dr.Rabiei 1.
Algebraic, transcendental (i.e., involving trigonometric and exponential functions), ordinary differential equations, or partial differential equations...
ACCELERATING GOOGLE’S PAGERANK Liz & Steve. Background  When a search query is entered in Google, the relevant results are returned to the user in an.
Use of Kalman filters in time and frequency analysis John Davis 1st May 2011.
Shape From Light Field meets Robust PCA
Modeling Generation and Nonlinear Evolution of VLF Waves for Space Applications W.A. Scales Center of Space Science and Engineering Research Virginia Tech.
Mar Numerical approach for large-scale Eigenvalue problems 1 Definition Why do we study it ? Is the Behavior system based or nodal based? What are.
Computer Graphics Recitation 5.
Scientific Computing Seminar AMLS, Spectral Schur Complements and Iterative Computation of Eigenvalues * C. BekasY. Saad Comp. Science & Engineering Dept.
Shawn Sickel A Comparison of some Iterative Methods in Scientific Computing.
1 A Matrix Free Newton /Krylov Method For Coupling Complex Multi-Physics Subsystems Yunlin Xu School of Nuclear Engineering Purdue University October 23,
Principal Components Analysis (PCA) 273A Intro Machine Learning.
Tutorial 10 Iterative Methods and Matrix Norms. 2 In an iterative process, the k+1 step is defined via: Iterative processes Eigenvector decomposition.
Monica Garika Chandana Guduru. METHODS TO SOLVE LINEAR SYSTEMS Direct methods Gaussian elimination method LU method for factorization Simplex method of.
Ordinary Differential Equations (ODEs)
MATH 685/ CSI 700/ OR 682 Lecture Notes Lecture 6. Eigenvalue problems.
Section 8.3 – Systems of Linear Equations - Determinants Using Determinants to Solve Systems of Equations A determinant is a value that is obtained from.
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems Prof. Hao Zhu Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
Solution of Eigenproblem of Non-Proportional Damping Systems by Lanczos Method In-Won Lee, Professor, PE In-Won Lee, Professor, PE Structural Dynamics.
Summarized by Soo-Jin Kim
Are their more appropriate domain-specific performance metrics for science and engineering HPC applications available then the canonical “percent of peak”
Using Adaptive Methods for Updating/Downdating PageRank Gene H. Golub Stanford University SCCM Joint Work With Sep Kamvar, Taher Haveliwala.
Algorithms for a large sparse nonlinear eigenvalue problem Yusaku Yamamoto Dept. of Computational Science & Engineering Nagoya University.
The Materials Computation Center, University of Illinois Duane Johnson and Richard Martin (PIs), NSF DMR The two-week Summer.
1 Using the PETSc Parallel Software library in Developing MPP Software for Calculating Exact Cumulative Reaction Probabilities for Large Systems (M. Minkoff.
Presentation to VII International Workshop on Advanced Computing and Analysis Techniques in Physics Research October, 2000.
2005 Materials Computation Center External Board Meeting The Materials Computation Center Duane D. Johnson and Richard M. Martin (PIs) Funded by NSF DMR.
SVD: Singular Value Decomposition
" Characterizing the Relationship between ILU-type Preconditioners and the Storage Hierarchy" " Characterizing the Relationship between ILU-type Preconditioners.
Orthogonality and Least Squares
Efficient Integration of Large Stiff Systems of ODEs Using Exponential Integrators M. Tokman, M. Tokman, University of California, Merced 2 hrs 1.5 hrs.
© 2011 Autodesk Freely licensed for use by educational institutions. Reuse and changes require a note indicating that content has been modified from the.
On the Use of Sparse Direct Solver in a Projection Method for Generalized Eigenvalue Problems Using Numerical Integration Takamitsu Watanabe and Yusaku.
Colorado Center for Astrodynamics Research The University of Colorado 1 STATISTICAL ORBIT DETERMINATION ASEN 5070 LECTURE 11 9/16,18/09.
Investigating Adaptive Compilation using the MIPSpro Compiler Keith D. Cooper Todd Waterman Department of Computer Science Rice University Houston, TX.
1 MODELING MATTER AT NANOSCALES 4. Introduction to quantum treatments The variational method.
Comp. Mat. Science School 2001 Lecture 21 Density Functional Theory for Electrons in Materials Richard M. Martin Bands in GaAs Prediction of Phase Diagram.
Approach Toward Linear Time QMC a,c David Ceperley, a Bryan Clark, b,d Eric de Sturler, a,c Jeongnim Kim, b,e Chris Siefert University of Illinois at Urbana-Champaign,
The Materials Computation Center, University of Illinois Duane Johnson and Richard Martin (PIs), NSF DMR OBJECTIVE: To accelerate.
Numerical Analysis. Numerical Analysis or Scientific Computing Concerned with design and analysis of algorithms for solving mathematical problems that.
MS 15: Data-Aware Parallel Computing Data-Driven Parallelization in Multi-Scale Applications – Ashok Srinivasan, Florida State University Dynamic Data.
23/5/20051 ICCS congres, Atlanta, USA May 23, 2005 The Deflation Accelerated Schwarz Method for CFD C. Vuik Delft University of Technology
© 2012 Autodesk A Fast Modal (Eigenvalue) Solver Based on Subspace and AMG Sam MurgieJames Herzing Research ManagerSimulation Evangelist.
Large-Scale Matrix Factorization with Missing Data under Additional Constraints Kaushik Mitra University of Maryland, College Park, MD Sameer Sheoreyy.
1. Systems of Linear Equations and Matrices (8 Lectures) 1.1 Introduction to Systems of Linear Equations 1.2 Gaussian Elimination 1.3 Matrices and Matrix.
Finite Element Modelling of Photonic Crystals Ben Hiett J Generowicz, M Molinari, D Beckett, KS Thomas, GJ Parker and SJ Cox High Performance Computing.
EECS 274 Computer Vision Projective Structure from Motion.
Application of Finite Element Methods to Photonic Crystal Modelling B.P. Hiett D. Beckett, S.J. Cox, J. Generowicz, M. Molinari, K.S. Thomas High Performance.
1a.1 Parallel Computing and Parallel Computers ITCS 4/5145 Cluster Computing, UNC-Charlotte, B. Wilkinson, 2006.
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems
MA237: Linear Algebra I Chapters 1 and 2: What have we learned?
Parallel Computing and Parallel Computers
Amit Amritkar & Danesh Tafti Eric de Sturler & Kasia Swirydowicz
LECTURE 09: BAYESIAN ESTIMATION (Cont.)
Solving Systems of Linear Equations: Iterative Methods
Last hour: Matrices in QM
Meros: Software for Block Preconditioning the Navier-Stokes Equations
A Comparison of some Iterative Methods in Scientific Computing
The Materials Computation Center. Duane D. Johnson and Richard M
Fast Refrigerant Property Calculations
ADVANCED VIBRATION Lecture #1 Asst. Prof. Dr. Mahir Hameed Majeed ©2018.
دانشگاه صنعتي اميركبير
Parallel Computing and Parallel Computers
Potential for parallel computers/parallel programming
RKPACK A numerical package for solving large eigenproblems
Presentation transcript:

The Materials Computation Center, University of Illinois Duane Johnson and Richard Martin (PIs), NSF DMR Computer science-based approaches for the design of advanced materials RESULTS: Calculating the properties and behavior materials has a high computational demand, which currently makes analyzing larger systems prohibitively expensive. Often, increasing the number of elements in a computation can increase the computing time significantly. Our research deals with some specific components of the calculations: linear systems and least squares, eigenvalue problems, systems of ODEs, and approximations to functions of matrices. Our approach is to recycle information from earlier computations, to make subsequent computations substantially more efficient. Some simulations which previously required supercomputers now only require desktop machines. Advanced materials: We have computed an optimal design for a material that becomes thicker when stretched in one direction. We investigate both the ideal shape of a single element of the material (inset) and the behavior of the whole material. Krylov Space Approximations for Materials Science Problems WHY IT MATTERS: Computer science plays a key role in modeling and creating materials that have unique properties and behavior. We designed, for example, a material that both widens and lengthens when stretched, and narrows when compressed — unlike almost all known materials. Potential applications include fasteners, such as ideal nails, and shock- absorbing material. We are also calculating the properties of important deep-earth materials, with unprecedented accuracy. At depths greater than 100 kilometers (60 miles), these materials can be difficult to obtain (some are found only in meteorites) and therefore cannot be evaluated with laboratory experiments. Computational mineral physics is part of a larger effort to predict Earth’s behavior and to understand how it became a habitable planet.

The Materials Computation Center, University of Illinois Duane Johnson and Richard Martin (PIs), NSF DMR METHODS: Many applications involve long sequences of slowly changing matrix problems. We approximate solutions by projection on search spaces that are constructed iteratively. We adapt and reuse (“recycle”) previous search spaces to augment the current search space to significantly improve initial guesses and the convergence to solutions for subsequent problems in the sequence. For effective recycling, we consider the effects of small changes in the matrix: perturbations of solutions, invariant subspaces (or eigenvectors), and other relevant values, vectors, or spaces. Our primary objectives are: to determine when recycling is appropriate and efficient. For example, in simulating crack propagation, the linear solver is faster when low-frequency modes are removed from the problem. These modes do not change for a tiny propagation of the crack. Hence, they are appropriate for recycling and the next linear system can be solved faster. to create a solver that copes with continually changing systems. For example, after sufficient propagation of a crack, the low-frequency modes change drastically, but our solver+recycling method is able to cope with the rate of change. to take advantage of parallel computing. NEXT STEPS: We plan to extend these models to the building blocks of a solid (at the scale of an individual atom and of electrons), and to perform even larger simulations. PUBLICATIONS ARISING FROM THIS RESEARCH: Misha Kilmer and Eric de Sturler, “Recycling Subspace Information for Diffuse Optical Tomography”, SIAM Journal on Scientific Computing 27 (6), , 27 pages (2006) Michael L. Parks, Eric de Sturler, Greg Mackey, Duane D. Johnson, and Spandan Maiti, “Recycling Krylov Subspaces for Sequences of Linear Systems”, SIAM Journal on Scientific Computing, 24 pages (accepted 2006) Shun Wang, Eric de Sturler, and Glaucio H. Paulino, “Large-Scale Topology Optimization using Preconditioned Krylov Subspace Methods with Recycling”, International Journal for Numerical Methods in Engineering, 28 pages (accepted 2006) PRINCIPAL INVESTIGATORS: E. de Sturler (CS, Virginia Tech), G. Paulino (Civ. Eng, UIUC), D. Ceperley (Phys. and NCSA, UIUC), J. Kim (NCSA, UIUC); Students: Z. Cheng (CS, UIUC), G. Mackey (Sandia Nat’l Lab), M. Parks (Sandia Nat’l Lab), C. Siefert (CS, UIUC), S. Wang (CS, UIUC)