- tridiagonal matrix
- мат. тридиагональная матрица
Большой англо-русский и русско-английский словарь. 2001.
tridiagonal matrix
Смотреть что такое "tridiagonal matrix" в других словарях:
Tridiagonal matrix — In linear algebra, a tridiagonal matrix is a matrix that is almost a diagonal matrix. To be exact: a tridiagonal matrix has nonzero elements only in the main diagonal, the first diagonal below this, and the first diagonal above the main… … Wikipedia
Tridiagonal matrix algorithm — The tridiagonal matrix algorithm (TDMA), also known as the Thomas algorithm , is a simplified form of Gaussian elimination that can be used to solve tridiagonal systems of equations. A tridiagonal system for n unknowns may be written as:a i x {i… … Wikipedia
Block matrix — In the mathematical discipline of matrix theory, a block matrix or a partitioned matrix is a matrix broken into sections called blocks. Looking at it another way, the matrix is written in terms of smaller matrices.[1] We group the rows and… … Wikipedia
Band matrix — In mathematics, particularly matrix theory, a band matrix is a sparse matrix whose non zero entries are confined to a diagonal band, comprising the main diagonal and zero or more diagonals on either side. Contents 1 Matrix bandwidth 2… … Wikipedia
Diagonal matrix — In linear algebra, a diagonal matrix is a matrix (usually a square matrix) in which the entries outside the main diagonal (↘) are all zero. The diagonal entries themselves may or may not be zero. Thus, the matrix D = (di,j) with n columns and n… … Wikipedia
Sparse matrix — A sparse matrix obtained when solving a finite element problem in two dimensions. The non zero elements are shown in black. In the subfield of numerical analysis, a sparse matrix is a matrix populated primarily with zeros (Stoer Bulirsch 2002,… … Wikipedia
Triangular matrix — In the mathematical discipline of linear algebra, a triangular matrix is a special kind of square matrix where the entries either below or above the main diagonal are zero. Because matrix equations with triangular matrices are easier to solve… … Wikipedia
Lehmer matrix — In mathematics, particularly matrix theory, the n×n Lehmer matrix is the constant symmetric matrix defined by:A {ij} =egin{cases}i/j, jge i j/i, j n . The values of elements diminish toward zero away from the diagonal, where all elements have… … Wikipedia
Pentadiagonal matrix — In linear algebra, a pentadiagonal matrix is a matrix that is nearly diagonal; to be exact, it is a matrix in which the only nonzero entries are on the main diagonal, and the first two diagonals above and below it. So it is of the form :… … Wikipedia
Hankel matrix — In linear algebra, a Hankel matrix, named after Hermann Hankel, is a square matrix with constant (positive sloping) skew diagonals, e.g.::egin{bmatrix}a b c d e b c d e f c d e f g d e f g h e f g h i end{bmatrix}.In mathematical terms::a {i,j} … Wikipedia
Arrowhead matrix — In the mathematical field of linear algebra, an arrowhead matrix is a square matrix containing zeros in all entries except for the first row, first column, and main diagonal. [cite book |author=Stewart, G. W. |title=Matrix Algorithms… … Wikipedia
