Paper · 1996

Preconditioned iterative methods for the large, sparse, symmetric eigenvalue problem on multicomputers5

Andreas Stathopoulos

Published 3 October 1996

View at the publisherCite this paper

In brief

“Preconditioned iterative methods for the large, sparse, symmetric eigenvalue problem on multicomputers5” is a 1996 paper by Andreas Stathopoulos. OpenAlex counts 0 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
0
Authors
1

Abstract

The numerical solution of the large, sparse, symmetric eigenvalue problem, is central to many scientific and engineering applications. Advances in technology allow scientists to continuously tackle larger problems for which only a few eigenpairs are required. The solution of these problems can only be achieved through iterative methods and is increasingly dependent on efficient implementations… Read the full abstract at the publisher.

Excerpt. This paper is not open access.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Stathopoulos, A. (1996). Preconditioned iterative methods for the large, sparse, symmetric eigenvalue problem on multicomputers5. http://dl.acm.org/citation.cfm?id=239812

MLA 9

Stathopoulos, Andreas. “Preconditioned iterative methods for the large, sparse, symmetric eigenvalue problem on multicomputers5.” 1996. http://dl.acm.org/citation.cfm?id=239812.

Chicago

Stathopoulos, Andreas. 1996. “Preconditioned iterative methods for the large, sparse, symmetric eigenvalue problem on multicomputers5.” http://dl.acm.org/citation.cfm?id=239812.

Harvard

Stathopoulos, A. (1996) ‘Preconditioned iterative methods for the large, sparse, symmetric eigenvalue problem on multicomputers5’. Available at: http://dl.acm.org/citation.cfm?id=239812.

IEEE

A. Stathopoulos, “Preconditioned iterative methods for the large, sparse, symmetric eigenvalue problem on multicomputers5,” 1996.

BibTeX

@article{stathopoulos1996preconditioned,
  title     = {{Preconditioned iterative methods for the large, sparse, symmetric eigenvalue problem on multicomputers5}},
  author    = {Stathopoulos, Andreas},
  year      = {1996},
  url       = {http://dl.acm.org/citation.cfm?id=239812}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms

  • preconditioned iterative methods
  • Krylov subspace methods
  • domain decomposition
  • quadratic convergence
  • Schwarz alternating method
  • atomic structure calculations
  • dynamic load balancing
  • network characteristics

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Stathopoulos, A. (1996). Preconditioned iterative methods for the large, sparse, symmetric eigenvalue problem on multicomputers5. http://dl.acm.org/citation.cfm?id=239812

How many times has this paper been cited?

0 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

Andreas Stathopoulos.

Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.