Pentadiagonal matrix

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

: egin{pmatrix} c_1 & d_1 & e_1 & 0 & cdots & cdots & 0 \ b_1 & c_2 & d_2 & e_2 & ddots & & vdots \ a_1 & b_2 & ddots & ddots & ddots & ddots & vdots \ 0 & a_2 & ddots & ddots & ddots & e_{n-3} & 0 \ vdots & ddots & ddots & ddots & ddots & d_{n-2} & e_{n-2} \ vdots & & ddots & a_{n-3} & b_{n-2} & c_{n-1} & d_{n-1} \ 0 & cdots & cdots & 0 & a_{n-2} & b_{n-1} & c_n end{pmatrix}.

It follows that a pentadiagonal matrix has at most 5n-6 nonzero entries, where "n" is the size of the matrix. Hence, pentadiagonal matrices are sparse. This makes them useful in numerical analysis.

ee also

* tridiagonal matrix

----


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • 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

  • List of matrices — This page lists some important classes of matrices used in mathematics, science and engineering: Matrices in mathematics*(0,1) matrix a matrix with all elements either 0 or 1. Also called a binary matrix . *Adjugate matrix * Alternant matrix a… …   Wikipedia

  • List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra …   Wikipedia

  • List of mathematics articles (P) — NOTOC P P = NP problem P adic analysis P adic number P adic order P compact group P group P² irreducible P Laplacian P matrix P rep P value P vector P y method Pacific Journal of Mathematics Package merge algorithm Packed storage matrix Packing… …   Wikipedia

  • Stone method — Stone s method, also known as the strongly implicit procedure or SIP, is an algorithm for solving a sparse linear system of equations. The method uses an incomplete LU decomposition, which approximates the exact LU decomposition, to get an… …   Wikipedia

  • NAS Parallel Benchmarks — Original author(s) NASA Numerical Aerodynamic Simulation Program Developer(s) NASA Advanced Supercomputing Division Stable release 3.3 Development status Active …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”