Scilab-Branch-5.3-GIT
- Scilab help
- Linear Algebra
- aff2ab
- balanc
- bdiag
- chfact
- chol
- chsolve
- classmarkov
- cmb_lin
- coff
- colcomp
- companion
- cond
- det
- eigenmarkov
- ereduc
- expm
- fstair
- fullrf
- fullrfk
- genmarkov
- givens
- glever
- gschur
- gspec
- hess
- householder
- im_inv
- inv
- kernel
- kroneck
- linsolve
- lsq
- lu
- lyap
- nlev
- orth
- pbig
- pencan
- penlaur
- pinv
- polar
- proj
- projspec
- psmall
- qr
- quaskro
- randpencil
- range
- rank
- rankqr
- rcond
- rowcomp
- rowshuff
- rref
- schur
- spaninter
- spanplus
- spantwo
- spec
- sqroot
- squeeze
- sva
- svd
- sylv
- trace
Please note that the recommended version of Scilab is 2025.0.0. This page might be outdated.
See the recommended documentation of this function
rcond
inverse condition number
Calling Sequence
rcond(X)
Arguments
- X
real or complex square matrix
Description
rcond(X)
is an estimate for the reciprocal of the
condition of X
in the 1-norm.
If X
is well conditioned, rcond(X)
is close to 1.
If not, rcond(X)
is close to 0.
We compute the 1-norm of A with Lapack/DLANGE, compute its LU decomposition with Lapack/DGETRF and finally estimate the condition with Lapack/DGECON.
Examples
A=diag([1:10]); rcond(A) A(1,1)=0.000001; rcond(A)
Estimating the 1-norm inverse condition number with rcond
is
much faster than computing the 2-norm condition number with cond
.
As a trade-off, rcond
may be less reliable.
<< rankqr | Linear Algebra | rowcomp >> |