{VERSION 3 0 "SGI MIPS UNIX" "3.0" } {USTYLETAB {CSTYLE "Maple Input" -1 0 "Courier" 0 1 255 0 0 1 0 1 0 0 1 0 0 0 0 }{CSTYLE "2D Math" -1 2 "Times" 0 1 0 0 0 0 0 0 2 0 0 0 0 0 0 }{CSTYLE "2D Comment" 2 18 "" 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 } {CSTYLE "2D Output" 2 20 "" 0 1 0 0 255 1 0 0 0 0 0 0 0 0 0 }{PSTYLE " Normal" -1 0 1 {CSTYLE "" -1 -1 "" 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 }0 0 0 -1 -1 -1 0 0 0 0 0 0 -1 0 }{PSTYLE "Maple Output" 0 11 1 {CSTYLE "" -1 -1 "" 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 }3 3 0 -1 -1 -1 0 0 0 0 0 0 -1 0 }{PSTYLE "" 11 12 1 {CSTYLE "" -1 -1 "" 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 }1 0 0 -1 -1 -1 0 0 0 0 0 0 -1 0 }} {SECT 0 {EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 9 "with(MS):" }}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 91 "Consider the example of the Euler numbers , given by the exponential generating function of " }{XPPEDIT 18 0 "2/ (exp(x)+exp(-x));" "6#*&\"\"#\"\"\",&-%$expG6#%\"xGF%-F(6#,$F*!\"\"F%F ." }{TEXT -1 336 ". The denominator of this has a symmetry of order 2 . Below are two methods to compute the recurrence for the denominato r, when multisectioned by 8. The first method does not take into acco unt the symmetry, where as the second does. Also demonstrated in this section is the code `egf/strip`, which will strip away the useless ze ros." }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 85 "botNoSym := `egf/st rip`(`bottom/ms/linalg/fft2`(exp(x)+exp(-x),f,x,8,[2,2,2]), 8, 0);" }} {PARA 12 "" 1 "" {XPPMATH 20 "6#>%)botNoSymG6&/-%\"fG6#%\"xG,6-F(6#,&F *\"\"\"!#!)F/!CO>ZI(p)>K58u4)ebqJ)-F(6#,&F*F/!#sF/\"D[WY:g.)4zvQ7:y-IB P-F(6#,&F*F/!#kF/\"Cs'[2:&ooK\\P@'R.)ym6-F(6#,&F*F/!#cF/!@?()>n&yAq3%> r4P*fG-F(6#,&F*F/!#[F/!=s)>J9`>
h%*-F(6#,&F*F/!#SF/\":cm#R())3?Lw
o\"*Q#-F(6#,&F*F/!#KF/\"3[oW)4&)3'Ra-F(6#,&F*F/!#CF/\"1+w$\\tbfj$-F(6#
,&F*F/!#;F/\"-sup!fe\"-F(6#,&F*F/!\")F/!'#R$GF(F*7-/-F(6#\"\"!\"$c#/-F
(6#\"\")!'cqb/-F(6#\"#;\".%Q)3:8!R/-F(6#\"#C!3?zD%*p'3Go*/-F(6#\"#K\"9
/.`m+<.]..'*))/-F(6#\"#S!?wX]wyPq$yLB*yo7R/-F(6#\"#[\"E?RF7Jq#G,1$>%*o
Q>W%[#/-F(6#\"#c!KOz[!)e;#[<(*3%>Bhl\"pI`@H\"/-F(6#\"#k\"PkGT8#)*G()\\
T^!f " 0 ""
{MPLTEXT 1 0 85 "botSym := `egf/strip`(`bottom/ms/linalg/fft2`(exp(x)+
exp(-x),f,x,8,[2,2,2],2), 8, 0);" }}{PARA 11 "" 1 "" {XPPMATH 20 "6#>%
'botSymG6&/-%\"fG6#%\"xG,&-F(6#,&F*\"\"\"!#;F/!%'4%-F(6#,&F*F/!\")F/!%
w@F(F*7$/-F(6#\"\"!\"#;/-F(6#\"\")!&3u\"" }}}{EXCHG {PARA 0 "> " 0 ""
{MPLTEXT 1 0 37 "BotNoSym := `egf/makeproc`(botNoSym):" }}}{EXCHG
{PARA 0 "> " 0 "" {MPLTEXT 1 0 33 "BotSym := `egf/makeproc`(botSym):"
}}}{EXCHG {PARA 0 "" 0 "" {TEXT -1 232 "Next consider the top recurren
ce, determined by the bottom recurrence and the definition of the Eule
r numbers, when multisectioning by 8 at 0. Again, the first method do
es not take into account symmetries, where as the second does." }}}
{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 86 "topNoSym := `egf/strip`(`top
/ms/linalg/know`(BotNoSym, euler, f, x, 8, 0, 30, 2),8,0);" }}{PARA
12 "" 1 "" {XPPMATH 20 "6#>%)topNoSymG6&/-%\"fG6#%\"xG,X-F(6#,&F*\"\"
\"!$7\"F/!jn?ESk4@yRo[Y8^iR-%f20O`^Le5AGf-#R%-F(6#,&F*F/!$G\"F/\"ao8J
\\A`lsa.b:T4bw!G_pum/)QzJt*yL@PGx$R;-F(6#,&F*F/!$/\"F/!fng=K)4aBy)y^.<
U0sr(fHOBmYA?.