📄 iteration.html
字号:
<HTML><!-- -- Copyright (c) 1998,1999 -- University of Notre Dame -- -- Permission to use, copy, modify, distribute and sell this software -- and its documentation for any purpose is hereby granted without fee, -- provided that the above copyright notice appears in all copies and -- that both that copyright notice and this permission notice appear -- in supporting documentation. The University of Notre Dame makes no -- representations about the suitability of this software for any -- purpose. It is provided "as is" without express or implied warranty. -- --><HEAD><TITLE>Description of Iteration</TITLE></HEAD><BODY BGCOLOR="#ffffff" LINK="#0000ee" TEXT="#000000" VLINK="#551a8b" ALINK="#ff0000"> <FONT FACE=Helvetica><!--end header--><TABLE BORDER=0 CELLSPACING=0 CELLPADDING=2 WIDTH=100%><TR><TD><TABLE BORDER=0 CELLSPACING=0 CELLPADDING=0 WIDTH=100%><TR><TD Align=left valign=middle width=440 rowspan=2><FONT FACE=verdana,arial,helvetica SIZE=+3 COLOR=#110088><B>Iteration</B></FONT></TD><TD valign=middle Align=right width=128 rowspan=2><A HREF="http://lsc.nd.edu/research/mtl"><IMG BORDER=0 SRC="./glossy-mtl-logo.jpg" height=48 ALT="[MTL Home]"></A></TD><TD Align=center width=280 nowrap><Font face=verdana,arial,helvetica size=+3><b>Programmers Guide</b></font></TD></TR><TR BGCOLOR='#2020b0'><TD HEIGHT=20 VALIGN='MIDDLE' NOWRAP align=center STYLE="font-family:verdana,arial,helvetica;font-weight:bold;"> <A STYLE="text-decoration:none;color:white;font-family:verdana,arial,helvetica;font-weight:bold;" HREF="./table_of_contents.html">Contents</A> | <A STYLE="text-decoration:none;color:white;font-family:verdana,arial,helvetica;font-weight:bold;" HREF="./mtl_index.html">Index</A> | <A STYLE="text-decoration:none;color:white;font-family:verdana,arial,helvetica;font-weight:bold;" HREF="http://lsc.nd.edu/research/mtl/search.html">Search</A> </TD></TR></TABLE></TD></TR><TR><TD><Table Border=0 CellPadding=0 CellSpacing=0 width=100% cols=2><TR><TD Align=left><BR><TABLE BORDER=0 CellSpacing=0 CellPadding=0><TR><TD><Img src = "itl.gif" Alt="" WIDTH = "194" HEIGHT = "38" ></TD></TR><TR><TD><Img src = "utilities.gif" Alt="" WIDTH = "194" HEIGHT = "38" ></TD></TR></TABLE></TD><TD Align=right><BR><TABLE BORDER=0 CellSpacing=0 CellPadding=0><TR><TD><Img src = "concept.gif" Alt="" WIDTH = "194" HEIGHT = "38" ></TD></TR></TABLE></TD></TR><TR><TD Align=left VAlign=top><b>Category</b>:itl,utilities</TD><TD Align=right VAlign=top><b>Component type</b>:concept</TD></TR></Table></TD></TR><TR><TD><IMG SRC="whitespace.gif" Alt="" WIDTH="32" HEIGHT="10" ALIGN="TOP"></TD></TR><TR BGCOLOR=#e0e0e0><TD VALIGN=BOTTOM><FONT FACE=arial,helvetica SIZE=+1><B>Description</B></FONT></TD></TR><TR><TD> The <A HREF="Iteration.html" >Iteration</A> object calculates whether the solution has reached the desired accuracy, or whether the maximum number of iterations has been reached. The method finished() checks both convergence and number of iterations. The method converged() only checks convergence. The error code() method is used to determine the return value for the this iterative solver function. The first() method is used to determine the first iteration of the loop. <p> <p> For all algorithms, if the error_code() is 0, it suggests the algorithm converges. Otherwise, if the error_code() returns 1, it means the maximum number of iteration has been reached but the desired accuacy is not reached. For other return codes, see the respective document.</TD></TR><TR><TD><IMG SRC="whitespace.gif" Alt="" WIDTH="32" HEIGHT="10" ALIGN="TOP"></TD></TR><TR BGCOLOR=#e0e0e0><TD VALIGN=BOTTOM><FONT FACE=arial,helvetica SIZE=+1><B>Refinement of</B></FONT></TD></TR><TR><TD></TD></TR><TR><TD><IMG SRC="whitespace.gif" Alt="" WIDTH="32" HEIGHT="10" ALIGN="TOP"></TD></TR><TR BGCOLOR=#e0e0e0><TD VALIGN=BOTTOM><FONT FACE=arial,helvetica SIZE=+1><B>Associated types</B></FONT></TD></TR><TR><TD><TABLE BORDER><TR><TH>Concept</TH><TH>Type name</TH><TH>Description</TH></TR> </TABLE></TD></TR><TR><TD><IMG SRC="whitespace.gif" Alt="" WIDTH="32" HEIGHT="10" ALIGN="TOP"></TD></TR><TR BGCOLOR=#e0e0e0><TD VALIGN=BOTTOM><FONT FACE=arial,helvetica SIZE=+1><B>Notations</B></FONT></TD></TR><TR><TD></TD></TR><TR><TD><IMG SRC="whitespace.gif" Alt="" WIDTH="32" HEIGHT="10" ALIGN="TOP"></TD></TR><TR BGCOLOR=#e0e0e0><TD VALIGN=BOTTOM><FONT FACE=arial,helvetica SIZE=+1><B>Definitions</B></FONT></TD></TR><TR><TD><UL></UL></TD></TR><TR><TD><IMG SRC="whitespace.gif" Alt="" WIDTH="32" HEIGHT="10" ALIGN="TOP"></TD></TR><TR BGCOLOR=#e0e0e0><TD VALIGN=BOTTOM><FONT FACE=arial,helvetica SIZE=+1><B>Expression semantics</B></FONT></TD></TR><TR><TD><TABLE BORDER><TR><TH>Description</TH><TH>Expression</TH><TH>Semantics</TH></TR> <TR> <TD><FONT FACE=Times SIZE=3> Testing if stop criteria is satisfied </FONT></TD> <TD VALIGN="TOP"> <TT> finish( <A HREF="Vector.html" >Vector</A> );</TT> </TD> <TD VALIGN="TOP"> <TT> </TT> </TD> </TR> <TR> <TD><FONT FACE=Times SIZE=3> Testing if stop criteria is satisfied for the case of qusi residual case. </FONT></TD> <TD VALIGN="TOP"> <TT> finish( TrivialType );</TT> </TD> <TD VALIGN="TOP"> <TT> </TT> </TD> </TR> <TR> <TD><FONT FACE=Times SIZE=3> Testing if it is converged </FONT></TD> <TD VALIGN="TOP"> <TT> converged( <A HREF="Vector.html" >Vector</A> );</TT> </TD> <TD VALIGN="TOP"> <TT> </TT> </TD> </TR> <TR> <TD><FONT FACE=Times SIZE=3> Testing if it is converged for the case of qusi residual case. </FONT></TD> <TD VALIGN="TOP"> <TT> converged( TrivialType );</TT> </TD> <TD VALIGN="TOP"> <TT> </TT> </TD> </TR> <TR> <TD><FONT FACE=Times SIZE=3> to increment number of iteration by one </FONT></TD> <TD VALIGN="TOP"> <TT> Iter;</TT> </TD> <TD VALIGN="TOP"> <TT> </TT> </TD> </TR> <TR> <TD><FONT FACE=Times SIZE=3> to Check if this is the first iteration </FONT></TD> <TD VALIGN="TOP"> <TT> Iter.first();</TT> </TD> <TD VALIGN="TOP"> <TT> </TT> </TD> </TR> <TR> <TD><FONT FACE=Times SIZE=3> to return error_code. Zero means success. </FONT></TD> <TD VALIGN="TOP"> <TT> Iter.error_code();</TT> </TD> <TD VALIGN="TOP"> <TT> </TT> </TD> </TR> <TR> <TD><FONT FACE=Times SIZE=3> to return number of iteration to be performed. </FONT></TD> <TD VALIGN="TOP"> <TT> Iter.iteration();</TT> </TD> <TD VALIGN="TOP"> <TT> </TT> </TD> </TR> <TR> <TD><FONT FACE=Times SIZE=3> to return residual or qusi-residual </FONT></TD> <TD VALIGN="TOP"> <TT> Iter.resid();</TT> </TD> <TD VALIGN="TOP"> <TT> </TT> </TD> </TR> <TR> <TD><FONT FACE=Times SIZE=3> to return tolerance. </FONT></TD> <TD VALIGN="TOP"> <TT> Iter.tol();</TT> </TD> <TD VALIGN="TOP"> <TT> </TT> </TD> </TR> <TR> <TD><FONT FACE=Times SIZE=3> <A HREF="set.html" >set</A> fail reason once fail happens during iteration </FONT></TD> <TD VALIGN="TOP"> <TT> fail( int );</TT> </TD> <TD VALIGN="TOP"> <TT> </TT> </TD> </TR> <TR> <TD><FONT FACE=Times SIZE=3> <A HREF="set.html" >set</A> fail reason once fail happens during iteration </FONT></TD> <TD VALIGN="TOP"> <TT> fail( int, string );</TT> </TD> <TD VALIGN="TOP"> <TT> </TT> </TD> </TR> </TABLE></TD></TR><TR><TD><IMG SRC="whitespace.gif" Alt="" WIDTH="32" HEIGHT="10" ALIGN="TOP"></TD></TR><TR BGCOLOR=#e0e0e0><TD VALIGN=BOTTOM><FONT FACE=arial,helvetica SIZE=+1><B>Function specification</B></FONT></TD></TR><TR><TD><TABLE BORDER><TR><TH>Name</TH><TH>Function</TH><TH>Complexity</TH></TR> </TABLE></TD></TR><TR><TD><IMG SRC="whitespace.gif" Alt="" WIDTH="32" HEIGHT="10" ALIGN="TOP"></TD></TR><TR BGCOLOR=#e0e0e0><TD VALIGN=BOTTOM><FONT FACE=arial,helvetica SIZE=+1><B>Invariants</B></FONT></TD></TR><TR><TD></TD></TR><TR><TD><IMG SRC="whitespace.gif" Alt="" WIDTH="32" HEIGHT="10" ALIGN="TOP"></TD></TR><TR BGCOLOR=#e0e0e0><TD VALIGN=BOTTOM><FONT FACE=arial,helvetica SIZE=+1><B>Models</B></FONT></TD></TR><TR><TD><UL></UL></TD></TR><TR><TD><IMG SRC="whitespace.gif" Alt="" WIDTH="32" HEIGHT="15" ALIGN="TOP"></TD></TR><TR BGCOLOR=#e0e0e0><TD VALIGN=BOTTOM><FONT FACE=arial,helvetica SIZE=+1><B>Notes</B></FONT></TD></TR><TR><TD></TD></TR><TR><TD><IMG SRC="whitespace.gif" Alt="" WIDTH="32" HEIGHT="15" ALIGN="TOP"></TD></TR><TR BGCOLOR=#e0e0e0><TD VALIGN=BOTTOM><FONT FACE=arial,helvetica SIZE=+1><B>See also</B></FONT></TD></TR><TR><TD></TD></TR></TABLE><!--start footer--> <P><CENTER><CENTER><IMG SRC="./blue-bar.jpg" width=640></CENTER></CENTER><P><A HREF="http://www.nd.edu"><IMG BORDER=0 SRC="./ndtoclogo.gif" ALT="[MTL Home]" ALIGN=absmiddle></A></A><FONT SIZE="-2"><A HREF="../LICENSE.htm">Copyright ©1998,1999 University of Notre Dame. All Rights Reserved.</FONT></FONT></BODY></HTML> ⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -