Item – Thèses Canada

​
Numéro d'OCLC
1006986185
Lien(s) vers le texte intégral
Exemplaire de BAC
Exemplaire de BAC
Auteur
McNally, Jeffrey Mark,1973-
Titre
Fast parallel algorithms for tri-diagonal symmetric Toeplitz systems.
Diplôme
M.C.S. -- University of New Brunswick, 1999
Éditeur
Ottawa : National Library of Canada = Bibliothèque nationale du Canada, [2001]
Description
2 microfiches
Notes
Includes bibliographical references.
Résumé
In 1990, Rojo proposed a new method for solving symmetric circulant tri-diagonal systems of linear equations. In 1994, Yan and Chung, using the work of Rojo, produced a fast algorithm for solving a special tri-diagonal system ' A'x = b where the coefficient matrix is either tri-diagonal symmetric Toeplitz and diagonally dominant or near tri-diagonal circulant symmetric Toeplitz and diagonally dominant. With the advent of modern day supercomputers, the interest of computer science and numerical analysis in developing better algorithms for solving systems has turned to parallel processing. The method of Yan and Chung, although an efficient algorithm, is inherently sequential in nature, and does not readily lend itself to the parallel processing environment. In this work, an algorithm loosely based around the method of Yan and Chung will be presented which will allow their method, and other similar methods, to be easily adapted for a parallel environment. This technique will primarily revolve around the idea of perturbing a matrix, i.e. splitting a matrix into two distinct matrices, one of which is readily solved, and the other of which is extremely sparse. (Abstract shortened by UMI.)
ISBN
0612546357
9780612546356