Locale
发表于 2025-3-23 11:52:16
Analytic Solutions of Linear Difference Equations, Formal Series, and Bottom Summation,difference equation .(.) = 0 with polynomial coefficients, and that a summing operator for . exists (such an operator can be found – if it exists – by the Accurate Summation algorithm, or alternatively, by Gosper’s algorithm when ord . = 1)..The notion of . which covers the case where .(z) has poles in . is introduced.
lymphedema
发表于 2025-3-23 15:55:52
http://reply.papertrans.cn/24/2335/233407/233407_12.png
Melodrama
发表于 2025-3-23 20:50:44
An Efficient LLL Gram Using Buffered Transformations,r-Euchner algorithm and introducing the use of buffered transformations allows us to obtain a major improvement in reduction time. Unlike previous work, we are able to achieve the improvement while obtaining a strong reduction result and maintaining the stability of the reduction algorithm.
范围广
发表于 2025-3-23 23:54:15
http://reply.papertrans.cn/24/2335/233407/233407_14.png
Flagging
发表于 2025-3-24 03:01:54
An Algorithm for Construction of Normal Forms,the corresponding transformations without computer algebra packages. Here we describe an algorithm for normalization of nonlinear autonomous ODEs. Some implementations of these algorithms are also discussed.
DEAWL
发表于 2025-3-24 07:07:50
http://reply.papertrans.cn/24/2335/233407/233407_16.png
微粒
发表于 2025-3-24 13:50:45
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/233407.jpg
Matrimony
发表于 2025-3-24 17:49:27
https://doi.org/10.1007/978-1-4471-7475-2difference equation .(.) = 0 with polynomial coefficients, and that a summing operator for . exists (such an operator can be found – if it exists – by the Accurate Summation algorithm, or alternatively, by Gosper’s algorithm when ord . = 1)..The notion of . which covers the case where .(z) has poles
最小
发表于 2025-3-24 21:38:53
https://doi.org/10.1007/978-1-4471-7475-2of the roots of polynomials. Empirical results presented in this paper verify that this implementation makes the CF method . faster than the Vincent-Collins-Akritas bisection method, or any of its variants.
Barter
发表于 2025-3-25 00:02:23
https://doi.org/10.1007/978-1-4471-7475-2r-Euchner algorithm and introducing the use of buffered transformations allows us to obtain a major improvement in reduction time. Unlike previous work, we are able to achieve the improvement while obtaining a strong reduction result and maintaining the stability of the reduction algorithm.