PARALLEL NETWORKS FOR MULTI-GRID ALGORITHMS - ARCHITECTURE AND COMPLEXITY

被引：10

作者：

CHAN, TF

SCHREIBER, R

机构：

[1] INST NATL RECH INFORMAT & AUTOMAT, F-78153 LE CHESNAY, FRANCE

[2] STANFORD UNIV, DEPT COMP SCI, STANFORD, CA 94305 USA

来源：

SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING | 1985年 / 6卷 / 03期

关键词：

D O I：

10.1137/0906048

中图分类号：

O29 [应用数学];

学科分类号：

070104 [应用数学];

摘要：

引用

页码：698 / 711

页数：14

共 9 条

[1]

BANK RE, 1981, MATH COMPUT, V36, P35, DOI 10.1090/S0025-5718-1981-0595040-2

[2]

BRANDT A, 1977, MATH COMPUT, V31, P333, DOI 10.1090/S0025-5718-1977-0431719-X

[3]

BRANDT A, 1980, ICASE 8023 NASA LANG

[4]

Ciarlet P.G., 2002, The Finite Element Method for Elliptic Problems

[5]

DOUGLAS CC, 1982, THESIS YALE U NEW HA

[6]

GANNON D, 1982, ICASE8236 NASA LANGL

[7]

HACKBUSCH W, 1977, 7717 U KOLN MATH I T

[8]

Kuck D. L., 1978, STRUCTURE COMPUTERS

[9]

KUNG HT, 1982, COMPUTER, V15, P37, DOI 10.1109/MC.1982.1653825