logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

A BSP recursive divide and conquer algorithm to solve a tridiagonal linear system

delete2004-12-01
delete4
PRE
AI
J
Joan‐Josep Climent *
C
Carmen Perea
L
Leandro Tortosa
A
Antonio Zamora
DOI：10.1016/j.amc.2003.08.130delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In this paper we discuss a recursive divide and conquer method to solve a tridiagonal system of linear equations. We propose two divide and conquer algorithms using different communication schemes. The first one uses a fan-in scheme to perform communication among processors, while the second one follows a rather different model, in which all the processors communicate all data to the main one. A theoretical study of the computational cost of both algorithms is developed computing theoretical times; firstly in an IBM SP2 computer with a high performance switch and Ethernet connection, and secondly in a CRAY T3D computer. We present experimental results for the IBM SP2 computer, for 2, 4, and 8 processors, comparing these results with the theoretical predicted times. (C) 2003 Elsevier Inc. All rights reserved.
Keywords:
tridiagonal matrix
BSP computer
divide and conquer
Shernian-Morrison formula
diagonal dominant matrix

Journal

Applied Mathematics and Computation cover
Applied Mathematics and Computation
IF:
3.4
Papers:
2.3W
Citations:
3.3W

Organization

No organization information available