Content deleted Content added
m Wording such as “effort” obfuscates the important point: what parallel is, and how tasks can be split accordingly. The addition of the word "trivial", clarifies the point being made. Also, revised some awkward wording. |
polynomial homotopy continuation methods. |
||
Line 16:
==Etymology==
"Embarrassingly" is used here in the same sense as in the phrase "an [[embarrassment of riches]]", meaning an overabundance—here referring to parallelization problems which are "embarrassingly easy".<ref>Matloff, Norman (2011). ''The Art of R Programming: A Tour of Statistical Software Design'', p.347. No Starch. {{ISBN|9781593274108}}.</ref> The term may also imply embarrassment on the part of developers or compilers: "Because so many important problems remain unsolved mainly due to their intrinsic computational complexity, it would be embarrassing not to develop parallel implementations of polynomial [[homotopy]] continuation methods."<ref>{{cite book|last1=Leykin|first1=Anton|last2=Verschelde|first2=Jan|last3=Zhuang|first3=Yan|title=Parallel Homotopy Algorithms to Solve Polynomial Systems|year=2006|journal=Proceedings of ICMS |volume=4151|pages=225–234|doi=10.1007/11832225_22|series=Lecture Notes in Computer Science|isbn=978-3-540-38084-9}}</ref> The term is first found in the literature in a 1986 book on multiprocessors by [[MATLAB]]'s creator [[Cleve Moler]],<ref name=hcmp>{{cite book
| title = Matrix Computation on Distributed Memory Multiprocessors
| author = Moler, Cleve
| |||