ScholarLens Back to search
2015•Unpublished venueRequires access

A Fast Algorithm for Sloving Symmetric Pentadiagonal Toeplitz Systems

Linjia Kang

Open publisher page 0 citations

Abstract

In this paper, a fast algorithm for solving linear systems with the symmetric pentadiagonal Toeplitz coefficient matrix is presented. The complexity of the algorithm is(13n+7), which is less than the algorithm of Xiangjian Xu with the cost of(16n+32).

About this research paper

What this paper is about

In this paper, a fast algorithm for solving linear systems with the symmetric pentadiagonal Toeplitz coefficient matrix is presented. The complexity of the algorithm is(13n+7), which is less than the algorithm of Xiangjian Xu with the cost of(16n+32).

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper, a fast algorithm for solving linear systems with the symmetric pentadiagonal Toeplitz coefficient matrix is presented. The complexity of the algorithm is(13n+7), which is less than the algorithm of Xiangjian Xu with the cost of(16n+32).

Key concepts: Toeplitz matrix, Mathematics, Algorithm, Linear system, Matrix (chemical analysis), Computer science, Mathematical optimization, Mathematical analysis

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A Fast Algorithm for Sloving Symmetric Pentadiagonal Toeplitz Systems — Research Paper | ScholarLens