The following pages link to Jean-Michel Muller (Q342872):
Displaying 50 items.
- Sharp error bounds for complex floating-point inversion (Q342874) (← links)
- Choosing starting values for certain Newton-Raphson iterations (Q817866) (← links)
- On the maximum relative error when computing integer powers by iterated multiplications in floating-point arithmetic (Q891788) (← links)
- (Q1074296) (redirect page) (← links)
- Parallel QR decomposition of a rectangular matrix (Q1074297) (← links)
- Some operators for on-line radix-2 computations (Q1344544) (← links)
- On-the-fly range reduction (Q1405457) (← links)
- (Q1580043) (redirect page) (← links)
- A radix-10 BKM algorithm for computing transcendentals on pocket computers (Q1580045) (← links)
- Formal verification of a floating-point expansion renormalization algorithm (Q1687723) (← links)
- A few results on table-based methods (Q1971081) (← links)
- Proposal for a standardization of mathematical function implementation in floating-point arith\-metic (Q2387784) (← links)
- Some issues related to double rounding (Q2434938) (← links)
- Complex square root with operand prescaling (Q2477433) (← links)
- Number of solutions of a binary of the equation \(A^2+B^2=C^2+C\) (Q2565942) (← links)
- CAMPARY: Cuda Multiple Precision Arithmetic Library and Applications (Q2819222) (← links)
- Error bounds on complex floating-point multiplication with an FMA (Q2953212) (← links)
- Comparison between Binary and Decimal Floating-Point Numbers (Q2985374) (← links)
- Arithmetic Algorithms for Extended Precision Using Floating-Point Expansions (Q2985528) (← links)
- Computing correctly rounded integer powers in floating-point arithmetic (Q2989084) (← links)
- (Q3031898) (← links)
- Elementary Functions (Q3186642) (← links)
- On Ziv's rounding test (Q3189688) (← links)
- Emulating Round-to-Nearest Ties-to-Zero “Augmented” Floating-Point Operations Using Round-to-Nearest Ties-to-Even Arithmetic (Q3389883) (← links)
- A new range-reduction algorithm (Q3417014) (← links)
- Computing machine-efficient polynomial approximations (Q3549157) (← links)
- Handbook of Floating-Point Arithmetic (Q3629031) (← links)
- (Q3709932) (← links)
- (Q3740240) (← links)
- Une méthodologie du calcul hardware des fonctions élémentaires (Q3750023) (← links)
- A Way to Build Efficient Carry-Skip Adders (Q3786426) (← links)
- (Q4026825) (← links)
- (Q4234512) (← links)
- (Q4373854) (← links)
- BKM: a new hardware algorithm for complex elementary functions (Q4419750) (← links)
- Some characterizations of functions computable in on-line arithmetic (Q4420054) (← links)
- (Q4520280) (← links)
- Reciprocation, square root, inverse square root, and some elementary functions using small multipliers (Q4571365) (← links)
- Semi-logarithmic number systems (Q4571440) (← links)
- On the Robustness of the 2Sum and Fast2Sum Algorithms (Q4581354) (← links)
- Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic (Q4581373) (← links)
- Correctly Rounded Multiplication by Arbitrary Precision Constants (Q4589537) (← links)
- Handbook of Floating-Point Arithmetic (Q4609588) (← links)
- (Q4725611) (← links)
- (Q4851661) (← links)
- (Q4885353) (← links)
- (Q4949366) (← links)
- Automatic Generation of Modular Multipliers for FPGA Applications (Q4975045) (← links)
- Formalization of Double-Word Arithmetic, and Comments on “Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic” (Q5066604) (← links)
- Formal Correctness of Comparison Algorithms Between Binary64 and Decimal64 Floating-Point Numbers (Q5086229) (← links)
