⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 node2.html

📁 htmdoc for html coding
💻 HTML
字号:
<!DOCTYPE HTML PUBLIC "-//IETF//DTD HTML 3.2 Final//FR"><!-- Converted with LaTeX2HTML 95.1 (Fri Jan 20 1995) --><!-- by Nikos Drakos (nikos@cbl.leeds.ac.uk), CBLU, University of Leeds --><!-- Modified Simulog 03/97 --><HTML><HEAD><TITLE>Table des mati鑢es</TITLE><LINK REL=STYLESHEET TYPE="text/css"	HREF="./Modulef.css" TITLE="Modulef CSS"><meta name="description" value="Table des mati鑢es"><meta name="keywords" value="Guide5"><meta name="resource-type" value="document"><meta name="distribution" value="global"></HEAD><BODY BGCOLOR="#FFFFFF"><P> <IMG SRC="../icons/smallmod.gif" WIDTH=211 HEIGHT=50 ALIGN=BOTTOM	ALT="Modulef"><A NAME=tex2html246 HREF="node1.html"><IMG BORDER=0 ALIGN=BOTTOM SRC="../icons/previous_motif.gif"	ALT="previous"></A><A NAME=tex2html252 HREF="Guide5.html"><IMG BORDER=0 ALIGN=BOTTOM SRC="../icons/up_motif.gif"	ALT="up"></A><A NAME=tex2html254 HREF="node3.html"><IMG BORDER=0 ALIGN=BOTTOM SRC="../icons/next_motif.gif"	ALT="next"></A><A NAME=tex2html256 HREF="node45.html"><IMG BORDER=0 ALIGN=BOTTOM SRC="../icons/index_motif.gif"	ALT="index"></A><A HREF="../Guide5-18/node2.html"><IMG BORDER=0 SRC="../icons/zoom18.gif" ALIGN=BOTTOM	ALT="[BIG]"></A><A HREF="../Guide5-14/node2.html"><IMG BORDER=0 SRC="../icons/zoom14.gif" ALIGN=BOTTOM	ALT="[Normal]"></A><A HREF="../Guide5-10/node2.html"><IMG BORDER=0 SRC="../icons/zoom10.gif" ALIGN=BOTTOM	ALT="[small]"></A><BR><B> Suiv.: </B> <A NAME=tex2html255 HREF="node3.html">Liste des figures</A><B>Sup.: </B> <A NAME=tex2html253 HREF="Guide5.html">Guide 5   R閟olution des syst鑝es lin閍ires </A><B> Pr閏.: </B> <A NAME=tex2html247 HREF="node1.html"> Pr閒ace</A><B><A HREF="node45.html"	>Index</A></B><HR SIZE=3 WIDTH="75&#37;"><P><H2><A NAME=SECTION01000000000000000000>Table des mati鑢es</A></H2><UL> <LI> <A NAME=tex2html257 HREF="node1.html#SECTION00010000000000000000"> Pr閒ace</A><LI> <A NAME=tex2html258 HREF="node3.html#SECTION02000000000000000000">Liste des figures</A><LI> <A NAME=tex2html259 HREF="node4.html#SECTION03000000000000000000"> G閚閞alit閟</A><UL> <LI> <A NAME=tex2html260 HREF="node5.html#SECTION03100000000000000000"> R閟olution des syst鑝es lin閍ires</A><UL> <LI> <A NAME=tex2html261 HREF="node6.html#SECTION03110000000000000000">1.1 Introduction</A><LI> <A NAME=tex2html262 HREF="node7.html#SECTION03120000000000000000"> R閟olution par une m閠hode directe</A><UL> <LI> <A NAME=tex2html263 HREF="node7.html#SECTION03121000000000000000">1.2.1 Introduction</A><LI> <A NAME=tex2html264 HREF="node7.html#SECTION03122000000000000000"> La structure de donn閑s MUA</A><UL> <LI> <A NAME=tex2html265 HREF="node7.html#SECTION03122100000000000000"> Contenu</A><LI> <A NAME=tex2html266 HREF="node7.html#SECTION03122200000000000000"> Exemple 1 : Matrice sym閠rique</A><LI> <A NAME=tex2html267 HREF="node7.html#SECTION03122300000000000000"> Exemple 2 : Matrice non sym閠rique</A></UL> <LI> <A NAME=tex2html268 HREF="node7.html#SECTION03123000000000000000"> La structure de donn閑s B</A><UL> <LI> <A NAME=tex2html269 HREF="node7.html#SECTION03123100000000000000"> Contenu</A></UL> </UL> <LI> <A NAME=tex2html270 HREF="node8.html#SECTION03130000000000000000"> R閟olution par une m閠hode it閞ative</A><UL> <LI> <A NAME=tex2html271 HREF="node8.html#SECTION03131000000000000000">1.3.1 Introduction</A><LI> <A NAME=tex2html272 HREF="node8.html#SECTION03132000000000000000"> La structure de donn閑s AMAT</A><UL> <LI> <A NAME=tex2html273 HREF="node8.html#SECTION03132100000000000000"> Contenu</A><LI> <A NAME=tex2html274 HREF="node8.html#SECTION03132200000000000000"> Exemple 1 : Matrice diagonale en M.C.</A><LI> <A NAME=tex2html275 HREF="node8.html#SECTION03132300000000000000"> Exemple 2 : Matrice sym閠rique en M.C.</A><LI> <A NAME=tex2html276 HREF="node8.html#SECTION03132400000000000000"> Exemple 3 : Matrice non sym閠rique en M.C.</A></UL> </UL> <LI> <A NAME=tex2html277 HREF="node9.html#SECTION03140000000000000000"> R閟olution par d閏omposition de domaines</A><LI> <A NAME=tex2html278 HREF="node10.html#SECTION03150000000000000000"> Correspondance op閞ateur-module</A></UL> </UL> <LI> <A NAME=tex2html279 HREF="node11.html#SECTION04000000000000000000">Partie II: Les modules</A><UL> <LI> <A NAME=tex2html280 HREF="node12.html#SECTION04100000000000000000"> Liste des m閠hodes directes</A><UL> <LI> <A NAME=tex2html281 HREF="node13.html#SECTION04110000000000000000">1.1 Introduction</A><LI> <A NAME=tex2html282 HREF="node14.html#SECTION04120000000000000000">1.2 Les modules</A><UL> <LI> <A NAME=tex2html283 HREF="node14.html#SECTION04121000000000000000">1.2.1 ASEMBV : assemblage de B</A><LI> <A NAME=tex2html284 HREF="node14.html#SECTION04122000000000000000">1.2.2 ASMAPS : assemblage de MUA</A><LI> <A NAME=tex2html285 HREF="node14.html#SECTION04123000000000000000">1.2.3 ASMBMS : assemblage de B</A><LI> <A NAME=tex2html286 HREF="node14.html#SECTION04124000000000000000">1.2.4 ASSMUA : assemblage de MUA</A><LI> <A NAME=tex2html287 HREF="node14.html#SECTION04125000000000000000">1.2.5 CHOLPC : factorisation de Cholesky</A><LI> <A NAME=tex2html288 HREF="node14.html#SECTION04126000000000000000"> CHOLPS : factorisation de Cholesky en m閙oire secondaire</A><LI> <A NAME=tex2html289 HREF="node14.html#SECTION04127000000000000000">1.2.7 CLIMPC : conditions aux limites</A><LI> <A NAME=tex2html290 HREF="node14.html#SECTION04128000000000000000">1.2.8 CLIMPS : conditions aux limites</A><LI> <A NAME=tex2html291 HREF="node14.html#SECTION04129000000000000000">1.2.9 CONDL1  : construction de NDL1</A><LI> <A NAME=tex2html292 HREF="node14.html#SECTION041210000000000000000">1.2.10 CROUPC : factorisation de Crout</A><LI> <A NAME=tex2html293 HREF="node14.html#SECTION041211000000000000000"> DRCHPC : descente-remont閑 de Cholesky</A><LI> <A NAME=tex2html294 HREF="node14.html#SECTION041212000000000000000"> DRCRPC : descente-remont閑 de Crout</A><LI> <A NAME=tex2html295 HREF="node14.html#SECTION041213000000000000000"> DRGAPC : descente remont閑 de Gauss</A><LI> <A NAME=tex2html296 HREF="node14.html#SECTION041214000000000000000"> FRONT : m閠hode frontale</A><LI> <A NAME=tex2html297 HREF="node14.html#SECTION041215000000000000000">1.2.15 GAUSPC : factorisation de Gauss</A><LI> <A NAME=tex2html298 HREF="node14.html#SECTION041216000000000000000">1.2.16 PREPAC : calcul des pointeurs de MUA</A><LI> <A NAME=tex2html299 HREF="node14.html#SECTION041217000000000000000"> PREPAF: calcul des pointeurs de la m閠hode frontale</A></UL> <LI> <A NAME=tex2html300 HREF="node15.html#SECTION04130000000000000000">1.3 Les algorithmes</A><UL> <LI> <A NAME=tex2html301 HREF="node15.html#SECTION04131000000000000000">1.3.1 Liste des programmmes</A></UL> </UL> <LI> <A NAME=tex2html302 HREF="node16.html#SECTION04200000000000000000"> Liste des m閠hodes it閞atives</A><UL> <LI> <A NAME=tex2html303 HREF="node17.html#SECTION04210000000000000000">2.1 Les modules</A><UL> <LI> <A NAME=tex2html304 HREF="node17.html#SECTION04211000000000000000">2.1.1 ASEMBV : assemblage de B</A><LI> <A NAME=tex2html305 HREF="node17.html#SECTION04212000000000000000">2.1.2 ASSAMA : assemblage de AMAT</A><LI> <A NAME=tex2html306 HREF="node17.html#SECTION04213000000000000000">2.1.3 CLIMGC : conditions aux limites</A><LI> <A NAME=tex2html307 HREF="node17.html#SECTION04214000000000000000"> CONDLU : factorisation incompl鑤e de Gauss</A><LI> <A NAME=tex2html308 HREF="node17.html#SECTION04215000000000000000">2.1.5 CONDL1 : construction de NDL1</A><LI> <A NAME=tex2html309 HREF="node17.html#SECTION04216000000000000000"> CSAMAT : construction de AMAT 

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -