GULP 发表于 2025-3-25 05:26:23
0302-9743their computation. One usesvectorprocessing on the Cray and achieves significant speed-ups.The other uses a distributed memory multiprocessor andeffectively explores the trade-offs involved with differentinterconnect topologies of the multiprocessors.978-3-540-55328-1978-3-540-47026-7Series ISSN 0302-9743 Series E-ISSN 1611-3349inflate 发表于 2025-3-25 10:25:21
,Embarrassingly parallel algorithms for algebraic number arithmetic — and some less trivial issues,.. The best known power-sum algorithm is based on Newton‘s identity, which may be treated as a linear recurrence, whose solution, conventionally understood to be of complexity O(.), will dominate the time of the multiplication algorithm and significantly increase the addition time. A parallel algoriExposition 发表于 2025-3-25 12:42:46
http://reply.papertrans.cn/24/2335/233403/233403_23.pngthrombosis 发表于 2025-3-25 18:37:05
The S-threads environment for parallel symbolic computation,AMITY 发表于 2025-3-26 00:00:35
http://reply.papertrans.cn/24/2335/233403/233403_25.pngCommonwealth 发表于 2025-3-26 03:13:30
http://reply.papertrans.cn/24/2335/233403/233403_26.pngBmd955 发表于 2025-3-26 06:07:37
http://reply.papertrans.cn/24/2335/233403/233403_27.png脊椎动物 发表于 2025-3-26 11:26:59
http://reply.papertrans.cn/24/2335/233403/233403_28.png放纵 发表于 2025-3-26 14:17:15
http://reply.papertrans.cn/24/2335/233403/233403_29.png易于 发表于 2025-3-26 17:09:12
Reliability and Risk in Perspective,nted by a list of character strings recursively involving root indices, +, −, x, and integer terms or radicands. Algorithms for sums, products, etc., in the defining polynomial representation, are based on the theory of symmetric functions and have relatively efficient implementations using polynomi