Search
Results
-
A comparison of parallel solvers for diagonally dominant and general narrow-banded linear systems
(1998)Technical ReportsReport -
Performance characterization and modeling of the molecular simulation code opal
(1998)Technical Report / ETH Zurich, Department of Computer ScienceReport -
Eigenvalue solvers for electromagnetic fields in cavities
(1997)Technische Berichte / ETH Zürich, Departement InformatikReport -
The remote computation system
(1996)Technische BerichteToday many high performance computers are reachable over some network However the access and use of these computers is often complicated This prevents many users to work on such machines The goal of our Remote Computation System RCS is to alleviate the usage of modern algorithms on high performance computers RCS has an easytouse mechanism for using computational resources remotely The computational resources available are used as eciently ...Report -
The stable parallel solution of general narrow banded linear systems
(1996)Internal reportReport -
Generalized subspace correction methods for parallel solution of linear systems
(1995)Technischer Bericht / Eidgenössische Technische Hochschule, Departement InformatikReport -
SCIDDLE
(1994)ETH, Eidgenössische Technische Hochschule Zürich, Departement Informatik, Institut für Wissenschaftliches RechnenReport -
Parallel divide and conquer algorithms for the symmetric tridiagonal eigenproblem
(1994)ETH, Eidgenössische Technische Hochschule Zürich, Departement Informatik, Institut für Wissenschaftliches RechnenReport -
A survey of direct parallel algorithms for banded linear systems
(1994)ETH, Eidgenössische Technische Hochschule Zürich, Departement Informatik, Institut für Wissenschaftliches RechnenReport -
Block implementations of the symmetric QR and Jacobi algorithms
(1992)ETH, Eidgenössische Technische Hochschule Zürich, Departement Informatik, Institut für Wissenschaftliches RechnenA common approach to solve problems in numerical linear algebra eciently on modern high speed computers is to redesign the classical algorithm which was originally developed for serial computers In this paper we discuss block variants of QR and Jacobi algorithms for the computation of the complete spectral decomposition of symmetric matrices We report on numerical tests which have been performed on a CRAY YMP and an ALLIANT FX/80.Report