source: git/Tst/Manual/minor.tst @ 6fb723

spielwiese
Last change on this file since 6fb723 was 894057, checked in by Oleksandr Motsak <motsak@…>, 13 years ago
ADD: Tests from online manual (res+stat on mamawutz): short ones Tst/Manual/s.lst
  • Property mode set to 100644
File size: 539 bytes
Line 
1LIB "tst.lib"; tst_init();
2  ring r=0,(a,b,c,d,e,f,g,h,s,t,u,v),ds;
3  matrix m[3][4]=a,b,c,d,e,f,g,h,s,t,u,v;
4  print(m);
5  // let's compute all non-zero minors;
6  // here we do not guarantee any ordering:
7  minor(m,2);
8  ideal i=a,c; i=std(i);
9  // here come the first 4 non-zero minors mod I;
10  // this time, a fixed ordering is guaranteed:
11  minor(m,2,i,4);
12  // and here the first 4 minors mod I (possibly zero)
13  // using Laplace's algorithm,
14  // again, the fixed ordering is guaranteed:
15  minor(m,2,i,-4,"Laplace");
16tst_status(1);$
Note: See TracBrowser for help on using the repository browser.