Mercurial > hg > octave-nkf
comparison scripts/sparse/pcr.m @ 7001:8b0cfeb06365
[project @ 2007-10-10 18:02:59 by jwe]
author | jwe |
---|---|
date | Wed, 10 Oct 2007 18:03:02 +0000 |
parents | 2c85044aa63f |
children | 93c65f2a5668 |
comparison
equal
deleted
inserted
replaced
7000:e87f860624cc | 7001:8b0cfeb06365 |
---|---|
90 ## @var{iter} is the actual number of iterations performed. | 90 ## @var{iter} is the actual number of iterations performed. |
91 ## | 91 ## |
92 ## @item | 92 ## @item |
93 ## @var{resvec} describes the convergence history of the method, | 93 ## @var{resvec} describes the convergence history of the method, |
94 ## so that @code{@var{resvec} (i)} contains the Euclidean norms of the | 94 ## so that @code{@var{resvec} (i)} contains the Euclidean norms of the |
95 ## residualafter the (@var{i}-1)-th iteration, @code{@var{i} = | 95 ## residual after the (@var{i}-1)-th iteration, @code{@var{i} = |
96 ## 1,2, @dots{}, @var{iter}+1}. | 96 ## 1,2, @dots{}, @var{iter}+1}. |
97 ## @end itemize | 97 ## @end itemize |
98 ## | 98 ## |
99 ## Let us consider a trivial problem with a diagonal matrix (we exploit the | 99 ## Let us consider a trivial problem with a diagonal matrix (we exploit the |
100 ## sparsity of A) | 100 ## sparsity of A) |
289 endif | 289 endif |
290 | 290 |
291 if (breakdown) | 291 if (breakdown) |
292 flag = 3; | 292 flag = 3; |
293 if (nargout < 2) | 293 if (nargout < 2) |
294 warning ("pcr: breakdown occured:\n"); | 294 warning ("pcr: breakdown occurred:\n"); |
295 warning ("system matrix singular or preconditioner indefinite?\n"); | 295 warning ("system matrix singular or preconditioner indefinite?\n"); |
296 endif | 296 endif |
297 endif | 297 endif |
298 | 298 |
299 endfunction | 299 endfunction |