hide long namesshow long names
hide short namesshow short names
Integer type:  int32  int64  nag_int  show int32  show int32  show int64  show int64  show nag_int  show nag_int

PDF version (NAG web site, 64-bit version, 64-bit version)
Chapter Contents
Chapter Introduction
NAG Toolbox

NAG Toolbox: nag_lapack_ztbtrs (f07vs)

 Contents

    1  Purpose
    2  Syntax
    7  Accuracy
    9  Example

Purpose

nag_lapack_ztbtrs (f07vs) solves a complex triangular band system of linear equations with multiple right-hand sides, AX=B, ATX=B or AHX=B.

Syntax

[b, info] = f07vs(uplo, trans, diag, kd, ab, b, 'n', n, 'nrhs_p', nrhs_p)
[b, info] = nag_lapack_ztbtrs(uplo, trans, diag, kd, ab, b, 'n', n, 'nrhs_p', nrhs_p)

Description

nag_lapack_ztbtrs (f07vs) solves a complex triangular band system of linear equations AX=B, ATX=B or AHX=B.

References

Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore
Higham N J (1989) The accuracy of solutions to triangular systems SIAM J. Numer. Anal. 26 1252–1265

Parameters

Compulsory Input Parameters

1:     uplo – string (length ≥ 1)
Specifies whether A is upper or lower triangular.
uplo='U'
A is upper triangular.
uplo='L'
A is lower triangular.
Constraint: uplo='U' or 'L'.
2:     trans – string (length ≥ 1)
Indicates the form of the equations.
trans='N'
The equations are of the form AX=B.
trans='T'
The equations are of the form ATX=B.
trans='C'
The equations are of the form AHX=B.
Constraint: trans='N', 'T' or 'C'.
3:     diag – string (length ≥ 1)
Indicates whether A is a nonunit or unit triangular matrix.
diag='N'
A is a nonunit triangular matrix.
diag='U'
A is a unit triangular matrix; the diagonal elements are not referenced and are assumed to be 1.
Constraint: diag='N' or 'U'.
4:     kd int64int32nag_int scalar
kd, the number of superdiagonals of the matrix A if uplo='U', or the number of subdiagonals if uplo='L'.
Constraint: kd0.
5:     abldab: – complex array
The first dimension of the array ab must be at least kd+1.
The second dimension of the array ab must be at least max1,n.
The n by n triangular band matrix A.
The matrix is stored in rows 1 to kd+1, more precisely,
  • if uplo='U', the elements of the upper triangle of A within the band must be stored with element Aij in abkd+1+i-jj​ for ​max1,j-kdij;
  • if uplo='L', the elements of the lower triangle of A within the band must be stored with element Aij in ab1+i-jj​ for ​jiminn,j+kd.
If diag='U', the diagonal elements of A are assumed to be 1, and are not referenced.
6:     bldb: – complex array
The first dimension of the array b must be at least max1,n.
The second dimension of the array b must be at least max1,nrhs_p.
The n by r right-hand side matrix B.

Optional Input Parameters

1:     n int64int32nag_int scalar
Default: the second dimension of the array ab.
n, the order of the matrix A.
Constraint: n0.
2:     nrhs_p int64int32nag_int scalar
Default: the second dimension of the array b.
r, the number of right-hand sides.
Constraint: nrhs_p0.

Output Parameters

1:     bldb: – complex array
The first dimension of the array b will be max1,n.
The second dimension of the array b will be max1,nrhs_p.
The n by r solution matrix X.
2:     info int64int32nag_int scalar
info=0 unless the function detects an error (see Error Indicators and Warnings).

Error Indicators and Warnings

Cases prefixed with W are classified as warnings and do not generate an error of type NAG:error_n. See nag_issue_warnings.

   info<0
If info=-i, argument i had an illegal value. An explanatory message is output, and execution of the program is terminated.
W  info>0
Element _ of the diagonal is exactly zero. A is singular and the solution has not been computed.

Accuracy

The solutions of triangular systems of equations are usually computed to high accuracy. See Higham (1989).
For each right-hand side vector b, the computed solution x is the exact solution of a perturbed system of equations A+Ex=b, where
EckεA ,  
ck is a modest linear function of k, and ε is the machine precision.
If x^ is the true solution, then the computed solution x satisfies a forward error bound of the form
x-x^ x ckcondA,xε ,   provided   ckcondA,xε<1 ,  
where condA,x=A-1Ax/x.
Note that condA,xcondA=A-1AκA; condA,x can be much smaller than condA and it is also possible for condAH, which is the same as condAT, to be much larger (or smaller) than condA.
Forward and backward error bounds can be computed by calling nag_lapack_ztbrfs (f07vv), and an estimate for κA can be obtained by calling nag_lapack_ztbcon (f07vu) with norm_p='I'.

Further Comments

The total number of real floating-point operations is approximately 8nkr if kn.
The real analogue of this function is nag_lapack_dtbtrs (f07ve).

Example

This example solves the system of equations AX=B, where
A= -1.94+4.43i 0.00+0.00i 0.00+0.00i 0.00+0.00i -3.39+3.44i 4.12-4.27i 0.00+0.00i 0.00+0.00i 1.62+3.68i -1.84+5.53i 0.43-2.66i 0.00+0.00i 0.00+0.00i -2.77-1.93i 1.74-0.04i 0.44+0.10i  
and
B= -8.86-03.88i -24.09-05.27i -15.57-23.41i -57.97+08.14i -7.63+22.78i 19.09-29.51i -14.74-02.40i 19.17+21.33i .  
Here A is treated as a lower triangular band matrix with two subdiagonals.
function f07vs_example


fprintf('f07vs example results\n\n');

% Solve AX=B, where A is complex lower triangular banded
% and stored in triangular/symmetric banded format 
kd = int64(2);
ab = [-1.94 + 4.43i,   4.12 - 4.27i,  0.43 - 2.66i,  0.44 + 0.10i;
      -3.39 + 3.44i,  -1.84 + 5.53i,  1.74 - 0.04i,  0    + 0i;
       1.62 + 3.68i,  -2.77 - 1.93i,  0    + 0i,     0    + 0i];
b = [ -8.86 -  3.88i, -24.09 -  5.27i;
     -15.57 - 23.41i, -57.97 +  8.14i;
      -7.63 + 22.78i,  19.09 - 29.51i;
     -14.74 -  2.40i,  19.17 + 21.33i];

% Solve
uplo  = 'L';
trans = 'N';
diag  = 'N';
[x, info] = f07vs( ...
                   uplo, trans, diag, kd, ab, b);

disp('Solution(s)');
disp(x);


f07vs example results

Solution(s)
   0.0000 + 2.0000i   1.0000 + 5.0000i
   1.0000 - 3.0000i  -7.0000 - 2.0000i
  -4.0000 - 5.0000i   3.0000 + 4.0000i
   2.0000 - 1.0000i  -6.0000 - 9.0000i


PDF version (NAG web site, 64-bit version, 64-bit version)
Chapter Contents
Chapter Introduction
NAG Toolbox

© The Numerical Algorithms Group Ltd, Oxford, UK. 2009–2015