| 1 |
<html><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8"><title>Álgebra linear</title><meta name="generator" content="DocBook XSL Stylesheets Vsnapshot"><link rel="home" href="index.html" title="Manual do Genius"><link rel="up" href="ch11.html" title="Chapter 11. List of GEL functions"><link rel="prev" href="ch11s08.html" title="Manipulação de matrizes"><link rel="next" href="ch11s10.html" title="Combinatória"></head><body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Álgebra linear</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ch11s08.html">Prev</a> </td><th width="60%" align="center">Chapter 11. List of GEL functions</th><td width="20%" align="right"> <a accesskey="n" href="ch11s10.html">Next</a></td></tr></table><hr></div><div class="sect1"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a name="genius-gel-function-list-linear-algebra"></a>Álgebra linear</h2></div></div></div><div class="variablelist"><dl class="variablelist"><dt><span lang="en" class="term"><a name="gel-function-AuxiliaryUnitMatrix"></a>AuxiliaryUnitMatrix</span></dt><dd><pre lang="en" class="synopsis">AuxiliaryUnitMatrix (n)</pre><p lang="en">Get the auxiliary unit matrix of size <code class="varname">n</code>. This is a square matrix with that is all zero except the |
| 2 |
superdiagonal being all ones. It is the Jordan block matrix of one zero eigenvalue.</p><p lang="en"> |
| 3 |
See |
| 4 |
<a class="ulink" href="http://planetmath.org/JordanCanonicalFormTheorem" target="_top">Planetmath</a> or |
| 5 |
<a class="ulink" href="http://mathworld.wolfram.com/JordanBlock.html" target="_top">Mathworld</a> for more information on Jordan Canonical Form. |
| 6 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-BilinearForm"></a>BilinearForm</span></dt><dd><pre lang="en" class="synopsis">BilinearForm (v,A,w)</pre><p lang="en">Evaluate (v,w) with respect to the bilinear form given by the matrix A.</p></dd><dt><span lang="en" class="term"><a name="gel-function-BilinearFormFunction"></a>BilinearFormFunction</span></dt><dd><pre lang="en" class="synopsis">BilinearFormFunction (A)</pre><p lang="en">Return a function that evaluates two vectors with respect to the bilinear form given by A.</p></dd><dt><span lang="en" class="term"><a name="gel-function-CharacteristicPolynomial"></a>CharacteristicPolynomial</span></dt><dd><pre lang="en" class="synopsis">CharacteristicPolynomial (M)</pre><p lang="en">Aliases: <code class="function">CharPoly</code></p><p lang="en">Get the characteristic polynomial as a vector. That is, return |
| 7 |
the coefficients of the polynomial starting with the constant term. This is |
| 8 |
the polynomial defined by <strong class="userinput"><code>det(M-xI)</code></strong>. The roots of this |
| 9 |
polynomial are the eigenvalues of <code class="varname">M</code>. |
| 10 |
See also <a class="link" href="ch11s09.html#gel-function-CharacteristicPolynomialFunction">CharacteristicPolynomialFunction</a>. |
| 11 |
</p><p lang="en"> |
| 12 |
See |
| 13 |
<a class="ulink" href="https://en.wikipedia.org/wiki/Characteristic_polynomial" target="_top">Wikipedia</a> or |
| 14 |
<a class="ulink" href="http://planetmath.org/CharacteristicEquation" target="_top">Planetmath</a> for more information. |
| 15 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-CharacteristicPolynomialFunction"></a>CharacteristicPolynomialFunction</span></dt><dd><pre lang="en" class="synopsis">CharacteristicPolynomialFunction (M)</pre><p lang="en">Get the characteristic polynomial as a function. This is |
| 16 |
the polynomial defined by <strong class="userinput"><code>det(M-xI)</code></strong>. The roots of this |
| 17 |
polynomial are the eigenvalues of <code class="varname">M</code>. |
| 18 |
See also <a class="link" href="ch11s09.html#gel-function-CharacteristicPolynomial">CharacteristicPolynomial</a>. |
| 19 |
</p><p lang="en"> |
| 20 |
See |
| 21 |
<a class="ulink" href="https://en.wikipedia.org/wiki/Characteristic_polynomial" target="_top">Wikipedia</a> or |
| 22 |
<a class="ulink" href="http://planetmath.org/CharacteristicEquation" target="_top">Planetmath</a> for more information. |
| 23 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-ColumnSpace"></a>ColumnSpace</span></dt><dd><pre lang="en" class="synopsis">ColumnSpace (M)</pre><p lang="en">Get a basis matrix for the columnspace of a matrix. That is, |
| 24 |
return a matrix whose columns are the basis for the column space of |
| 25 |
<code class="varname">M</code>. That is the space spanned by the columns of |
| 26 |
<code class="varname">M</code>.</p><p lang="en"> |
| 27 |
See |
| 28 |
<a class="ulink" href="https://en.wikipedia.org/wiki/Row_and_column_spaces" target="_top">Wikipedia</a> for more information. |
| 29 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-CommutationMatrix"></a>CommutationMatrix</span></dt><dd><pre lang="en" class="synopsis">CommutationMatrix (m, n)</pre><p lang="en">Return the commutation matrix <strong class="userinput"><code>K(m,n)</code></strong>, which is the unique <strong class="userinput"><code>m*n</code></strong> by |
| 30 |
<strong class="userinput"><code>m*n</code></strong> matrix such that <strong class="userinput"><code>K(m,n) * MakeVector(A) = MakeVector(A.')</code></strong> for all <code class="varname">m</code> by <code class="varname">n</code> |
| 31 |
matrices <code class="varname">A</code>.</p></dd><dt><span lang="en" class="term"><a name="gel-function-CompanionMatrix"></a>CompanionMatrix</span></dt><dd><pre lang="en" class="synopsis">CompanionMatrix (p)</pre><p lang="en">Companion matrix of a polynomial (as vector).</p></dd><dt><span lang="en" class="term"><a name="gel-function-ConjugateTranspose"></a>ConjugateTranspose</span></dt><dd><pre lang="en" class="synopsis">ConjugateTranspose (M)</pre><p lang="en">Conjugate transpose of a matrix (adjoint). This is the |
| 32 |
same as the <strong class="userinput"><code>'</code></strong> operator.</p><p lang="en"> |
| 33 |
See |
| 34 |
<a class="ulink" href="https://en.wikipedia.org/wiki/Conjugate_transpose" target="_top">Wikipedia</a> or |
| 35 |
<a class="ulink" href="http://planetmath.org/ConjugateTranspose" target="_top">Planetmath</a> for more information. |
| 36 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-Convolution"></a>Convolution</span></dt><dd><pre lang="en" class="synopsis">Convolution (a,b)</pre><p lang="en">Aliases: <code class="function">convol</code></p><p lang="en">Calculate convolution of two horizontal vectors.</p></dd><dt><span lang="en" class="term"><a name="gel-function-ConvolutionVector"></a>ConvolutionVector</span></dt><dd><pre lang="en" class="synopsis">ConvolutionVector (a,b)</pre><p lang="en">Calculate convolution of two horizontal vectors. Return |
| 37 |
result as a vector and not added together.</p></dd><dt><span lang="en" class="term"><a name="gel-function-CrossProduct"></a>CrossProduct</span></dt><dd><pre lang="en" class="synopsis">CrossProduct (v,w)</pre><p lang="en">CrossProduct of two vectors in R<sup>3</sup> as |
| 38 |
a column vector.</p><p lang="en"> |
| 39 |
See |
| 40 |
<a class="ulink" href="https://en.wikipedia.org/wiki/Cross_product" target="_top">Wikipedia</a> for more information. |
| 41 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-DeterminantalDivisorsInteger"></a>DeterminantalDivisorsInteger</span></dt><dd><pre lang="en" class="synopsis">DeterminantalDivisorsInteger (M)</pre><p lang="en">Get the determinantal divisors of an integer matrix.</p></dd><dt><span lang="en" class="term"><a name="gel-function-DirectSum"></a>DirectSum</span></dt><dd><pre lang="en" class="synopsis">DirectSum (M,N...)</pre><p lang="en">Direct sum of matrices.</p><p lang="en"> |
| 42 |
See |
| 43 |
<a class="ulink" href="https://en.wikipedia.org/wiki/Matrix_addition#directsum" target="_top">Wikipedia</a> for more information. |
| 44 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-DirectSumMatrixVector"></a>DirectSumMatrixVector</span></dt><dd><pre lang="en" class="synopsis">DirectSumMatrixVector (v)</pre><p lang="en">Direct sum of a vector of matrices.</p><p lang="en"> |
| 45 |
See |
| 46 |
<a class="ulink" href="https://en.wikipedia.org/wiki/Matrix_addition#directsum" target="_top">Wikipedia</a> for more information. |
| 47 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-Eigenvalues"></a>Eigenvalues</span></dt><dd><pre lang="en" class="synopsis">Eigenvalues (M)</pre><p lang="en">Aliases: <code class="function">eig</code></p><p lang="en">Get the eigenvalues of a square matrix. |
| 48 |
Currently only works for matrices of size up to 4 by 4, or for |
| 49 |
triangular matrices (for which the eigenvalues are on the |
| 50 |
diagonal). |
| 51 |
</p><p lang="en"> |
| 52 |
See |
| 53 |
<a class="ulink" href="https://en.wikipedia.org/wiki/Eigenvalue" target="_top">Wikipedia</a>, |
| 54 |
<a class="ulink" href="http://planetmath.org/Eigenvalue" target="_top">Planetmath</a>, or |
| 55 |
<a class="ulink" href="http://mathworld.wolfram.com/Eigenvalue.html" target="_top">Mathworld</a> for more information. |
| 56 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-Eigenvectors"></a>Eigenvectors</span></dt><dd><pre lang="en" class="synopsis">Eigenvectors (M)</pre><pre lang="en" class="synopsis">Eigenvectors (M, &eigenvalues)</pre><pre lang="en" class="synopsis">Eigenvectors (M, &eigenvalues, &multiplicities)</pre><p lang="en">Get the eigenvectors of a square matrix. Optionally get also |
| 57 |
the eigenvalues and their algebraic multiplicities. |
| 58 |
Currently only works for matrices of size up to 2 by 2. |
| 59 |
</p><p lang="en"> |
| 60 |
See |
| 61 |
<a class="ulink" href="https://en.wikipedia.org/wiki/Eigenvector" target="_top">Wikipedia</a>, |
| 62 |
<a class="ulink" href="http://planetmath.org/Eigenvector" target="_top">Planetmath</a>, or |
| 63 |
<a class="ulink" href="http://mathworld.wolfram.com/Eigenvector.html" target="_top">Mathworld</a> for more information. |
| 64 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-GramSchmidt"></a>GramSchmidt</span></dt><dd><pre lang="en" class="synopsis">GramSchmidt (v,B...)</pre><p lang="en">Apply the Gram-Schmidt process (to the columns) with respect to |
| 65 |
inner product given by <code class="varname">B</code>. If <code class="varname">B</code> is not |
| 66 |
given then the standard Hermitian product is used. <code class="varname">B</code> can |
| 67 |
either be a sesquilinear function of two arguments or it can be a matrix giving |
| 68 |
a sesquilinear form. The vectors will be made orthonormal with respect to |
| 69 |
<code class="varname">B</code>.</p><p lang="en"> |
| 70 |
See |
| 71 |
<a class="ulink" href="https://en.wikipedia.org/wiki/Gram%E2%80%93Schmidt_process" target="_top">Wikipedia</a> or |
| 72 |
<a class="ulink" href="http://planetmath.org/GramSchmidtOrthogonalization" target="_top">Planetmath</a> for more information. |
| 73 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-HankelMatrix"></a>HankelMatrix</span></dt><dd><pre lang="en" class="synopsis">HankelMatrix (c,r)</pre><p lang="en">Hankel matrix, a matrix whose skew-diagonals are constant. <code class="varname">c</code> is the first row and <code class="varname">r</code> is the |
| 74 |
last column. It is assumed that both arguments are vectors and the last element of <code class="varname">c</code> is the same |
| 75 |
as the first element of <code class="varname">r</code>.</p><p lang="en"> |
| 76 |
See |
| 77 |
<a class="ulink" href="https://en.wikipedia.org/wiki/Hankel_matrix" target="_top">Wikipedia</a> for more information. |
| 78 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-HilbertMatrix"></a>HilbertMatrix</span></dt><dd><pre lang="en" class="synopsis">HilbertMatrix (n)</pre><p lang="en">Hilbert matrix of order <code class="varname">n</code>.</p><p lang="en"> |
| 79 |
See |
| 80 |
<a class="ulink" href="https://en.wikipedia.org/wiki/Hilbert_matrix" target="_top">Wikipedia</a> or |
| 81 |
<a class="ulink" href="http://planetmath.org/HilbertMatrix" target="_top">Planetmath</a> for more information. |
| 82 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-Image"></a>Image</span></dt><dd><pre lang="en" class="synopsis">Image (T)</pre><p lang="en">Get the image (columnspace) of a linear transform.</p><p lang="en"> |
| 83 |
See |
| 84 |
<a class="ulink" href="https://en.wikipedia.org/wiki/Row_and_column_spaces" target="_top">Wikipedia</a> for more information. |
| 85 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-InfNorm"></a>InfNorm</span></dt><dd><pre lang="en" class="synopsis">InfNorm (v)</pre><p lang="en">Get the Inf Norm of a vector, sometimes called the sup norm or the max norm.</p></dd><dt><span lang="en" class="term"><a name="gel-function-InvariantFactorsInteger"></a>InvariantFactorsInteger</span></dt><dd><pre lang="en" class="synopsis">InvariantFactorsInteger (M)</pre><p lang="en">Get the invariant factors of a square integer matrix.</p></dd><dt><span lang="en" class="term"><a name="gel-function-InverseHilbertMatrix"></a>InverseHilbertMatrix</span></dt><dd><pre lang="en" class="synopsis">InverseHilbertMatrix (n)</pre><p lang="en">Inverse Hilbert matrix of order <code class="varname">n</code>.</p><p lang="en"> |
| 86 |
See |
| 87 |
<a class="ulink" href="https://en.wikipedia.org/wiki/Hilbert_matrix" target="_top">Wikipedia</a> or |
| 88 |
<a class="ulink" href="http://planetmath.org/HilbertMatrix" target="_top">Planetmath</a> for more information. |
| 89 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-IsHermitian"></a>IsHermitian</span></dt><dd><pre lang="en" class="synopsis">IsHermitian (M)</pre><p lang="en">Is a matrix Hermitian. That is, is it equal to its conjugate transpose.</p><p lang="en"> |
| 90 |
See |
| 91 |
<a class="ulink" href="https://en.wikipedia.org/wiki/Hermitian_matrix" target="_top">Wikipedia</a> or |
| 92 |
<a class="ulink" href="http://planetmath.org/HermitianMatrix" target="_top">Planetmath</a> for more information. |
| 93 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-IsInSubspace"></a>IsInSubspace</span></dt><dd><pre lang="en" class="synopsis">IsInSubspace (v,W)</pre><p lang="en">Test if a vector is in a subspace.</p></dd><dt><span lang="en" class="term"><a name="gel-function-IsInvertible"></a>IsInvertible</span></dt><dd><pre lang="en" class="synopsis">IsInvertible (n)</pre><p lang="en">Is a matrix (or number) invertible (Integer matrix is invertible if and only if it is invertible over the integers).</p></dd><dt><span lang="en" class="term"><a name="gel-function-IsInvertibleField"></a>IsInvertibleField</span></dt><dd><pre lang="en" class="synopsis">IsInvertibleField (n)</pre><p lang="en">Is a matrix (or number) invertible over a field.</p></dd><dt><span lang="en" class="term"><a name="gel-function-IsNormal"></a>IsNormal</span></dt><dd><pre lang="en" class="synopsis">IsNormal (M)</pre><p lang="en">Is <code class="varname">M</code> a normal matrix. That is, |
| 94 |
does <strong class="userinput"><code>M*M' == M'*M</code></strong>.</p><p lang="en"> |
| 95 |
See |
| 96 |
<a class="ulink" href="http://planetmath.org/NormalMatrix" target="_top">Planetmath</a> or |
| 97 |
<a class="ulink" href="http://mathworld.wolfram.com/NormalMatrix.html" target="_top">Mathworld</a> for more information. |
| 98 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-IsPositiveDefinite"></a>IsPositiveDefinite</span></dt><dd><pre lang="en" class="synopsis">IsPositiveDefinite (M)</pre><p lang="en">Is <code class="varname">M</code> a Hermitian positive definite matrix. That is if |
| 99 |
<strong class="userinput"><code>HermitianProduct(M*v,v)</code></strong> is always strictly positive for |
| 100 |
any vector <code class="varname">v</code>. |
| 101 |
<code class="varname">M</code> must be square and Hermitian to be positive definite. |
| 102 |
The check that is performed is that every principal submatrix has a non-negative |
| 103 |
determinant. |
| 104 |
(See <a class="link" href="ch11s08.html#gel-function-HermitianProduct">HermitianProduct</a>)</p><p lang="en"> |
| 105 |
Note that some authors (for example Mathworld) do not require that |
| 106 |
<code class="varname">M</code> be Hermitian, and then the condition is |
| 107 |
on the real part of the inner product, but we do not take this |
| 108 |
view. If you wish to perform this check, just check the |
| 109 |
Hermitian part of the matrix <code class="varname">M</code> as follows: |
| 110 |
<strong class="userinput"><code>IsPositiveDefinite(M+M')</code></strong>. |
| 111 |
</p><p lang="en"> |
| 112 |
See |
| 113 |
<a class="ulink" href="https://en.wikipedia.org/wiki/Positive-definite_matrix" target="_top">Wikipedia</a>, |
| 114 |
<a class="ulink" href="http://planetmath.org/PositiveDefinite" target="_top">Planetmath</a>, or |
| 115 |
<a class="ulink" href="http://mathworld.wolfram.com/PositiveDefiniteMatrix.html" target="_top">Mathworld</a> for more information. |
| 116 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-IsPositiveSemidefinite"></a>IsPositiveSemidefinite</span></dt><dd><pre lang="en" class="synopsis">IsPositiveSemidefinite (M)</pre><p lang="en">Is <code class="varname">M</code> a Hermitian positive semidefinite matrix. That is if |
| 117 |
<strong class="userinput"><code>HermitianProduct(M*v,v)</code></strong> is always non-negative for |
| 118 |
any vector <code class="varname">v</code>. |
| 119 |
<code class="varname">M</code> must be square and Hermitian to be positive semidefinite. |
| 120 |
The check that is performed is that every principal submatrix has a non-negative |
| 121 |
determinant. |
| 122 |
(See <a class="link" href="ch11s08.html#gel-function-HermitianProduct">HermitianProduct</a>)</p><p lang="en"> |
| 123 |
Note that some authors do not require that |
| 124 |
<code class="varname">M</code> be Hermitian, and then the condition is |
| 125 |
on the real part of the inner product, but we do not take this |
| 126 |
view. If you wish to perform this check, just check the |
| 127 |
Hermitian part of the matrix <code class="varname">M</code> as follows: |
| 128 |
<strong class="userinput"><code>IsPositiveSemidefinite(M+M')</code></strong>. |
| 129 |
</p><p lang="en"> |
| 130 |
See |
| 131 |
<a class="ulink" href="http://planetmath.org/PositiveSemidefinite" target="_top">Planetmath</a> or |
| 132 |
<a class="ulink" href="http://mathworld.wolfram.com/PositiveSemidefiniteMatrix.html" target="_top">Mathworld</a> for more information. |
| 133 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-IsSkewHermitian"></a>IsSkewHermitian</span></dt><dd><pre lang="en" class="synopsis">IsSkewHermitian (M)</pre><p lang="en">Is a matrix skew-Hermitian. That is, is the conjugate transpose equal to negative of the matrix.</p><p lang="en"> |
| 134 |
See |
| 135 |
<a class="ulink" href="http://planetmath.org/SkewHermitianMatrix" target="_top">Planetmath</a> for more information. |
| 136 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-IsUnitary"></a>IsUnitary</span></dt><dd><pre lang="en" class="synopsis">IsUnitary (M)</pre><p lang="en">Is a matrix unitary? That is, does |
| 137 |
<strong class="userinput"><code>M'*M</code></strong> and <strong class="userinput"><code>M*M'</code></strong> |
| 138 |
equal the identity.</p><p lang="en"> |
| 139 |
See |
| 140 |
<a class="ulink" href="http://planetmath.org/UnitaryTransformation" target="_top">Planetmath</a> or |
| 141 |
<a class="ulink" href="http://mathworld.wolfram.com/UnitaryMatrix.html" target="_top">Mathworld</a> for more information. |
| 142 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-JordanBlock"></a>JordanBlock</span></dt><dd><pre lang="en" class="synopsis">JordanBlock (n,lambda)</pre><p lang="en">Aliases: <code class="function">J</code></p><p lang="en">Get the Jordan block corresponding to the eigenvalue |
| 143 |
<code class="varname">lambda</code> with multiplicity <code class="varname">n</code>. |
| 144 |
</p><p lang="en"> |
| 145 |
See |
| 146 |
<a class="ulink" href="http://planetmath.org/JordanCanonicalFormTheorem" target="_top">Planetmath</a> or |
| 147 |
<a class="ulink" href="http://mathworld.wolfram.com/JordanBlock.html" target="_top">Mathworld</a> for more information. |
| 148 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-Kernel"></a>Kernel</span></dt><dd><pre lang="en" class="synopsis">Kernel (T)</pre><p lang="en">Get the kernel (nullspace) of a linear transform.</p><p lang="en"> |
| 149 |
(See <a class="link" href="ch11s09.html#gel-function-NullSpace">NullSpace</a>) |
| 150 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-KroneckerProduct"></a>KroneckerProduct</span></dt><dd><pre lang="en" class="synopsis">KroneckerProduct (M, N)</pre><p lang="en">Aliases: <code class="function">TensorProduct</code></p><p lang="en"> |
| 151 |
Compute the Kronecker product (tensor product in standard basis) |
| 152 |
of two matrices. |
| 153 |
</p><p lang="en"> |
| 154 |
See |
| 155 |
<a class="ulink" href="https://en.wikipedia.org/wiki/Kronecker_product" target="_top">Wikipedia</a>, |
| 156 |
<a class="ulink" href="http://planetmath.org/KroneckerProduct" target="_top">Planetmath</a> or |
| 157 |
<a class="ulink" href="http://mathworld.wolfram.com/KroneckerProduct.html" target="_top">Mathworld</a> for more information. |
| 158 |
</p><p lang="en">Version 1.0.18 onwards.</p></dd><dt><span lang="en" class="term"><a name="gel-function-LUDecomposition"></a>LUDecomposition</span></dt><dd><pre lang="en" class="synopsis">LUDecomposition (A, L, U)</pre><p lang="en"> |
| 159 |
Get the LU decomposition of <code class="varname">A</code>, that is |
| 160 |
find a lower triangular matrix and upper triangular |
| 161 |
matrix whose product is <code class="varname">A</code>. |
| 162 |
Store the result in the <code class="varname">L</code> and |
| 163 |
<code class="varname">U</code>, which should be references. It returns <code class="constant">true</code> |
| 164 |
if successful. |
| 165 |
For example suppose that A is a square matrix, then after running: |
| 166 |
</p><pre lang="en" class="screen"><code class="prompt">genius></code> <strong class="userinput"><code>LUDecomposition(A,&L,&U)</code></strong> |
| 167 |
</pre><p lang="en"> |
| 168 |
You will have the lower matrix stored in a variable called |
| 169 |
<code class="varname">L</code> and the upper matrix in a variable called |
| 170 |
<code class="varname">U</code>. |
| 171 |
</p><p lang="en"> |
| 172 |
This is the LU decomposition of a matrix aka Crout and/or Cholesky |
| 173 |
reduction. |
| 174 |
(ISBN 0-201-11577-8 pp.99-103) |
| 175 |
The upper triangular matrix features a diagonal |
| 176 |
of values 1 (one). This is not Doolittle's Method, which features |
| 177 |
the 1's diagonal on the lower matrix. |
| 178 |
</p><p lang="en"> |
| 179 |
Not all matrices have LU decompositions, for example |
| 180 |
<strong class="userinput"><code>[0,1;1,0]</code></strong> does not and this function returns |
| 181 |
<code class="constant">false</code> in this case and sets <code class="varname">L</code> |
| 182 |
and <code class="varname">U</code> to <code class="constant">null</code>. |
| 183 |
</p><p lang="en"> |
| 184 |
See |
| 185 |
<a class="ulink" href="https://en.wikipedia.org/wiki/LU_decomposition" target="_top">Wikipedia</a>, |
| 186 |
<a class="ulink" href="http://planetmath.org/LUDecomposition" target="_top">Planetmath</a> or |
| 187 |
<a class="ulink" href="http://mathworld.wolfram.com/LUDecomposition.html" target="_top">Mathworld</a> for more information. |
| 188 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-Minor"></a>Minor</span></dt><dd><pre lang="en" class="synopsis">Minor (M,i,j)</pre><p lang="en">Get the <code class="varname">i</code>-<code class="varname">j</code> minor of a matrix.</p><p lang="en"> |
| 189 |
See |
| 190 |
<a class="ulink" href="http://planetmath.org/Minor" target="_top">Planetmath</a> for more information. |
| 191 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-NonPivotColumns"></a>NonPivotColumns</span></dt><dd><pre lang="en" class="synopsis">NonPivotColumns (M)</pre><p lang="en">Return the columns that are not the pivot columns of a matrix.</p></dd><dt><span lang="en" class="term"><a name="gel-function-Norm"></a>Norm</span></dt><dd><pre lang="en" class="synopsis">Norm (v,p...)</pre><p lang="en">Aliases: <code class="function">norm</code></p><p lang="en">Get the p Norm (or 2 Norm if no p is supplied) of a vector.</p></dd><dt><span lang="en" class="term"><a name="gel-function-NullSpace"></a>NullSpace</span></dt><dd><pre lang="en" class="synopsis">NullSpace (T)</pre><p lang="en">Get the nullspace of a matrix. That is the kernel of the |
| 192 |
linear mapping that the matrix represents. This is returned |
| 193 |
as a matrix whose column space is the nullspace of |
| 194 |
<code class="varname">T</code>.</p><p lang="en"> |
| 195 |
See |
| 196 |
<a class="ulink" href="http://planetmath.org/Nullspace" target="_top">Planetmath</a> for more information. |
| 197 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-Nullity"></a>Nullity</span></dt><dd><pre lang="en" class="synopsis">Nullity (M)</pre><p lang="en">Aliases: <code class="function">nullity</code></p><p lang="en">Get the nullity of a matrix. That is, return the dimension of |
| 198 |
the nullspace; the dimension of the kernel of <code class="varname">M</code>.</p><p lang="en"> |
| 199 |
See |
| 200 |
<a class="ulink" href="http://planetmath.org/Nullity" target="_top">Planetmath</a> for more information. |
| 201 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-OrthogonalComplement"></a>OrthogonalComplement</span></dt><dd><pre lang="en" class="synopsis">OrthogonalComplement (M)</pre><p lang="en">Get the orthogonal complement of the columnspace.</p></dd><dt><span lang="en" class="term"><a name="gel-function-PivotColumns"></a>PivotColumns</span></dt><dd><pre lang="en" class="synopsis">PivotColumns (M)</pre><p lang="en">Return pivot columns of a matrix, that is columns that have a leading 1 in row reduced form. Also returns the row where they occur.</p></dd><dt><span lang="en" class="term"><a name="gel-function-Projection"></a>Projection</span></dt><dd><pre lang="en" class="synopsis">Projection (v,W,B...)</pre><p lang="en">Projection of vector <code class="varname">v</code> onto subspace |
| 202 |
<code class="varname">W</code> with respect to inner product given by |
| 203 |
<code class="varname">B</code>. If <code class="varname">B</code> is not given then the standard |
| 204 |
Hermitian product is used. <code class="varname">B</code> can either be a sesquilinear |
| 205 |
function of two arguments or it can be a matrix giving a sesquilinear form. |
| 206 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-QRDecomposition"></a>QRDecomposition</span></dt><dd><pre lang="en" class="synopsis">QRDecomposition (A, Q)</pre><p lang="en"> |
| 207 |
Get the QR decomposition of a square matrix <code class="varname">A</code>, |
| 208 |
returns the upper triangular matrix <code class="varname">R</code> |
| 209 |
and sets <code class="varname">Q</code> to the orthogonal (unitary) matrix. |
| 210 |
<code class="varname">Q</code> should be a reference or <code class="constant">null</code> if you don't |
| 211 |
want any return. |
| 212 |
For example: |
| 213 |
</p><pre lang="en" class="screen"><code class="prompt">genius></code> <strong class="userinput"><code>R = QRDecomposition(A,&Q)</code></strong> |
| 214 |
</pre><p lang="en"> |
| 215 |
You will have the upper triangular matrix stored in |
| 216 |
a variable called |
| 217 |
<code class="varname">R</code> and the orthogonal (unitary) matrix stored in |
| 218 |
<code class="varname">Q</code>. |
| 219 |
</p><p lang="en"> |
| 220 |
See |
| 221 |
<a class="ulink" href="https://en.wikipedia.org/wiki/QR_decomposition" target="_top">Wikipedia</a> or |
| 222 |
<a class="ulink" href="http://planetmath.org/QRDecomposition" target="_top">Planetmath</a> or |
| 223 |
<a class="ulink" href="http://mathworld.wolfram.com/QRDecomposition.html" target="_top">Mathworld</a> for more information. |
| 224 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-RayleighQuotient"></a>RayleighQuotient</span></dt><dd><pre lang="en" class="synopsis">RayleighQuotient (A,x)</pre><p lang="en">Return the Rayleigh quotient (also called the Rayleigh-Ritz quotient or ratio) of a matrix and a vector.</p><p lang="en"> |
| 225 |
See |
| 226 |
<a class="ulink" href="http://planetmath.org/RayleighQuotient" target="_top">Planetmath</a> for more information. |
| 227 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-RayleighQuotientIteration"></a>RayleighQuotientIteration</span></dt><dd><pre lang="en" class="synopsis">RayleighQuotientIteration (A,x,epsilon,maxiter,vecref)</pre><p lang="en">Find eigenvalues of <code class="varname">A</code> using the Rayleigh |
| 228 |
quotient iteration method. <code class="varname">x</code> is a guess |
| 229 |
at a eigenvector and could be random. It should have |
| 230 |
nonzero imaginary part if it will have any chance at finding |
| 231 |
complex eigenvalues. The code will run at most |
| 232 |
<code class="varname">maxiter</code> iterations and return <code class="constant">null</code> |
| 233 |
if we cannot get within an error of <code class="varname">epsilon</code>. |
| 234 |
<code class="varname">vecref</code> should either be <code class="constant">null</code> or a reference |
| 235 |
to a variable where the eigenvector should be stored. |
| 236 |
</p><p lang="en"> |
| 237 |
See |
| 238 |
<a class="ulink" href="http://planetmath.org/RayleighQuotient" target="_top">Planetmath</a> for more information on Rayleigh quotient. |
| 239 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-Rank"></a>Rank</span></dt><dd><pre lang="en" class="synopsis">Rank (M)</pre><p lang="en">Aliases: <code class="function">rank</code></p><p lang="en">Get the rank of a matrix.</p><p lang="en"> |
| 240 |
See |
| 241 |
<a class="ulink" href="http://planetmath.org/SylvestersLaw" target="_top">Planetmath</a> for more information. |
| 242 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-RosserMatrix"></a>RosserMatrix</span></dt><dd><pre lang="en" class="synopsis">RosserMatrix ()</pre><p lang="en">Returns the Rosser matrix, which is a classic symmetric eigenvalue test problem.</p></dd><dt><span lang="en" class="term"><a name="gel-function-Rotation2D"></a>Rotation2D</span></dt><dd><pre lang="en" class="synopsis">Rotation2D (angle)</pre><p lang="en">Aliases: <code class="function">RotationMatrix</code></p><p lang="en">Return the matrix corresponding to rotation around origin in R<sup>2</sup>.</p></dd><dt><span lang="en" class="term"><a name="gel-function-Rotation3DX"></a>Rotation3DX</span></dt><dd><pre lang="en" class="synopsis">Rotation3DX (angle)</pre><p lang="en">Return the matrix corresponding to rotation around origin in R<sup>3</sup> about the x-axis.</p></dd><dt><span lang="en" class="term"><a name="gel-function-Rotation3DY"></a>Rotation3DY</span></dt><dd><pre lang="en" class="synopsis">Rotation3DY (angle)</pre><p lang="en">Return the matrix corresponding to rotation around origin in R<sup>3</sup> about the y-axis.</p></dd><dt><span lang="en" class="term"><a name="gel-function-Rotation3DZ"></a>Rotation3DZ</span></dt><dd><pre lang="en" class="synopsis">Rotation3DZ (angle)</pre><p lang="en">Return the matrix corresponding to rotation around origin in R<sup>3</sup> about the z-axis.</p></dd><dt><span lang="en" class="term"><a name="gel-function-RowSpace"></a>RowSpace</span></dt><dd><pre lang="en" class="synopsis">RowSpace (M)</pre><p lang="en">Get a basis matrix for the rowspace of a matrix.</p></dd><dt><span lang="en" class="term"><a name="gel-function-SesquilinearForm"></a>SesquilinearForm</span></dt><dd><pre lang="en" class="synopsis">SesquilinearForm (v,A,w)</pre><p lang="en">Evaluate (v,w) with respect to the sesquilinear form given by the matrix A.</p></dd><dt><span lang="en" class="term"><a name="gel-function-SesquilinearFormFunction"></a>SesquilinearFormFunction</span></dt><dd><pre lang="en" class="synopsis">SesquilinearFormFunction (A)</pre><p lang="en">Return a function that evaluates two vectors with respect to the sesquilinear form given by A.</p></dd><dt><span lang="en" class="term"><a name="gel-function-SmithNormalFormField"></a>SmithNormalFormField</span></dt><dd><pre lang="en" class="synopsis">SmithNormalFormField (A)</pre><p lang="en">Returns the Smith normal form of a matrix over fields (will end up with 1's on the diagonal).</p><p lang="en"> |
| 243 |
See |
| 244 |
<a class="ulink" href="https://en.wikipedia.org/wiki/Smith_normal_form" target="_top">Wikipedia</a> for more information. |
| 245 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-SmithNormalFormInteger"></a>SmithNormalFormInteger</span></dt><dd><pre lang="en" class="synopsis">SmithNormalFormInteger (M)</pre><p lang="en">Return the Smith normal form for square integer matrices over integers.</p><p lang="en"> |
| 246 |
See |
| 247 |
<a class="ulink" href="https://en.wikipedia.org/wiki/Smith_normal_form" target="_top">Wikipedia</a> for more information. |
| 248 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-SolveLinearSystem"></a>SolveLinearSystem</span></dt><dd><pre lang="en" class="synopsis">SolveLinearSystem (M,V,args...)</pre><p lang="en">Solve linear system Mx=V, return solution V if there is a unique solution, <code class="constant">null</code> otherwise. Extra two reference parameters can optionally be used to get the reduced M and V.</p></dd><dt><span lang="en" class="term"><a name="gel-function-ToeplitzMatrix"></a>ToeplitzMatrix</span></dt><dd><pre lang="en" class="synopsis">ToeplitzMatrix (c, r...)</pre><p lang="en">Return the Toeplitz matrix constructed given the first column c |
| 249 |
and (optionally) the first row r. If only the column c is given then it is |
| 250 |
conjugated and the nonconjugated version is used for the first row to give a |
| 251 |
Hermitian matrix (if the first element is real).</p><p lang="en"> |
| 252 |
See |
| 253 |
<a class="ulink" href="https://en.wikipedia.org/wiki/Toeplitz_matrix" target="_top">Wikipedia</a> or |
| 254 |
<a class="ulink" href="http://planetmath.org/ToeplitzMatrix" target="_top">Planetmath</a> for more information. |
| 255 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-Trace"></a>Trace</span></dt><dd><pre lang="en" class="synopsis">Trace (M)</pre><p lang="en">Aliases: <code class="function">trace</code></p><p lang="en">Calculate the trace of a matrix. That is the sum of the diagonal elements.</p><p lang="en"> |
| 256 |
See |
| 257 |
<a class="ulink" href="https://en.wikipedia.org/wiki/Trace_(linear_algebra)" target="_top">Wikipedia</a> or |
| 258 |
<a class="ulink" href="http://planetmath.org/Trace" target="_top">Planetmath</a> for more information. |
| 259 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-Transpose"></a>Transpose</span></dt><dd><pre lang="en" class="synopsis">Transpose (M)</pre><p lang="en">Transpose of a matrix. This is the same as the |
| 260 |
<strong class="userinput"><code>.'</code></strong> operator.</p><p lang="en"> |
| 261 |
See |
| 262 |
<a class="ulink" href="https://en.wikipedia.org/wiki/Transpose" target="_top">Wikipedia</a> or |
| 263 |
<a class="ulink" href="http://planetmath.org/Transpose" target="_top">Planetmath</a> for more information. |
| 264 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-VandermondeMatrix"></a>VandermondeMatrix</span></dt><dd><pre lang="en" class="synopsis">VandermondeMatrix (v)</pre><p lang="en">Aliases: <code class="function">vander</code></p><p lang="en">Return the Vandermonde matrix.</p><p lang="en"> |
| 265 |
See |
| 266 |
<a class="ulink" href="https://en.wikipedia.org/wiki/Vandermonde_matrix" target="_top">Wikipedia</a> for more information. |
| 267 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-VectorAngle"></a>VectorAngle</span></dt><dd><pre lang="en" class="synopsis">VectorAngle (v,w,B...)</pre><p lang="en">The angle of two vectors with respect to inner product given by |
| 268 |
<code class="varname">B</code>. If <code class="varname">B</code> is not given then the standard |
| 269 |
Hermitian product is used. <code class="varname">B</code> can either be a sesquilinear |
| 270 |
function of two arguments or it can be a matrix giving a sesquilinear form. |
| 271 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-VectorSpaceDirectSum"></a>VectorSpaceDirectSum</span></dt><dd><pre lang="en" class="synopsis">VectorSpaceDirectSum (M,N)</pre><p lang="en">The direct sum of the vector spaces M and N.</p></dd><dt><span lang="en" class="term"><a name="gel-function-VectorSubspaceIntersection"></a>VectorSubspaceIntersection</span></dt><dd><pre lang="en" class="synopsis">VectorSubspaceIntersection (M,N)</pre><p lang="en">Intersection of the subspaces given by M and N.</p></dd><dt><span lang="en" class="term"><a name="gel-function-VectorSubspaceSum"></a>VectorSubspaceSum</span></dt><dd><pre lang="en" class="synopsis">VectorSubspaceSum (M,N)</pre><p lang="en">The sum of the vector spaces M and N, that is {w | w=m+n, m in M, n in N}.</p></dd><dt><span lang="en" class="term"><a name="gel-function-adj"></a>adj</span></dt><dd><pre lang="en" class="synopsis">adj (m)</pre><p lang="en">Aliases: <code class="function">Adjugate</code></p><p lang="en">Get the classical adjoint (adjugate) of a matrix.</p></dd><dt><span lang="en" class="term"><a name="gel-function-cref"></a>cref</span></dt><dd><pre lang="en" class="synopsis">cref (M)</pre><p lang="en">Aliases: <code class="function">CREF</code> <code class="function">ColumnReducedEchelonForm</code></p><p lang="en">Compute the Column Reduced Echelon Form.</p></dd><dt><span lang="en" class="term"><a name="gel-function-det"></a>det</span></dt><dd><pre lang="en" class="synopsis">det (M)</pre><p lang="en">Aliases: <code class="function">Determinant</code></p><p lang="en">Get the determinant of a matrix.</p><p lang="en"> |
| 272 |
See |
| 273 |
<a class="ulink" href="https://en.wikipedia.org/wiki/Determinant" target="_top">Wikipedia</a> or |
| 274 |
<a class="ulink" href="http://planetmath.org/Determinant2" target="_top">Planetmath</a> for more information. |
| 275 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-ref"></a>ref</span></dt><dd><pre lang="en" class="synopsis">ref (M)</pre><p lang="en">Aliases: <code class="function">REF</code> <code class="function">RowEchelonForm</code></p><p lang="en">Get the row echelon form of a matrix. That is, apply gaussian |
| 276 |
elimination but not backaddition to <code class="varname">M</code>. The pivot rows are |
| 277 |
divided to make all pivots 1.</p><p lang="en"> |
| 278 |
See |
| 279 |
<a class="ulink" href="https://en.wikipedia.org/wiki/Row_echelon_form" target="_top">Wikipedia</a> or |
| 280 |
<a class="ulink" href="http://planetmath.org/RowEchelonForm" target="_top">Planetmath</a> for more information. |
| 281 |
</p></dd><dt><span lang="en" class="term"><a name="gel-function-rref"></a>rref</span></dt><dd><pre lang="en" class="synopsis">rref (M)</pre><p lang="en">Aliases: <code class="function">RREF</code> <code class="function">ReducedRowEchelonForm</code></p><p lang="en">Get the reduced row echelon form of a matrix. That is, apply gaussian elimination together with backaddition to <code class="varname">M</code>.</p><p lang="en"> |
| 282 |
See |
| 283 |
<a class="ulink" href="https://en.wikipedia.org/wiki/Reduced_row_echelon_form" target="_top">Wikipedia</a> or |
| 284 |
<a class="ulink" href="http://planetmath.org/ReducedRowEchelonForm" target="_top">Planetmath</a> for more information. |
| 285 |
</p></dd></dl></div></div><div class="navfooter"><hr><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="ch11s08.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="ch11.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="ch11s10.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Manipulação de matrizes </td><td width="20%" align="center"><a accesskey="h" href="index.html">Home</a></td><td width="40%" align="right" valign="top"> Combinatória</td></tr></table></div></body></html> |