{"id":181984,"date":"2009-06-12T00:00:00","date_gmt":"2009-10-31T09:15:47","guid":{"rendered":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/msr-research-item\/modern-computer-arithmetic\/"},"modified":"2018-07-19T08:24:01","modified_gmt":"2018-07-19T15:24:01","slug":"modern-computer-arithmetic","status":"publish","type":"msr-video","link":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/video\/modern-computer-arithmetic\/","title":{"rendered":"Modern Computer Arithmetic"},"content":{"rendered":"<div class=\"asset-content\">\n<p>This talk is about a book in progress with Richard Brent (ANU, Canberra, Australia). &#8220;Modern Computer Arithmetic&#8221; collects in the same document all state-of-the-art algorithms in multiple precision arithmetic (integers, integers modulo n, floating-point numbers). The best current reference on that topic is volume 2 from Knuth&#8217;s &#8220;The art of computer programming&#8221;, which misses some new important algorithms (divide and conquer division, other variants of FFT multiplication, floating-point algorithms, &#8230;) Our aim is to give detailed algorithms: (i) for all operations (not just multiplication as many text books), (ii) for all size ranges (not just schoolbook methods or FFT-based methods), (iii) and including all details (for example how to properly deal with carries for integer algorithms, or a rigorous analysis of roundoff errors for floating-point algorithms).<br \/>\nThe talk will say a few words about the history of this book, and then will focus on a few algorithms from the book, some of which are not well known.<br \/>\nUrl of the book: http:\/\/www.loria.fr\/~zimmerma\/mca\/pub226.html<\/p>\n<\/div>\n<p><!-- .asset-content --><\/p>\n","protected":false},"excerpt":{"rendered":"<p>This talk is about a book in progress with Richard Brent (ANU, Canberra, Australia). &#8220;Modern Computer Arithmetic&#8221; collects in the same document all state-of-the-art algorithms in multiple precision arithmetic (integers, integers modulo n, floating-point numbers). The best current reference on that topic is volume 2 from Knuth&#8217;s &#8220;The art of computer programming&#8221;, which misses some [&hellip;]<\/p>\n","protected":false},"featured_media":194397,"template":"","meta":{"msr-url-field":"","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"_classifai_error":"","msr_hide_image_in_river":0,"footnotes":""},"research-area":[13558],"msr-video-type":[],"msr-locale":[268875],"msr-post-option":[],"msr-session-type":[],"msr-impact-theme":[],"msr-pillar":[],"msr-episode":[],"msr-research-theme":[],"class_list":["post-181984","msr-video","type-msr-video","status-publish","has-post-thumbnail","hentry","msr-research-area-security-privacy-cryptography","msr-locale-en_us"],"msr_download_urls":"","msr_external_url":"https:\/\/youtu.be\/6TDoZw6f5J0","msr_secondary_video_url":"","msr_video_file":"","_links":{"self":[{"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-video\/181984","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-video"}],"about":[{"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/types\/msr-video"}],"version-history":[{"count":1,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-video\/181984\/revisions"}],"predecessor-version":[{"id":496109,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-video\/181984\/revisions\/496109"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/media\/194397"}],"wp:attachment":[{"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/media?parent=181984"}],"wp:term":[{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=181984"},{"taxonomy":"msr-video-type","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-video-type?post=181984"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=181984"},{"taxonomy":"msr-post-option","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-post-option?post=181984"},{"taxonomy":"msr-session-type","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-session-type?post=181984"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=181984"},{"taxonomy":"msr-pillar","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-pillar?post=181984"},{"taxonomy":"msr-episode","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-episode?post=181984"},{"taxonomy":"msr-research-theme","embeddable":true,"href":"https:\/\/newed.any0.dpdns.org\/en-us\/research\/wp-json\/wp\/v2\/msr-research-theme?post=181984"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}