txlyre
/
avram


			
				
					
						
						
							12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455
							<html lang="en">
<head>
<title>kinsol output - avram - a virtual machine code interpreter</title>
<meta http-equiv="Content-Type" content="text/html">
<meta name="description" content="avram - a virtual machine code interpreter">
<meta name="generator" content="makeinfo 4.13">
<link title="Top" rel="start" href="index.html#Top">
<link rel="up" href="kinsol.html#kinsol" title="kinsol">
<link rel="prev" href="kinsol-input-parameters.html#kinsol-input-parameters" title="kinsol input parameters">
<link rel="next" href="kinsol-exceptions.html#kinsol-exceptions" title="kinsol exceptions">
<link href="http://www.gnu.org/software/texinfo/" rel="generator-home" title="Texinfo Homepage">
<meta http-equiv="Content-Style-Type" content="text/css">
<style type="text/css"><!--
  pre.display { font-family:inherit }
  pre.format  { font-family:inherit }
  pre.smalldisplay { font-family:inherit; font-size:smaller }
  pre.smallformat  { font-family:inherit; font-size:smaller }
  pre.smallexample { font-size:smaller }
  pre.smalllisp    { font-size:smaller }
  span.sc    { font-variant:small-caps }
  span.roman { font-family:serif; font-weight:normal; } 
  span.sansserif { font-family:sans-serif; font-weight:normal; } 
--></style>
</head>
<body>
<div class="node">
<a name="kinsol-output"></a>
<p>
Next:&nbsp;<a rel="next" accesskey="n" href="kinsol-exceptions.html#kinsol-exceptions">kinsol exceptions</a>,
Previous:&nbsp;<a rel="previous" accesskey="p" href="kinsol-input-parameters.html#kinsol-input-parameters">kinsol input parameters</a>,
Up:&nbsp;<a rel="up" accesskey="u" href="kinsol.html#kinsol">kinsol</a>
<hr>
</div>

<h4 class="subsection">D.9.2 <code>kinsol</code> output</h4>

<p>The <code>kinsol</code> functions attempt to search the domain of
<var>f</var> for a vector <var>v</var> the length of <var>i</var> to satisfy
<var>f</var><code>(</code><var>v</var><code>) = </code><var>o</var> as closely as possible. In the case
of constrained optimization, (i.e., functions whose names begin with
<code>c</code>), only non-negative numbers are acceptable in <var>v</var>. The
search for <var>v</var> will start in the vicinity of <var>i</var>. The value of
<var>i</var> will therefore determine a unique solution if multiple
solutions exist, and will save time if it is near a solution.

   <p>In some cases when a solution can't be found due to non-convergence,
<a name="index-non_002dconvergence-742"></a>an empty list is returned. Non-convergence is not considered an
exceptional condition. In all other cases where no exception occurs,
the output from a <code>kinsol</code> function will be the list <var>v</var> of
real numbers satisfying <var>f</var><code>(</code><var>v</var><code>) = </code><var>o</var> to the best
possible tolerance. 
<a name="index-tolerance-743"></a>

   </body></html>