A cost-optimal parallel tridiagonal system solver
type: Item
instance of: scholarly article
title: A cost-optimal parallel tridiagonal system solver
zbMATH Open document ID: 0706.65017
DOI: 10.1016/0167-8191(90)90042-8
author: Elsie Sterbin Gottlieb
published in: Parallel Computing
publication date: 1990-01-01T00:00:00Z
full work available at URL: http://ntur.lib.ntu.edu.tw//handle/246246/155726
review text: The solution of a tridiagonal system is transformed into three recurrence equations. These recurrence equations are solved simply doing continued fraction expansions and applying the substitution concept. It is cost- optimal in the sense that processor number times execution time is minimized.
Mathematics Subject Classification ID: 65F05
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 4159957
zbMATH Keywords: parallel computation
zbMATH Keywords: tridiagonal system
zbMATH Keywords: recurrence equations
zbMATH Keywords: continued fraction expansions
reviewed by: N. F. F. Ebecken
MaRDI profile type: Publication
OpenAlex ID: W2020553063
Recommended article: Q4537016
Recommended article: A tridiagonal solver for massively parallel computer systems
Recommended article: A method to parallelize tridiagonal solvers
Recommended article: Optimal and efficient parallel tridiagonal solvers using direct methods
Recommended article: Q3583388
Recommended article: Efficient tridiagonal solvers on multicomputers
Recommended article: A parallel solver for tridiagonal linear systems for distributed memory parallel computers
Recommended article: A fast parallel algorithm for the solution of tridiagonal linear systems
Recommended article: Q3223797
description: scientific article; zbMATH DE number 4159957