- 13
- 21 568
AG Geometry Processing
Приєднався 14 чер 2016
IGS 2016 Invited Talk: Combinatorics + Numerical Methods + Applications = SuiteSparse (Tim Davis)
Sparse Matrix Algorithms:
Combinatorics + Numerical Methods + Applications = SuiteSparse
Tim Davis, Texas A&M University
Abstract:
Sparse matrix algorithms lie in the intersection of graph theory and numerical linear algebra, and are a key component of high-performance combinatorial scientific computing. This talk gives an overview of SuiteSparse, a suite of sparse solvers written over the past 25 years with several colleagues. I will also highlight several specific contributions in this domain that appear in SuiteSparse, ranging from theory and algorithms to reliable mathematical software and its impact on applications:
Sparse Cholesky update/downdate
Approximate minimum degree
Unsymmetric multifrontal method for sparse LU factorization
Multifrontal sparse QR factorization, including my current work in GPU-based heterogeneous high-performance parallel computing.
My goal is to connect with current and potential users of SuiteSparse, by illustrating the features that the codes provide to users, by providing an overview of the algorithms inside SuiteSparse, and by motivating possible future features and collaborations.
Brief Biography:
Tim Davis is a Professor in the Computer Science and Engineering Department at Texas A&M University. His primary scholarly contribution is the creation of widely-used sparse matrix algorithms and software (SuiteSparse). His software is relied upon by a vast array of commercial, government lab, and open source applications, including MATLAB (x=A\b when A is sparse), Mathematica, Google (Street View, Photo Tours, and 3D Earth), Octave, Cadence, MSC NASTRAN, Mentor Graphics, and many more. As an NVIDIA Academic Partner, he is creating a new suite of highly-parallel sparse direct methods that can exploit the high computational throughput of recent GPUs. NVIDIA has designated his work Texas A&M as a CUDA Research Center.
He was elected in 2013 as a SIAM Fellow, in 2014 as an ACM Fellow, and in 2016 as an IEEE Fellow. He serves as an associate editor for ACM Transactions on Mathematical Software, and the SIAM Journal on Scientific Computing. Tim is a Master Consultant to The MathWorks.
Work is fun, but for pure fun, Tim does algorithmic art by translating music into visual art via Fourier transforms, graph algorithms, and force-directed graph visualization. His most recent commissioned work appeared as the theme artwork for the 2013 London Electronic Arts Festival, which appeared on billboards all over London in the fall of 2013. He created his logo for SuiteSparse via a visualization of Straus' "Also Sprach Zarathustra".
For more details, his professional web page is faculty.cse.tamu.edu/davis, and his algorithmic art appears at notesartstudio.com.
Combinatorics + Numerical Methods + Applications = SuiteSparse
Tim Davis, Texas A&M University
Abstract:
Sparse matrix algorithms lie in the intersection of graph theory and numerical linear algebra, and are a key component of high-performance combinatorial scientific computing. This talk gives an overview of SuiteSparse, a suite of sparse solvers written over the past 25 years with several colleagues. I will also highlight several specific contributions in this domain that appear in SuiteSparse, ranging from theory and algorithms to reliable mathematical software and its impact on applications:
Sparse Cholesky update/downdate
Approximate minimum degree
Unsymmetric multifrontal method for sparse LU factorization
Multifrontal sparse QR factorization, including my current work in GPU-based heterogeneous high-performance parallel computing.
My goal is to connect with current and potential users of SuiteSparse, by illustrating the features that the codes provide to users, by providing an overview of the algorithms inside SuiteSparse, and by motivating possible future features and collaborations.
Brief Biography:
Tim Davis is a Professor in the Computer Science and Engineering Department at Texas A&M University. His primary scholarly contribution is the creation of widely-used sparse matrix algorithms and software (SuiteSparse). His software is relied upon by a vast array of commercial, government lab, and open source applications, including MATLAB (x=A\b when A is sparse), Mathematica, Google (Street View, Photo Tours, and 3D Earth), Octave, Cadence, MSC NASTRAN, Mentor Graphics, and many more. As an NVIDIA Academic Partner, he is creating a new suite of highly-parallel sparse direct methods that can exploit the high computational throughput of recent GPUs. NVIDIA has designated his work Texas A&M as a CUDA Research Center.
He was elected in 2013 as a SIAM Fellow, in 2014 as an ACM Fellow, and in 2016 as an IEEE Fellow. He serves as an associate editor for ACM Transactions on Mathematical Software, and the SIAM Journal on Scientific Computing. Tim is a Master Consultant to The MathWorks.
Work is fun, but for pure fun, Tim does algorithmic art by translating music into visual art via Fourier transforms, graph algorithms, and force-directed graph visualization. His most recent commissioned work appeared as the theme artwork for the 2013 London Electronic Arts Festival, which appeared on billboards all over London in the fall of 2013. He created his logo for SuiteSparse via a visualization of Straus' "Also Sprach Zarathustra".
For more details, his professional web page is faculty.cse.tamu.edu/davis, and his algorithmic art appears at notesartstudio.com.
Переглядів: 421
Відео
IGS 2016 Invited Talk: Design of 3D printed mathematical art (Henry Segerman)
Переглядів 1138 років тому
Design of 3D printed mathematical art Henry Segerman, Oklahoma State University Abstract: When visualising topological objects via 3D printing, we need a three-dimensional geometric representation of the object. There are approximately three broad strategies for doing this: "Manual" - using whatever design software is available to build the object by hand; "Parametric/Implicit" - generating the...
IGS 2016 Invited Lecture: Geometry Processing in Shape Spaces (Martin Rumpf)
Переглядів 3858 років тому
Geometry Processing in Shape Spaces Martin Rumpf, Universität Bonn Abstract: The talk will be concerned with the transfer of classical geometric tools to shape spaces. Particular instances are spaces of triangular surfaces, two dimensional objects, images or measures. It will be shown how to introduce physically motivated distance measures on these spaces and how to come up with computationally...
IGS'16 Summer School: Simplification and Approximation
Переглядів 7668 років тому
Course 8 Simplification and Approximation Pierre Alliez (INRIA Sophia Antipolis) Abstract: Mesh simplification and surface approximation are two core topics in geometry processing. In this lecture we will review the main approaches and error metrics used for mesh simplification and approximation of surfaces. We will distinguish between greedy algorithms (coarse-to-fine versus fine-to-coarse) an...
IGS'16 Summer School: Representations and Applications of Tangential Vector Fields
Переглядів 5388 років тому
Course 9 Representations and Applications of Tangential Vector Fields Mirela Ben-Chen and Omri Azencot (Technion) Abstract: Tangent vector fields are fundamental to many applications in geometry processing. In this tutorial we discuss various representations of tangent vector fields on triangle meshes (vertex- and face-based, discrete 1-forms and operator representations) and present a sample o...
IGS'16 Summer School: Laplace-Beltrami: The Swiss Army Knife of Geometry Processing
Переглядів 6 тис.8 років тому
Course 6 Laplace-Beltrami: The Swiss Army Knife of Geometry Processing Etienne Vouga (UT Austin) Abstract: A remarkable variety of basic geometry processing tools can be expressed in terms of the Laplace-Beltrami operator on a surface-understanding these tasks in terms of fundamental PDEs such as heat flow, Poisson equations, and eigenvalue problems leads to an efficient, unified treatment at t...
IGS'16 Summer School: Projective Geometric Algebra: A Swiss Army Knife for Graphics and Games
Переглядів 4 тис.8 років тому
Course 10 Projective Geometric Algebra: A Swiss Army Knife for Graphics and Games Charles Gunn (TU Berlin) Abstract: A short, informal introduction to a newly-developed toolkit for doing euclidean geometry, based on half-forgotten 19th century discoveries. In three words: quaternions on steroids. Level of difficulty: the treatment will be aimed at entering graduate students who after a day of t...
IGS'16 Summer School: Pyramid Algorithms
Переглядів 2528 років тому
Course 7 Pyramid Algorithms Ron Goldman (Rice University) Abstract: Pyramid algorithms are dynamic programming procedures for organizing, visualizing, and analyzing recursive algorithms for freeform curves and surfaces. Important examples of pyramid algorithms include: Neville’s algorithm for Lagrange interpolation, de Casteljau’s evaluation algorithm and subdivision procedures for Bezier appro...
IGS'16 Summer School: Optimization in Geometry Processing
Переглядів 7938 років тому
Course 3 Optimization in Geometry Processing David Bommes (RWTH Aachen) and Justin Solomon (MIT) Abstract: Countless techniques in geometry processing can be described variationally, that is, as the minimization or maximization of an objective function measuring shape properties. Algorithms for parameterization, mapping, quad meshing, alignment, smoothing, and other tasks can be expressed and s...
IGS'16 Summer School: Skinning: Real-time Shape Deformation
Переглядів 3,2 тис.8 років тому
Course 5 Skinning: Real-time Shape Deformation Alec Jacobson (Columbia University) Abstract: The intended audience of this course are computer graphics practitioners and researchers, from technical directors to programmers or students. This course serves both as an implementation recipe for state-of-the-art deformation techniques as well as summary of the most recent research and unsolved chall...
The Helicoid
Переглядів 3,4 тис.8 років тому
A short movie by Ulrike Bath and Kevin Guo about the Helicoid - a minimal surface. Music taken from www.bensound.com
IGS'16 Summer School: Inverse Problems in Computational Design
Переглядів 3318 років тому
Course 2 Inverse Problems in Computational Design Bernhard Thomaszewski (Disney Research Zurich) Abstract: Physical simulation is the cornerstone of many computational design tools. However, when designing physical artifacts with complex forms and functions, we often need to solve inverse problems, i.e., invert the simulation in order to compute design parameters that lead to the desired system...
IGS'16 Summer School: Computational Aspects of Mappings
Переглядів 9368 років тому
International Geometry Summit 2016 Summer School Course 1 Computational Aspects of Mappings Noam Aigerman and Shahar Kovalsky (Weizmann Institute) Abstract: Maps are fundamental to Geometry Processing, and play a key role in a wide spectrum of applications, e.g., deformations, parameterizations, shape matching, remeshing, and texturing. In this tutorial we will review both the theory and practi...