#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1984

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

An artificial HIV-1 enhancer-binding 42-residue peptide (R42) that had been derived from bacteriophage 434 repressor inhibited the cell-free in vitro transcription of HIV-1 enhancer-containing plasmids [Hehlgans, T., Stolz, M., Klauser, S., Cui, T., Salgam, P., Brenz Verca, S., Widmann, M., Leiser, A., Städler, K. & Gutte, B. (1993) FEBS Lett. 315, 51-55;… (More)

- Amanda Bienz, Kossi Fokle, Zachary Keller, Ed Zulkoski, Scott Thede
- 2011

The focus of this paper is to implement a genetic algorithm using parallel programming. Genetic algorithms are well-suited to “parallelization,” since they model many individuals. Three implementations of a genetic algorithm were created for this paper a standard sequential programming algorithm, a parallel algorithm using a master process to control the… (More)

- Amanda Bienz, Robert D. Falgout, William Gropp, Luke N. Olson, Jacob B. Schroder
- SIAM J. Scientific Computing
- 2016

Algebraic multigrid (AMG) is an O(n) solution process for many large sparse linear systems. A hierarchy of progressively coarser grids is constructed that utilize complementary relaxation and interpolation operators. High-energy error is reduced by relaxation, while low-energy error is mapped to coarse-grids and reduced there. However, large parallel… (More)

As high-performance computing systems continue to progress towards extreme scale, the scalability of applications becomes critical. The scalability of an algorithm is dependent on interconnect properties, such as latency and bandwidth, and is often limited by network contention. Sparse matrixvector multiplication (SpMV) is fundamental to a large class of… (More)

- Amanda Bienz, Luke Olson
- 2015

Algebraic multigrid (AMG) is an iterative method for solving sparse linear systems of equations (Ax̂ = b), such as discretized partial differential equations arising in various fields of science and engineering. AMG is considered an optimal solver, requiring only O(n) operations to solve a system of n unknowns. Standard computers contain neither the memory… (More)

- Amanda Bienz, William Gropp, Luke N. Olson
- ArXiv
- 2016

where A is a sparse N ×N matrix and v is a dense N -dimensional vector. In parallel, the sparse system is often distributed across np processes such that each process holds a contiguous block of rows from the matrix A, and equivalent rows from the vectors v and w, as shown in Figure 1. A common approach is to also split the rows of A on a single process… (More)

- A Bienz, E Blanchat, E Schori, F Stamm
- Krankenpflege. Soins infirmiers
- 1984

- ‹
- 1
- ›