找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Scientific Computation with Automatic Result Verification; Ulrich Kulisch,Hans J. Stetter Conference proceedings 1988 Springer-Verlag/Wien

[复制链接]
楼主: dentin
发表于 2025-3-28 18:06:45 | 显示全部楼层
发表于 2025-3-28 20:05:03 | 显示全部楼层
发表于 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.
发表于 2025-3-29 03:09:47 | 显示全部楼层
发表于 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
发表于 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
发表于 2025-3-29 19:33:01 | 显示全部楼层
发表于 2025-3-29 22:27:07 | 显示全部楼层
发表于 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.
发表于 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, [4], [5].
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-23 00:16
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表