2006•Journal of Hunan University of Arts and ScienceRequires access

Fast Algorithm for Near Banded Toeplitz Systems

Yunxiang Li

Abstract

A new fast solution for near banded Toeplitz systems was described based on fast solution to banded Toeplitz systems and rank-1 updating strategy. It turned a near banded Toeplitz equation into several banded Toeplitz systems. The structure of the new algorithm is simple,and the algorithm can be realized efficiently on parallel computer.

About this research paper

What this paper is about

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

Key concepts: Toeplitz matrix, Levinson recursion, Rank (graph theory), Algorithm, Simple (philosophy), Mathematics, Computer science, Combinatorics