added reference for complex square root

2 files changed, 17 insertions, 1 deletions

diff --git a/doc/algorithms.bib b/doc/algorithms.bib
index 18f3e98..8e468bf 100644
--- a/doc/algorithms.bib
+++ b/doc/algorithms.bib
@@ -96,3 +96,19 @@
   HAL_VERSION = {v1},
   note = {2nd edition, which contains a chapter on complex numbers}
 }
+
+@inproceedings{jeannerod:ensl-01780265,
+  TITLE = {{On the relative error of computing complex square roots in floating-point arithmetic}},
+  AUTHOR = {Jeannerod, Claude-Pierre and Muller, Jean-Michel},
+  URL = {https://hal-ens-lyon.archives-ouvertes.fr/ensl-01780265},
+  BOOKTITLE = {{ACSSC 2017 - 51st Asilomar Conference on Signals, Systems, and Computers}},
+  ADDRESS = {Pacific Grove, United States},
+  PUBLISHER = {{IEEE}},
+  PAGES = {1-4},
+  YEAR = {2017},
+  MONTH = Oct,
+  DOI = {10.1109/ACSSC.2017.8335442},
+  PDF = {https://hal-ens-lyon.archives-ouvertes.fr/ensl-01780265/file/asilomar17.pdf},
+  HAL_ID = {ensl-01780265},
+  HAL_VERSION = {v1},
+}
diff --git a/doc/algorithms.tex b/doc/algorithms.tex
index 7129454..b79be41 100644
--- a/doc/algorithms.tex
+++ b/doc/algorithms.tex
@@ -2425,7 +2425,7 @@ $k_R$ and $k_I$ will most likely not change with a larger precision.
 So one should let $k' = \max (k_R, k_I)$, replace $N$ by $N + k'$
 and adapt the precision and number of iterations accordingly.
 
-\nocite{Baudin11,Stewart85,Priest04,muller:hal-01766584}
+\nocite{Baudin11,Stewart85,Priest04,muller:hal-01766584,jeannerod:ensl-01780265}
 \bibliographystyle{acm}
 \bibliography{algorithms}