{"id":22,"date":"2023-08-28T13:37:24","date_gmt":"2023-08-28T16:37:24","guid":{"rendered":"https:\/\/disciplinas.ime.unicamp.br\/ms993\/?page_id=22"},"modified":"2023-09-04T10:52:05","modified_gmt":"2023-09-04T13:52:05","slug":"materiais-complementares","status":"publish","type":"page","link":"https:\/\/disciplinas.ime.unicamp.br\/ms993\/materiais-complementares\/","title":{"rendered":"Materiais complementares"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\">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>Condicionamento de algoritmos (texto de Eduardo Abreu)&nbsp;&nbsp;&#8211;&nbsp;&nbsp;<a href=\"http:\/\/tripolis.ime.unicamp.br\/~ms993\/%5Btitle%5D\"><\/a><a href=\"http:\/\/tripolis.ime.unicamp.br\/~ms993\/%5Btitle%5D\"><\/a><a href=\"http:\/\/disciplinas.ime.unicamp.br\/ms993\/wp-content\/uploads\/sites\/8\/2023\/08\/CN1Sem2016.pdf\">CN1Sem2016.pdf<\/a><\/li>\n\n\n\n<li><a href=\"http:\/\/www-math.mit.edu\/~gs\/\" target=\"_blank\" rel=\"noreferrer noopener\">Site do Professor Gilbert Strang (videos, cursos, etc&#8230;)<\/a><\/li>\n\n\n\n<li><a href=\"http:\/\/www-users.cs.umn.edu\/~saad\/books.html\" target=\"_blank\" rel=\"noreferrer noopener\">Site do Yousef Saad (Livros, publica\u00e7\u00f5es em \u00c1lgebra Linear Computacional, etc\u2026)<\/a><\/li>\n\n\n\n<li>Slides &#8211; Aulas 16\/Set e 23\/Set&nbsp;&nbsp;&#8211;&nbsp;&nbsp;<a href=\"http:\/\/tripolis.ime.unicamp.br\/~ms993\/%5Btitle%5D\"><\/a><a href=\"http:\/\/tripolis.ime.unicamp.br\/~ms993\/%5Btitle%5D\"><\/a><a href=\"http:\/\/disciplinas.ime.unicamp.br\/ms993\/wp-content\/uploads\/sites\/8\/2023\/08\/basicIterative.pdf\">basicIterative.pdf<\/a><\/li>\n\n\n\n<li>Slides &#8211; Aulas 16\/Set e 23\/Set&nbsp;&nbsp;&#8211;&nbsp;&nbsp;<a href=\"http:\/\/tripolis.ime.unicamp.br\/~ms993\/%5Btitle%5D\"><\/a><a href=\"http:\/\/tripolis.ime.unicamp.br\/~ms993\/%5Btitle%5D\"><\/a><a href=\"http:\/\/disciplinas.ime.unicamp.br\/ms993\/wp-content\/uploads\/sites\/8\/2023\/08\/slides-16e23Set.pdf\">slides-16e23Set.pdf<\/a><\/li>\n\n\n\n<li>Slides &#8211; Aulas 2\/Set e 9\/Set&nbsp;&nbsp;&#8211;&nbsp;&nbsp;<a href=\"http:\/\/tripolis.ime.unicamp.br\/~ms993\/%5Btitle%5D\"><\/a><a href=\"http:\/\/tripolis.ime.unicamp.br\/~ms993\/%5Btitle%5D\"><\/a><a href=\"http:\/\/disciplinas.ime.unicamp.br\/ms993\/wp-content\/uploads\/sites\/8\/2023\/08\/slides-ms993mt404_compressed.pdf\">slides-ms993mt404.pdf<\/a><\/li>\n\n\n\n<li>Sum\u00e1rio QR e SVD: M\u00e9todos num\u00e9ricos para problemas de quadrados m\u00ednimos\u00a0\u00a0&#8211;\u00a0\u00a0<a href=\"http:\/\/tripolis.ime.unicamp.br\/~ms993\/%5Btitle%5D\"><\/a><a href=\"http:\/\/tripolis.ime.unicamp.br\/~ms993\/%5Btitle%5D\"><\/a><a href=\"http:\/\/disciplinas.ime.unicamp.br\/ms993\/wp-content\/uploads\/sites\/8\/2023\/08\/ms993mt404-SVD-QR.pdf\">ms993mt404-SVD-QR.pdf<\/a><\/li>\n\n\n\n<li><a href=\"http:\/\/johnkerl.org\/doc\/hh.pdf\" target=\"_blank\" rel=\"noreferrer noopener\">The Householder transformation in numerical linear algebra<\/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 href=\"http:\/\/www.gnu.org\/software\/octave\/\" target=\"_blank\" rel=\"noreferrer noopener\">Octave<\/a><\/li>\n\n\n\n<li><a href=\"https:\/\/www.r-project.org\/\" target=\"_blank\" rel=\"noreferrer noopener\">R<\/a><\/li>\n\n\n\n<li><a rel=\"noreferrer noopener\" href=\"https:\/\/www.scilab.org\/\" target=\"_blank\">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=\"http:\/\/en.cppreference.com\/w\/\" 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:\/\/www.geogebra.org\/\" target=\"_blank\" rel=\"noreferrer noopener\">Geogebra<\/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\">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>An algorithm for the machine calculation of complex fourier series&nbsp;&nbsp;&#8211;&nbsp;&nbsp;<a href=\"http:\/\/tripolis.ime.unicamp.br\/~ms993\/%5Btitle%5D\"><\/a><a href=\"http:\/\/tripolis.ime.unicamp.br\/~ms993\/%5Btitle%5D\"><\/a><a href=\"http:\/\/disciplinas.ime.unicamp.br\/ms993\/wp-content\/uploads\/sites\/8\/2023\/08\/machine-calculation-complex-fourier.pdf\">machine-calculation-complex-fourier.pdf<\/a><\/li>\n\n\n\n<li>Complexidade C\u00e1lculo Real&nbsp;&nbsp;&#8211;&nbsp;&nbsp;<a href=\"http:\/\/tripolis.ime.unicamp.br\/~ms993\/%5Btitle%5D\"><\/a><a href=\"http:\/\/tripolis.ime.unicamp.br\/~ms993\/%5Btitle%5D\"><\/a><a href=\"http:\/\/disciplinas.ime.unicamp.br\/ms993\/wp-content\/uploads\/sites\/8\/2023\/08\/complexidade-computacao-real.pdf\">complexidade-computacao-real.pdf<\/a><\/li>\n\n\n\n<li>Computa\u00e7\u00e3o Real (precis\u00e3o infinita)&nbsp;&nbsp;&#8211;&nbsp;&nbsp;<a href=\"http:\/\/tripolis.ime.unicamp.br\/~ms993\/%5Btitle%5D\"><\/a><a href=\"http:\/\/tripolis.ime.unicamp.br\/~ms993\/%5Btitle%5D\"><\/a><a href=\"http:\/\/disciplinas.ime.unicamp.br\/ms993\/wp-content\/uploads\/sites\/8\/2023\/08\/real-computation-model.pdf\">real-computation-model.pdf<\/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>Magnus R. Hestenes and Eduard Stiefel, Methods of Conjugate Gradients for Solving Linear Systems, Journal of Research of the National Bureau of Standards 49 (1952), 409\u2013436&nbsp;&nbsp;&#8211;&nbsp;&nbsp;<a href=\"http:\/\/tripolis.ime.unicamp.br\/~ms993\/%5Btitle%5D\"><\/a><a href=\"http:\/\/tripolis.ime.unicamp.br\/~ms993\/%5Btitle%5D\"><\/a><a href=\"http:\/\/disciplinas.ime.unicamp.br\/ms993\/wp-content\/uploads\/sites\/8\/2023\/08\/hestenes-stiefel.pdf\">hestenes-stiefel.pdf<\/a><\/li>\n\n\n\n<li>Numerical Analysis &#8211; The Need for Numerical Computation\u00a0\u00a0&#8211;\u00a0\u00a0<a href=\"http:\/\/tripolis.ime.unicamp.br\/~ms993\/%5Btitle%5D\"><\/a><a href=\"http:\/\/tripolis.ime.unicamp.br\/~ms993\/%5Btitle%5D\"><\/a><a href=\"http:\/\/disciplinas.ime.unicamp.br\/ms993\/wp-content\/uploads\/sites\/8\/2023\/08\/NAessay.pdf\">NAessay.pdf<\/a><\/li>\n\n\n\n<li>Ten digit problems&nbsp;&nbsp;&#8211;&nbsp;&nbsp;<a href=\"http:\/\/tripolis.ime.unicamp.br\/~ms993\/%5Btitle%5D\"><\/a><a href=\"http:\/\/tripolis.ime.unicamp.br\/~ms993\/%5Btitle%5D\"><\/a><a href=\"http:\/\/disciplinas.ime.unicamp.br\/ms993\/wp-content\/uploads\/sites\/8\/2023\/08\/Ten-digit.pdf\">Ten-digit.pdf<\/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>The definiton of numerical analysis&nbsp;&nbsp;&#8211;&nbsp;&nbsp;<a href=\"http:\/\/tripolis.ime.unicamp.br\/~ms993\/%5Btitle%5D\"><\/a><a href=\"http:\/\/tripolis.ime.unicamp.br\/~ms993\/%5Btitle%5D\"><\/a><a href=\"http:\/\/disciplinas.ime.unicamp.br\/ms993\/wp-content\/uploads\/sites\/8\/2023\/08\/LIoydTrefethen.pdf\">LIoydTrefethen.pdf<\/a><\/li>\n\n\n\n<li>The loss of orthogonality in the Gram-Schmidt orthogonalization process&nbsp;&nbsp;&#8211;&nbsp;&nbsp;<a href=\"http:\/\/tripolis.ime.unicamp.br\/~ms993\/%5Btitle%5D\"><\/a><a href=\"http:\/\/tripolis.ime.unicamp.br\/~ms993\/%5Btitle%5D\"><\/a><a href=\"http:\/\/disciplinas.ime.unicamp.br\/ms993\/wp-content\/uploads\/sites\/8\/2023\/08\/2005-CMA-giraud-langou-rozloznik.pdf\">2005-CMA-giraud-langou-rozloznik.pdf<\/a><\/li>\n\n\n\n<li>The QR algorithm: 50 years later its genesis by John Francis and Vera Kublanovskaya and subsequent developments&nbsp;&nbsp;&#8211;&nbsp;&nbsp;<a href=\"http:\/\/tripolis.ime.unicamp.br\/~ms993\/%5Btitle%5D\"><\/a><a href=\"http:\/\/tripolis.ime.unicamp.br\/~ms993\/%5Btitle%5D\"><\/a><a href=\"http:\/\/disciplinas.ime.unicamp.br\/ms993\/wp-content\/uploads\/sites\/8\/2023\/08\/QR_50_years_later.pdf\">QR_50_years_later.pdf<\/a><\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">Biblioteca de matem\u00e1tica num\u00e9rica para \u00c1lgebra Linear<\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li>EVSL &#8211; EigensValues Slicing LibraryThis is the release of the first version of EVSL (the EigensValues&nbsp;Slicing Library), a spectrum slicing library for large eigenvalue&nbsp;problems &#8211;&nbsp;&nbsp;<a href=\"http:\/\/www.cs.umn.edu\/~saad\/software\/EVSL\" target=\"_blank\" rel=\"noreferrer noopener\">http:\/\/www.cs.umn.edu\/~saad\/software\/EVSL<\/a><br><br>EVSL provides routines for computing eigenvalues located in a given&nbsp;interval, and their associated eigenvectors, of real symmetric matrices.&nbsp;It also provides tools for spectrum slicing, i.e., the technique of&nbsp;subdividing a given interval into p smaller subintervals and computing&nbsp;the eigenvalues in each subinterval independently.&nbsp; EVSL implements a<br>polynomial filtered Lanczos algorithm (thick restart, no restart) a&nbsp;rational filtered Lanczos algorithm (thick restart, no restart), and&nbsp;a polynomial filtered subspace iteration.&nbsp; For details see the&nbsp;following web-page from where you can also access the code:&nbsp;<a href=\"http:\/\/www.cs.umn.edu\/~saad\/software\/EVSL\" target=\"_blank\" rel=\"noreferrer noopener\">http:\/\/www.cs.umn.edu\/~saad\/software\/EVSL<\/a><\/li>\n\n\n\n<li><a href=\"https:\/\/software.intel.com\/en-us\/articles\/intel-math-kernel-library-documentation\" target=\"_blank\" rel=\"noreferrer noopener\">Intel\u00ae Math Kernel Library \u2013 Documentation<\/a><\/li>\n\n\n\n<li>LAPACKLAPACK est\u00e1 continuamente melhorado e sendo atualizado e est\u00e1 dispon\u00edvel gratuitamente no link&nbsp;<a href=\"http:\/\/www.netlib.org\/lapack95\/\" target=\"_blank\" rel=\"noreferrer noopener\">http:\/\/www.netlib.org\/lapack95\/<\/a>.<br>Rotinas para v\u00e1rias formas especiais de matrizes est\u00e3o prontas para uso no LAPACK:<br>&#8211; General<br>&#8211; General band<br>&#8211; Positive definite<br>&#8211; Positive definite packed<br>&#8211; Positive definite band<br>&#8211; Symmetric (Hermitian) indefinite<br>&#8211; Symmetric (Hermitian) indefinite packed<br>&#8211; Triangular<br>&#8211; General tridiagonal<br>&#8211; Positive definite tridiagonalLAPACK95 \u00e9 uma interface escrita em Fortran 95 para a biblioteca LAPACK Fortran 77. LAPACK pode ser \u00fatil para qualquer usu\u00e1rio que um que escreve em linguagem Fortran 95 l\u00edngua e deseja utilizar as facilidades de um software confi\u00e1vel (Fortran 95) para a \u00e1lgebra linear b\u00e1sica num\u00e9rica. Para mais detalhes, ver o link a seguir:&nbsp;<a href=\"http:\/\/www.netlib.org\/lapack95\/\" target=\"_blank\" rel=\"noreferrer noopener\">http:\/\/www.netlib.org\/lapack95\/<\/a>.<\/li>\n\n\n\n<li><a rel=\"noreferrer noopener\" href=\"http:\/\/www.netlib.org\/\" target=\"_blank\">NetLib<\/a> um site com um amplo e rico conte\u00fado de informa\u00e7\u00f5es para o software em matem\u00e1tica computacional para \u00e1lgebra linear num\u00e9rica LAPACK e BLAS (\u00e1lgebra linear para matrizes densas), NETSOLVE (gera\u00e7\u00e3o de malhas) e TEMPLATES (manuais especializados em m\u00e9todos computacionais em \u00e1lgebra linear).<\/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":10,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-22","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/disciplinas.ime.unicamp.br\/ms993\/wp-json\/wp\/v2\/pages\/22","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/disciplinas.ime.unicamp.br\/ms993\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/disciplinas.ime.unicamp.br\/ms993\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/disciplinas.ime.unicamp.br\/ms993\/wp-json\/wp\/v2\/users\/10"}],"replies":[{"embeddable":true,"href":"https:\/\/disciplinas.ime.unicamp.br\/ms993\/wp-json\/wp\/v2\/comments?post=22"}],"version-history":[{"count":8,"href":"https:\/\/disciplinas.ime.unicamp.br\/ms993\/wp-json\/wp\/v2\/pages\/22\/revisions"}],"predecessor-version":[{"id":83,"href":"https:\/\/disciplinas.ime.unicamp.br\/ms993\/wp-json\/wp\/v2\/pages\/22\/revisions\/83"}],"wp:attachment":[{"href":"https:\/\/disciplinas.ime.unicamp.br\/ms993\/wp-json\/wp\/v2\/media?parent=22"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}