A COMPARISON OF FAC AND PCG METHODS FOR SOLVING COMPOSITE GRID PROBLEMS

被引：1

作者：

HEROUX, MA ^{[1
]}

THOMAS, JW ^{[1
]}

机构：

[1] COLORADO STATE UNIV,DEPT MATH,FT COLLINS,CO 80523

来源：

COMMUNICATIONS IN APPLIED NUMERICAL METHODS | 1992年 / 8卷 / 09期

关键词：

D O I：

10.1002/cnm.1630080905

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

The fast adaptive composite grid method (FAC) is a multi-level adaptive method for the discretization and solution of partial differential equations. This paper compares the speed of solution of the resulting discrete equations by the FAC algorithm and a preconditioned conjugate gradient scheme. Comparisons and information concerning the solutions are given for several model problems.

引用

页码：573 / 583

页数：11

共 11 条

[1]

Anderson E., 1988, THESIS U ILLINOIS

[2]

ERHEL J, 1988, MULTIPLICATION VECTO

[3]

Ewing R. E., 1988, LOCAL REFINEMENT TEC

[4]

GOLUB GH, 1989, MATRIX COMPUTATIONS

[5]

HEROUX MA, 1991, APPL NUMER METH

[6]

HEROUX MA, 1989, THESIS COLORADO STAT

[7]

MADSEN J, 1990, UNICOS MATH SCI LIBR, V3

[8]

MCCORMICK S, 1986, MATH COMPUT, V46, P439, DOI 10.1090/S0025-5718-1986-0829618-X

[9]

MCKAY S, 1989, 4TH P COPP MOUNT C M, P338

[10] DATA-STRUCTURES TO VECTORIZE CG ALGORITHMS FOR GENERAL SPARSITY PATTERNS [J].

PAOLINI, GV ;

DIBROZOLO, GR .

BIT, 1989, 29 (04) :703-718

← 1 2 →