2007
DOI: 10.1007/978-3-540-72584-8_19
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Implementation of the Thomas-Algorithm for Block Penta-diagonal Systems on Vector Computers

Abstract: Abstract. In simulations of supernovae, linear systems of equations with a block penta-diagonal matrix possessing small, dense matrix blocks occur. For an efficient solution, a compact multiplication scheme based on a restructured version of the Thomas algorithm and specifically adapted routines for LU factorization as well as forward and backward substitution are presented. On a NEC SX-8 vector system, runtime could be decreased between 35% and 54% for block sizes varying from 20 to 85 compared to the origina… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2009
2009
2022
2022

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 14 publications
(7 citation statements)
references
References 8 publications
0
7
0
Order By: Relevance
“…The Thomas algorithm represents a standard method to solve blocktridiagonal systems [43]. In this paper, we propose an algorithm based on a generalization of the Thomas algorithm (see [3][4][5]) which provides us a block-pentadiagonal solver with optimal complexity. Although this procedure is standard (Gaussian elimination for banded matrices), for the sake of clearness in the exposition of our work we present the used algorithm.…”
Section: Endmentioning
confidence: 99%
“…The Thomas algorithm represents a standard method to solve blocktridiagonal systems [43]. In this paper, we propose an algorithm based on a generalization of the Thomas algorithm (see [3][4][5]) which provides us a block-pentadiagonal solver with optimal complexity. Although this procedure is standard (Gaussian elimination for banded matrices), for the sake of clearness in the exposition of our work we present the used algorithm.…”
Section: Endmentioning
confidence: 99%
“…Due to the sparse nature of both the left and right side solver matrices, this equation can be stored in vector form extracting only the populated diagonal vectors a, b, c, d , e and f along with the temperature vectors T mÀ1 and T m . The penta-diagonal matrix can be solved efficiently using a row reduction algorithm conceptually similar to the Thomas algorithm, Askar and Karawia (2015), Benkert and Fischer (2007). The method can be accelerated by pre-computing the algorithm factors σ, ϕ, ω, ρ and ψ and reusing these during each iteration.…”
Section: D Multilayer Numerical Methodologymentioning
confidence: 99%
“…(In our Matlab implementation, this was achieved with cubic-spline interpolation-but not necessarily so with the other available methods.) The resulting linear system to be solved at each time step has a block pentadiagonal structure (there are linear algebra routines tailored to such systems, see [BF07]).…”
Section: Let the Spatial Domainmentioning
confidence: 99%