#### Filter Results:

- Full text PDF available (49)

#### Publication Year

1991

2016

- This year (0)
- Last 5 years (13)
- Last 10 years (43)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Brain Region

#### Cell Type

#### Data Set Used

#### Key Phrases

#### Method

#### Organism

Learn More

- Jonathan E. Atkins, Erik G. Boman, Bruce Hendrickson
- SIAM J. Comput.
- 1998

In applications ranging from DNA sequencing through archeological dating to sparse matrix reordering, a recurrent problem is the sequencing of elements in such a way that highly correlated pairs of elements are near each other. That is, given a correlation function f reflecting the desire for each pair of elements to be near each other, find all… (More)

- Karen D. Devine, Erik G. Boman, Robert T. Heaphy, Bruce Hendrickson, Courtenay T. Vaughan
- Computing in Science and Engineering
- 2002

- Karen D. Devine, Erik G. Boman, Robert T. Heaphy, Rob H. Bisseling, Ümit V. Çatalyürek
- Proceedings 20th IEEE International Parallel…
- 2006

Graph partitioning is often used for load balancing in parallel computing, but it is known that hypergraph partitioning has several advantages. First, hypergraphs more accurately model communication volume, and second, they are more expressive and can better represent nonsymmetric problems. Hypergraph partitioning is particularly suited to parallel sparse… (More)

- Erik G. Boman, Bruce Hendrickson
- SIAM J. Matrix Analysis Applications
- 2003

We present support theory, a set of techniques for bounding extreme eigenvalues and condition numbers for matrix pencils. Our intended application of support theory is to enable proving condition number bounds for preconditioners for symmetric, positive definite systems. One key feature sets our approach apart from most other works: We use support numbers… (More)

- Ümit V. Çatalyürek, Erik G. Boman, Karen D. Devine, Doruk Bozdag, Robert T. Heaphy, Lee Ann Riesen
- J. Parallel Distrib. Comput.
- 2009

In parallel adaptive applications, the computational structure of the applications changes over time, leading to load imbalances even though the initial load distributions were balanced. To restore balance and to keep communication volume low in further iterations of the applications, dynamic load balancing (repartitioning) of the changed computational… (More)

- Matthew Phillips, Erik Boman, Hanna Österman, David Willhite, Matthias Laska
- PloS one
- 2011

Using a longitudinal study design, two strains of Alzheimer's disease (AD) model mice, one expressing β-amyloid plaques and one expressing Tau protein-associated neurofibrillary tangles were assessed for olfactory and visuospatial learning and memory and their performance compared to that of age-matched controls. No significant difference between AD and… (More)

- Erik G. Boman, Bruce Hendrickson, Stephen A. Vavasis
- SIAM J. Numerical Analysis
- 2008

We show in this note how support preconditioners can be applied to a class of linear systems arising from use of the finite element method to solve linear elliptic problems. Our technique reduces the problem, which is symmetric and positive definite, to a symmetric positive definite diagonally dominant problem. Significant theory has already been developed… (More)

- Erik G. Boman, Doron Chen, Bruce Hendrickson, Sivan Toledo
- Numerical Lin. Alg. with Applic.
- 2004

This paper analyzes a novel method for constructing preconditioners for diagonally-dominant symmetric positive-definite matrices. The method discussed here is based on a simple idea: we construct M by simply dropping offdiagonal nonzeros from A and modifying the diagonal elements to maintain a certain row-sum property. The preconditioners are extensions of… (More)

- Ariful Azad, Mahantesh Halappanavar, Sivasankaran Rajamanickam, Erik G. Boman, Arif M. Khan, Alex Pothen
- 2012 IEEE 26th International Parallel and…
- 2012

We design, implement, and evaluate algorithms for computing a matching of maximum cardinality in a bipartite graph on multicore and massively multithreaded computers. As computers with larger numbers of slower cores dominate the commodity processor market, the design of multithreaded algorithms to solve large matching problems becomes a necessity. Recent… (More)

- Erik G. Boman, Ümit V. Çatalyürek, Cédric Chevalier, Karen D. Devine
- Scientific Programming
- 2012

Partitioning and load balancing are important problems in scientific computing that can be modeled as combinatorial problems using graphs or hypergraphs. The Zoltan toolkit was developed primarily for partitioning and load balancing to support dynamic parallel applications, but has expanded to support other problems in combinatorial scientific computing,… (More)