國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Low-Communication, Parallel Multigri...

Mitchell, Wayne Bradford.

Low-Communication, Parallel Multigrid Algorithms for Elliptic Partial Differential Equations.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Low-Communication, Parallel Multigrid Algorithms for Elliptic Partial Differential Equations.
作者:	Mitchell, Wayne Bradford.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, 2017
面頁冊數:	109 p.
附註:	Source: Dissertation Abstracts International, Volume: 79-02(E), Section: B.
附註:	Advisers: Thomas A. Manteuffel; Stephen F. McCormick.
Contained By:	Dissertation Abstracts International79-02B(E).
標題:	Applied mathematics.
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10615220
ISBN:	9780355231755

Low-Communication, Parallel Multigrid Algorithms for Elliptic Partial Differential Equations.
Mitchell, Wayne Bradford.

Low-Communication, Parallel Multigrid Algorithms for Elliptic Partial Differential Equations. - Ann Arbor : ProQuest Dissertations & Theses, 2017 - 109 p.

Source: Dissertation Abstracts International, Volume: 79-02(E), Section: B.

Thesis (Ph.D.)--University of Colorado at Boulder, 2017.

When solving elliptic partial differential equations (PDE's) multigrid algorithms often provide optimal solvers and preconditioners capable of providing solutions with O(N) computational cost, where N is the number of unknowns. As parallelism of modern super computers continues to grow towards exascale, however, the cost of communication has overshadowed the cost of computation as the next major bottleneck for multigrid algorithms. Typically, multigrid algorithms require O((log P)2) communication steps in order to solve a PDE problem to the level of discretization accuracy, where P is the number of processors. This has inspired the development of new algorithms that employ novel paradigms for parallelizing PDE problems, and this thesis studies and further develops two such algorithms.

ISBN: 9780355231755Subjects--Topical Terms:

377601
Applied mathematics.

Low-Communication, Parallel Multigrid Algorithms for Elliptic Partial Differential Equations.
LDR:02946nmm a2200313 4500 001 523936
005 20180517120325.5
008 180709s2017 ||||||||||||||||| ||eng d
020 $a 9780355231755
035 $a (MiAaPQ)AAI10615220
035 $a (MiAaPQ)colorado:15042
035 $a AAI10615220
040 $a MiAaPQ $c MiAaPQ
100 1 $a Mitchell, Wayne Bradford. $3 795424
245 1 0 $a Low-Communication, Parallel Multigrid Algorithms for Elliptic Partial Differential Equations.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2017
300 $a 109 p.
500 $a Source: Dissertation Abstracts International, Volume: 79-02(E), Section: B.
500 $a Advisers: Thomas A. Manteuffel; Stephen F. McCormick.
502 $a Thesis (Ph.D.)--University of Colorado at Boulder, 2017.
520 $a When solving elliptic partial differential equations (PDE's) multigrid algorithms often provide optimal solvers and preconditioners capable of providing solutions with O(N) computational cost, where N is the number of unknowns. As parallelism of modern super computers continues to grow towards exascale, however, the cost of communication has overshadowed the cost of computation as the next major bottleneck for multigrid algorithms. Typically, multigrid algorithms require O((log P)2) communication steps in order to solve a PDE problem to the level of discretization accuracy, where P is the number of processors. This has inspired the development of new algorithms that employ novel paradigms for parallelizing PDE problems, and this thesis studies and further develops two such algorithms.
520 $a The nested iteration with range decomposition (NIRD) algorithm is known to achieve accuracy similar to that of traditional methods in only a single iteration with log P communication steps for simple elliptic problems. This thesis makes several improvements to the NIRD algorithm and extends its application to a much wider variety of problems, while also examining and updating previously proposed convergence theory and performance models.
520 $a The second method studied is the algebraic multigrid with domain decomposition (AMG-DD) algorithm. Though previous work showed only marginal benefits when comparing convergence factors for AMG-DD against standard AMG V-cycles, this thesis studies the potential of AMG-DD as a discretization-accuracy solver. In addition to detailing the first parallel implementation of this algorithm, this thesis also shows new results that study the effect of different AMG coarsening and interpolation strategies on AMG-DD convergence and show some evidence to suggest AMG-DD may achieve discretization accuracy in a fixed number of cycles with O(log P) communication cost even as problem size increases.
590 $a School code: 0051.
650 4 $a Applied mathematics. $3 377601
690 $a 0364
710 2 $a University of Colorado at Boulder. $b Applied Mathematics. $3 795425
773 0 $t Dissertation Abstracts International $g 79-02B(E).
790 $a 0051
791 $a Ph.D.
792 $a 2017
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10615220