Name
Abstract | ||
|---|---|---|
We deal with accurate complex multiplication in binary floating-point arithmetic, with an emphasis on the case where one of the operands is 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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/ARITH.2019.00013 | 2019 IEEE 26th Symposium on Computer Arithmetic (ARITH) |
Keywords | Field | DocType |
Floating-point arithmetic, Complex multiplication, Rounding error analysis | Approximation algorithm,Computer science,Floating point,Parallel computing,Operand,Parallel processing,Arithmetic,Rounding,Approximation error,Complex multiplication,Binary number | Conference |
ISSN | ISBN | Citations |
1063-6889 | 978-1-7281-3367-6 | 0 |
PageRank | References | Authors |
0.34 | 6 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vincent Lefèvre | 1 | 0 | 0.34 |
| Jean-Michel Muller | 2 | 466 | 66.61 |