2021
DOI: 10.1007/s10910-021-01217-7
|View full text |Cite
|
Sign up to set email alerts
|

A fast algorithm for solving diagonally dominant symmetric quasi-pentadiagonal Toeplitz linear systems

Abstract: In this paper, we develop a new algorithm for solving diagonally dominant symmetric quasi-pentadiagonal Toeplitz linear systems. Numerical experiments are given in order to illustrate the validity and efficiency of our algorithm.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 18 publications
0
3
0
Order By: Relevance
“…Recent research continues to highlight the importance of studying Topelitz matrices, such as [3,12,13,19].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Recent research continues to highlight the importance of studying Topelitz matrices, such as [3,12,13,19].…”
Section: Introductionmentioning
confidence: 99%
“…However, the authors did not present sufficient conditions for existence of the LU factorization of Toeplitz tridiagonal matrices. In 2021, Skander Belhaj et al [3] also developed in their paper a fast algorithm for solving diagonally dominant symmetric quasi-pentadiagonal Toeplitz linear systems. Numerical experiments were given in order to illustrate the validity and efciency of the algorithm.…”
Section: Introductionmentioning
confidence: 99%
“…Later on this method was generalised to solve the block quasi tridiagonal Toeplitz [4]. In [5,6], a fast method for solving quasi-pentadiagonal Toeplitz linear systems was presented, which was based on solving pentadiagonal Toeplitz linear systems.…”
Section: Introductionmentioning
confidence: 99%