|
|
| Line 1: |
Line 1: |
| {{citations missing|date=May 2010}}
| | <br><br>Another day I woke up and [http://Www.Wonderhowto.com/search/noticed+-/ noticed -] I've been single where is the luke bryan concert ([http://lukebryantickets.iczmpbangladesh.org pop over to these guys]) for a while now and following much bullying from pals I today find myself signed up for online dating. They guaranteed me that there are lots of pleasant, ordinary and interesting folks to meet, so the [http://www.museodecarruajes.org luke bryan concert tour 2014] pitch is gone by here!<br>I try and maintain as physically healthy as possible being at the gymnasium several-times per week. I appreciate my athletics and try to perform [http://www.banburycrossonline.com lukebrayn] or see as many a potential. Being winter I'll often at Hawthorn fits. Notice: If you would contemplated buying a sport I really do not brain, I've noticed the carnage of fumbling matches at stocktake revenue.<br>My household and pals are magnificent and spending time together at tavern gigs or meals is obviously essential. As I locate that one can never have a decent conversation with all the sound I haven't ever been into nightclubs. I likewise got two really adorable and unquestionably cheeky dogs that are constantly keen to meet up fresh individuals.<br><br>Review my homepage :: luke bryan tickets 2012 ([http://lukebryantickets.flicense.com pop over to these guys]) |
| In [[mathematics]], particularly [[Matrix (mathematics)|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.
| |
| | |
| ==Matrix bandwidth==<!--
| |
| [[Bandwidth (sparse matrix)]], [[matrix bandwidth]], [[bandwidth (matrix)]], [[bandwidth (matrix theory)]]
| |
| redirect here -->
| |
| Formally, consider an ''n''×''n'' matrix ''A''=(''a''<sub>''i,j'' </sub>). If all matrix elements are zero outside a diagonally bordered band whose range is determined by constants ''k''<sub>1</sub> and ''k''<sub>2</sub>:
| |
| | |
| :<math>a_{i,j}=0 \quad\mbox{if}\quad j<i-k_1 \quad\mbox{ or }\quad j>i+k_2; \quad k_1, k_2 \ge 0.\,</math> | |
| | |
| then the quantities ''k''<sub>1</sub> and ''k''<sub>2</sub> are called the '''left''' and '''right''' '''half-bandwidth''', respectively {{harv|Golub|Van Loan|1996|loc=§1.2.1}}. The '''bandwidth''' of the matrix is ''k''<sub>1</sub> + ''k''<sub>2</sub> + 1 (in other words, it is the smallest number of adjacent diagonals to which the non-zero elements are confined).
| |
| | |
| A matrix is called a '''band matrix''' or '''banded matrix''' if its bandwidth is reasonably small.
| |
| | |
| A band matrix with ''k''<sub>1</sub> = ''k''<sub>2</sub> = 0 is a [[diagonal matrix]]; a band matrix with ''k''<sub>1</sub> = ''k''<sub>2</sub> = 1 is a [[tridiagonal matrix]]; when ''k''<sub>1</sub> = ''k''<sub>2</sub> = 2 one has a [[pentadiagonal matrix]] and so on. If one puts ''k''<sub>1</sub> = 0, ''k''<sub>2</sub> = ''n''−1, one obtains the definition of an upper [[triangular matrix]]; similarly, for ''k''<sub>1</sub> = ''n''−1, ''k''<sub>2</sub> = 0 one obtains a lower triangular matrix.
| |
| | |
| ==Applications==
| |
| In [[numerical analysis]], matrices from [[finite element]] or [[finite difference]] problems are often banded. Such matrices can be viewed as descriptions of the coupling between the problem variables; the bandedness corresponds to the fact that variables are not coupled over arbitrarily large distances. Such matrices can be further divided - for instance, banded matrices exist where every element in the band is nonzero. These often arise when discretising one-dimensional problems.{{Fact|date=February 2007}}
| |
| | |
| Problems in higher dimensions also lead to banded matrices, in which case the band itself also tends to be sparse. For instance, a partial differential equation on a square domain (using central differences) will yield a matrix with a half-bandwidth equal to the square root of the matrix dimension, but inside the band only 5 diagonals are nonzero. Unfortunately, applying [[Gaussian elimination]] (or equivalently an [[LU decomposition]]) to such a matrix results in the band being filled in by many non-zero elements.
| |
| | |
| ==Band storage==
| |
| Band matrices are usually stored by storing the diagonals in the band; the rest is implicitly zero.
| |
| | |
| For example, a [[tridiagonal matrix]] has bandwidth 3. The 6-by-6 matrix
| |
| :<math> | |
| \begin{bmatrix}
| |
| B_{11} & B_{12} & 0 & \cdots & \cdots & 0 \\
| |
| B_{21} & B_{22} & B_{23} & \ddots & \ddots & \vdots \\
| |
| 0 & B_{32} & B_{33} & B_{34} & \ddots & \vdots \\
| |
| \vdots & \ddots & B_{43} & B_{44} & B_{45} & 0 \\
| |
| \vdots & \ddots & \ddots & B_{54} & B_{55} & B_{56} \\
| |
| 0 & \cdots & \cdots & 0 & B_{65} & B_{66}
| |
| \end{bmatrix}
| |
| </math>
| |
| is stored as the 6-by-3 matrix
| |
| :<math>
| |
| \begin{bmatrix}
| |
| 0 & B_{11} & B_{12}\\
| |
| B_{21} & B_{22} & B_{23} \\
| |
| B_{32} & B_{33} & B_{34} \\
| |
| B_{43} & B_{44} & B_{45} \\
| |
| B_{54} & B_{55} & B_{56} \\
| |
| B_{65} & B_{66} & 0
| |
| \end{bmatrix}.
| |
| </math>
| |
| | |
| A further saving is possible when the matrix is symmetric. For example, consider a symmetric 6-by-6 matrix with a right bandwidth of 2:
| |
| :<math>
| |
| \begin{bmatrix}
| |
| A_{11} & A_{12} & A_{13} & 0 & \cdots & 0 \\
| |
| & A_{22} & A_{23} & A_{24} & \ddots & \vdots \\
| |
| & & A_{33} & A_{34} & A_{35} & 0 \\
| |
| & & & A_{44} & A_{45} & A_{46} \\
| |
| & sym & & & A_{55} & A_{56} \\
| |
| & & & & & A_{66}
| |
| \end{bmatrix}.
| |
| </math>
| |
| This matrix is stored as the 6-by-3 matrix:
| |
| :<math>
| |
| \begin{bmatrix}
| |
| A_{11} & A_{12} & A_{13} \\
| |
| A_{22} & A_{23} & A_{24} \\
| |
| A_{33} & A_{34} & A_{35} \\
| |
| A_{44} & A_{45} & A_{46} \\
| |
| A_{55} & A_{56} & 0 \\
| |
| A_{66} & 0 & 0
| |
| \end{bmatrix}.
| |
| </math> | |
| | |
| ==Band form of sparse matrices==
| |
| From a computational point of view, working with band matrices is always preferential to working with similarly dimensioned square matrices. A band matrix can be likened in complexity to a rectangular matrix whose row dimension is equal to the bandwidth of the band matrix. Thus the work involved in performing operations such as multiplication falls significantly, often leading to huge savings in terms of calculation time and [[calculation complexity|complexity]].
| |
| | |
| As sparse matrices lend themselves to more efficient computation than dense matrices, as well as in more efficient utilization of computer storage, there has been much research focused on finding ways to minimise the bandwidth (or directly minimise the fill in) by applying permutations to the matrix, or other such equivalence or similarity transformations.{{Fact|date=February 2007}}
| |
| | |
| The [[Cuthill–McKee algorithm]] can be used to reduce the bandwidth of a sparse [[symmetric matrix]]. There are, however, matrices for which the [[reverse Cuthill–McKee algorithm]] performs better. There are many other methods in use.
| |
| | |
| The problem of finding a representation of a matrix with minimal bandwidth by means of permutations of rows and columns is [[NP-hard]].<ref name=feige>"Coping with the NP-Hardness of the Graph Bandwidth Problem", Uriel Feige, ''[[Lecture Notes in Computer Science]]'', Volume 1851, 2000, pp. 129-145, {{doi|10.1007/3-540-44985-X_2}} </ref>
| |
| | |
| ==Examples and special cases==
| |
| The following are special cases of band matrices:
| |
| * [[Diagonal matrix|Diagonal matrices]].
| |
| * [[Tridiagonal matrix|Tridiagonal matrices]].
| |
| * [[Pentadiagonal matrix|Pentadiagonal matrices]].
| |
| * Upper and lower [[triangular matrix|triangular matrices]].
| |
| * Upper and lower [[Hessenberg matrix|Hessenberg matrices]].
| |
| * [[Block-diagonal matrix|Block-diagonal matrices]].
| |
| * [[Shift matrix|Shift matrices]] and [[shear matrix|shear matrices]].
| |
| * Matrices in [[Jordan normal form]].
| |
| * A [[skyline matrix]], also called "variable band matrix" is a generalization of band matrix
| |
| | |
| The inverses of [[Lehmer matrix|Lehmer matrices]] are constant tridiagonal matrices, and are thus band matrices.
| |
| | |
| ==See also==
| |
| * [[Graph bandwidth]]
| |
| | |
| ==References==
| |
| {{reflist}}
| |
| * {{Cite book | first1=Gene H. | last1=Golub | author1-link=Gene H. Golub | first2=Charles F. | last2=Van Loan | author2-link=Charles F. Van Loan | year=1996 | title=Matrix Computations | edition=3rd | publisher=Johns Hopkins | place=Baltimore | isbn=978-0-8018-5414-9 }}.
| |
| *{{Citation|last1=Press|first1=WH|last2=Teukolsky|first2=SA|last3=Vetterling|first3=WT|last4=Flannery|first4=BP|year=2007|title=Numerical Recipes: The Art of Scientific Computing|edition=3rd|publisher=Cambridge University Press| publication-place=New York|isbn=978-0-521-88068-8|chapter=Section 2.4|chapter-url=http://apps.nrbook.com/empanel/index.html?pg=56}}
| |
| | |
| ==External links==
| |
| * [http://www.netlib.org/lapack/lug/node124.html Information pertaining to LAPACK and band matrices]
| |
| * [http://www.netlib.org/linalg/html_templates/node89.html#SECTION00930000000000000000 A tutorial on banded matrices and other sparse matrix formats]
| |
| | |
| | |
| [[Category:Sparse matrices]]
| |
Another day I woke up and noticed - I've been single where is the luke bryan concert (pop over to these guys) for a while now and following much bullying from pals I today find myself signed up for online dating. They guaranteed me that there are lots of pleasant, ordinary and interesting folks to meet, so the luke bryan concert tour 2014 pitch is gone by here!
I try and maintain as physically healthy as possible being at the gymnasium several-times per week. I appreciate my athletics and try to perform lukebrayn or see as many a potential. Being winter I'll often at Hawthorn fits. Notice: If you would contemplated buying a sport I really do not brain, I've noticed the carnage of fumbling matches at stocktake revenue.
My household and pals are magnificent and spending time together at tavern gigs or meals is obviously essential. As I locate that one can never have a decent conversation with all the sound I haven't ever been into nightclubs. I likewise got two really adorable and unquestionably cheeky dogs that are constantly keen to meet up fresh individuals.
Review my homepage :: luke bryan tickets 2012 (pop over to these guys)