dc.contributor.author | Edelman, Alan | en_US |
dc.coverage.temporal | Spring 2003 | en_US |
dc.date.issued | 2003-06 | |
dc.identifier | 18.337J-Spring2003 | |
dc.identifier | local: 18.337J | |
dc.identifier | local: 6.338J | |
dc.identifier | local: IMSCP-MD5-54188fe058d3dcf6e793c05fb8f52272 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/35786 | |
dc.description.abstract | Advanced interdisciplinary introduction to modern scientific computing on parallel supercomputers. Numerical topics include dense and sparse linear algebra, N-body problems, and Fourier transforms. Geometrical topics include partitioning and mesh generation. Other topics include architectures and software systems with hands-on emphasis on understanding the realities and myths of what is possible on the world's fastest machines. | en_US |
dc.format.extent | 13566 bytes | en_US |
dc.format.extent | 13596 bytes | en_US |
dc.format.extent | 15856 bytes | en_US |
dc.format.extent | 16644 bytes | en_US |
dc.format.extent | 15643 bytes | en_US |
dc.format.extent | 15027 bytes | en_US |
dc.format.extent | 12053 bytes | en_US |
dc.format.extent | 27334 bytes | en_US |
dc.format.extent | 15795 bytes | en_US |
dc.format.extent | 12694 bytes | en_US |
dc.format.extent | 16202 bytes | en_US |
dc.format.extent | 11 bytes | en_US |
dc.format.extent | 4586 bytes | en_US |
dc.format.extent | 21366 bytes | en_US |
dc.format.extent | 11602 bytes | en_US |
dc.format.extent | 38351 bytes | en_US |
dc.format.extent | 4755 bytes | en_US |
dc.format.extent | 27322 bytes | en_US |
dc.format.extent | 25313 bytes | en_US |
dc.format.extent | 4039 bytes | en_US |
dc.format.extent | 301 bytes | en_US |
dc.format.extent | 354 bytes | en_US |
dc.format.extent | 339 bytes | en_US |
dc.format.extent | 180 bytes | en_US |
dc.format.extent | 285 bytes | en_US |
dc.format.extent | 67 bytes | en_US |
dc.format.extent | 17685 bytes | en_US |
dc.format.extent | 49 bytes | en_US |
dc.format.extent | 143 bytes | en_US |
dc.format.extent | 247 bytes | en_US |
dc.format.extent | 19283 bytes | en_US |
dc.format.extent | 244 bytes | en_US |
dc.format.extent | 1216 bytes | en_US |
dc.format.extent | 262 bytes | en_US |
dc.format.extent | 43254 bytes | en_US |
dc.format.extent | 1315584 bytes | en_US |
dc.format.extent | 23547 bytes | en_US |
dc.format.extent | 127610 bytes | en_US |
dc.format.extent | 341475 bytes | en_US |
dc.format.extent | 289783 bytes | en_US |
dc.format.extent | 991467 bytes | en_US |
dc.format.extent | 116508 bytes | en_US |
dc.format.extent | 1159172 bytes | en_US |
dc.format.extent | 859596 bytes | en_US |
dc.format.extent | 905091 bytes | en_US |
dc.format.extent | 81804 bytes | en_US |
dc.format.extent | 301177 bytes | en_US |
dc.format.extent | 231091 bytes | en_US |
dc.format.extent | 420822 bytes | en_US |
dc.format.extent | 369259 bytes | en_US |
dc.format.extent | 233899 bytes | en_US |
dc.format.extent | 143079 bytes | en_US |
dc.format.extent | 102197 bytes | en_US |
dc.format.extent | 891075 bytes | en_US |
dc.format.extent | 125309 bytes | en_US |
dc.format.extent | 225881 bytes | en_US |
dc.format.extent | 19283 bytes | en_US |
dc.format.extent | 3486 bytes | en_US |
dc.format.extent | 811 bytes | en_US |
dc.format.extent | 813 bytes | en_US |
dc.format.extent | 830 bytes | en_US |
dc.format.extent | 458 bytes | en_US |
dc.format.extent | 2097 bytes | en_US |
dc.format.extent | 28700 bytes | en_US |
dc.format.extent | 7209 bytes | en_US |
dc.format.extent | 7446 bytes | en_US |
dc.format.extent | 6938 bytes | en_US |
dc.format.extent | 7435 bytes | en_US |
dc.format.extent | 7015 bytes | en_US |
dc.format.extent | 7840 bytes | en_US |
dc.format.extent | 5939 bytes | en_US |
dc.format.extent | 8177 bytes | en_US |
dc.format.extent | 6954 bytes | en_US |
dc.format.extent | 7698 bytes | en_US |
dc.format.extent | 6912 bytes | en_US |
dc.format.extent | 7810 bytes | en_US |
dc.format.extent | 7454 bytes | en_US |
dc.format.extent | 7821 bytes | en_US |
dc.format.extent | 7479 bytes | en_US |
dc.format.extent | 6921 bytes | en_US |
dc.format.extent | 7480 bytes | en_US |
dc.format.extent | 7448 bytes | en_US |
dc.format.extent | 6886 bytes | en_US |
dc.format.extent | 8161 bytes | en_US |
dc.format.extent | 7835 bytes | en_US |
dc.format.extent | 7460 bytes | en_US |
dc.format.extent | 7858 bytes | en_US |
dc.format.extent | 7819 bytes | en_US |
dc.format.extent | 7879 bytes | en_US |
dc.format.extent | 7859 bytes | en_US |
dc.format.extent | 6884 bytes | en_US |
dc.format.extent | 7769 bytes | en_US |
dc.format.extent | 7852 bytes | en_US |
dc.format.extent | 8125 bytes | en_US |
dc.language | en-US | en_US |
dc.rights.uri | Usage Restrictions: This site (c) Massachusetts Institute of Technology 2003. Content within individual courses is (c) by the individual authors unless otherwise noted. The Massachusetts Institute of Technology is providing this Work (as defined below) under the terms of this Creative Commons public license ("CCPL" or "license"). The Work is protected by copyright and/or other applicable law. Any use of the work other than as authorized under this license is prohibited. By exercising any of the rights to the Work provided here, You (as defined below) accept and agree to be bound by the terms of this license. The Licensor, the Massachusetts Institute of Technology, grants You the rights contained here in consideration of Your acceptance of such terms and conditions. | en_US |
dc.subject | dense and sparse linear algebra | en_US |
dc.subject | N-body problems | en_US |
dc.subject | Fourier transforms | en_US |
dc.subject | partitioning | en_US |
dc.subject | mesh generation | en_US |
dc.subject | 18.337J | en_US |
dc.subject | 6.338J | en_US |
dc.subject | 18.337 | en_US |
dc.subject | 6.338 | en_US |
dc.title | 18.337J / 6.338J Applied Parallel Computing (SMA 5505), Spring 2003 | en_US |
dc.title.alternative | Applied Parallel Computing (SMA 5505) | en_US |
dc.type | Learning Object | |
dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | |