Chip 2000 May

home *** CD-ROM | disk | FTP | other *** search

/ Chip 2000 May / Chip_2000-05_cd1.bin / zkuste / Perl / ActivePerl-5.6.0.613.msi / 䆊䌷䈹䈙䏵-䞅䞆䞀㡆䞃䄦䠥 / _17f3f51f0068b7603fc9d7c534c7c475 < prev next >

Wrap

Text File | 2000-03-23 | 58.0 KB | 1,338 lines

<HTML> <HEAD> <TITLE>Math::MatrixReal - Matrix of Reals</TITLE> <LINK REL="stylesheet" HREF="../../../Active.css" TYPE="text/css"> <LINK REV="made" HREF="mailto:"> </HEAD> <BODY> <TABLE BORDER=0 CELLPADDING=0 CELLSPACING=0 WIDTH=100%> <TR><TD CLASS=block VALIGN=MIDDLE WIDTH=100% BGCOLOR="#cccccc"> Math::MatrixReal - Matrix of Reals </TD></TR> </TABLE> <A NAME="__index__"></A>  <UL> <LI><A HREF="#name">NAME</A></LI><LI><A HREF="#supportedplatforms">SUPPORTED PLATFORMS</A></LI> <LI><A HREF="#description">DESCRIPTION</A></LI> <LI><A HREF="#synopsis">SYNOPSIS</A></LI> <UL> <LI><A HREF="#eigensystems">Eigensystems</A></LI> </UL> <LI><A HREF="#overloaded operators">OVERLOADED OPERATORS</A></LI> <UL> <LI><A HREF="#synopsis">SYNOPSIS</A></LI> <LI><A HREF="#description">DESCRIPTION</A></LI> </UL> <LI><A HREF="#see also">SEE ALSO</A></LI> <LI><A HREF="#version">VERSION</A></LI> <LI><A HREF="#authors">AUTHORS</A></LI> <LI><A HREF="#credits">CREDITS</A></LI> <LI><A HREF="#copyright">COPYRIGHT</A></LI> <LI><A HREF="#license agreement">LICENSE AGREEMENT</A></LI> </UL>  <HR> <H1><A NAME="name">NAME</A></H1> Math::MatrixReal - Matrix of Reals Implements the data type ``matrix of reals'' (and consequently also ``vector of reals'') <HR> <H1><A NAME="supportedplatforms">SUPPORTED PLATFORMS</A></H1> <UL> <LI>Linux</LI> <LI>Solaris</LI> <LI>Windows</LI> </UL> <HR> <H1><A NAME="description">DESCRIPTION</A></H1> Implements the data type ``matrix of reals'', which can be used almost like any other basic Perl type thanks to OPERATOR OVERLOADING, i.e., <PRE> $product = $matrix1 * $matrix2;</PRE> does what you would like it to do (a matrix multiplication). Also features many important operations and methods: matrix norm, matrix transposition, matrix inverse, determinant of a matrix, order and numerical condition of a matrix, scalar product of vectors, vector product of vectors, vector length, projection of row and column vectors, a comfortable way for reading in a matrix from a file, the keyboard or your code, and many more. Allows to solve linear equation systems using an efficient algorithm known as ``L-R-decomposition'' and several approximative (iterative) methods. Features an implementation of Kleene's algorithm to compute the minimal costs for all paths in a graph with weighted edges (the ``weights'' being the costs associated with each edge). <HR> <H1><A NAME="synopsis">SYNOPSIS</A></H1> <UL> <LI> <CODE>use Math::MatrixReal;</CODE> Makes the methods and overloaded operators of this module available to your program. <LI> <A HREF="../../../lib/Pod/perlfunc.html#item_qw"><CODE>use Math::MatrixReal qw(min max);</CODE></A> <LI> <A HREF="../../../lib/Pod/perlfunc.html#item_qw"><CODE>use Math::MatrixReal qw(:all);</CODE></A> Use one of these two variants to import (all) the functions which the module offers for export; currently these are ``min()'' and ``max()''. <LI> <CODE>$new_matrix = new Math::MatrixReal($rows,$columns);</CODE> The matrix object constructor method. Note that this method is implicitly called by many of the other methods in this module! <LI> <CODE>$new_matrix = Math::MatrixReal-></CODE><CODE>new($rows,$columns);</CODE> An alternate way of calling the matrix object constructor method. <LI> <CODE>$new_matrix = $some_matrix-></CODE><CODE>new($rows,$columns);</CODE> Still another way of calling the matrix object constructor method. Matrix ``<CODE>$some_matrix</CODE>'' is not changed by this in any way. <LI> <CODE>$new_matrix = Math::MatrixReal-></CODE><CODE>new_from_string($string);</CODE> This method allows you to read in a matrix from a string (for instance, from the keyboard, from a file or from your code). The syntax is simple: each row must start with ``<CODE>[ </CODE>'' and end with ``<CODE> ]\n</CODE>'' (``<CODE>\n</CODE>'' being the newline character and ``<CODE> </CODE>'' a space or tab) and contain one or more numbers, all separated from each other by spaces or tabs. Additional spaces or tabs can be added at will, but no comments. Examples: <PRE> $string = "[ 1 2 3 ]\n[ 2 2 -1 ]\n[ 1 1 1 ]\n"; $matrix = Math::MatrixReal->new_from_string($string); print "$matrix";</PRE> By the way, this prints <PRE> [ 1.000000000000E+00 2.000000000000E+00 3.000000000000E+00 ] [ 2.000000000000E+00 2.000000000000E+00 -1.000000000000E+00 ] [ 1.000000000000E+00 1.000000000000E+00 1.000000000000E+00 ]</PRE> But you can also do this in a much more comfortable way using the shell-like ``here-document'' syntax: <PRE> $matrix = Math::MatrixReal->new_from_string(<<'MATRIX'); [ 1 0 0 0 0 0 1 ] [ 0 1 0 0 0 0 0 ] [ 0 0 1 0 0 0 0 ] [ 0 0 0 1 0 0 0 ] [ 0 0 0 0 1 0 0 ] [ 0 0 0 0 0 1 0 ] [ 1 0 0 0 0 0 -1 ] MATRIX</PRE> You can even use variables in the matrix: <PRE> $c1 = 2 / 3; $c2 = -2 / 5; $c3 = 26 / 9;</PRE> <PRE> $matrix = Math::MatrixReal->new_from_string(<<"MATRIX");</PRE> <PRE> [ 3 2 0 ] [ 0 3 2 ] [ $c1 $c2 $c3 ]</PRE> <PRE> MATRIX</PRE> (Remember that you may use spaces and tabs to format the matrix to your taste) Note that this method uses exactly the same representation for a matrix as the ``stringify'' operator ``'': this means that you can convert any matrix into a string with <CODE>$string = "$matrix";</CODE> and read it back in later (for instance from a file!). Note however that you may suffer a precision loss in this process because only 13 digits are supported in the mantissa when printed!! If the string you supply (or someone else supplies) does not obey the syntax mentioned above, an exception is raised, which can be caught by ``eval'' as follows: <PRE> print "Please enter your matrix (in one line): "; $string = <STDIN>; $string =~ s/\\n/\n/g; eval { $matrix = Math::MatrixReal->new_from_string($string); }; if ($@) { print "$@"; # ... # (error handling) } else { # continue... }</PRE> or as follows: <PRE> eval { $matrix = Math::MatrixReal->new_from_string(<<"MATRIX"); }; [ 3 2 0 ] [ 0 3 2 ] [ $c1 $c2 $c3 ] MATRIX if ($@) # ...</PRE> Actually, the method shown above for reading a matrix from the keyboard is a little awkward, since you have to enter a lot of ``\n'''s for the newlines. A better way is shown in this piece of code: <PRE> while (1) { print "\nPlease enter your matrix "; print "(multiple lines, <ctrl-D> = done):\n"; eval { $new_matrix = Math::MatrixReal->new_from_string(join('',<STDIN>)); }; if ($@) { $@ =~ s/\s+at\b.*?$//; print "${@}Please try again.\n"; } else { last; } }</PRE> Possible error messages of the ``new_from_string()'' method are: <PRE> Math::MatrixReal::new_from_string(): syntax error in input string Math::MatrixReal::new_from_string(): empty input string</PRE> If the input string has rows with varying numbers of columns, the following warning will be printed to STDERR: <PRE> Math::MatrixReal::new_from_string(): missing elements will be set to zero!</PRE> If everything is okay, the method returns an object reference to the (newly allocated) matrix containing the elements you specified. <LI> <CODE>$new_matrix = $some_matrix->shadow();</CODE> Returns an object reference to a NEW but EMPTY matrix (filled with zero's) of the SAME SIZE as matrix ``<CODE>$some_matrix</CODE>''. Matrix ``<CODE>$some_matrix</CODE>'' is not changed by this in any way. <LI> <CODE>$matrix1->copy($matrix2);</CODE> Copies the contents of matrix ``<CODE>$matrix2</CODE>'' to an ALREADY EXISTING matrix ``<CODE>$matrix1</CODE>'' (which must have the same size as matrix ``<CODE>$matrix2</CODE>''!). Matrix ``<CODE>$matrix2</CODE>'' is not changed by this in any way. <LI> <CODE>$twin_matrix = $some_matrix->clone();</CODE> Returns an object reference to a NEW matrix of the SAME SIZE as matrix ``<CODE>$some_matrix</CODE>''. The contents of matrix ``<CODE>$some_matrix</CODE>'' have ALREADY BEEN COPIED to the new matrix ``<CODE>$twin_matrix</CODE>''. Matrix ``<CODE>$some_matrix</CODE>'' is not changed by this in any way. <LI> <CODE>$row_vector = $matrix->row($row);</CODE> This is a projection method which returns an object reference to a NEW matrix (which in fact is a (row) vector since it has only one row) to which row number ``<CODE>$row</CODE>'' of matrix ``<CODE>$matrix</CODE>'' has already been copied. Matrix ``<CODE>$matrix</CODE>'' is not changed by this in any way. <LI> <CODE>$column_vector = $matrix->column($column);</CODE> This is a projection method which returns an object reference to a NEW matrix (which in fact is a (column) vector since it has only one column) to which column number ``<CODE>$column</CODE>'' of matrix ``<CODE>$matrix</CODE>'' has already been copied. Matrix ``<CODE>$matrix</CODE>'' is not changed by this in any way. <LI> <CODE>$matrix->zero();</CODE> Assigns a zero to every element of the matrix ``<CODE>$matrix</CODE>'', i.e., erases all values previously stored there, thereby effectively transforming the matrix into a ``zero''-matrix or ``null''-matrix, the neutral element of the addition operation in a Ring. (For instance the (quadratic) matrices with ``n'' rows and columns and matrix addition and multiplication form a Ring. Most prominent characteristic of a Ring is that multiplication is not commutative, i.e., in general, ``<CODE>matrix1 * matrix2</CODE>'' is not the same as ``<CODE>matrix2 * matrix1</CODE>''!) <LI> <CODE>$matrix->one();</CODE> Assigns one's to the elements on the main diagonal (elements (1,1), (2,2), (3,3) and so on) of matrix ``<CODE>$matrix</CODE>'' and zero's to all others, thereby erasing all values previously stored there and transforming the matrix into a ``one''-matrix, the neutral element of the multiplication operation in a Ring. (If the matrix is quadratic (which this method doesn't require, though), then multiplying this matrix with itself yields this same matrix again, and multiplying it with some other matrix leaves that other matrix unchanged!) <LI> <CODE>$matrix->assign($row,$column,$value);</CODE> Explicitly assigns a value ``<CODE>$value</CODE>'' to a single element of the matrix ``<CODE>$matrix</CODE>'', located in row ``<CODE>$row</CODE>'' and column ``<CODE>$column</CODE>'', thereby replacing the value previously stored there. <LI> <CODE>$value = $matrix-></CODE><CODE>element($row,$column);</CODE> Returns the value of a specific element of the matrix ``<CODE>$matrix</CODE>'', located in row ``<CODE>$row</CODE>'' and column ``<CODE>$column</CODE>''. <LI> <CODE>($rows,$columns) = $matrix->dim();</CODE> Returns a list of two items, representing the number of rows and columns the given matrix ``<CODE>$matrix</CODE>'' contains. <LI> <CODE>$norm_one = $matrix->norm_one();</CODE> Returns the ``one''-norm of the given matrix ``<CODE>$matrix</CODE>''. The ``one''-norm is defined as follows: For each column, the sum of the absolute values of the elements in the different rows of that column is calculated. Finally, the maximum of these sums is returned. Note that the ``one''-norm and the ``maximum''-norm are mathematically equivalent, although for the same matrix they usually yield a different value. Therefore, you should only compare values that have been calculated using the same norm! Throughout this package, the ``one''-norm is (arbitrarily) used for all comparisons, for the sake of uniformity and comparability, except for the iterative methods ``solve_GSM()'', ``solve_SSM()'' and ``solve_RM()'' which use either norm depending on the matrix itself. <LI> <CODE>$norm_max = $matrix->norm_max();</CODE> Returns the ``maximum''-norm of the given matrix ``<CODE>$matrix</CODE>''. The ``maximum''-norm is defined as follows: For each row, the sum of the absolute values of the elements in the different columns of that row is calculated. Finally, the maximum of these sums is returned. Note that the ``maximum''-norm and the ``one''-norm are mathematically equivalent, although for the same matrix they usually yield a different value. Therefore, you should only compare values that have been calculated using the same norm! Throughout this package, the ``one''-norm is (arbitrarily) used for all comparisons, for the sake of uniformity and comparability, except for the iterative methods ``solve_GSM()'', ``solve_SSM()'' and ``solve_RM()'' which use either norm depending on the matrix itself. <LI> <CODE>$matrix1->negate($matrix2);</CODE> Calculates the negative of matrix ``<CODE>$matrix2</CODE>'' (i.e., multiplies all elements with ``-1'') and stores the result in matrix ``<CODE>$matrix1</CODE>'' (which must already exist and have the same size as matrix ``<CODE>$matrix2</CODE>''!). This operation can also be carried out ``in-place'', i.e., input and output matrix may be identical. <LI> <CODE>$matrix1->transpose($matrix2);</CODE> Calculates the transposed matrix of matrix ``<CODE>$matrix2</CODE>'' and stores the result in matrix ``<CODE>$matrix1</CODE>'' (which must already exist and have the same size as matrix ``<CODE>$matrix2</CODE>''!). This operation can also be carried out ``in-place'', i.e., input and output matrix may be identical. Transposition is a symmetry operation: imagine you rotate the matrix along the axis of its main diagonal (going through elements (1,1), (2,2), (3,3) and so on) by 180 degrees. Another way of looking at it is to say that rows and columns are swapped. In fact the contents of element <CODE>(i,j)</CODE> are swapped with those of element <CODE>(j,i)</CODE>. Note that (especially for vectors) it makes a big difference if you have a row vector, like this: <PRE> [ -1 0 1 ]</PRE> or a column vector, like this: <PRE> [ -1 ] [ 0 ] [ 1 ]</PRE> the one vector being the transposed of the other! This is especially true for the matrix product of two vectors: <PRE> [ -1 ] [ -1 0 1 ] * [ 0 ] = [ 2 ] , whereas [ 1 ]</PRE> <PRE> * [ -1 0 1 ] [ -1 ] [ 1 0 -1 ] [ 0 ] * [ -1 0 1 ] = [ -1 ] [ 1 0 -1 ] = [ 0 0 0 ] [ 1 ] [ 0 ] [ 0 0 0 ] [ -1 0 1 ] [ 1 ] [ -1 0 1 ]</PRE> So be careful about what you really mean! Hint: throughout this module, whenever a vector is explicitly required for input, a COLUMN vector is expected! <LI> <CODE>$matrix1->add($matrix2,$matrix3);</CODE> Calculates the sum of matrix ``<CODE>$matrix2</CODE>'' and matrix ``<CODE>$matrix3</CODE>'' and stores the result in matrix ``<CODE>$matrix1</CODE>'' (which must already exist and have the same size as matrix ``<CODE>$matrix2</CODE>'' and matrix ``<CODE>$matrix3</CODE>''!). This operation can also be carried out ``in-place'', i.e., the output and one (or both) of the input matrices may be identical. <LI> <CODE>$matrix1->subtract($matrix2,$matrix3);</CODE> Calculates the difference of matrix ``<CODE>$matrix2</CODE>'' minus matrix ``<CODE>$matrix3</CODE>'' and stores the result in matrix ``<CODE>$matrix1</CODE>'' (which must already exist and have the same size as matrix ``<CODE>$matrix2</CODE>'' and matrix ``<CODE>$matrix3</CODE>''!). This operation can also be carried out ``in-place'', i.e., the output and one (or both) of the input matrices may be identical. Note that this operation is the same as <CODE>$matrix1->add($matrix2,-$matrix3);</CODE>, although the latter is a little less efficient. <LI> <CODE>$matrix1->multiply_scalar($matrix2,$scalar);</CODE> Calculates the product of matrix ``<CODE>$matrix2</CODE>'' and the number ``<CODE>$scalar</CODE>'' (i.e., multiplies each element of matrix ``<CODE>$matrix2</CODE>'' with the factor ``<CODE>$scalar</CODE>'') and stores the result in matrix ``<CODE>$matrix1</CODE>'' (which must already exist and have the same size as matrix ``<CODE>$matrix2</CODE>''!). This operation can also be carried out ``in-place'', i.e., input and output matrix may be identical. <LI> <CODE>$product_matrix = $matrix1->multiply($matrix2);</CODE> Calculates the product of matrix ``<CODE>$matrix1</CODE>'' and matrix ``<CODE>$matrix2</CODE>'' and returns an object reference to a new matrix ``<CODE>$product_matrix</CODE>'' in which the result of this operation has been stored. Note that the dimensions of the two matrices ``<CODE>$matrix1</CODE>'' and ``<CODE>$matrix2</CODE>'' (i.e., their numbers of rows and columns) must harmonize in the following way (example): <PRE> [ 2 2 ] [ 2 2 ] [ 2 2 ]</PRE> <PRE> [ 1 1 1 ] [ * * ] [ 1 1 1 ] [ * * ] [ 1 1 1 ] [ * * ] [ 1 1 1 ] [ * * ]</PRE> I.e., the number of columns of matrix ``<CODE>$matrix1</CODE>'' has to be the same as the number of rows of matrix ``<CODE>$matrix2</CODE>''. The number of rows and columns of the resulting matrix ``<CODE>$product_matrix</CODE>'' is determined by the number of rows of matrix ``<CODE>$matrix1</CODE>'' and the number of columns of matrix ``<CODE>$matrix2</CODE>'', respectively. <LI> <CODE>$minimum = Math::MatrixReal::min($number1,$number2);</CODE> Returns the minimum of the two numbers ``<CODE>number1</CODE>'' and ``<CODE>number2</CODE>''. <LI> <CODE>$minimum = Math::MatrixReal::max($number1,$number2);</CODE> Returns the maximum of the two numbers ``<CODE>number1</CODE>'' and ``<CODE>number2</CODE>''. <LI> <CODE>$minimal_cost_matrix = $cost_matrix->kleene();</CODE> Copies the matrix ``<CODE>$cost_matrix</CODE>'' (which has to be quadratic!) to a new matrix of the same size (i.e., ``clones'' the input matrix) and applies Kleene's algorithm to it. See <A HREF="../../../Math/Kleene(3).html">the Math::Kleene(3) manpage</A> for more details about this algorithm! The method returns an object reference to the new matrix. Matrix ``<CODE>$cost_matrix</CODE>'' is not changed by this method in any way. <LI> <CODE>($norm_matrix,$norm_vector) = $matrix->normalize($vector);</CODE> This method is used to improve the numerical stability when solving linear equation systems. Suppose you have a matrix ``A'' and a vector ``b'' and you want to find out a vector ``x'' so that <CODE>A * x = b</CODE>, i.e., the vector ``x'' which solves the equation system represented by the matrix ``A'' and the vector ``b''. Applying this method to the pair (A,b) yields a pair (A',b') where each row has been divided by (the absolute value of) the greatest coefficient appearing in that row. So this coefficient becomes equal to ``1'' (or ``-1'') in the new pair (A',b') (all others become smaller than one and greater than minus one). Note that this operation does not change the equation system itself because the same division is carried out on either side of the equation sign! The method requires a quadratic (!) matrix ``<CODE>$matrix</CODE>'' and a vector ``<CODE>$vector</CODE>'' for input (the vector must be a column vector with the same number of rows as the input matrix) and returns a list of two items which are object references to a new matrix and a new vector, in this order. The output matrix and vector are clones of the input matrix and vector to which the operation explained above has been applied. The input matrix and vector are not changed by this in any way. Example of how this method can affect the result of the methods to solve equation systems (explained immediately below following this method): Consider the following little program: <PRE> #!perl -w</PRE> <PRE> use Math::MatrixReal qw(new_from_string);</PRE> <PRE> $A = Math::MatrixReal->new_from_string(<<"MATRIX"); [ 1 2 3 ] [ 5 7 11 ] [ 23 19 13 ] MATRIX</PRE> <PRE> $b = Math::MatrixReal->new_from_string(<<"MATRIX"); [ 0 ] [ 1 ] [ 29 ] MATRIX</PRE> <PRE> $LR = $A->decompose_LR(); if (($dim,$x,$B) = $LR->solve_LR($b)) { $test = $A * $x; print "x = \n$x"; print "A * x = \n$test"; }</PRE> <PRE> ($A_,$b_) = $A->normalize($b);</PRE> <PRE> $LR = $A_->decompose_LR(); if (($dim,$x,$B) = $LR->solve_LR($b_)) { $test = $A * $x; print "x = \n$x"; print "A * x = \n$test"; }</PRE> This will print: <PRE> x = [ 1.000000000000E+00 ] [ 1.000000000000E+00 ] [ -1.000000000000E+00 ] A * x = [ 4.440892098501E-16 ] [ 1.000000000000E+00 ] [ 2.900000000000E+01 ] x = [ 1.000000000000E+00 ] [ 1.000000000000E+00 ] [ -1.000000000000E+00 ] A * x = [ 0.000000000000E+00 ] [ 1.000000000000E+00 ] [ 2.900000000000E+01 ]</PRE> You can see that in the second example (where ``normalize()'' has been used), the result is ``better'', i.e., more accurate! <LI> <CODE>$LR_matrix = $matrix->decompose_LR();</CODE> This method is needed to solve linear equation systems. Suppose you have a matrix ``A'' and a vector ``b'' and you want to find out a vector ``x'' so that <CODE>A * x = b</CODE>, i.e., the vector ``x'' which solves the equation system represented by the matrix ``A'' and the vector ``b''. You might also have a matrix ``A'' and a whole bunch of different vectors ``b1''..``bk'' for which you need to find vectors ``x1''..``xk'' so that <CODE>A * xi = bi</CODE>, for <CODE>i=1..k</CODE>. Using Gaussian transformations (multiplying a row or column with a factor, swapping two rows or two columns and adding a multiple of one row or column to another), it is possible to decompose any matrix ``A'' into two triangular matrices, called ``L'' and ``R'' (for ``Left'' and ``Right''). ``L'' has one's on the main diagonal (the elements (1,1), (2,2), (3,3) and so so), non-zero values to the left and below of the main diagonal and all zero's in the upper right half of the matrix. ``R'' has non-zero values on the main diagonal as well as to the right and above of the main diagonal and all zero's in the lower left half of the matrix, as follows: <PRE> [ 1 0 0 0 0 ] [ x x x x x ] [ x 1 0 0 0 ] [ 0 x x x x ] L = [ x x 1 0 0 ] R = [ 0 0 x x x ] [ x x x 1 0 ] [ 0 0 0 x x ] [ x x x x 1 ] [ 0 0 0 0 x ]</PRE> Note that ``<CODE>L * R</CODE>'' is equivalent to matrix ``A'' in the sense that <CODE>L * R * x = b <==> A * x = b</CODE> for all vectors ``x'', leaving out of account permutations of the rows and columns (these are taken care of ``magically'' by this module!) and numerical errors. Trick: Because we know that ``L'' has one's on its main diagonal, we can store both matrices together in the same array without information loss! I.e., <PRE> [ R R R R R ] [ L R R R R ] LR = [ L L R R R ] [ L L L R R ] [ L L L L R ]</PRE> Beware, though, that ``LR'' and ``<CODE>L * R</CODE>'' are not the same!!! Note also that for the same reason, you cannot apply the method ``normalize()'' to an ``LR'' decomposition matrix. Trying to do so will yield meaningless rubbish! (You need to apply ``normalize()'' to each pair (Ai,bi) BEFORE decomposing the matrix ``Ai'''!) Now what does all this help us in solving linear equation systems? It helps us because a triangular matrix is the next best thing that can happen to us besides a diagonal matrix (a matrix that has non-zero values only on its main diagonal - in which case the solution is trivial, simply divide ``<CODE>b[i]</CODE>'' by ``<CODE>A[i,i]</CODE>'' to get ``<CODE>x[i]</CODE>''!). To find the solution to our problem ``<CODE>A * x = b</CODE>'', we divide this problem in parts: instead of solving <CODE>A * x = b</CODE> directly, we first decompose ``A'' into ``L'' and ``R'' and then solve ``<CODE>L * y = b</CODE>'' and finally ``<CODE>R * x = y</CODE>'' (motto: divide and rule!). From the illustration above it is clear that solving ``<CODE>L * y = b</CODE>'' and ``<CODE>R * x = y</CODE>'' is straightforward: we immediately know that <CODE>y[1] = b[1]</CODE>. We then deduce swiftly that <PRE> y[2] = b[2] - L[2,1] * y[1]</PRE> (and we know ``<CODE>y[1]</CODE>'' by now!), that <PRE> y[3] = b[3] - L[3,1] * y[1] - L[3,2] * y[2]</PRE> and so on. Having effortlessly calculated the vector ``y'', we now proceed to calculate the vector ``x'' in a similar fashion: we see immediately that <CODE>x[n] = y[n] / R[n,n]</CODE>. It follows that <PRE> x[n-1] = ( y[n-1] - R[n-1,n] * x[n] ) / R[n-1,n-1]</PRE> and <PRE> x[n-2] = ( y[n-2] - R[n-2,n-1] * x[n-1] - R[n-2,n] * x[n] ) / R[n-2,n-2]</PRE> and so on. You can see that - especially when you have many vectors ``b1''..``bk'' for which you are searching solutions to <CODE>A * xi = bi</CODE> - this scheme is much more efficient than a straightforward, ``brute force'' approach. This method requires a quadratic matrix as its input matrix. If you don't have that many equations, fill up with zero's (i.e., do nothing to fill the superfluous rows if it's a ``fresh'' matrix, i.e., a matrix that has been created with ``new()'' or ``shadow()''). The method returns an object reference to a new matrix containing the matrices ``L'' and ``R''. The input matrix is not changed by this method in any way. Note that you can ``copy()'' or ``clone()'' the result of this method without losing its ``magical'' properties (for instance concerning the hidden permutations of its rows and columns). However, as soon as you are applying any method that alters the contents of the matrix, its ``magical'' properties are stripped off, and the matrix immediately reverts to an ``ordinary'' matrix (with the values it just happens to contain at that moment, be they meaningful as an ordinary matrix or not!). <LI> <CODE>($dimension,$x_vector,$base_matrix) = $LR_matrix</CODE><CODE>-></CODE><CODE>solve_LR($b_vector);</CODE> Use this method to actually solve an equation system. Matrix ``<CODE>$LR_matrix</CODE>'' must be a (quadratic) matrix returned by the method ``decompose_LR()'', the LR decomposition matrix of the matrix ``A'' of your equation system <CODE>A * x = b</CODE>. The input vector ``<CODE>$b_vector</CODE>'' is the vector ``b'' in your equation system <CODE>A * x = b</CODE>, which must be a column vector and have the same number of rows as the input matrix ``<CODE>$LR_matrix</CODE>''. The method returns a list of three items if a solution exists or an empty list otherwise (!). Therefore, you should always use this method like this: <PRE> if ( ($dim,$x_vec,$base) = $LR->solve_LR($b_vec) ) { # do something with the solution... } else { # do something with the fact that there is no solution... }</PRE> The three items returned are: the dimension ``<CODE>$dimension</CODE>'' of the solution space (which is zero if only one solution exists, one if the solution is a straight line, two if the solution is a plane, and so on), the solution vector ``<CODE>$x_vector</CODE>'' (which is the vector ``x'' of your equation system <CODE>A * x = b</CODE>) and a matrix ``<CODE>$base_matrix</CODE>'' representing a base of the solution space (a set of vectors which put up the solution space like the spokes of an umbrella). Only the first ``<CODE>$dimension</CODE>'' columns of this base matrix actually contain entries, the remaining columns are all zero. Now what is all this stuff with that ``base'' good for? The output vector ``x'' is ALWAYS a solution of your equation system <CODE>A * x = b</CODE>. But also any vector ``<CODE>$vector</CODE>'' <PRE> $vector = $x_vector->clone();</PRE> <PRE> $machine_infinity = 1E+99; # or something like that</PRE> <PRE> for ( $i = 1; $i <= $dimension; $i++ ) { $vector += rand($machine_infinity) * $base_matrix->column($i); }</PRE> is a solution to your problem <CODE>A * x = b</CODE>, i.e., if ``<CODE>$A_matrix</CODE>'' contains your matrix ``A'', then <PRE> print abs( $A_matrix * $vector - $b_vector ), "\n";</PRE> should print a number around 1E-16 or so! By the way, note that you can actually calculate those vectors ``<CODE>$vector</CODE>'' a little more efficient as follows: <PRE> $rand_vector = $x_vector->shadow();</PRE> <PRE> $machine_infinity = 1E+99; # or something like that</PRE> <PRE> for ( $i = 1; $i <= $dimension; $i++ ) { $rand_vector->assign($i,1, rand($machine_infinity) ); }</PRE> <PRE> $vector = $x_vector + ( $base_matrix * $rand_vector );</PRE> Note that the input matrix and vector are not changed by this method in any way. <LI> <CODE>$inverse_matrix = $LR_matrix->invert_LR();</CODE> Use this method to calculate the inverse of a given matrix ``<CODE>$LR_matrix</CODE>'', which must be a (quadratic) matrix returned by the method ``decompose_LR()''. The method returns an object reference to a new matrix of the same size as the input matrix containing the inverse of the matrix that you initially fed into ``decompose_LR()'' IF THE INVERSE EXISTS, or an empty list otherwise. Therefore, you should always use this method in the following way: <PRE> if ( $inverse_matrix = $LR->invert_LR() ) { # do something with the inverse matrix... } else { # do something with the fact that there is no inverse matrix... }</PRE> Note that by definition (disregarding numerical errors), the product of the initial matrix and its inverse (or vice-versa) is always a matrix containing one's on the main diagonal (elements (1,1), (2,2), (3,3) and so on) and zero's elsewhere. The input matrix is not changed by this method in any way. <LI> <CODE>$condition = $matrix->condition($inverse_matrix);</CODE> In fact this method is just a shortcut for <PRE> abs($matrix) * abs($inverse_matrix)</PRE> Both input matrices must be quadratic and have the same size, and the result is meaningful only if one of them is the inverse of the other (for instance, as returned by the method ``invert_LR()''). The number returned is a measure of the ``condition'' of the given matrix ``<CODE>$matrix</CODE>'', i.e., a measure of the numerical stability of the matrix. This number is always positive, and the smaller its value, the better the condition of the matrix (the better the stability of all subsequent computations carried out using this matrix). Numerical stability means for example that if <PRE> abs( $vec_correct - $vec_with_error ) < $epsilon</PRE> holds, there must be a ``<CODE>$delta</CODE>'' which doesn't depend on the vector ``<CODE>$vec_correct</CODE>'' (nor ``<CODE>$vec_with_error</CODE>'', by the way) so that <PRE> abs( $matrix * $vec_correct - $matrix * $vec_with_error ) < $delta</PRE> also holds. <LI> <CODE>$determinant = $LR_matrix->det_LR();</CODE> Calculates the determinant of a matrix, whose LR decomposition matrix ``<CODE>$LR_matrix</CODE>'' must be given (which must be a (quadratic) matrix returned by the method ``decompose_LR()''). In fact the determinant is a by-product of the LR decomposition: It is (in principle, that is, except for the sign) simply the product of the elements on the main diagonal (elements (1,1), (2,2), (3,3) and so on) of the LR decomposition matrix. (The sign is taken care of ``magically'' by this module) <LI> <CODE>$order = $LR_matrix->order_LR();</CODE> Calculates the order (called ``Rang'' in German) of a matrix, whose LR decomposition matrix ``<CODE>$LR_matrix</CODE>'' must be given (which must be a (quadratic) matrix returned by the method ``decompose_LR()''). This number is a measure of the number of linear independent row and column vectors (= number of linear independent equations in the case of a matrix representing an equation system) of the matrix that was initially fed into ``decompose_LR()''. If ``n'' is the number of rows and columns of the (quadratic!) matrix, then ``n - order'' is the dimension of the solution space of the associated equation system. <LI> <CODE>$scalar_product = $vector1->scalar_product($vector2);</CODE> Returns the scalar product of vector ``<CODE>$vector1</CODE>'' and vector ``<CODE>$vector2</CODE>''. Both vectors must be column vectors (i.e., a matrix having several rows but only one column). This is a (more efficient!) shortcut for <PRE> $temp = ~$vector1 * $vector2; $scalar_product = $temp->element(1,1);</PRE> or the sum <CODE>i=1..n</CODE> of the products <CODE>vector1[i] * vector2[i]</CODE>. Provided none of the two input vectors is the null vector, then the two vectors are orthogonal, i.e., have an angle of 90 degrees between them, exactly when their scalar product is zero, and vice-versa. <LI> <CODE>$vector_product = $vector1->vector_product($vector2);</CODE> Returns the vector product of vector ``<CODE>$vector1</CODE>'' and vector ``<CODE>$vector2</CODE>''. Both vectors must be column vectors (i.e., a matrix having several rows but only one column). Currently, the vector product is only defined for 3 dimensions (i.e., vectors with 3 rows); all other vectors trigger an error message. In 3 dimensions, the vector product of two vectors ``x'' and ``y'' is defined as <PRE> | x[1] y[1] e[1] | determinant | x[2] y[2] e[2] | | x[3] y[3] e[3] |</PRE> where the ``<CODE>x[i]</CODE>'' and ``<CODE>y[i]</CODE>'' are the components of the two vectors ``x'' and ``y'', respectively, and the ``<CODE>e[i]</CODE>'' are unity vectors (i.e., vectors with a length equal to one) with a one in row ``i'' and zero's elsewhere (this means that you have numbers and vectors as elements in this matrix!). This determinant evaluates to the rather simple formula <PRE> z[1] = x[2] * y[3] - x[3] * y[2] z[2] = x[3] * y[1] - x[1] * y[3] z[3] = x[1] * y[2] - x[2] * y[1]</PRE> A characteristic property of the vector product is that the resulting vector is orthogonal to both of the input vectors (if neither of both is the null vector, otherwise this is trivial), i.e., the scalar product of each of the input vectors with the resulting vector is always zero. <LI> <A HREF="../../../lib/Pod/perlfunc.html#item_length"><CODE>$length = $vector->length();</CODE></A> This is actually a shortcut for <PRE> $length = sqrt( $vector->scalar_product($vector) );</PRE> and returns the length of a given (column!) vector ``<CODE>$vector</CODE>''. Note that the ``length'' calculated by this method is in fact the ``two''-norm of a vector ``<CODE>$vector</CODE>''! The general definition for norms of vectors is the following: <PRE> sub vector_norm { croak "Usage: \$norm = \$vector->vector_norm(\$n);" if (@_ != 2);</PRE> <PRE> my($vector,$n) = @_; my($rows,$cols) = ($vector->[1],$vector->[2]); my($k,$comp,$sum);</PRE> <PRE> croak "Math::MatrixReal::vector_norm(): vector is not a column vector" unless ($cols == 1);</PRE> <PRE> croak "Math::MatrixReal::vector_norm(): norm index must be > 0" unless ($n > 0);</PRE> <PRE> croak "Math::MatrixReal::vector_norm(): norm index must be integer" unless ($n == int($n));</PRE> <PRE> $sum = 0; for ( $k = 0; $k < $rows; $k++ ) { $comp = abs( $vector->[0][$k][0] ); $sum += $comp ** $n; } return( $sum ** (1 / $n) ); }</PRE> Note that the case ``n = 1'' is the ``one''-norm for matrices applied to a vector, the case ``n = 2'' is the euclidian norm or length of a vector, and if ``n'' goes to infinity, you have the ``infinity''- or ``maximum''-norm for matrices applied to a vector! <LI> <CODE>$xn_vector = $matrix-></CODE><CODE>solve_GSM($x0_vector,$b_vector,$epsilon);</CODE> <LI> <CODE>$xn_vector = $matrix-></CODE><CODE>solve_SSM($x0_vector,$b_vector,$epsilon);</CODE> <LI> <CODE>$xn_vector = $matrix-></CODE><CODE>solve_RM($x0_vector,$b_vector,$weight,$epsilon);</CODE> In some cases it might not be practical or desirable to solve an equation system ``<CODE>A * x = b</CODE>'' using an analytical algorithm like the ``decompose_LR()'' and ``solve_LR()'' method pair. In fact in some cases, due to the numerical properties (the ``condition'') of the matrix ``A'', the numerical error of the obtained result can be greater than by using an approximative (iterative) algorithm like one of the three implemented here. All three methods, GSM (``Global Step Method'' or ``Gesamtschrittverfahren''), SSM (``Single Step Method'' or ``Einzelschrittverfahren'') and RM (``Relaxation Method'' or ``Relaxationsverfahren''), are fix-point iterations, that is, can be described by an iteration function ``<CODE>x(t+1) = Phi( x(t) )</CODE>'' which has the property: <PRE> Phi(x) = x <==> A * x = b</PRE> We can define ``<CODE>Phi(x)</CODE>'' as follows: <PRE> Phi(x) := ( En - A ) * x + b</PRE> where ``En'' is a matrix of the same size as ``A'' (``n'' rows and columns) with one's on its main diagonal and zero's elsewhere. This function has the required property. Proof: <PRE> A * x = b</PRE> <PRE> <==> -( A * x ) = -b</PRE> <PRE> <==> -( A * x ) + x = -b + x</PRE> <PRE> <==> -( A * x ) + x + b = x</PRE> <PRE> <==> x - ( A * x ) + b = x</PRE> <PRE> <==> ( En - A ) * x + b = x</PRE> This last step is true because <PRE> x[i] - ( a[i,1] x[1] + ... + a[i,i] x[i] + ... + a[i,n] x[n] ) + b[i]</PRE> is the same as <PRE> ( -a[i,1] x[1] + ... + (1 - a[i,i]) x[i] + ... + -a[i,n] x[n] ) + b[i]</PRE> qed Note that actually solving the equation system ``<CODE>A * x = b</CODE>'' means to calculate <PRE> a[i,1] x[1] + ... + a[i,i] x[i] + ... + a[i,n] x[n] = b[i]</PRE> <PRE> <==> a[i,i] x[i] = b[i] - ( a[i,1] x[1] + ... + a[i,i] x[i] + ... + a[i,n] x[n] ) + a[i,i] x[i]</PRE> <PRE> <==> x[i] = ( b[i] - ( a[i,1] x[1] + ... + a[i,i] x[i] + ... + a[i,n] x[n] ) + a[i,i] x[i] ) / a[i,i]</PRE> <PRE> <==> x[i] = ( b[i] - ( a[i,1] x[1] + ... + a[i,i-1] x[i-1] + a[i,i+1] x[i+1] + ... + a[i,n] x[n] ) ) / a[i,i]</PRE> There is one major restriction, though: a fix-point iteration is guaranteed to converge only if the first derivative of the iteration function has an absolute value less than one in an area around the point ``<CODE>x(*)</CODE>'' for which ``<CODE>Phi( x(*) ) = x(*)</CODE>'' is to be true, and if the start vector ``<CODE>x(0)</CODE>'' lies within that area! This is best verified grafically, which unfortunately is impossible to do in this textual documentation! See literature on Numerical Analysis for details! In our case, this restriction translates to the following three conditions: There must exist a norm so that the norm of the matrix of the iteration function, <CODE>( En - A )</CODE>, has a value less than one, the matrix ``A'' may not have any zero value on its main diagonal and the initial vector ``<CODE>x(0)</CODE>'' must be ``good enough'', i.e., ``close enough'' to the solution ``<CODE>x(*)</CODE>''. (Remember school math: the first derivative of a straight line given by ``<CODE>y = a * x + b</CODE>'' is ``a''!) The three methods expect a (quadratic!) matrix ``<CODE>$matrix</CODE>'' as their first argument, a start vector ``<CODE>$x0_vector</CODE>'', a vector ``<CODE>$b_vector</CODE>'' (which is the vector ``b'' in your equation system ``<CODE>A * x = b</CODE>''), in the case of the ``Relaxation Method'' (``RM''), a real number ``<CODE>$weight</CODE>'' best between zero and two, and finally an error limit (real number) ``<CODE>$epsilon</CODE>''. (Note that the weight ``<CODE>$weight</CODE>'' used by the ``Relaxation Method'' (``RM'') is NOT checked to lie within any reasonable range!) The three methods first test the first two conditions of the three conditions listed above and return an empty list if these conditions are not fulfilled. Therefore, you should always test their return value using some code like: <PRE> if ( $xn_vector = $A_matrix->solve_GSM($x0_vector,$b_vector,1E-12) ) { # do something with the solution... } else { # do something with the fact that there is no solution... }</PRE> Otherwise, they iterate until <A HREF="#item_abs"><CODE>abs( Phi(x) - x ) < epsilon</CODE></A>. (Beware that theoretically, infinite loops might result if the starting vector is too far ``off'' the solution! In practice, this shouldn't be a problem. Anyway, you can always press <ctrl-C> if you think that the iteration takes too long!) The difference between the three methods is the following: In the ``Global Step Method'' (``GSM''), the new vector ``<CODE>x(t+1)</CODE>'' (called ``y'' here) is calculated from the vector ``<CODE>x(t)</CODE>'' (called ``x'' here) according to the formula: <PRE> y[i] = ( b[i] - ( a[i,1] x[1] + ... + a[i,i-1] x[i-1] + a[i,i+1] x[i+1] + ... + a[i,n] x[n] ) ) / a[i,i]</PRE> In the ``Single Step Method'' (``SSM''), the components of the vector ``<CODE>x(t+1)</CODE>'' which have already been calculated are used to calculate the remaining components, i.e. <PRE> y[i] = ( b[i] - ( a[i,1] y[1] + ... + a[i,i-1] y[i-1] + # note the "y[]"! a[i,i+1] x[i+1] + ... + a[i,n] x[n] ) # note the "x[]"! ) / a[i,i]</PRE> In the ``Relaxation method'' (``RM''), the components of the vector ``<CODE>x(t+1)</CODE>'' are calculated by ``mixing'' old and new value (like cold and hot water), and the weight ``<CODE>$weight</CODE>'' determines the ``aperture'' of both the ``hot water tap'' as well as of the ``cold water tap'', according to the formula: <PRE> y[i] = ( b[i] - ( a[i,1] y[1] + ... + a[i,i-1] y[i-1] + # note the "y[]"! a[i,i+1] x[i+1] + ... + a[i,n] x[n] ) # note the "x[]"! ) / a[i,i] y[i] = weight * y[i] + (1 - weight) * x[i]</PRE> Note that the weight ``<CODE>$weight</CODE>'' should be greater than zero and less than two (!). The three methods are supposed to be of different efficiency. Experiment! Remember that in most cases, it is probably advantageous to first ``normalize()'' your equation system prior to solving it! </UL> <H2><A NAME="eigensystems">Eigensystems</A></H2> <UL> <LI> <CODE>$matrix->is_symmetric();</CODE> Returns a boolean value indicating if the given matrix is symmetric (M[i,j]=M[j,i]). This is equivalent to <CODE>($matrix == ~$matrix)</CODE> but without memory allocation. <LI> <CODE>($l, $V) = $matrix->sym_diagonalize();</CODE> This method performs the diagonalization of the quadratic symmetric matrix M stored in $matrix. On output, l is a column vector containing all the eigenvalues of M and V is an orthogonal matrix which columns are the corresponding normalized eigenvectors. The primary property of an eigenvalue l and an eigenvector x is of course that: M * x = l * x. The method uses a Householder reduction to tridiagonal form followed by a QL algoritm with implicit shifts on this tridiagonal. (The tridiagonal matrix is kept internally in a compact form in this routine to save memory.) In fact, this routine wraps the <CODE>householder()</CODE> and <CODE>tri_diagonalize()</CODE> methods described below when their intermediate results are not desired. The overall algorithmic complexity of this technique is O(N^3). According to several books, the coefficient hidden by the 'O' is one of the best possible for general (symmetric) matrixes. <LI> <CODE>($T, $Q) = $matrix->householder();</CODE> This method performs the Householder algorithm which reduces the n by n real symmetric matrix M contained in $matrix to tridiagonal form. On output, T is a symmetric tridiagonal matrix (only diagonal and off-diagonal elements are non-zero) and Q is an orthogonal matrix performing the tranformation between M and T (<CODE>$M == $Q * $T * ~$Q</CODE>). <LI> <CODE>($l, $V) = $T->tri_diagonalize([$Q]);</CODE> This method diagonalizes the symmetric tridiagonal matrix T. On output, $l and $V are similar to the output values described for sym_diagonalize(). The optional argument $Q corresponds to an orthogonal transformation matrix Q that should be used additionally during V (eigenvectors) computation. It should be supplied if the desired eigenvectors correspond to a more general symmetric matrix M previously reduced by the <CODE>householder()</CODE> method, not a mere tridiagonal. If T is really a tridiagonal matrix, Q can be omitted (it will be internally created in fact as an identity matrix). The method uses a QL algorithm (with implicit shifts). <LI> <CODE>$l = $matrix->sym_eigenvalues();</CODE> This method computes the eigenvalues of the quadratic symmetric matrix M stored in $matrix. On output, l is a column vector containing all the eigenvalues of M. Eigenvectors are not computed (on the contrary of <CODE>sym_diagonalize()</CODE>) and this method is more efficient (even though it uses a similar algorithm with two phases). However, understand that the algorithmic complexity of this technique is still also O(N^3). But the coefficient hidden by the 'O' is better by a factor of..., well, see your benchmark, it's wiser. This routine wraps the <CODE>householder_tridiagonal()</CODE> and <CODE>tri_eigenvalues()</CODE> methods described below when the intermediate tridiagonal matrix is not needed. <LI> <CODE>$T = $matrix->householder_tridiagonal();</CODE> This method performs the Householder algorithm which reduces the n by n real symmetric matrix M contained in $matrix to tridiagonal form. On output, T is the obtained symmetric tridiagonal matrix (only diagonal and off-diagonal elements are non-zero). The operation is similar to the <CODE>householder()</CODE> method, but potentially a little more efficient as the transformation matrix is not computed. <LI> <CODE>$l = $T->tri_eigenvalues();</CODE> This method compute the eigenvalues of the symmetric tridiagonal matrix T. On output, $l is a vector containing the eigenvalues (similar to <CODE>sym_eigenvalues()</CODE>). This method is much more efficient than <CODE>tri_diagonalize()</CODE> when eigenvectors are not needed. </UL> <HR> <H1><A NAME="overloaded operators">OVERLOADED OPERATORS</A></H1> <H2><A NAME="synopsis">SYNOPSIS</A></H2> <UL> <LI> Unary operators: ``<CODE>-</CODE>'', ``<CODE>~</CODE>'', ``<A HREF="#item_abs"><CODE>abs</CODE></A>'', <A HREF="#item_test"><CODE>test</CODE></A>, ``<CODE>!</CODE>'', '<CODE>""</CODE>' <LI> Binary (arithmetic) operators: ``<CODE>+</CODE>'', ``<CODE>-</CODE>'', ``<CODE>*</CODE>'' <LI> Binary (relational) operators: ``<CODE>==</CODE>'', ``<CODE>!=</CODE>'', ``<CODE><</CODE>'', ``<CODE><=</CODE>'', ``<CODE>></CODE>'', ``<CODE>>=</CODE>'' ``<CODE>eq</CODE>'', ``<CODE>ne</CODE>'', ``<CODE>lt</CODE>'', ``<CODE>le</CODE>'', ``<CODE>gt</CODE>'', ``<CODE>ge</CODE>'' Note that the latter (``<CODE>eq</CODE>'', ``<CODE>ne</CODE>'', ... ) are just synonyms of the former (``<CODE>==</CODE>'', ``<CODE>!=</CODE>'', ... ), defined for convenience only. </UL> <H2><A NAME="description">DESCRIPTION</A></H2> <DL> <DT><A NAME="item_%27%2D%27">'-'</A> <DD> Unary minus Returns the negative of the given matrix, i.e., the matrix with all elements multiplied with the factor ``-1''. Example: <PRE> $matrix = -$matrix;</PRE> <DT><A NAME="item_%27%7E%27">'~'</A> <DD> Transposition Returns the transposed of the given matrix. Examples: <PRE> $temp = ~$vector * $vector; $length = sqrt( $temp->element(1,1) );</PRE> <PRE> if (~$matrix == $matrix) { # matrix is symmetric ... }</PRE> <DT><A NAME="item_abs">abs</A> <DD> Norm Returns the ``one''-Norm of the given matrix. Example: <PRE> $error = abs( $A * $x - $b );</PRE> <DT><A NAME="item_test">test</A> <DD> Boolean test Tests wether there is at least one non-zero element in the matrix. Example: <PRE> if ($xn_vector) { # result of iteration is not zero ... }</PRE> <DT><A NAME="item_%27%21%27">'!'</A> <DD> Negated boolean test Tests wether the matrix contains only zero's. Examples: <PRE> if (! $b_vector) { # heterogenous equation system ... } else { # homogenous equation system ... }</PRE> <PRE> unless ($x_vector) { # not the null-vector! }</PRE> <DT><A NAME="item_%27%22%22%22%22%27">'``''``'''</A> <DD> ``Stringify'' operator Converts the given matrix into a string. Uses scientific representation to keep precision loss to a minimum in case you want to read this string back in again later with ``new_from_string()''. Uses a 13-digit mantissa and a 20-character field for each element so that lines will wrap nicely on an 80-column screen. Examples: <PRE> $matrix = Math::MatrixReal->new_from_string(<<"MATRIX"); [ 1 0 ] [ 0 -1 ] MATRIX print "$matrix";</PRE> <PRE> [ 1.000000000000E+00 0.000000000000E+00 ] [ 0.000000000000E+00 -1.000000000000E+00 ]</PRE> <PRE> $string = "$matrix"; $test = Math::MatrixReal->new_from_string($string); if ($test == $matrix) { print ":-)\n"; } else { print ":-(\n"; }</PRE> <DT><A NAME="item_%27%2B%27">'+'</A> <DD> Addition Returns the sum of the two given matrices. Examples: <PRE> $matrix_S = $matrix_A + $matrix_B;</PRE> <PRE> $matrix_A += $matrix_B;</PRE> <DT>'-' <DD> Subtraction Returns the difference of the two given matrices. Examples: <PRE> $matrix_D = $matrix_A - $matrix_B;</PRE> <PRE> $matrix_A -= $matrix_B;</PRE> Note that this is the same as: <PRE> $matrix_S = $matrix_A + -$matrix_B;</PRE> <PRE> $matrix_A += -$matrix_B;</PRE> (The latter are less efficient, though) <DT><A NAME="item_%27%2A%27">'*'</A> <DD> Multiplication Returns the matrix product of the two given matrices or the product of the given matrix and scalar factor. Examples: <PRE> $matrix_P = $matrix_A * $matrix_B;</PRE> <PRE> $matrix_A *= $matrix_B;</PRE> <PRE> $vector_b = $matrix_A * $vector_x;</PRE> <PRE> $matrix_B = -1 * $matrix_A;</PRE> <PRE> $matrix_B = $matrix_A * -1;</PRE> <PRE> $matrix_A *= -1;</PRE> <DT><A NAME="item_%27%3D%3D%27">'=='</A> <DD> Equality Tests two matrices for equality. Example: <PRE> if ( $A * $x == $b ) { print "EUREKA!\n"; }</PRE> Note that in most cases, due to numerical errors (due to the finite precision of computer arithmetics), it is a bad idea to compare two matrices or vectors this way. Better use the norm of the difference of the two matrices you want to compare and compare that norm with a small number, like this: <PRE> if ( abs( $A * $x - $b ) < 1E-12 ) { print "BINGO!\n"; }</PRE> <DT><A NAME="item_%27%21%3D%27">'!='</A> <DD> Inequality Tests two matrices for inequality. Example: <PRE> while ($x0_vector != $xn_vector) { # proceed with iteration ... }</PRE> (Stops when the iteration becomes stationary) Note that (just like with the '==' operator), it is usually a bad idea to compare matrices or vectors this way. Compare the norm of the difference of the two matrices with a small number instead. <DT><A NAME="item_%27%3C%27">'<'</A> <DD> Less than Examples: <PRE> if ( $matrix1 < $matrix2 ) { # ... }</PRE> <PRE> if ( $vector < $epsilon ) { # ... }</PRE> <PRE> if ( 1E-12 < $vector ) { # ... }</PRE> <PRE> if ( $A * $x - $b < 1E-12 ) { # ... }</PRE> These are just shortcuts for saying: <PRE> if ( abs($matrix1) < abs($matrix2) ) { # ... }</PRE> <PRE> if ( abs($vector) < abs($epsilon) ) { # ... }</PRE> <PRE> if ( abs(1E-12) < abs($vector) ) { # ... }</PRE> <PRE> if ( abs( $A * $x - $b ) < abs(1E-12) ) { # ... }</PRE> Uses the ``one''-norm for matrices and Perl's built-in ``abs()'' for scalars. <DT><A NAME="item_%27%3C%3D%27">'<='</A> <DD> Less than or equal As with the '<' operator, this is just a shortcut for the same expression with ``abs()'' around all arguments. Example: <PRE> if ( $A * $x - $b <= 1E-12 ) { # ... }</PRE> which in fact is the same as: <PRE> if ( abs( $A * $x - $b ) <= abs(1E-12) ) { # ... }</PRE> Uses the ``one''-norm for matrices and Perl's built-in ``abs()'' for scalars. <DT><A NAME="item_%27%3E%27">'>'</A> <DD> Greater than As with the '<' and '<=' operator, this <PRE> if ( $xn - $x0 > 1E-12 ) { # ... }</PRE> is just a shortcut for: <PRE> if ( abs( $xn - $x0 ) > abs(1E-12) ) { # ... }</PRE> Uses the ``one''-norm for matrices and Perl's built-in ``abs()'' for scalars. <DT><A NAME="item_%27%3E%3D%27">'>='</A> <DD> Greater than or equal As with the '<', '<=' and '>' operator, the following <PRE> if ( $LR >= $A ) { # ... }</PRE> is simply a shortcut for: <PRE> if ( abs($LR) >= abs($A) ) { # ... }</PRE> Uses the ``one''-norm for matrices and Perl's built-in ``abs()'' for scalars. </DL> <HR> <H1><A NAME="see also">SEE ALSO</A></H1> Math::MatrixBool(3), DFA::Kleene(3), Math::Kleene(3), Set::IntegerRange(3), Set::IntegerFast(3). <HR> <H1><A NAME="version">VERSION</A></H1> This man page documents Math::MatrixReal version 1.3. <HR> <H1><A NAME="authors">AUTHORS</A></H1> Steffen Beyer <<A HREF="mailto:sb@sdm.de">sb@sdm.de</A>>, Rodolphe Ortalo <<A HREF="mailto:ortalo@laas.fr">ortalo@laas.fr</A>>. <HR> <H1><A NAME="credits">CREDITS</A></H1> Many thanks to Prof. Pahlings for stoking the fire of my enthusiasm for Algebra and Linear Algebra at the university (RWTH Aachen, Germany), and to Prof. Esser and his assistant, Mr. Jarausch, for their fascinating lectures in Numerical Analysis! <HR> <H1><A NAME="copyright">COPYRIGHT</A></H1> Copyright (c) 1996, 1997, 1999 by Steffen Beyer and Rodolphe Ortalo. All rights reserved. <HR> <H1><A NAME="license agreement">LICENSE AGREEMENT</A></H1> This package is free software; you can redistribute it and/or modify it under the same terms as Perl itself. <TABLE BORDER=0 CELLPADDING=0 CELLSPACING=0 WIDTH=100%> <TR><TD CLASS=block VALIGN=MIDDLE WIDTH=100% BGCOLOR="#cccccc"> Math::MatrixReal - Matrix of Reals </TD></TR> </TABLE> </BODY> </HTML>