An Efficient Parallel Three-Level Preconditioner for Linear Partial Differential Equations

The primary motivation of this research is to develop and investigate parallel preconditioners for linear elliptic partial differential equations. Three preconditioners are studied: block-Jacobi preconditioner (BJ), a two-level tangential preconditioner (D0), and a three-level preconditioner (D1). Performance and scalability on a distributed memory parallel computer are considered. Communication cost and redundancy are explored as well. After experiments and analysis, we find that the three-level preconditioner D1 is the most efficient and scalable parallel preconditioner, compared to BJ and D0. The D1 preconditioner reduces both the number of iterations and computational time substantially. A new hybrid preconditioner is suggested which may combine the best features of D0 and D1.

Name thesis:degree_name

Master of Science

Level thesis:degree_level

masters

Discipline thesis:degree_discipline

Computer Science

Department dc:contributor.department

Computer Science

Grantor dc:publisher

Virginia Tech

Year dc:date.issued

1998

Author dc:creator

• Yao, Aixiang I Song

Chair dc:contributor.committeechair

• Ribbens, Calvin J.

Committee members dc:contributor.committeemember

• Beattie, Christopher A.
• Watson, Layne T.

• domain decomposition
• preconditioner
• parallel computing
• PDE
• distributed systems

Statement dc:rights

• In Copyright

Licence dc:rights.uri

• http://rightsstatements.org/vocab/InC/1.0/

Dc Identifier Other

etd-12398-18633

OAI identifier oai:identifier

oai:vtechworks.lib.vt.edu:10919/36499