Accurate Complex Multiplication in Floating-Point Arithmetic

Vincent Lefèvre 1 Jean-Michel Muller 1
1 ARIC - Arithmetic and Computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : We deal with accurate complex multiplication in binary floating-point arithmetic, with an emphasis on the case where one of the operands in a "double-word" number. We provide an algorithm that returns a complex product with normwise relative error bound close to the best possible one, i.e., the rounding unit u.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02001080
Contributor : Jean-Michel Muller <>
Submitted on : Thursday, April 4, 2019 - 4:20:58 PM
Last modification on : Monday, May 13, 2019 - 4:06:50 PM
Long-term archiving on : Friday, July 5, 2019 - 4:16:18 PM

File

MultConstComplex.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02001080, version 2

Collections

Citation

Vincent Lefèvre, Jean-Michel Muller. Accurate Complex Multiplication in Floating-Point Arithmetic. ARITH 2019 - 26th IEEE Symposium on Computer Arithmetic, Jun 2019, Kyoto, Japan. pp.1-7. ⟨hal-02001080v2⟩

Share

Metrics

Record views

215

Files downloads

54