The search for high level parallelism for the iterative solution of large sparse linear systems

PDF Version Also Available for Download.

Description

In this paper the author is concerned with the numerical solution, based on iterative methods, of large sparse systems of linear algebraic equations of the type which arise in the numerical solution of elliptic and parabolic partial differential equations by finite difference or finite element methods. He considers linear systems of the form Au = b where A is a given N x N matrix which is large and sparse and where b is a given N x 1 column vector. He will assumes that A is symmetric and positive definite (SPD). He considers iterative algorithms which consist of a ... continued below

Physical Description

21 p.

Creation Information

Young, D.M. July 1, 1988.

Context

This article is part of the collection entitled: Office of Scientific & Technical Information Technical Reports and was provided by UNT Libraries Government Documents Department to Digital Library, a digital repository hosted by the UNT Libraries. More information about this article can be viewed below.

Who

People and organizations associated with either the creation of this article or its content.

Author

Sponsor

Provided By

UNT Libraries Government Documents Department

Serving as both a federal and a state depository library, the UNT Libraries Government Documents Department maintains millions of items in a variety of formats. The department is a member of the FDLP Content Partnerships Program and an Affiliated Archive of the National Archives.

Contact Us

What

Descriptive information to help identify this article. Follow the links below to find similar items on the Digital Library.

Description

In this paper the author is concerned with the numerical solution, based on iterative methods, of large sparse systems of linear algebraic equations of the type which arise in the numerical solution of elliptic and parabolic partial differential equations by finite difference or finite element methods. He considers linear systems of the form Au = b where A is a given N x N matrix which is large and sparse and where b is a given N x 1 column vector. He will assumes that A is symmetric and positive definite (SPD). He considers iterative algorithms which consist of a basic iterative method, such as the Richardson, Jacobi, SSOR or incomplete Cholesky method, combined with an acceleration procedure such as Chebyshev acceleration or conjugate gradient acceleration. The object of this paper is, however, to examine some high-level methods for achieving parallelism. Such techniques involve only matrix/vector operations and do not involve working with blocks of the matrix, subdividing the region, or using different meshes. It is expected that if effective high-level methods could be developed, they could be combined with block and domain decomposition methods, and related methods, to obtain even greater speedups. It is also expected that by working at a higher level it will eventually be possible to develop general purpose software for parallel machines similar to the ITPACK software packages which have already been developed for sequential and vector machines. The discussion here is primarily devoted to describing various techniques which the author and others have considered for obtaining high-level parallelism. The author plans to continue research on these techniques and eventually to develop algorithms and programs for multiprocessors based on them.

Physical Description

21 p.

Notes

OSTI as DE99000920

Source

  • 2. international conference on vector and parallel computing: issues in applied research and development, Tromso (Norway), 6-10 Jun 1988

Language

Item Type

Identifier

Unique identifying numbers for this article in the Digital Library or other systems.

  • Other: DE99000920
  • Report No.: DOE/ER/25048--32
  • Report No.: CONF-8806154--
  • Grant Number: FG05-87ER25048
  • Office of Scientific & Technical Information Report Number: 674881
  • Archival Resource Key: ark:/67531/metadc703009

Collections

This article is part of the following collection of related materials.

Office of Scientific & Technical Information Technical Reports

What responsibilities do I have when using this article?

When

Dates and time periods associated with this article.

Creation Date

  • July 1, 1988

Added to The UNT Digital Library

  • Sept. 12, 2015, 6:31 a.m.

Description Last Updated

  • Nov. 6, 2015, 1:25 p.m.

Usage Statistics

When was this article last used?

Yesterday: 0
Past 30 days: 0
Total Uses: 4

Interact With This Article

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

Citations, Rights, Re-Use

Young, D.M. The search for high level parallelism for the iterative solution of large sparse linear systems, article, July 1, 1988; United States. (digital.library.unt.edu/ark:/67531/metadc703009/: accessed August 19, 2017), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT Libraries Government Documents Department.