Mercurial > octave
view libinterp/corefcn/rcond.cc @ 21317:a4faec57f4c8
maint: remove semicolon after %!assert tests to follow Octave conventions.
* testfun.txi: Remove semicolons from examples in manual and update remaider
of text to reflect changes.
* bsxfun.cc, cellfun.cc, data.cc, hash.cc, lu.cc, nproc.cc,
rcond.cc, regexp.cc, sparse-xpow.cc, strfns.cc, symtab.cc, time.cc,
variables.cc, ov-class.cc, ov-cx-diag.cc, ov-struct.cc, ov.cc, oct-parse.in.yy,
pt-mat.cc, CMatrix.cc, oct-inttypes.cc, md5sum.m, blkdiag.m, cell2mat.m,
interp1.m, interp2.m, interpft.m, num2str.m, repmat.m, ntsc2rgb.m, expm.m,
inputname.m, polyvalm.m, blackman.m, hamming.m, hanning.m, eigs.m, median.m,
binopdf.m, strsplit.m, strtok.m, assert.m, example.m, datevec.m, bug-38565.tst,
build-sparse-tests.sh, classdef.tst, classes.tst, diag-perm.tst, index.tst,
io.tst, logical-index.tst, nest.tst, parser.tst, prefer.tst, struct.tst:
maint: remove semicolon after %!assert tests to follow Octave conventions.
author | Rik <rik@octave.org> |
---|---|
date | Sun, 21 Feb 2016 08:10:36 -0800 |
parents | 40de9f8f23a6 |
children | aba2e6293dd8 |
line wrap: on
line source
/* Copyright (C) 2008-2015 David Bateman This file is part of Octave. Octave is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 3 of the License, or (at your option) any later version. Octave is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with Octave; see the file COPYING. If not, see <http://www.gnu.org/licenses/>. */ #ifdef HAVE_CONFIG_H # include "config.h" #endif #include "defun.h" #include "error.h" #include "errwarn.h" #include "ovl.h" #include "utils.h" DEFUN (rcond, args, , "-*- texinfo -*-\n\ @deftypefn {} {@var{c} =} rcond (@var{A})\n\ Compute the 1-norm estimate of the reciprocal condition number as returned\n\ by @sc{lapack}.\n\ \n\ If the matrix is well-conditioned then @var{c} will be near 1 and if the\n\ matrix is poorly conditioned it will be close to 0.\n\ \n\ The matrix @var{A} must not be sparse. If the matrix is sparse then\n\ @code{condest (@var{A})} or @code{rcond (full (@var{A}))} should be used\n\ instead.\n\ @seealso{cond, condest}\n\ @end deftypefn") { if (args.length () != 1) print_usage (); octave_value retval; if (args(0).is_sparse_type ()) error ("rcond: for sparse matrices use 'rcond (full (a))' or 'condest (a)' instead"); if (args(0).is_single_type ()) { if (args(0).is_complex_type ()) { FloatComplexMatrix m = args(0).float_complex_matrix_value (); MatrixType mattyp; retval = m.rcond (mattyp); args(0).matrix_type (mattyp); } else { FloatMatrix m = args(0).float_matrix_value (); MatrixType mattyp; retval = m.rcond (mattyp); args(0).matrix_type (mattyp); } } else if (args(0).is_complex_type ()) { ComplexMatrix m = args(0).complex_matrix_value (); MatrixType mattyp; retval = m.rcond (mattyp); args(0).matrix_type (mattyp); } else { Matrix m = args(0).matrix_value (); MatrixType mattyp; retval = m.rcond (mattyp); args(0).matrix_type (mattyp); } return retval; } /* %!assert (rcond (eye (2)), 1) %!assert (rcond (ones (2)), 0) %!assert (rcond ([1 1; 2 1]), 1/9) %!assert (rcond (magic (4)), 0, eps) %!shared x, sx %! x = [-5.25, -2.25; -2.25, 1] * eps () + ones (2) / 2; %! sx = [-5.25, -2.25; -2.25, 1] * eps ("single") + ones (2) / 2; %!assert (rcond (x) < eps ()) %!assert (rcond (sx) < eps ('single')) %!assert (rcond (x*i) < eps ()) %!assert (rcond (sx*i) < eps ('single')) */