OpenXM/src/asir-doc/parts/builtin/array.texi - diff

Return to array.texi CVS log

Up to [local] / OpenXM / src / asir-doc / parts / builtin

version 1.6, 2003/04/19 15:44:58

version 1.8, 2003/10/19 07:21:57

Line 1

@comment $OpenXM: OpenXM/src/asir-doc/parts/builtin/array.texi,v 1.5 2002/08/08 05:24:37 noro Exp $

@comment $OpenXM: OpenXM/src/asir-doc/parts/builtin/array.texi,v 1.7 2003/04/20 08:01:28 noro Exp $

\BJP

@node $BG[Ns(B,,, $BAH$_9~$_H!?t(B

@section $BG[Ns(B

Line 416 in a rational expression.

\JP :: @var{mat} $B$N9TNs<0$r5a$a$k(B.

\EG :: Determinant of @var{mat}.

@item invmat(@var{mat})

\JP :: @var{mat} $B$N9TNs<0$r5a$a$k(B.

\JP :: @var{mat} $B$N5U9TNs$r5a$a$k(B.

\EG :: Inverse matrix of @var{mat}.

@end table

Line 471 is more efficient than the fraction free Gaussian algo

[ 1 u u^2 u^3 u^4 ]

[ 1 v v^2 v^3 v^4 ]

[95] fctr(det(A));

[[1,1],[u-v,1],[-z+v,1],[-z+u,1],[-y+u,1],[y-v,1],[-y+z,1],[-x+u,1],[-x+z,1],

[[1,1],[u-v,1],[-z+v,1],[-z+u,1],[-y+u,1],[y-v,1],[-y+z,1],[-x+u,1],

[-x+v,1],[-x+y,1]]

[-x+z,1],[-x+v,1],[-x+y,1]]

[96] A = newmat(3,3)$

[97] for(I=0;I<3;I++)for(J=0,B=A[I],W=V[I];J<3;J++)B[J]=W^J;

[98] A;