標(biāo)題: Titlebook: Handbook of Floating-Point Arithmetic; Jean-Michel Muller,Nicolas Brisebarre,Serge Torres Book 20101st edition Birkh?user Boston 2010 Algo [打印本頁] 作者: GRASS 時間: 2025-3-21 19:39
書目名稱Handbook of Floating-Point Arithmetic影響因子(影響力)
書目名稱Handbook of Floating-Point Arithmetic影響因子(影響力)學(xué)科排名
書目名稱Handbook of Floating-Point Arithmetic網(wǎng)絡(luò)公開度
書目名稱Handbook of Floating-Point Arithmetic網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Handbook of Floating-Point Arithmetic被引頻次
書目名稱Handbook of Floating-Point Arithmetic被引頻次學(xué)科排名
書目名稱Handbook of Floating-Point Arithmetic年度引用
書目名稱Handbook of Floating-Point Arithmetic年度引用學(xué)科排名
書目名稱Handbook of Floating-Point Arithmetic讀者反饋
書目名稱Handbook of Floating-Point Arithmetic讀者反饋學(xué)科排名
作者: RADE 時間: 2025-3-22 00:00 作者: Barter 時間: 2025-3-22 02:20
https://doi.org/10.1007/978-3-658-32173-4ns arise in many fields of numerical computing. Computing sums is required, e.g., in numerical integration and the computation of means and variances. Dot products appear everywhere in numerical linear algebra. Polynomials are used to approximate many functions (see Chapter 11).作者: 共同確定為確 時間: 2025-3-22 05:46
https://doi.org/10.1007/978-3-663-07617-9ion, subtraction, multiplication, division, and square root. We will also study the fused multiply-add (FMA) operator. We review here some of the known properties and algorithms used to implement each of those operators. Chapter 9 and Chapter 10 will detail some examples of actual implementations in, respectively, hardware and software.作者: 蕁麻 時間: 2025-3-22 11:51
https://doi.org/10.1007/978-3-658-37731-1ndeed, floating-point arithmetic introduces numerous special cases, and examining all the details would be tedious. As a consequence, the certification process tends to focus on the main parts of the correctness proof, so that it does not grow out of reach.作者: 拍下盜公款 時間: 2025-3-22 13:45
Enhanced Floating-Point Sums, Dot Products, and Polynomial Valuesns arise in many fields of numerical computing. Computing sums is required, e.g., in numerical integration and the computation of means and variances. Dot products appear everywhere in numerical linear algebra. Polynomials are used to approximate many functions (see Chapter 11).作者: 使入迷 時間: 2025-3-22 20:47
Algorithms for the Five Basic Operationsion, subtraction, multiplication, division, and square root. We will also study the fused multiply-add (FMA) operator. We review here some of the known properties and algorithms used to implement each of those operators. Chapter 9 and Chapter 10 will detail some examples of actual implementations in, respectively, hardware and software.作者: WATER 時間: 2025-3-22 23:39
Formalisms for Certifying Floating-Point Algorithmsndeed, floating-point arithmetic introduces numerous special cases, and examining all the details would be tedious. As a consequence, the certification process tends to focus on the main parts of the correctness proof, so that it does not grow out of reach.作者: 包裹 時間: 2025-3-23 01:44 作者: 使?jié)M足 時間: 2025-3-23 07:40 作者: 不斷的變動 時間: 2025-3-23 12:17
https://doi.org/10.1007/978-3-476-98924-6A. in previous chapters (especially in Chapters 2 and 4), requiring correctly rounded arithmetic operations has a number of advantages.作者: Lymphocyte 時間: 2025-3-23 16:13
The Fused Multiply-Add InstructionT. (FMA) instruction makes it possible to evaluate ., where ., and . are floating-point numbers, with one final rounding only.作者: 施加 時間: 2025-3-23 19:18
Software Implementation of Floating-Point ArithmeticT. has presented the basic paradigms used for implementing floating-point arithmetic in hardware. However, some processors may not have such dedicated hardware, mainly for cost reasons. When it is necessary to handle floating-point numbers on such processors, one solution is to implement floating-point arithmetic in software.作者: 過份好問 時間: 2025-3-24 00:46
Solving the Table Maker’s DilemmaA. in previous chapters (especially in Chapters 2 and 4), requiring correctly rounded arithmetic operations has a number of advantages.作者: Subjugate 時間: 2025-3-24 04:19 作者: 不可比擬 時間: 2025-3-24 07:20 作者: SOB 時間: 2025-3-24 13:17
Jean-Michel Muller,Nicolas Brisebarre,Serge TorresFirst comprehensive treatment of floating-point arithmetic.Provides a complete overview of a topic that is widely used to implement real-number arithmetic on modern computers, yet is far from being fu作者: Banister 時間: 2025-3-24 16:06
http://image.papertrans.cn/h/image/421331.jpg作者: 圓柱 時間: 2025-3-24 19:19 作者: 領(lǐng)先 時間: 2025-3-25 00:01 作者: 期滿 時間: 2025-3-25 03:37
Floating-Point Formats and Environmentthat circuit and system manufacturers could build much more efficient machines without them should read that paper and think about it. Even if there were at that time a few reasonably good environments, the various systems available then were so different that writing portable yet reasonably efficient numerical software was extremely difficult.作者: Adornment 時間: 2025-3-25 10:14
Basic Properties and Algorithmsmats and operations. The behavior of a sequence of operations becomes at least partially. predictable (see Chapter 7) for more details on this). We therefore can build algorithms and proofs that use these specifications.作者: Nomadic 時間: 2025-3-25 15:01
Hardware Implementation of Floating-Point Arithmeticer, obtaining the correct rounding of the result may require considerable design effort and the use of nonarithmetic primitives such as leading-zero counters and shifters. This chapter details the implementation of these algorithms in hardware, using digital logic.作者: Neuralgia 時間: 2025-3-25 16:47 作者: 悲觀 時間: 2025-3-25 22:40 作者: 脆弱吧 時間: 2025-3-26 00:17 作者: agnostic 時間: 2025-3-26 04:44 作者: Outwit 時間: 2025-3-26 08:56
https://doi.org/10.1007/978-3-658-45581-1that circuit and system manufacturers could build much more efficient machines without them should read that paper and think about it. Even if there were at that time a few reasonably good environments, the various systems available then were so different that writing portable yet reasonably efficient numerical software was extremely difficult.作者: 背書 時間: 2025-3-26 13:03 作者: 易碎 時間: 2025-3-26 18:51 作者: ITCH 時間: 2025-3-26 22:49
https://doi.org/10.1007/978-3-658-40592-2crude as approximations of the real numbers. This may occur for example when dealing with ill-conditioned numerical problems: internal computations with very high precision may be needed to obtain a meaningful final result.作者: Ingenuity 時間: 2025-3-27 02:39
https://doi.org/10.1007/978-3-658-38348-0emory consumption, size of code, etc.). With regard to performance, one will also resort to different methods depending on whether one wishes to optimize average performance or worst-case performance.作者: BATE 時間: 2025-3-27 08:45
Evaluating Floating-Point Elementary Functionsemory consumption, size of code, etc.). With regard to performance, one will also resort to different methods depending on whether one wishes to optimize average performance or worst-case performance.作者: 祖?zhèn)髫敭a(chǎn) 時間: 2025-3-27 09:50 作者: 隼鷹 時間: 2025-3-27 16:03 作者: Amendment 時間: 2025-3-27 18:27 作者: attenuate 時間: 2025-3-27 23:58 作者: 多嘴 時間: 2025-3-28 05:43
https://doi.org/10.1007/978-3-322-97241-5. is the significand of ., and . is its .. And yet, portability, accuracy, and the ability to prove interesting and useful properties as well as to design smart algorithms require more rigorous definitions, and much care in the specifications. This is the first purpose of this chapter. The second on作者: Camouflage 時間: 2025-3-28 07:07
https://doi.org/10.1007/978-3-658-45581-1s the rather messy situation of floating-point arithmetic before the 1980s. Anybody who estimates that the current standards are too constraining and that circuit and system manufacturers could build much more efficient machines without them should read that paper and think about it. Even if there w作者: HALL 時間: 2025-3-28 11:24
Konzeption Empirische Literaturwissenschaft, such as the ones given in the various successive IEEE standards. Thanks to these standards, we now have an accurate definition of floating-point formats and operations. The behavior of a sequence of operations becomes at least partially. predictable (see Chapter 7) for more details on this). We th作者: debunk 時間: 2025-3-28 17:31
https://doi.org/10.1007/978-3-658-32173-4ns arise in many fields of numerical computing. Computing sums is required, e.g., in numerical integration and the computation of means and variances. Dot products appear everywhere in numerical linear algebra. Polynomials are used to approximate many functions (see Chapter 11).作者: indigenous 時間: 2025-3-28 20:36 作者: vibrant 時間: 2025-3-28 23:46
https://doi.org/10.1007/978-3-663-07617-9ion, subtraction, multiplication, division, and square root. We will also study the fused multiply-add (FMA) operator. We review here some of the known properties and algorithms used to implement each of those operators. Chapter 9 and Chapter 10 will detail some examples of actual implementations in作者: 傀儡 時間: 2025-3-29 03:07 作者: 掃興 時間: 2025-3-29 07:51
https://doi.org/10.1007/978-3-658-38348-0appear everywhere in scientific computing; thus being able to evaluate them quickly and accurately is important for many applications. Various very different methods have been used for evaluating them: polynomial or rational approximations, shift-and-add algorithms, table-based methods, etc. The cho作者: SUE 時間: 2025-3-29 13:21
https://doi.org/10.1007/978-3-658-37731-1ndeed, floating-point arithmetic introduces numerous special cases, and examining all the details would be tedious. As a consequence, the certification process tends to focus on the main parts of the correctness proof, so that it does not grow out of reach.作者: 小步走路 時間: 2025-3-29 17:11
https://doi.org/10.1007/978-3-658-40592-2fficient. There are reasonably rare cases when the binary64/decimal64 or binary128/decimal128 floating-point numbers of the IEEE 754 standard are too crude as approximations of the real numbers. This may occur for example when dealing with ill-conditioned numerical problems: internal computations wi作者: Glucose 時間: 2025-3-29 19:42 作者: 向宇宙 時間: 2025-3-30 00:40
Definitions and Basic Notions. is the significand of ., and . is its .. And yet, portability, accuracy, and the ability to prove interesting and useful properties as well as to design smart algorithms require more rigorous definitions, and much care in the specifications. This is the first purpose of this chapter. The second on作者: 身體萌芽 時間: 2025-3-30 04:17
Floating-Point Formats and Environments the rather messy situation of floating-point arithmetic before the 1980s. Anybody who estimates that the current standards are too constraining and that circuit and system manufacturers could build much more efficient machines without them should read that paper and think about it. Even if there w作者: 悲痛 時間: 2025-3-30 11:40
Basic Properties and Algorithms, such as the ones given in the various successive IEEE standards. Thanks to these standards, we now have an accurate definition of floating-point formats and operations. The behavior of a sequence of operations becomes at least partially. predictable (see Chapter 7) for more details on this). We th作者: 繞著哥哥問 時間: 2025-3-30 12:37
Enhanced Floating-Point Sums, Dot Products, and Polynomial Valuesns arise in many fields of numerical computing. Computing sums is required, e.g., in numerical integration and the computation of means and variances. Dot products appear everywhere in numerical linear algebra. Polynomials are used to approximate many functions (see Chapter 11).作者: CRANK 時間: 2025-3-30 18:00 作者: 壯觀的游行 時間: 2025-3-30 21:00
Algorithms for the Five Basic Operationsion, subtraction, multiplication, division, and square root. We will also study the fused multiply-add (FMA) operator. We review here some of the known properties and algorithms used to implement each of those operators. Chapter 9 and Chapter 10 will detail some examples of actual implementations in
