Tomohiro Sogabe

Learn More
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(More)
The elementary symmetric polynomials play a fundamental role in algebra, discrete mathematics, combinatorics, numerical analysis and computer science. It is of great importance to find properties of the elementary symmetric polynomials; for the properties, see, e.g., [5]. In the area of linear algebra, it has been recently found that some special matrices(More)
In the present paper, we give a fast algorithm for block diagonalization of k-tridiagonal matrices. The block diagonalization provides us with some useful results: e.g., another derivation of a very recent result on generalized k-Fibonacci numbers in [M.E.A. El-Mikkawy, T. Sogabe, A new family of k-Fibonacci numbers, Appl. Math. Comput. 215 (2010) 4456–(More)