Searching for authors named Andreas Stathopoulos – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

31 documents found, showing 1 through 10. Next 10 →

A Case For A Biorthogonal Jacobi-Davidson Method: Restarting And Correction Equation
by Andreas Stathopoulos — SIAM J. Matrix Anal. Appl
…We propose a biorthogonal Jacobi-Davidson method (biJD), which can be viewed as an explicitly biorthogonalized, restarted Lanczos method, that uses the approximate solution of a correction equation to expand its basis. Through an elegant formulation, the algorithm allows for all the functionalities …
Cited by 3 (0 self) – Add To MetaCart

PRIMME: PReconditioned Iterative MultiMethod Eigensolver: Methods and software description
by Andreas Stathopoulos — 2006
…This paper describes the PRIMME software package for the solving large, sparse Hermitian and real symmetric eigenvalue problems. The difficulty and importance of these problems have increased over the years, necessitating the use of preconditioning and near optimally converging iterative methods. On…
Cited by 3 (2 self) – Add To MetaCart

Locking issues for finding a large number of eigenvectors of Hermitian matrices
by Andreas Stathopoulos
…Locking is a popular deflation technique followed by many eigensolvers, where a converged eigenvector is frozen and removed from the iteration search space. Other deflation techniques that do not modify the matrix have less favorable numerical properties, so the alternative to locking is not to perf…
Cited by 1 (1 self) – Add To MetaCart

Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems under Limited Memory. Part I: Seeking One Eigenvalue
by Andreas Stathopoulos, Eigenvalue Andreas Stathopoulos — 2005 — SIAM J. Sci. Comput
…WM-CS-2005-03 Nearly optimal preconditioned methods for hermitian eigenproblems underlimited memory. Part I: Seeking one eigenvalue…
Cited by 7 (3 self) – Add To MetaCart

Dynamic Load Balancing of Atomic Structure Programs on a PVM Cluster
by Andreas Stathopoulos, Anders Ynnerman — 1995 — Lecture Notes in Computer Science
…The MCHF package is a suite of programs that enable the calculation of atomic data required by many science and engineering disciplines. As a means of meeting its high computational demands, the package has previously been implemented in PVM. The codes have been used on a dedicated cluster of workst…
Cited by 1 (0 self) – Add To MetaCart

A Block Orthogonalization Procedure With Constant Synchronization Requirements
by Andreas Stathopoulos, Kesheng Wu — 2002 — SIAM J. Sci. Comput
…First, we consider the problem of orthonormalizing skinny (long) matrices. We propose an alternative orthonormalization method that computes the orthonormal basis from the right singular vectors of a matrix. Its advantage are: a) all operations are matrix-matrix multiplications and thus cache-effici…
Cited by 4 (1 self) – Add To MetaCart

Restarting Techniques for the (Jacobi-)Davidson Symmetric Eigenvalue Methods
by Andreas Stathopoulos, Yousef Saad — 1998 — ELECTR. TRANS. NUMER. ALG
…The (Jacobi-)Davidson method, which is a popular preconditioned extension to the Arnoldi method for solving large eigenvalue problems, is often used with restarting. This has significant performance shortcomings, since important components of the invariant subspace may be discarded. One way of savin…
Cited by 14 (7 self) – Add To MetaCart

Overlapping Domain Decomposition Preconditioners for the Generalized Davidson Method for the Eigenvalue Problem
by Andreas Stathopoulos Youcef, Andreas Stathopoulos, Youcef Saad
…This paper presents the changes that are necessary to solve these problems. Some preliminary experimental results are also given.…
Add To MetaCart

A Block Orthogonalization Procedure With Constant Synchronization Requirements
by Andreas Stathopoulos Kesheng, Andreas Stathopoulos, Kesheng Wu — 2002 — SIAM J. Sci. Comput
…. We propose an alternative orthonormalization method that computes the orthonormal basis from the right singular vectors of a matrix. Its advantage are: a) all operations are matrix-matrix multiplications and thus cache-efficient, b) only one synchronization point is required in parallel implementa…
Add To MetaCart

A Parallel, Block, Jacobi-Davidson Implementation for Solving Large Eigenproblems on Coarse Grain Environments
by Andreas Stathopoulos Department, Andreas Stathopoulos, James R. Mccombs — 1999 — In 1999 International Conference on Parallel and Distributed Processing Techniques and Applications
…Iterative methods often provide the only means of solving large eigenvalue problems. Their block variants converge slowly but they are robust especially in the presence of multiplicities. Preconditioning is often used to improve convergence. Yet, for large matrices, the demands posed on the availabl…
Add To MetaCart

Showing 1 through 10. Next 10 →

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB