PDF version (NAG web site
, 64-bit version, 64-bit version)
NAG Toolbox: nag_lapack_zgbcon (f07bu)
Purpose
nag_lapack_zgbcon (f07bu) estimates the condition number of a complex band matrix
, where
has been factorized by
nag_lapack_zgbtrf (f07br).
Syntax
Description
nag_lapack_zgbcon (f07bu) estimates the condition number of a complex band matrix
, in either the
-norm or the
-norm:
Note that .
Because the condition number is infinite if is singular, the function actually returns an estimate of the reciprocal of the condition number.
The function should be preceded by a call to
to compute
or
, and a call to
nag_lapack_zgbtrf (f07br) to compute the
factorization of
. The function then uses Higham's implementation of Hager's method (see
Higham (1988)) to estimate
or
.
References
Higham N J (1988) FORTRAN codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation ACM Trans. Math. Software 14 381–396
Parameters
Compulsory Input Parameters
- 1:
– string (length ≥ 1)
-
Indicates whether
or
is estimated.
- or
- is estimated.
- is estimated.
Constraint:
, or .
- 2:
– int64int32nag_int scalar
-
, the number of subdiagonals within the band of the matrix .
Constraint:
.
- 3:
– int64int32nag_int scalar
-
, the number of superdiagonals within the band of the matrix .
Constraint:
.
- 4:
– complex array
-
The first dimension of the array
ab must be at least
.
The second dimension of the array
ab must be at least
.
The
factorization of
, as returned by
nag_lapack_zgbtrf (f07br).
- 5:
– int64int32nag_int array
-
The dimension of the array
ipiv
must be at least
The pivot indices, as returned by
nag_lapack_zgbtrf (f07br).
- 6:
– double scalar
-
If
or
, the
-norm of the
original matrix
.
If , the -norm of the original matrix .
anorm must be computed either
before calling
nag_lapack_zgbtrf (f07br) or else from a
copy of the original matrix
(see
Example).
Constraint:
.
Optional Input Parameters
- 1:
– int64int32nag_int scalar
-
Default:
the second dimension of the array
ab.
, the order of the matrix .
Constraint:
.
Output Parameters
- 1:
– double scalar
-
An estimate of the reciprocal of the condition number of
.
rcond is set to zero if exact singularity is detected or the estimate underflows. If
rcond is less than
machine precision,
is singular to working precision.
- 2:
– int64int32nag_int scalar
unless the function detects an error (see
Error Indicators and Warnings).
Error Indicators and Warnings
-
If , argument had an illegal value. An explanatory message is output, and execution of the program is terminated.
Accuracy
The computed estimate
rcond is never less than the true value
, and in practice is nearly always less than
, although examples can be constructed where
rcond is much larger.
Further Comments
A call to
nag_lapack_zgbcon (f07bu) involves solving a number of systems of linear equations of the form
or
; the number is usually
and never more than
. Each solution involves approximately
real floating-point operations (assuming
and
) but takes considerably longer than a call to
nag_lapack_zgbtrs (f07bs) with one right-hand side, because extra care is taken to avoid overflow when
is approximately singular.
The real analogue of this function is
nag_lapack_dgbcon (f07bg).
Example
This example estimates the condition number in the
-norm of the matrix
, where
Open in the MATLAB editor:
f07bu_example
function f07bu_example
fprintf('f07bu example results\n\n');
m = int64(4);
kl = int64(1);
ku = int64(2);
ab = [0 + 0i, 0 + 0i, 0.97 - 2.84i, 0.59 - 0.48i;
0 + 0i, -2.05 - 0.85i, -3.99 + 4.01i, 3.33 - 1.04i;
-1.65 + 2.26i, -1.48 - 1.75i, -1.06 + 1.94i, -0.46 - 1.72i;
0 + 6.3i, -0.77 + 2.83i, 4.48 - 1.09i, 0 + 0i];
norm_p = 'one';
anorm = f16ub( ...
norm_p, m, kl, ku, ab);
abf = [ complex(zeros(kl,m)); ab];
[abf, ipiv, info] = f07br( ...
m, kl, ku, abf);
[rcond, info] = f07bu( ...
norm_p, kl, ku, abf, ipiv, anorm);
fprintf('Estimate of condition number = %9.2e\n', 1/rcond);
f07bu example results
Estimate of condition number = 1.04e+02
PDF version (NAG web site
, 64-bit version, 64-bit version)
© The Numerical Algorithms Group Ltd, Oxford, UK. 2009–2015