维持
发表于 2025-3-28 18:06:45
http://reply.papertrans.cn/87/8627/862695/862695_41.png
颠簸下上
发表于 2025-3-28 20:05:03
http://reply.papertrans.cn/87/8627/862695/862695_42.png
畸形
发表于 2025-3-29 00:04:03
Evaluation of Arithmetic Expressions with Guaranteed High Accuracy this tool to develop an algorithm for the evaluation of rational expressions in several variables with high guaranteed accuracy. An extension for complex expressions, vectormatrix expressions and expressions with standard functions and interval arguments is also given.
concert
发表于 2025-3-29 03:09:47
http://reply.papertrans.cn/87/8627/862695/862695_44.png
赦免
发表于 2025-3-29 08:37:23
Inverse Standard Functions for Real and Complex Point and Interval Arguments with Dynamic Accuracy possible rounding errors are considered. The desired accuracy of the function as well as the base of the number system used are parameters of the error formula. For implementation it is only assumed that the four elementary arithmetic operations are performed with a certain number of correct digits
Adherent
发表于 2025-3-29 13:31:15
Conference proceedings 1988 for many years. A good number of meetings have been devoted to this area. The latest of these meetings was held from 30 September to 2 October, 1987, in Karlsruhe; it was co-sponsored by the GAMM Committee on "Computer Arithmetic and Scientific Computation". - - This volume combines edited versions
Vo2-Max
发表于 2025-3-29 19:33:01
http://reply.papertrans.cn/87/8627/862695/862695_47.png
transdermal
发表于 2025-3-29 22:27:07
http://reply.papertrans.cn/87/8627/862695/862695_48.png
宿醉
发表于 2025-3-30 01:34:33
The Periodic Solutions of the Oregonator and Verification of Resultsnegligibly small within graphical accuracy. This result of the “Karlsruhe enclosure methods” has been obtained with a simultaneous verification of the existence of periodic solutions in ., making use of index theory and th Poincaré-Bendixson theory.
cogitate
发表于 2025-3-30 04:25:22
Precise Evaluation of Polynomials in Several Variables. Numerical examples demonstrate the high precision of the results and show that traditional algorithms (e g nested Homer’s schemes) can fail completely for this problem. The algorithm presented here is a generalization of Böhm’s algorithm for one-dimensional polynomials, , .