You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: docs/references/bib.bib
+31-1Lines changed: 31 additions & 1 deletion
Original file line number
Diff line number
Diff line change
@@ -2353,10 +2353,40 @@ @article{lawson:1979a
2353
2353
month = {sep},
2354
2354
number = {3},
2355
2355
numpages = {2},
2356
-
pages = {324-325},
2356
+
pages = {324--325},
2357
2357
publisher = {Association for Computing Machinery},
2358
2358
title = {{Algorithm 539: Basic Linear Algebra Subprograms for Fortran Usage [F1]}},
2359
2359
url = {https://doi.org/10.1145/355841.355848},
2360
2360
volume = {5},
2361
2361
year = {1979},
2362
2362
}
2363
+
2364
+
@article{neumair:1974a,
2365
+
abstract = {The rounding‐error arising during summation can be interpreted as a measure for the quality of the procedure used. In the following, a‐priori‐bounds for this rounding‐error are used to compare several summation procedures, e.g. the common procedure and the method of Kahan‐Babuška.},
2366
+
author = {Arnold Neumaier},
2367
+
doi = {10.1002/zamm.19740540106},
2368
+
journal = {Zeitschrift für Angewandte Mathematik und Mechanik},
abstract = {In this article, we combine recursive summation techniques with Kahan-Babu{\v s}ka type balancing strategies {$[$}1{$]$}, {$[$}7{$]$} to get highly accurate summation formulas. An i-th algorithm have only error beyond 1upl and thus allows to sum many millions of numbers with high accuracy. The additional afford is a small multiple of the naive summation. In addition we show that these algorithms could be modified to provide tight upper and lower bounds for use with interval arithmetic.},
0 commit comments