node2.html
来自「htmdoc for html coding」· HTML 代码 · 共 187 行
HTML
187 行
<!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>Contents</TITLE><LINK REL=STYLESHEET TYPE="text/css" HREF="./Modulef.css" TITLE="Modulef CSS"><meta name="description" value="Contents"><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=tex2html233 HREF="node1.html"><IMG BORDER=0 ALIGN=BOTTOM SRC="../icons/previous_motif.gif" ALT="previous"></A><A NAME=tex2html239 HREF="Guide5.html"><IMG BORDER=0 ALIGN=BOTTOM SRC="../icons/up_motif.gif" ALT="up"></A><A NAME=tex2html241 HREF="node3.html"><IMG BORDER=0 ALIGN=BOTTOM SRC="../icons/next_motif.gif" ALT="next"></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> Next: </B> <A NAME=tex2html242 HREF="node3.html">List of Figures</A><B>Up: </B> <A NAME=tex2html240 HREF="Guide5.html">Guide 5 Solution of Linear Systems </A><B> Prev: </B> <A NAME=tex2html234 HREF="node1.html"> Preface</A><HR SIZE=3 WIDTH="75%"><P><H2><A NAME=SECTION01000000000000000000>Contents</A></H2><UL> <LI> <A NAME=tex2html243 HREF="node1.html#SECTION00010000000000000000"> Preface</A><LI> <A NAME=tex2html244 HREF="node3.html#SECTION02000000000000000000">List of Figures</A><LI> <A NAME=tex2html245 HREF="node4.html#SECTION03000000000000000000">Part I: General</A><UL> <LI> <A NAME=tex2html246 HREF="node5.html#SECTION03100000000000000000">1 Solution of linear systems</A><UL> <LI> <A NAME=tex2html247 HREF="node6.html#SECTION03110000000000000000">1.1 Introduction</A><LI> <A NAME=tex2html248 HREF="node7.html#SECTION03120000000000000000">1.2 Solution by a direct method</A><UL> <LI> <A NAME=tex2html249 HREF="node7.html#SECTION03121000000000000000">1.2.1 Introduction</A><LI> <A NAME=tex2html250 HREF="node7.html#SECTION03122000000000000000">1.2.2 The MUA data structure</A><UL> <LI> <A NAME=tex2html251 HREF="node7.html#SECTION03122100000000000000"> Contents</A><LI> <A NAME=tex2html252 HREF="node7.html#SECTION03122200000000000000"> Example 1: Symmetric matrix</A><LI> <A NAME=tex2html253 HREF="node7.html#SECTION03122300000000000000"> Example 2: Non-symmetric matrix</A></UL> <LI> <A NAME=tex2html254 HREF="node7.html#SECTION03123000000000000000">1.2.3 The B data structure</A><UL> <LI> <A NAME=tex2html255 HREF="node7.html#SECTION03123100000000000000"> Contents</A></UL> </UL> <LI> <A NAME=tex2html256 HREF="node8.html#SECTION03130000000000000000">1.3 Solution by an iterative method</A><UL> <LI> <A NAME=tex2html257 HREF="node8.html#SECTION03131000000000000000">1.3.1 Introduction</A><LI> <A NAME=tex2html258 HREF="node8.html#SECTION03132000000000000000">1.3.2 The AMAT data structure</A><UL> <LI> <A NAME=tex2html259 HREF="node8.html#SECTION03132100000000000000"> Contents</A><LI> <A NAME=tex2html260 HREF="node8.html#SECTION03132200000000000000"> Example 1: Diagonal matrix in M.M. </A><LI> <A NAME=tex2html261 HREF="node8.html#SECTION03132300000000000000"> Example 2: Symmetric matrix in M.M.</A><LI> <A NAME=tex2html262 HREF="node8.html#SECTION03132400000000000000"> Example 3: Non-symmetric matrix in M.M.</A></UL> </UL> <LI> <A NAME=tex2html263 HREF="node9.html#SECTION03140000000000000000">1.4 Solution by domain decomposition</A><LI> <A NAME=tex2html264 HREF="node10.html#SECTION03150000000000000000">1.5 Correspondence: operator-module</A></UL> </UL> <LI> <A NAME=tex2html265 HREF="node11.html#SECTION04000000000000000000">Part II: The modules</A><UL> <LI> <A NAME=tex2html266 HREF="node12.html#SECTION04100000000000000000">1 Direct methods</A><UL> <LI> <A NAME=tex2html267 HREF="node13.html#SECTION04110000000000000000">1.1 Introduction</A><LI> <A NAME=tex2html268 HREF="node14.html#SECTION04120000000000000000">1.2 The modules</A><UL> <LI> <A NAME=tex2html269 HREF="node14.html#SECTION04121000000000000000">1.2.1 ASEMBV: assembly of B</A><LI> <A NAME=tex2html270 HREF="node14.html#SECTION04122000000000000000">1.2.2 ASMAPS: assembly of MUA</A><LI> <A NAME=tex2html271 HREF="node14.html#SECTION04123000000000000000">1.2.3 ASMBMS: assembly of B</A><LI> <A NAME=tex2html272 HREF="node14.html#SECTION04124000000000000000">1.2.4 ASSMUA: assembly of MUA</A><LI> <A NAME=tex2html273 HREF="node14.html#SECTION04125000000000000000">1.2.5 CHOLPC: Cholesky factorization</A><LI> <A NAME=tex2html274 HREF="node14.html#SECTION04126000000000000000">1.2.6 CHOLPS: Cholesky factorization in secondary memory</A><LI> <A NAME=tex2html275 HREF="node14.html#SECTION04127000000000000000">1.2.7 CLIMPC: boundary conditions</A><LI> <A NAME=tex2html276 HREF="node14.html#SECTION04128000000000000000">1.2.8 CLIMPS: boundary conditions</A><LI> <A NAME=tex2html277 HREF="node14.html#SECTION04129000000000000000">1.2.9 CONDL1: construction of NDL1</A><LI> <A NAME=tex2html278 HREF="node14.html#SECTION041210000000000000000">1.2.10 CROUPC: Crout factorization</A><LI> <A NAME=tex2html279 HREF="node14.html#SECTION041211000000000000000">1.2.11 DRCHPC: Cholesky forward- and backsubstitution</A><LI> <A NAME=tex2html280 HREF="node14.html#SECTION041212000000000000000">1.2.12 DRCRPC: Crout forward- and backsubstitution</A><LI> <A NAME=tex2html281 HREF="node14.html#SECTION041213000000000000000">1.2.13 DRGAPC: Gauss forward- and backsubstitution</A><LI> <A NAME=tex2html282 HREF="node14.html#SECTION041214000000000000000">1.2.14 FRONT: frontal method</A><LI> <A NAME=tex2html283 HREF="node14.html#SECTION041215000000000000000">1.2.15 GAUSPC: Gauss factorization</A><LI> <A NAME=tex2html284 HREF="node14.html#SECTION041216000000000000000">1.2.16 PREPAC: computation of pointers for MUA</A><LI> <A NAME=tex2html285 HREF="node14.html#SECTION041217000000000000000">1.2.17 PREPAF: computation of pointers for the frontal method</A></UL> <LI> <A NAME=tex2html286 HREF="node15.html#SECTION04130000000000000000">1.3 The algorithms</A><UL> <LI> <A NAME=tex2html287 HREF="node15.html#SECTION04131000000000000000">1.3.1 List of programs</A></UL> </UL> <LI> <A NAME=tex2html288 HREF="node16.html#SECTION04200000000000000000">2 Iterative methods</A><UL> <LI> <A NAME=tex2html289 HREF="node17.html#SECTION04210000000000000000">2.1 The modules</A><UL> <LI> <A NAME=tex2html290 HREF="node17.html#SECTION04211000000000000000">2.1.1 ASEMBV: assembly of B</A><LI> <A NAME=tex2html291 HREF="node17.html#SECTION04212000000000000000">2.1.2 ASSAMA: assembly of AMAT</A><LI> <A NAME=tex2html292 HREF="node17.html#SECTION04213000000000000000">2.1.3 CLIMGC: boundary conditions</A><LI> <A NAME=tex2html293 HREF="node17.html#SECTION04214000000000000000">2.1.4 CONDLU: incomplete Gauss factorization</A><LI> <A NAME=tex2html294 HREF="node17.html#SECTION04215000000000000000">2.1.5 CONDL1: construction of NDL1</A><LI> <A NAME=tex2html295 HREF="node17.html#SECTION04216000000000000000">2.1.6 CSAMAT: construction of AMAT from MUA</A><LI> <A NAME=tex2html296 HREF="node17.html#SECTION04217000000000000000">2.1.7 DGRADA: double conjugate gradient</A><LI> <A NAME=tex2html297 HREF="node17.html#SECTION04218000000000000000">2.1.8 FANIGC: incomplete Cholesky-Crout factorization</A><LI> <A NAME=tex2html298 HREF="node17.html#SECTION04219000000000000000">2.1.9 GCDIAG: preconditioned conjugate gradient</A><LI> <A NAME=tex2html299 HREF="node17.html#SECTION042110000000000000000">2.1.10 ICHRGC: preconditioned conjugate gradient</A><LI> <A NAME=tex2html300 HREF="node17.html#SECTION042111000000000000000">2.1.11 PREPGC: computation of pointers for AMAT</A><LI> <A NAME=tex2html301 HREF="node17.html#SECTION042112000000000000000">2.1.12 SIMPGC: non-preconditioned conjugate gradient</A><LI> <A NAME=tex2html302 HREF="node17.html#SECTION042113000000000000000">2.1.13 SSORGC: preconditioned conjugate gradient</A></UL> <LI> <A NAME=tex2html303 HREF="node18.html#SECTION04220000000000000000">2.2 The algorithms</A><UL> <LI> <A NAME=tex2html304 HREF="node18.html#SECTION04221000000000000000">2.2.1 List of programs</A></UL> </UL> <LI> <A NAME=tex2html305 HREF="node19.html#SECTION04300000000000000000">3 The domain decomposition method</A><UL> <LI> <A NAME=tex2html306 HREF="node20.html#SECTION04310000000000000000">3.1 Introduction</A><LI> <A NAME=tex2html307 HREF="node21.html#SECTION04320000000000000000">3.2 The modules</A><UL> <LI> <A NAME=tex2html308 HREF="node21.html#SECTION04321000000000000000">3.2.1 PRSDOM</A><LI> <A NAME=tex2html309 HREF="node21.html#SECTION04322000000000000000">3.2.2 SDOMVD</A><LI> <A NAME=tex2html310 HREF="node21.html#SECTION04323000000000000000">3.2.3 SDOMVR</A></UL> </UL> <LI> <A NAME=tex2html311 HREF="node22.html#SECTION04400000000000000000">4 Utilities</A><UL> <LI> <A NAME=tex2html312 HREF="node23.html#SECTION04410000000000000000">4.1 AMATB</A><LI> <A NAME=tex2html313 HREF="node24.html#SECTION04420000000000000000">4.2 AMAT2</A><LI> <A NAME=tex2html314 HREF="node25.html#SECTION04430000000000000000">4.3 CCAMAT</A><LI> <A NAME=tex2html315 HREF="node26.html#SECTION04440000000000000000">4.4 CCMUA</A><LI> <A NAME=tex2html316 HREF="node27.html#SECTION04450000000000000000">4.5 CONDL1</A><LI> <A NAME=tex2html317 HREF="node28.html#SECTION04460000000000000000">4.6 CSAMAT</A><LI> <A NAME=tex2html318 HREF="node29.html#SECTION04470000000000000000">4.7 ELVOIS</A><LI> <A NAME=tex2html319 HREF="node30.html#SECTION04480000000000000000">4.8 IMAMAT</A><LI> <A NAME=tex2html320 HREF="node31.html#SECTION04490000000000000000">4.9 IMB</A><LI> <A NAME=tex2html321 HREF="node32.html#SECTION044100000000000000000">4.10 IMMUA</A><LI> <A NAME=tex2html322 HREF="node33.html#SECTION044110000000000000000">4.11 MUABPC</A><LI> <A NAME=tex2html323 HREF="node34.html#SECTION044120000000000000000">4.12 MUA2PC</A><LI> <A NAME=tex2html324 HREF="node35.html#SECTION044130000000000000000">4.13 SDB2MC</A><LI> <A NAME=tex2html325 HREF="node36.html#SECTION044140000000000000000">4.14 SDB2MS</A><LI> <A NAME=tex2html326 HREF="node37.html#SECTION044150000000000000000">4.15 TAMMUA</A><LI> <A NAME=tex2html327 HREF="node38.html#SECTION044160000000000000000">4.16 TAVOIS</A></UL> </UL> <LI> <A NAME=tex2html328 HREF="node39.html#SECTION05000000000000000000">Part III: Utilization examples</A><UL> <LI> <A NAME=tex2html329 HREF="node40.html#SECTION05100000000000000000">1 Examples</A><UL> <LI> <A NAME=tex2html330 HREF="node41.html#SECTION05110000000000000000">1.1 Introduction</A><LI> <A NAME=tex2html331 HREF="node42.html#SECTION05120000000000000000">1.2 The symmetric model problem</A><UL> <LI> <A NAME=tex2html332 HREF="node42.html#SECTION05121000000000000000">1.2.1 Solution by Cholesky in main memory</A><LI> <A NAME=tex2html333 HREF="node42.html#SECTION05122000000000000000">1.2.2 Solution by Crout in main memory</A><LI> <A NAME=tex2html334 HREF="node42.html#SECTION05123000000000000000">1.2.3 Solution by Cholesky in secondary memory</A><LI> <A NAME=tex2html335 HREF="node42.html#SECTION05124000000000000000">1.2.4 Solution by frontal Cholesky</A><LI> <A NAME=tex2html336 HREF="node42.html#SECTION05125000000000000000">1.2.5 Solution by Conjugate Gradient</A></UL> <LI> <A NAME=tex2html337 HREF="node43.html#SECTION05130000000000000000">1.3 The non-symmetric model problem</A><UL> <LI> <A NAME=tex2html338 HREF="node43.html#SECTION05131000000000000000">1.3.1 Solution by the Gauss method</A><LI> <A NAME=tex2html339 HREF="node43.html#SECTION05132000000000000000">1.3.2 Solution by Conjugate Gradient</A></UL> </UL> </UL> <LI> <A NAME=tex2html340 HREF="node44.html#SECTION06000000000000000000">References</A></UL> <HR SIZE=3 WIDTH="75%"><IMG SRC="../icons/smallmod.gif" WIDTH=211 HEIGHT=50 ALIGN=BOTTOM ALT="Modulef"><A NAME=tex2html233 HREF="node1.html"><IMG BORDER=0 ALIGN=BOTTOM SRC="../icons/previous_motif.gif" ALT="previous"></A><A NAME=tex2html239 HREF="Guide5.html"><IMG BORDER=0 ALIGN=BOTTOM SRC="../icons/up_motif.gif" ALT="up"></A><A NAME=tex2html241 HREF="node3.html"><IMG BORDER=0 ALIGN=BOTTOM SRC="../icons/next_motif.gif" ALT="next"></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> Next: </B> <A NAME=tex2html242 HREF="node3.html">List of Figures</A><B>Up: </B> <A NAME=tex2html240 HREF="Guide5.html">Guide 5 Solution of Linear Systems </A><B> Prev: </B> <A NAME=tex2html234 HREF="node1.html"> Preface</A><BR> <HR><P><ADDRESS></ADDRESS></BODY></HTML>⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?