of large sparse systems of linear equations. Often these systems arise from the discretization of differential equations by finite difference, finite volume or finite element methods. Iterative methods exploiting these sparse structures have proven to be very effective on conventional computers for a wide area of applications. Due to the rapid
|
303
|
Iterative Solution methods
– Axelsson
- 1994
|
|
266
|
Iterative methods by space decomposition and subspace correction
– Xu
- 1992
|
|
78
|
Advanced Computer Architecture: Parallelism Scalability Programmability
– Hwang
- 1993
|
|
64
|
A divide and conquer method for the symmetric tridiagonal eigenproblem
– Cuppen
- 1981
|
|
36
|
Row projection methods for large nonsymmetric linear systems
– BRAMLEY, SAMEH
- 1992
|
|
33
|
Angenäherte Auflösung von Systemen linearer Gleichungen,” Bulletin de l’Académie Polonaise des Sciences et Lettres
– Kaczmarz
- 1937
|
|
25
|
Calcolo approssimato per le soluzioni dei sistemi di equazioni lineari
– Cimmino
- 1938
|
|
23
|
On the orthogonality of eigenvectors computed by divide and conquer techniques
– Sorensen, Tang
- 1991
|
|
22
|
A survey of direct parallel algorithms for banded linear systems
– Arbenz, Gander
- 1994
|
|
21
|
Parallel algorithms for banded linear systems
– Wright
- 1991
|
|
20
|
The NX message passing interface
– Pierce
- 1994
|
|
19
|
Solving Narrow Banded Systems on Ensemble Architectures
– Johnsson
- 1985
|
|
18
|
A comparison of solvers for large eigenvalue problems occurring in the design of resonant cavities
– ARBENZ, GEUS
- 1999
|
|
17
|
Solving banded systems on a parallel processor
– Dongarra, J, et al.
- 1987
|
|
11
|
Parallel algorithms for the solution of narrow banded systems
– Conroy
- 1989
|
|
11
|
On some parallel banded system solvers
– Dongarra, Sameh
- 1984
|
|
7
|
Parallel divide and conquer algorithms for the symmetric tridiagonal eigenproblem
– Gates, Arbenz
- 1994
|
|
6
|
Block-iterative methods for consistent and inconsistent linear equations
– Elfving
- 1980
|
|
5
|
Use of fast direct methods for the ecient numerical solution of nonseparable elliptic equations
– Concus, Golub
- 1973
|
|
5
|
Techniques for accelerating the block Cimmino method
– Arioli, Duff, et al.
- 1992
|
|
5
|
A parallel block projection method of the Cimmino type for finite Markov chains
– Benzi, Sgallari, et al.
- 1995
|
|
4
|
Software and guide are available from Netlib at URL http://www.netlib.org/lapack
– Anderson, Bai, et al.
- 1994
|
|
4
|
First experiences with the Intel Paragon
– Arbenz
- 1994
|
|
4
|
Generalized Subspace Correction Methods for Parallel Solution of Linear Systems
– Kolm, Arbenz, et al.
- 1995
|
|
3
|
Implementation and applications of the spectral transformation Lanczos algorithm
– Ericsson
- 1983
|
|
3
|
Numerical experiments with dissection methods to solve n by n grid problems
– George
- 1973
|
|
1
|
Towards an ecient implementation of the eigenstate expansion method for quantum molecular dynamics simulations
– Arbenz
- 2000
|
|
1
|
Gunsteren, A comparison of dierent numerical propagation schemes for solving the time-dependent Schrodinger equation in the position representation in one dimension for mixed quantum- and molecular dynamics simulations
– Billeter, van
- 1995
|
|
