Brain (Tech) NCRR Overview Magnetic Leadfields and Superquadric Glyphs.

Slides:



Advertisements
Similar presentations
A Discrete Adjoint-Based Approach for Optimization Problems on 3D Unstructured Meshes Dimitri J. Mavriplis Department of Mechanical Engineering University.
Advertisements

Computer Science & Engineering Department University of California, San Diego SPICE Diego A Transistor Level Full System Simulator Chung-Kuan Cheng May.
1 Numerical Solvers for BVPs By Dong Xu State Key Lab of CAD&CG, ZJU.
CS 290H 7 November Introduction to multigrid methods
CSCI-455/552 Introduction to High Performance Computing Lecture 26.
MULTISCALE COMPUTATIONAL METHODS Achi Brandt The Weizmann Institute of Science UCLA
Numerical Algorithms ITCS 4/5145 Parallel Computing UNC-Charlotte, B. Wilkinson, 2009.
Parallelizing stencil computations Based on slides from David Culler, Jim Demmel, Bob Lucas, Horst Simon, Kathy Yelick, et al., UCB CS267.
Efficient Storage and Processing of Adaptive Triangular Grids using Sierpinski Curves Csaba Attila Vigh Department of Informatics, TU München JASS 2006,
Numerical Algorithms Matrix multiplication
Algebraic MultiGrid. Algebraic MultiGrid – AMG (Brandt 1982)  General structure  Choose a subset of variables: the C-points such that every variable.
Numerical Algorithms • Matrix multiplication
CS 584. Review n Systems of equations and finite element methods are related.
Influence of (pointwise) Gauss-Seidel relaxation on the error Poisson equation, uniform grid Error of initial guess Error after 5 relaxation Error after.
CSE351/ IT351 Modeling and Simulation
Sparse Matrix Algorithms CS 524 – High-Performance Computing.
Sparse Matrix Solvers on the GPU: Conjugate Gradients and Multigrid Jeffrey Bolz, Ian Farmer, Eitan Grinspun, Peter Schröder Caltech ASCI Center.
Steady Aeroelastic Computations to Predict the Flying Shape of Sails Sriram Antony Jameson Dept. of Aeronautics and Astronautics Stanford University First.
Scientific Visualization Data Modelling for Scientific Visualization CS 5630 / 6630 August 28, 2007.
Multi-Cluster, Mixed-Mode Computational Modeling of Human Head Conductivity Adnan Salman 1, Sergei Turovets 1, Allen Malony 1, and Vasily Volkov 1 NeuroInformatics.
An Algebraic Multigrid Solver for Analytical Placement With Layout Based Clustering Hongyu Chen, Chung-Kuan Cheng, Andrew B. Kahng, Bo Yao, Zhengyong Zhu.
Monica Garika Chandana Guduru. METHODS TO SOLVE LINEAR SYSTEMS Direct methods Gaussian elimination method LU method for factorization Simplex method of.
Tensor Field Visualization
Direct and iterative sparse linear solvers applied to groundwater flow simulations Matrix Analysis and Applications October 2007.
1 Parallel Simulations of Underground Flow in Porous and Fractured Media H. Mustapha 1,2, A. Beaudoin 1, J. Erhel 1 and J.R. De Dreuzy IRISA – INRIA.
Conjugate gradients, sparse matrix-vector multiplication, graphs, and meshes Thanks to Aydin Buluc, Umit Catalyurek, Alan Edelman, and Kathy Yelick for.
Parallel Adaptive Mesh Refinement Combined With Multigrid for a Poisson Equation CRTI RD Project Review Meeting Canadian Meteorological Centre August.
1 Numerical Integration of Partial Differential Equations (PDEs)
Parallel Performance of Hierarchical Multipole Algorithms for Inductance Extraction Ananth Grama, Purdue University Vivek Sarin, Texas A&M University Hemant.
1 A Domain Decomposition Analysis of a Nonlinear Magnetostatic Problem with 100 Million Degrees of Freedom H.KANAYAMA *, M.Ogino *, S.Sugimoto ** and J.Zhao.
Scalable Multi-Stage Stochastic Programming
Source localization MfD 2010, 17th Feb 2010
A comparison between a direct and a multigrid sparse linear solvers for highly heterogeneous flux computations A. Beaudoin, J.-R. De Dreuzy and J. Erhel.
ParCFD Parallel computation of pollutant dispersion in industrial sites Julien Montagnier Marc Buffat David Guibert.
CFD Lab - Department of Engineering - University of Liverpool Ken Badcock & Mark Woodgate Department of Engineering University of Liverpool Liverpool L69.
A 3D Vector-Additive Iterative Solver for the Anisotropic Inhomogeneous Poisson Equation in the Forward EEG problem V. Volkov 1, A. Zherdetsky 1, S. Turovets.
ML: Multilevel Preconditioning Package Trilinos User’s Group Meeting Wednesday, October 15, 2003 Jonathan Hu Sandia is a multiprogram laboratory operated.
Special Solution Strategies inside a Spectral Element Ocean Model Mohamed Iskandarani Rutgers University and Miami University Craig C. Douglas University.
Parallelizing Gauss-Seidel Solver/Pre-conditioner Aim: To parallelize a Gauss-Seidel Solver, which can be used as a pre-conditioner for the finite element.
Parallel Solution of the Poisson Problem Using MPI
CS240A: Conjugate Gradients and the Model Problem.
Implementing Hypre- AMG in NIMROD via PETSc S. Vadlamani- Tech X S. Kruger- Tech X T. Manteuffel- CU APPM S. McCormick- CU APPM Funding: DE-FG02-07ER84730.
Domain Decomposition in High-Level Parallelizaton of PDE codes Xing Cai University of Oslo.
Introduction to Scientific Computing II Multigrid Dr. Miriam Mehl Institut für Informatik Scientific Computing In Computer Science.
Introduction to Scientific Computing II Multigrid Dr. Miriam Mehl.
1 Mark F. Adams 22 October 2004 Applications of Algebraic Multigrid to Large Scale Mechanics Problems.
Introduction to Scientific Computing II
Discretization for PDEs Chunfang Chen,Danny Thorne Adam Zornes, Deng Li CS 521 Feb., 9,2006.
1 Mark F. Adams SciDAC - 27 June 2005 Ax=b: The Link between Gyrokinetic Particle Simulations of Turbulent Transport in Burning Plasmas and Micro-FE Analysis.
MULTISCALE COMPUTATIONAL METHODS Achi Brandt The Weizmann Institute of Science UCLA
1 Solving the algebraic equations A x = B =. 2 Direct solution x = A -1 B = = Applicable only to small problems For the vertical in the spectral technique.
On the Performance of PC Clusters in Solving Partial Differential Equations Xing Cai Åsmund Ødegård Department of Informatics University of Oslo Norway.
Monte Carlo Linear Algebra Techniques and Their Parallelization Ashok Srinivasan Computer Science Florida State University
Makeig-Worrell NCRR Project Overview Scott Makeig, Ph.D. is the Director of the Swartz Center for Computational Neuroscience Institute for Neural Computation.
A Parallel Hierarchical Solver for the Poisson Equation Seung Lee Deparment of Mechanical Engineering
1 Spring 2003 Prof. Tim Warburton MA557/MA578/CS557 Lecture 28.
University of Colorado
ANSYS, Inc. Proprietary © 2004 ANSYS, Inc. Chapter 5 Distributed Memory Parallel Computing v9.0.
All Pairs Shortest Path Algorithms Aditya Sehgal Amlan Bhattacharya.
Sandia National Laboratories is a multi-program laboratory managed and operated by Sandia Corporation, a wholly owned subsidiary of Lockheed Martin Corporation,
Monte Carlo Linear Algebra Techniques and Their Parallelization Ashok Srinivasan Computer Science Florida State University
High Performance Computing Seminar II Parallel mesh partitioning with ParMETIS Parallel iterative solvers with Hypre M.Sc. Caroline Mendonça Costa.
Unstructured Meshing Tools for Fusion Plasma Simulations
Finite Element Modelling of the dipole source in EEG
Linear complexity for FE forward modeling: Transfer matrices, fast FE solver methods and a first sensitivity study Carsten Wolters Tensor weiter erlaeutern.
Xing Cai University of Oslo
Adnan Salman1 , Sergei Turovets1, Allen Malony1, and Vasily Volkov
Introduction to Scientific Computing II
Comparison of CFEM and DG methods
Ph.D. Thesis Numerical Solution of PDEs and Their Object-oriented Parallel Implementations Xing Cai October 26, 1998.
Presentation transcript:

Brain (Tech) NCRR Overview Magnetic Leadfields and Superquadric Glyphs

C.H.Wolters et al., talk at BWH in Boston, August 6, 2004 [Plonsey and Heppner, 1969] Maxwell equations Maxwell equations of electrodynamics MEG [Nolting, 1992]

C.H.Wolters et al., talk at BWH in Boston, August 6, 2004 MEG node-oriented lead field

C.H.Wolters et al., talk at BWH in Boston, August 6, 2004 MEG node-oriented lead field

C.H.Wolters et al., talk at BWH in Boston, August 6, 2004 MEG node-oriented lead field

C.H.Wolters et al., talk at BWH in Boston, August 6, 2004 MEG node-oriented lead field

C.H.Wolters et al., talk at BWH in Boston, August 6, 2004 Efficient and memory-economical setup

C.H.Wolters et al., talk at BWH in Boston, August 6, 2004 with condition number Convergence of the CG solver: FE discretization, meshsize: Strategy: MultiGrid (MG)-Preconditioning! Example: Efficient and memory-economical setup

C.H.Wolters et al., talk at BWH in Boston, August 6, 2004 Principle of the AMG: Smoother is given (Gauss-Seidel) Algebraic Multigrid Coarse grids and interpolation matrices are constructed from the entries of K –Diagonal entries nodes –Nondiagonal entries edges Coarse grids and interpolation matrices are constructed from the entries of K –Diagonal entries nodes –Nondiagonal entries edges Only one high resolution FE mesh! AMG-interpolation non-optimal: –Some few error components are not well reduced, i.e., some few eigenvalues of the AMG iteration matrix are close to 1 AMG-interpolation non-optimal: –Some few error components are not well reduced, i.e., some few eigenvalues of the AMG iteration matrix are close to 1 Problems: Strategy: AMG-CG!

C.H.Wolters et al., talk at BWH in Boston, August 6, 2004 SGI Origin2000, 195MHz, MIPS Single processor: Solver comparison

C.H.Wolters et al., talk at BWH in Boston, August 6, 2004 Multiple right-hand sides (RHS) saved as block-vector  memory access to matrix in matrix-vector op. once per block  Improved cache hit rate Multiple right-hand sides (RHS) saved as block-vector  memory access to matrix in matrix-vector op. once per block  Improved cache hit rate Treatment of multiple right-hand sides All matrix-vector operations in AMG-CG adapted to blockvectors: CG: Matrix-blockvector, block scalar products AMG: block smoother, block defect, block restriction/prolongation

C.H.Wolters et al., talk at BWH in Boston, August 6, 2004 Unknowns:147,287 MEG-channels: 147 3RHS-AMG-CG symIC(0)-CG Factor: 9 Mac G4, 3RHS- AMG-CG: 14min FE iterative solver approach for the lead field bases setup Aniso./Inhom. does not change performance

C.H.Wolters et al., talk at BWH in Boston, August 6, 2004 Efficiency of the lead field bases approach Head model: Tetrahedral FE, 147,287 nodes, 892,119 elements

C.H.Wolters et al., talk at BWH in Boston, August 6, 2004 Efficiency of the lead field bases approach Head model: Tetrahedral FE, 147,287 nodes, 892,119 elements Influence space: brain surface mesh, 2mm resolution, 9555 nodes

C.H.Wolters et al., talk at BWH in Boston, August 6, 2004 Efficiency of the lead field bases approach Head model: Tetrahedral FE, 147,287 nodes, 892,119 elements Influence space: brain surface mesh, 2mm resolution, 9555 nodes Number of FE forward solutions: EEG, 71 electrodes: 9555 * 3 = MEG, 147 channels: 9555 * 2 = (tangential constraint) Number of FE forward solutions: EEG, 71 electrodes: 9555 * 3 = MEG, 147 channels: 9555 * 2 = (tangential constraint) Dipole model: Blurred dipole [Buchner et al., 1997]

C.H.Wolters et al., talk at BWH in Boston, August 6, 2004 Distributing the memory for 1mm FE- modeling

C.H.Wolters et al., talk at BWH in Boston, August 6, 2004 ``Element-wise’’ partitioning into subdomains Parallel MultiRHS-AMG-CG: Communication is only necessary for: Smoother (  -Jacobi within interface nodes, Gauss-Seidel between blocks and for inner nodes) distribution of coarse grid solution inner products within PCG method Towards 1mm FE resolutions: Parallel AMG- CG on distributed memory computers

C.H.Wolters et al., talk at BWH in Boston, August 6, 2004 Solver time comparison: Unknowns: PC cluster, each processor 1.7GHz, 256KB cache Performance of parallel MultiRHS-AMG-CG

Brain (Tech) NCRR Superquadric Tensor Glyphs Ellipsoidal Glyphs No shape difference Visual ambiguity Barr ‘81

Brain (Tech) NCRR Superquadric Tensor Glyphs Eigenvalue differences imply assymetry Better visualization: Anisotropy Skewness