索赔 发表于 2025-3-30 10:56:25
Computer Algebra in Scientific Computing978-3-319-66320-3Series ISSN 0302-9743 Series E-ISSN 1611-3349斜 发表于 2025-3-30 15:47:39
Thomas Fehlmann,Eberhard Kranichion of infinite power series: the algorithmic representation (for each series, an algorithm is specified that, given an integer ., finds the coefficient of ., — any such algorithm defines a so called computable, or constructive, series) and a representation in an approximate form, namely, in a truncated form.BLAZE 发表于 2025-3-30 16:54:51
http://reply.papertrans.cn/24/2335/233418/233418_53.pngSTRIA 发表于 2025-3-30 21:52:59
http://reply.papertrans.cn/24/2335/233418/233418_54.pnginundate 发表于 2025-3-31 04:17:00
http://reply.papertrans.cn/24/2335/233418/233418_55.png违法事实 发表于 2025-3-31 07:40:28
http://reply.papertrans.cn/24/2335/233418/233418_56.pngpreeclampsia 发表于 2025-3-31 12:08:37
Thomas Fehlmann,Eberhard Kranichion of infinite power series: the algorithmic representation (for each series, an algorithm is specified that, given an integer ., finds the coefficient of ., — any such algorithm defines a so called computable, or constructive, series) and a representation in an approximate form, namely, in a trunccochlea 发表于 2025-3-31 15:42:42
http://reply.papertrans.cn/24/2335/233418/233418_58.pngCeliac-Plexus 发表于 2025-3-31 20:44:11
Aarthy Krishnamurthy,Rory V. O’Connorr combination of complex exponentials with integer frequencies. A fast algorithm to compute the Fourier transform is based on a binary divide and conquer strategy..In computer algebra, sparse interpolation is well-known and closely related to Prony’s method of exponential fitting, which dates back t浅滩 发表于 2025-3-31 22:28:16
https://doi.org/10.1007/978-3-030-56441-4in. The approach is based on making use of the Power Geometry Method and the computation of normal forms. We look for the complete set of necessary conditions on parameters of the system under which the system is locally integrable near the degenerate stationary point. We found earlier that the sets