Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors - MaRDI portal

Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors

From MaRDI portal

Publication:4943883

Jump to:navigation, search

DOI10.1137/S0097539798341594zbMath0967.65057MaRDI QIDQ4943883

Jie Wang, Ming-Yang Kao

Publication date: 19 March 2000

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimization error analysis roundoff error approximation algorithms NP-hardness floating-point summation addition trees

Mathematics Subject Classification ID

Roundoff error (65G50) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (2)

Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees ⋮ A generalized Kahan-Babuška-summation-algorithm

This page was built for publication: Linear-Time Approximation Algorithms for Computing Numerical Summation with Provably Small Errors

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4943883&oldid=19361168"