Numerical algorithms for solving comrade linear systems based on tridiagonal solvers

Tomohiro Sogabe

doi:10.1016/j.amc.2007.08.029

Return

Numerical algorithms for solving comrade linear systems based on tridiagonal solvers

2008-04-01

PRE

Tomohiro Sogabe *

DOI：10.1016/j.amc.2007.08.029

Original

Original request for help

Save

Abstract

En 中文

Recently, two efficient algorithms for solving comrade linear systems have been proposed by Karawia [A. A. Karawia, Two algorithms for solving comrade linear systems, Appl. Math. Comput. 189 (2007) 291-297]. The two algorithms are based on the LU decomposition of the comrade matrix. In this paper, two algorithms are presented for solving the comrade linear systems based on the use of conventional fast tridiagonal solvers and an efficient way of evaluating the determinant of the comrade matrix is discussed. (C) 2007 Elsevier Inc. All rights reserved.

Keywords:

comrade matrices

tridiagonal matrices

linear systems

determinants