Results 171 to 180 of about 442,498 (206)

On Minimal Eigenvalues of a Class of Tridiagonal Matrices

IEEE Transactions on Information Theory, 2009
It is known that the worst case near-far resistance of optimum multiuser detectors for asynchronous Gaussian multiple-access channels can be expressed in terms of a class of block-tridiagonal matrices, and the minimal eigenvalues of such a class of block-tridiagonal matrices serve as a good measure of the worst case near-far resistance.
Jay Cheng, Toby Berger
openaire   +2 more sources

The LU Factorizations and Determinants of the K-Tridiagonal Matrices

Asian-European Journal of Mathematics, 2011
In this paper we present LU factorizations and determinants of the k-tridiagonal matrices. We find also eigenvalues of the respective k-tridiagonal Toeplitz matrices.
Aynur YALCINER
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Remarks on anti-tridiagonal matrices

Applied Mathematics and Computation, 2020
The authors provide several spectral considerations on anti-tridiagonal matrices of the following type: \[\left( \begin{array}{cccccccc} & & & & & & * & * \\ & \mathbf{0} & & & & * & * & * \\ & & & & \cdot & \cdot & * & \\ & & & \cdot & \cdot & \cdot & & \\ & & \cdot & \cdot & \cdot & & & \\ & * & \cdot & \cdot & & & & \\ * & * & * & & & & \mathbf{0} &
Natália Bebiano, Susana Furtado
openaire   +2 more sources

A Note on a Fast Breakdown-Free Algorithm for Computing the Determinants and the Permanents of k-Tridiagonal Matrices

Applied Mathematics and Computation, 2014
k-Tridiagonal matrices have attracted much attention in recent years, which are a generalization of tridiagonal matrices. In this note, a breakdown-free numerical algorithm of O(n) is presented for computing the determinants and the permanents of k ...
Tomohiro Sogabe, Fatih Yilmaz
exaly   +2 more sources

The inverses of block tridiagonal matrices

Applied Mathematics and Computation, 2006
Combining an LU and a UL decomposition of a block tridiagonal matrix a twisted block decomposition of the matrix and an iterative formula for the computation of the block elements of the inverse matrix are derived. Furthermore, considering only the multiplication and division operations a comparison of the computational complexity of the new algorithm ...
Rui-Sheng Ran, Ting-Zhu Huang
openaire   +3 more sources

Tridiagonal Matrices with Dominant Diagonals and Applications

Operations Research Letters, 2014
We show that in an n×n tridiagonal matrix T that has a positive dominant diagonal and negative super- and sub-diagonals, there exists a strictly positive x>0 that satisfies the system Tx=b, b≧0 and b≠0. Furthermore, if T is symmetric, the components of x can be ranked under certain conditions.
Winston W. Chang, Tai-Liang Chen
openaire   +1 more source

A POLYNOMIAL PRECONDITIONER FOR BLOCK TRIDIAGONAL MATRICES

Parallel Algorithms and Applications, 1994
ABSTRACT This paper is concerned with the solution of block tridiagonal linear systems by the preconditioned conjugate gradient (PCG) method. If we consider a block AGE splitting of the coefficient matrix, it is possible to derive an additive polynomial preconditioner and to give conditions for such preconditioner to be symmetric positive definite ...
GALLIGANI, Emanuele, V. RUGGIERO
openaire   +2 more sources

Eigenvectors of tridiagonal matrices of Sylvester type

Calcolo, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
CHU, Wenchang, WANG X.
openaire   +3 more sources

A bound for tridiagonal matrices

Siberian Mathematical Journal, 1989
See the review in Zbl 0684.15005.
openaire   +1 more source

On inverses of tridiagonal matrices

Journal of Discrete Mathematical Sciences and Cryptography, 2005
Abstract An algorithm for computing the inverse of a general tridiagonal matrix is introduced. This algorithm is obtained by factoring this matrix into the product of two bidiagonal matrices using Crout’s LU factorization, one upper and one lower bidiagonal.
openaire   +1 more source