{"id":23,"date":"2023-08-02T14:41:29","date_gmt":"2023-08-02T17:41:29","guid":{"rendered":"https:\/\/disciplinas.ime.unicamp.br\/ms211\/?page_id=23"},"modified":"2023-08-09T13:31:57","modified_gmt":"2023-08-09T16:31:57","slug":"material-didatico","status":"publish","type":"page","link":"https:\/\/disciplinas.ime.unicamp.br\/ms211\/material-didatico\/","title":{"rendered":"Material Did\u00e1tico"},"content":{"rendered":"\n<h2 class=\"wp-block-heading has-cyan-bluish-gray-background-color has-background\">Did\u00e1tica Acad\u00eamica<\/h2>\n\n\n\n<h3 class=\"wp-block-heading\">Notas de aulas introdut\u00f3rias<\/h3>\n\n\n\n<ul class=\"wp-block-list\">\n<li><a href=\"http:\/\/www.ime.unicamp.br\/~pulino\/ALESA\/\" target=\"_blank\" rel=\"noreferrer noopener\">\u00c1lgebra Linear e suas Aplica\u00e7\u00f5es<\/a><\/li>\n\n\n\n<li><a href=\"\/ms211\/wp-content\/uploads\/sites\/4\/2023\/08\/pontoflutuante.pdf\">Aritm\u00e9tica de Ponto Flutuante (texto de M\u00e1rcia A Gomes Ruggiero)<\/a><\/li>\n\n\n\n<li><a href=\"\/ms211\/wp-content\/uploads\/sites\/4\/2023\/08\/CN1Sem2015.pdf\">Condicionamento de algoritmos (texto de Eduardo Abreu)<\/a><\/li>\n\n\n\n<li><a href=\"https:\/\/www.ime.unicamp.br\/~biloti\/an\/211\/\" target=\"_blank\" rel=\"noreferrer noopener\">Curso on-line de C\u00e1lculo Num\u00e9rico do professor Ricardo Biloti<\/a><\/li>\n\n\n\n<li><a href=\"http:\/\/www.youtube.com\/watch?v=lempeC72Tyg&amp;feature=c4-overview-vl&amp;list=PLFBA21F349930F92F\" target=\"_blank\" rel=\"noreferrer noopener\">Cursos Unicamp &#8211; C\u00e1lculo III<\/a><\/li>\n\n\n\n<li><a href=\"\/ms211\/wp-content\/uploads\/sites\/4\/2023\/08\/sistemas_v2.pdf\">Palestra do Professor Aur\u00e9lio sobre Sistemas Lineares<\/a><\/li>\n\n\n\n<li><a href=\"\/ms211\/wp-content\/uploads\/sites\/4\/2023\/08\/sistemaslin.pdf\">Sistemas Lineares (texto de Jos\u00e9 Mario Martinez e Ana Friedlander)<\/a><\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading\">Linguagem de programa\u00e7\u00e3o<\/h3>\n\n\n\n<p class=\"wp-block-paragraph\">\u00c9 v\u00e1lido reiterar que a teoria para o desenvolvimento de m\u00e9todos construtivos de aproxima\u00e7\u00e3o (algoritmos num\u00e9ricos) \u00e9 baseada em resultados matem\u00e1ticos s\u00f3lidos e que m\u00e9todos num\u00e9ricos n\u00e3o s\u00e3o dependentes de uma&nbsp;<a href=\"http:\/\/pt.wikipedia.org\/wiki\/Linguagem_de_programa%C3%A7%C3%A3o\">linguagem de programa\u00e7\u00e3o<\/a>&nbsp;particular. Veja a seguir uma lista n\u00e3o exaustiva, e sem uma ordem de prefer\u00eancia, de ambientes \u00fateis de programa\u00e7\u00e3o de &#8220;alto n\u00edvel&#8221; e de &#8220;baixo n\u00edvel&#8221;.<\/p>\n\n\n\n<h3 class=\"wp-block-heading\">Alto n\u00edvel:<\/h3>\n\n\n\n<ul class=\"wp-block-list\">\n<li><a href=\"http:\/\/www.haskell.org\/haskellwiki\/Haskell\" target=\"_blank\" rel=\"noreferrer noopener\">Haskell<\/a><\/li>\n\n\n\n<li><a href=\"http:\/\/www.maplesoft.com\/products\/maple\/\" target=\"_blank\" rel=\"noreferrer noopener\">Maple<\/a><\/li>\n\n\n\n<li><a href=\"http:\/\/www.wolfram.com\/mathematica\/\" target=\"_blank\" rel=\"noreferrer noopener\">Mathematica<\/a><\/li>\n\n\n\n<li><a href=\"http:\/\/www.mathworks.com\/academia\/student_center\/tutorials\/launchpad.html\" target=\"_blank\" rel=\"noreferrer noopener\">Matlab<\/a><\/li>\n\n\n\n<li><a rel=\"noreferrer noopener\" href=\"http:\/\/www.gnu.org\/software\/octave\/\" target=\"_blank\">Octave<\/a><\/li>\n\n\n\n<li><a href=\"https:\/\/www.python.org\/\">Python<\/a><\/li>\n\n\n\n<li><a href=\"https:\/\/www.scilab.org\/\" target=\"_blank\" rel=\"noreferrer noopener\">Scilab<\/a><\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading\">Baixo n\u00edvel:<\/h3>\n\n\n\n<ul class=\"wp-block-list\">\n<li><a href=\"https:\/\/www.w3schools.com\/c\/index.php\" target=\"_blank\" rel=\"noreferrer noopener\">C<\/a><\/li>\n\n\n\n<li><a href=\"http:\/\/en.cppreference.com\/w\/\" target=\"_blank\" rel=\"noreferrer noopener\">C++<\/a><\/li>\n\n\n\n<li><a href=\"http:\/\/www.softwarepreservation.org\/projects\/FORTRAN\/\" target=\"_blank\" rel=\"noreferrer noopener\">Fortran<\/a><\/li>\n\n\n\n<li><a href=\"http:\/\/www.inf.ethz.ch\/personal\/wirth\/\" target=\"_blank\" rel=\"noreferrer noopener\">Pascal<\/a><\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading\">V\u00eddeos cient\u00edficos e outros materiais<\/h3>\n\n\n\n<ul class=\"wp-block-list\">\n<li><a href=\"http:\/\/history.siam.org\/\" target=\"_blank\" rel=\"noreferrer noopener\">The History of Numerical Analysis and Scientific Computing<\/a><\/li>\n\n\n\n<li><a href=\"http:\/\/www.geogebra.org\/\" target=\"_blank\" rel=\"noreferrer noopener\">Geogebra<\/a><\/li>\n\n\n\n<li><a href=\"http:\/\/video.impa.br\/index.php?page=etienne-ghys-laudations-for-fields-medalist-artur-avila\" target=\"_blank\" rel=\"noreferrer noopener\">Laudations for Fields Medalist: Artur Avila (v\u00eddeo)<\/a><\/li>\n\n\n\n<li><a href=\"http:\/\/www.impa.br\/opencms\/pt\/destaques\/download_destaque\/news_release_avila.pdf\" target=\"_blank\" rel=\"noreferrer noopener\">The Work of Artur Avila (em pdf)<\/a><\/li>\n\n\n\n<li><a href=\"http:\/\/www.wolframalpha.com\/\" target=\"_blank\" rel=\"noreferrer noopener\">Wolfram|Alpha: Computational Knowledge Engine<\/a><\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading has-cyan-bluish-gray-background-color has-background\">Ci\u00eancia e Aplica\u00e7\u00f5es<\/h2>\n\n\n\n<h3 class=\"wp-block-heading\">Artigos<\/h3>\n\n\n\n<ul class=\"wp-block-list\">\n<li><a href=\"\/ms211\/wp-content\/uploads\/sites\/4\/2023\/08\/machine-calculation-complex-fourier.pdf\">An algorithm for the machine calculation of complex fourier series<\/a><\/li>\n\n\n\n<li><a href=\"\/ms211\/wp-content\/uploads\/sites\/4\/2023\/08\/complexidade-computacao-real.pdf\">Complexidade C\u00e1lculo Real<\/a><\/li>\n\n\n\n<li><a href=\"\/ms211\/wp-content\/uploads\/sites\/4\/2023\/08\/real-computation-model.pdf\">Computa\u00e7\u00e3o Real (precis\u00e3o infinita)<\/a><\/li>\n\n\n\n<li><a href=\"http:\/\/www.ams.org\/samplings\/feature-column\/fcarc-pagerank\" target=\"_blank\" rel=\"noreferrer noopener\">How Google Finds Your Needle in the Web&#8217;s Haystack<\/a><\/li>\n\n\n\n<li><a href=\"\/ms211\/wp-content\/uploads\/sites\/4\/2023\/08\/NAessay.pdf\">Numerical Analysis &#8211; The Need for Numerical Computation<\/a><\/li>\n\n\n\n<li><a href=\"\/ms211\/wp-content\/uploads\/sites\/4\/2023\/08\/Ten-digit.pdf\">Ten digit problems<\/a><\/li>\n\n\n\n<li><a href=\"http:\/\/epubs.siam.org\/doi\/abs\/10.1137\/050623280?journalCode=siread&amp;\" target=\"_blank\" rel=\"noreferrer noopener\">The $25,000,000,000 Eigenvector: The Linear Algebra behind Google<\/a><\/li>\n\n\n\n<li><a href=\"\/ms211\/wp-content\/uploads\/sites\/4\/2023\/08\/LIoydTrefethen.pdf\">The definiton of numerical analysis<\/a><\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading\">Aritm\u00e9tica de Ponto Flutuante &amp; Relatos de desastres devidos a propaga\u00e7\u00e3o de erros num\u00e9ricos<\/h3>\n\n\n\n<ul class=\"wp-block-list\">\n<li><a href=\"http:\/\/www5.in.tum.de\/~huckle\/bugse.html\" target=\"_blank\" rel=\"noreferrer noopener\">Collection of Software Bugs<\/a><\/li>\n\n\n\n<li><a href=\"http:\/\/www.cs.berkeley.edu\/~wkahan\" target=\"_blank\" rel=\"noreferrer noopener\">Sobre aritm\u00e9tica de ponto flutuante<\/a><\/li>\n\n\n\n<li><a href=\"http:\/\/www.ima.umn.edu\/~arnold\/disasters\" target=\"_blank\" rel=\"noreferrer noopener\">Some disasters attributable to bad numerical computing<\/a><\/li>\n\n\n\n<li><a href=\"http:\/\/ta.twi.tudelft.nl\/nw\/users\/vuik\/wi211\/disasters.html\" target=\"_blank\" rel=\"noreferrer noopener\">Some disasters caused by numerical errors<\/a><\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Did\u00e1tica Acad\u00eamica Notas de aulas introdut\u00f3rias Linguagem de programa\u00e7\u00e3o \u00c9 v\u00e1lido reiterar que a teoria para o desenvolvimento de m\u00e9todos construtivos de aproxima\u00e7\u00e3o (algoritmos num\u00e9ricos) \u00e9 baseada em resultados matem\u00e1ticos s\u00f3lidos e que m\u00e9todos num\u00e9ricos n\u00e3o s\u00e3o dependentes de uma&nbsp;linguagem de programa\u00e7\u00e3o&nbsp;particular. Veja a seguir uma lista n\u00e3o exaustiva, e sem uma ordem de prefer\u00eancia, [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-23","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/disciplinas.ime.unicamp.br\/ms211\/wp-json\/wp\/v2\/pages\/23","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/disciplinas.ime.unicamp.br\/ms211\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/disciplinas.ime.unicamp.br\/ms211\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/disciplinas.ime.unicamp.br\/ms211\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/disciplinas.ime.unicamp.br\/ms211\/wp-json\/wp\/v2\/comments?post=23"}],"version-history":[{"count":4,"href":"https:\/\/disciplinas.ime.unicamp.br\/ms211\/wp-json\/wp\/v2\/pages\/23\/revisions"}],"predecessor-version":[{"id":171,"href":"https:\/\/disciplinas.ime.unicamp.br\/ms211\/wp-json\/wp\/v2\/pages\/23\/revisions\/171"}],"wp:attachment":[{"href":"https:\/\/disciplinas.ime.unicamp.br\/ms211\/wp-json\/wp\/v2\/media?parent=23"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}