[BACK]Return to gtt_ekn-en.texi CVS log [TXT][DIR] Up to [local] / OpenXM / src / asir-contrib / packages / doc / gtt_ekn

Diff for /OpenXM/src/asir-contrib/packages/doc/gtt_ekn/gtt_ekn-en.texi between version 1.2 and 1.3

version 1.2, 2019/06/12 05:53:29 version 1.3, 2019/06/12 22:54:52
Line 1 
Line 1 
 %% $OpenXM$  %% $OpenXM: OpenXM/src/asir-contrib/packages/doc/gtt_ekn/gtt_ekn-en.texi,v 1.2 2019/06/12 05:53:29 takayama Exp $
 %% xetex gtt_ekn-en.texi   (.texi までつける. )  %% xetex gtt_ekn-en.texi   (.texi までつける. )
 %% 英語版, 以下コメントは @comment で始める.  \input texinfo 以降は普通の tex 命令は使えない.  %% 英語版, 以下コメントは @comment で始める.  \input texinfo 以降は普通の tex 命令は使えない.
 \input texinfo-ja  \input texinfo-ja
Line 41 
Line 41 
 @title HGM functions for two way contingency tables.  @title HGM functions for two way contingency tables.
 @subtitle HGM functions for two way contingency tables on Risa/Asir  @subtitle HGM functions for two way contingency tables on Risa/Asir
 @subtitle Version 3.0  @subtitle Version 3.0
 @subtitle June 11, 2019  @subtitle June 12, 2019
   
 @author  by Y.Goto, Y.Tachibana, N.Takayama  @author  by Y.Goto, Y.Tachibana, N.Takayama
 @page  @page
Line 106  RIMS kokyuroku (in Japanese).
Line 106  RIMS kokyuroku (in Japanese).
 @item [TGKT]  @item [TGKT]
 Y.Tachibana, Y.Goto, T.Koyama, N.Takayama,  Y.Tachibana, Y.Goto, T.Koyama, N.Takayama,
 Holonomic Gradient Method for Two Way Contingency Tables,  Holonomic Gradient Method for Two Way Contingency Tables,
 @uref{https://arxiv.org/abs/1803.04170, arxiv:1803.04170 (the 2nd version)}  @uref{https://arxiv.org/abs/1803.04170, arxiv:1803.04170 (the 3rd version)}
 @item [TKT2015]  @item [TKT2015]
 N.Takayama, S.Kuriki, A.Takemura,  N.Takayama, S.Kuriki, A.Takemura,
          A-hypergeometric distributions and Newton polytopes.           A-hypergeometric distributions and Newton polytopes.
Line 127  The changelogs are described only in the Japanese vers
Line 127  The changelogs are described only in the Japanese vers
 * gtt_ekn3.expectation::  * gtt_ekn3.expectation::
 * gtt_ekn3.setup::  * gtt_ekn3.setup::
 * gtt_ekn3.upAlpha::  * gtt_ekn3.upAlpha::
   * gtt_ekn3.downAlpha::
 * gtt_ekn3.cmle::  * gtt_ekn3.cmle::
 * gtt_ekn3.set_debug_level::  * gtt_ekn3.set_debug_level::
 * gtt_ekn3.contiguity_mat_list_2::  * gtt_ekn3.contiguity_mat_list_2::
Line 689  level&0x4: g_mat_fac_test([ 67/62944040755546030080000
Line 690  level&0x4: g_mat_fac_test([ 67/62944040755546030080000
 level&0x4: g_mat_fac_test ------  snip  level&0x4: g_mat_fac_test ------  snip
 @end example  @end example
   
 Example.  Example:
 @example  @example
 [2659] gtt_ekn3.nc([[4,5,6],[2,4,9]],[[1,1/2,1/3],[1,1/5,1/7],[1,1,1]])$  [2659] gtt_ekn3.nc([[4,5,6],[2,4,9]],[[1,1/2,1/3],[1,1/5,1/7],[1,1,1]])$
 [2660] L=matrix_transpose(gtt_ekn3.show_path())$  [2660] L=matrix_transpose(gtt_ekn3.show_path())$
Line 700  This means that the contiguity relations for the direc
Line 701  This means that the contiguity relations for the direc
 L[0] is the contiguity matrix,  L[0] is the contiguity matrix,
 L[1] is a list of the steps to apply for corresponding relations.  L[1] is a list of the steps to apply for corresponding relations.
   
 Example. Finding a path without evaluations of gmvectors.  Example: Finding a path without evaluations of gmvectors.
 @example  @example
 A=gtt_ekn3.marginaltoAlpha_list([[400,410,1011],[910,411,500]])$  A=gtt_ekn3.marginaltoAlpha_list([[400,410,1011],[910,411,500]])$
 [2666] gtt_ekn3.contiguity_mat_list_2(A,2,2)$  [2666] gtt_ekn3.contiguity_mat_list_2(A,2,2)$
Line 713  A=gtt_ekn3.marginaltoAlpha_list([[400,410,1011],[910,4
Line 714  A=gtt_ekn3.marginaltoAlpha_list([[400,410,1011],[910,4
 [2 1]  // shorter  [2 1]  // shorter
 @end example  @end example
   
 Example. When assert2() returns 0 matrices, then the results of g_mat_fac_plain and g_mat_fac_int  Example: When assert2() returns 0 matrices, then the results of g_mat_fac_plain and g_mat_fac_int
 agree.  In other words, the system is OK.  agree.  In other words, the system is OK.
 @example  @example
 [8859] gtt_ekn3.assert2(1);  [8859] gtt_ekn3.assert2(1);
Line 742  Try [[crt,1]]
Line 743  Try [[crt,1]]
 ----  snip  ----  snip
 @end example  @end example
   
 Example.  Example:
 3x5 contingency table.  3x5 contingency table.
 The parameter p (cell probability) is a list of 1/(prime number) 's.  The parameter p (cell probability) is a list of 1/(prime number) 's.
 @example  @example
Line 753  The parameter p (cell probability) is a list of 1/(pri
Line 754  The parameter p (cell probability) is a list of 1/(pri
 [ 1.65224223218613 ... snip ]  [ 1.65224223218613 ... snip ]
 @end example  @end example
   
 Example.  Example:
 @example  @example
 [5779] import("gtt_ekn3.rr"); load("gtt_ekn3/ekn_eval-timing.rr");  [5779] import("gtt_ekn3.rr"); load("gtt_ekn3/ekn_eval-timing.rr");
 [5780] gtt_ekn3.assert3(5,5,100 | nps=32, interval=100);  [5780] gtt_ekn3.assert3(5,5,100 | nps=32, interval=100);
Legend:
Removed from v.1.2  
changed lines
  Added in v.1.3
FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>