Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mark Baertschy

dblp:39/995 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2001
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 83% Parallel and multicore computing · 17%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
High-performance computing
parallel numerical algorithms
0.012001
Solution of a three-body problem in quantum mechanics using sparse linear algebra on parallel computers · SC 2001
High-performance computing
scientific computing systems
0.012001
Solution of a three-body problem in quantum mechanics using sparse linear algebra on parallel computers · SC 2001
High-performance computing
sparse linear algebra
0.012001
Solution of a three-body problem in quantum mechanics using sparse linear algebra on parallel computers · SC 2001
Parallel and multicore computing › parallel architecture
distributed-memory parallel computing
0.012001
Solution of a three-body problem in quantum mechanics using sparse linear algebra on parallel computers · SC 2001
Parallel and multicore computing
parallel programming models and runtimes
0.012001
Solution of a three-body problem in quantum mechanics using sparse linear algebra on parallel computers · SC 2001

Methods — techniques the papers use, named apart from their topics

two-level iterative algorithm · 0.0sparse LU factorization · 0.0LU factorization · 0.0
YearPublicationVenuePosition
2001 Solution of a three-body problem in quantum mechanics using sparse linear algebra on parallel computers
abstract
A complete description of two outgoing electrons following an ionizing collision between a single electron and an atom or molecule has long stood as one of the unsolved fundamental problems in quantum collision theory. In this paper we describe our use of distributed memory parallel computers to calculate a fully converged wave function describing the electron-impact ionization of hydrogen. Our approach hinges on a transformation of the Schrödinger equation that simplifies the boundary conditions but requires solving very ill-conditioned systems of a few million complex, sparse linear equations. We developed a two-level iterative algorithm that requires repeated solution of sets of a few hundred thousand linear equations. These are solved directly by LU-factorization using a specially tuned, distributed memory parallel version of the sparse LU-factorization library SuperLU. In smaller cases, where direct solution is technically possible, our iterative algorithm still gives significant savings in time and memory despite lower megaflop rates.
Mark Baertschy, Xiaoye S. Li
SC1