
New FOSLS Formulation of Nonlinear Stokes Flow for Glaciers
07 Feb 2016  Online Presentations  Contributor(s): Jeffrey Allen
This talk describes two Firstorder System Leastsquares (FOSLS) formulations of the nonlinear Stokes flow used to model glaciers and ice sheets. The first is a Stress formulation and the second a StressVorticity formulation. Both use fluidity, which is the reciprocal of viscosity and avoid the...

DataCentric Models for Multilevel Algorithms
07 Feb 2016  Online Presentations  Contributor(s): Samuel Guiterrez
Today, computational scientists must contend with a diverse set of supercomputer architectures that are capable of exposing unprecedented levels of parallelism and complexity. Effectively placing, moving, and operating on data residing in complex distributed memory hierarchies is quickly...

LegoGen
05 Feb 2016  Tools  Contributor(s): Scott Michael Louis Slone, Chris Maffeo, AbderRahman N Sobh, Aleksei Aksimentiev
Tool workflow for building DNA Brick structures automatically.

[Illinois] CNST Nanotechnology Workshop 2015
03 Feb 2016  Workshops  Contributor(s): Mustafa Elsayed, Mehmet Toner
The CNST Nanotechnology Workshop highlights University of Illinois research in bionanotechnology and nanomedicine, nanoelectronics and nanophotonics, and nanomaterials and nanomanufacturing, leading to crosscampus and industry collaborations.

[Illinois] Rare Events with LargeImpact: Bioengineering & Clinical Applications of Circulating Tumor Cells
03 Feb 2016  Online Presentations  Contributor(s): Mehmet Toner

Stable Discretizations and Robust Block Preconditioners for FluidStructure Interaction Systems
02 Feb 2016  Online Presentations  Contributor(s): Kai Yang
In our work we develop a family of preconditioners for the linear algebraic systems arising from the arbitrary LagrangianEulerian discretization of some fluidstructure interaction models. After the time discretization, we formulate the fluidstructure interaction equations as saddle point...

High Dimensional Uncertainty Quantification via Multilevel Monte Carlo
02 Feb 2016  Online Presentations  Contributor(s): Hillary Fairbanks
Multilevel Monte Carlo (MLMC) has been shown to be a cost effective way to compute moments of desired quantities of interest in stochastic partial differential equations when the uncertainty in the data is highdimensional. In this talk, we investigate the improved performance of MLMC versus...

Plasmonics and Metasurfaces for Extreme Manipulation of Light
07 Mar 2016  Online Presentations  Contributor(s): Yongmin Liu
In this talk, I will present some of our work in the fascinating field of plasmonics and optical metasurfaces. First, I will discuss reconfigurable plasmonic lenses operating in microfluidic environment, which can dynamically diverge, collimate and focus surface plasmons [5]. Second, I will...

Discretization of Elliptic Differential Equations Using Sparse Grids and Prewavelets
02 Feb 2016  Online Presentations  Contributor(s): Christoph Pflaum
Sparse grids can be used to discretize second order elliptic differential equations on a ddimensional cube. Using Galerkin discretization, we obtain a linear equation system with unknowns. The corresponding discretization error is in the norm. A major difficulty in...

Multilevel Markov Chain Monte Carlo for Uncertainty Quantification in Subsurface Flow
02 Feb 2016  Online Presentations  Contributor(s): Christian Ketelsen
The multilevel Monte Carlo method has been shown to be an effective variance reduction technique for quantifying uncertainty in subsurface flow simulations when the random conductivity field can be represented by a simple prior distribution. In stateoftheart subsurface simulation the...

Spacetime constrained FOSLS with AMGe upscaling
02 Feb 2016  Online Presentations  Contributor(s): Panayot Vassilevski
We consider timedependent PDEs discretized in combined spacetime domains. We first reduce the PDE to a first order system. Very often in practice, one of the equations of the reduced system involves the divergence operator (in spacetime). The popular FOSLS (first order system leastsquares)...

Reducing Communication Costs for Sparse Matrix Multiplication within Algebraic Multigrid
02 Feb 2016  Online Presentations  Contributor(s): Grey Ballard
We consider the sequence of sparse matrixmatrix multiplications performed during the setup phase of algebraic multigrid. In particular, we show that the most commonly used parallel algorithm is often not the most communicationefficient one for all of the matrix multiplications involved. By...

Is the Ideal Approximation Operator Always "Ideal" for a Particular C/F Splitting?
02 Feb 2016  Online Presentations  Contributor(s): Erin Molloy
Given a coarse grid, the ideal prolongation operator is defined by , where the weight matrix, , interpolates a set of fine grid variable (points) from a set of coarse grid variable (points), and the identity matrix, , represents the injection of points to and from...

On the Preconditioning of a HighOrder RDGbased AllSpeed NavierStokes Solver
02 Feb 2016  Online Presentations  Contributor(s): Brian Weston
We investigate the preconditioning of an allspeed NavierStokes solver, based on the orthogonalbasis Reconstructed Discontinuous Galerkin (RDG) space discretization, and integrated using a highorder fullyimplicit time discretization method. The work is motivated by applications in Additive...

Hub Snub: Removing Vertices with High Degree from Coarsegrid Correction
02 Feb 2016  Online Presentations  Contributor(s): Geoffry Sanders
Network scientists often employ numerical solutions to linear systems as subroutines of data mining algorithms. Due to the illconditioned nature of the systems, obtaining solutions with standard iterative methods is often prohibitively costly; current research aims to automatically construct...

Compatible Relaxation Based GeometricAlgebraic Multigrid
02 Feb 2016  Online Presentations  Contributor(s): Fei Cao
We develop compatible relaxation algorithms for smoothed aggregationbased multigrid coarsening. In the proposed method, we use the geometry of the given discrete problem on the finest level to coarsen the system together with compatible relaxation to from the sparsity structure of the...

A Fast Multigrid Approach for Solving the Helmholtz Equation with a Point Source
02 Feb 2016  Online Presentations  Contributor(s): Eran Treister
Solving the discretized Helmholtz equations with high wave numbers in large dimensions is a challenging task. However, in many scenarios, the solution of these equations is required for a point source. In this case, the problem can be be reformulated and split into two parts: one in a solution...

TaskGraph and Functional Programming Models: The New Paradigm
02 Feb 2016  Online Presentations  Contributor(s): Ben Bergen
The Message Passing Interface (MPI) is an example of a distributedmemory communication model that has served us well through the CISC processor era. However, because of MPI's lowlevel interface, which requires the user to manage raw memory buffers, and its bulksynchronous communication...

Support Graph Smoothing Techniques
02 Feb 2016  Online Presentations  Contributor(s): Alyson Fox
Many tasks in largescale network analysis and simulation require efficient approximation of the solution to the linear system $ Lx=b$, where $ L$ is a graph Laplacian. However, due to the large size and complexity of scalefree graphs, standard iterative methods do not perform optimally. The...

A Scalable Algorithm for Inverse Medium Problems with Multiple Sources
02 Feb 2016  Online Presentations  Contributor(s): Keith Kelly
We consider the problem of acoustic scattering as described by the freespace, timeharmonic scalar wave equation given by (0.1) along with radiation boundary conditions. Here, is a point in , is the source term, and is the wavenumber. Our formulation is based on potential theory....