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_linsys_complex_tridiag_solve (f04cc)

 Contents

    1  Purpose
    2  Syntax
    7  Accuracy
    9  Example

Purpose

nag_linsys_complex_tridiag_solve (f04cc) computes the solution to a complex system of linear equations AX=B, where A is an n by n tridiagonal matrix and X and B are n by r matrices. An estimate of the condition number of A and an error bound for the computed solution are also returned.

Syntax

[dl, d, du, du2, ipiv, b, rcond, errbnd, ifail] = f04cc(dl, d, du, b, 'n', n, 'nrhs_p', nrhs_p)
[dl, d, du, du2, ipiv, b, rcond, errbnd, ifail] = nag_linsys_complex_tridiag_solve(dl, d, du, b, 'n', n, 'nrhs_p', nrhs_p)

Description

The LU decomposition with partial pivoting and row interchanges is used to factor A as A=PLU, where P is a permutation matrix, L is unit lower triangular with at most one nonzero subdiagonal element, and U is an upper triangular band matrix with two superdiagonals. The factored form of A is then used to solve the system of equations AX=B.
Note that the equations ATX=B may be solved by interchanging the order of the arguments du and dl.

References

Anderson E, Bai Z, Bischof C, Blackford S, Demmel J, Dongarra J J, Du Croz J J, Greenbaum A, Hammarling S, McKenney A and Sorensen D (1999) LAPACK Users' Guide (3rd Edition) SIAM, Philadelphia http://www.netlib.org/lapack/lug
Higham N J (2002) Accuracy and Stability of Numerical Algorithms (2nd Edition) SIAM, Philadelphia

Parameters

Compulsory Input Parameters

1:     dl: – complex array
The dimension of the array dl must be at least max1,n-1
Must contain the n-1 subdiagonal elements of the matrix A.
2:     d: – complex array
The dimension of the array d must be at least max1,n
Must contain the n diagonal elements of the matrix A.
3:     du: – complex array
The dimension of the array du must be at least max1,n-1
Must contain the n-1 superdiagonal elements of the matrix A
4:     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 matrix of right-hand sides B.

Optional Input Parameters

1:     n int64int32nag_int scalar
Default: the first dimension of the array b and the dimension of the array d.
The number of linear equations n, i.e., the order of the matrix A.
Constraint: n0.
2:     nrhs_p int64int32nag_int scalar
Default: the second dimension of the array b.
The number of right-hand sides r, i.e., the number of columns of the matrix B.
Constraint: nrhs_p0.

Output Parameters

1:     dl: – complex array
The dimension of the array dl will be max1,n-1
If ifail0, dl stores the n-1 multipliers that define the matrix L from the LU factorization of A.
2:     d: – complex array
The dimension of the array d will be max1,n
If ifail0, d stores the n diagonal elements of the upper triangular matrix U from the LU factorization of A.
3:     du: – complex array
The dimension of the array du will be max1,n-1
If ifail0, du stores the n-1 elements of the first superdiagonal of U.
4:     du2n-2 – complex array
If ifail0, du2 returns the n-2 elements of the second superdiagonal of U.
5:     ipivn int64int32nag_int array
If ifail0, the pivot indices that define the permutation matrix P; at the ith step row i of the matrix was interchanged with row ipivi. ipivi will always be either i or i+1; ipivi=i indicates a row interchange was not required.
6:     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.
If ifail=0 or n+1, the n by r solution matrix X.
7:     rcond – double scalar
If no constraints are violated, an estimate of the reciprocal of the condition number of the matrix A, computed as rcond=1/A1A-11.
8:     errbnd – double scalar
If ifail=0 or n+1, an estimate of the forward error bound for a computed solution x^, such that x^-x1/x1errbnd, where x^ is a column of the computed solution returned in the array b and x is the corresponding column of the exact solution X. If rcond is less than machine precision, then errbnd is returned as unity.
9:     ifail int64int32nag_int scalar
ifail=0 unless the function detects an error (see Error Indicators and Warnings).

Error Indicators and Warnings

Errors or warnings detected by the function:

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

   ifail>0andifailn
Diagonal element _ of the upper triangular factor is zero. The factorization has been completed, but the solution could not be computed.
W  ifail=n+1
A solution has been computed, but rcond is less than machine precision so that the matrix A is numerically singular.
   ifail=-1
Constraint: n0.
   ifail=-2
Constraint: nrhs_p0.
   ifail=-9
Constraint: ldbmax1,n.
   ifail=-99
An unexpected error has been triggered by this routine. Please contact NAG.
   ifail=-399
Your licence key may have expired or may not have been installed correctly.
   ifail=-999
Dynamic memory allocation failed.
The complex allocatable memory required is 2×n. In this case the factorization and the solution X have been computed, but rcond and errbnd have not been computed.

Accuracy

The computed solution for a single right-hand side, x^, satisfies an equation of the form
A+E x^=b,  
where
E1 = Oε A1  
and ε is the machine precision. An approximate error bound for the computed solution is given by
x^-x1 x1 κA E1 A1 ,  
where κA = A-11 A1 , the condition number of A with respect to the solution of the linear equations. nag_linsys_complex_tridiag_solve (f04cc) uses the approximation E1=εA1 to estimate errbnd. See Section 4.4 of Anderson et al. (1999) for further details.

Further Comments

The total number of floating-point operations required to solve the equations AX=B is proportional to nr. The condition number estimation typically requires between four and five solves and never more than eleven solves, following the factorization.
In practice the condition number estimator is very reliable, but it can underestimate the true condition number; see Section 15.3 of Higham (2002) for further details.
The real analogue of nag_linsys_complex_tridiag_solve (f04cc) is nag_linsys_real_tridiag_solve (f04bc).

Example

This example solves the equations
AX=B,  
where A is the tridiagonal matrix
A= -1.3+1.3i 2.0-1.0i 0.0i+0.0 0.0i+0.0 0.0i+0.0 1.0-2.0i -1.3+1.3i 2.0+1.0i 0.0i+0.0 0.0i+0.0 0.0i+0.0 1.0+1.0i -1.3+3.3i -1.0+1.0i 0.0i+0.0 0.0i+0.0 0.0i+0.0 2.0-3.0i -0.3+4.3i 1.0-1.0i 0.0i+0.0 0.0i+0.0 0.0i+0.0 1.0+1.0i -3.3+1.3i  
and
B = 2.4-05.0i 2.7+06.9i 3.4+18.2i -6.9-05.3i -14.7+09.7i -6.0-00.6i 31.9-07.7i -3.9+09.3i -1.0+01.6i -3.0+12.2i .  
An estimate of the condition number of A and an approximate error bound for the computed solutions are also printed.
function f04cc_example


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

du = [                2.0 -  1.0i;  2.0 + 1.0i; -1.0 + 1.0i;  1.0 - 1.0i];
d  = [ -1.3 +  1.3i; -1.3 +  1.3i; -1.3 + 3.3i; -0.3 + 4.3i; -3.3 + 1.3i];
dl = [  1.0 -  2.0i;  1.0 +  1.0i;  2.0 - 3.0i;  1.0 + 1.0i             ];

b = [   2.4 -  5.0i,  2.7 +  6.9i;
        3.4 + 18.2i, -6.9 -  5.3i;
      -14.7 +  9.7i, -6.0 -  0.6i;
       31.9 -  7.7i, -3.9 +  9.3i;
       -1.0 +  1.6i, -3.0 + 12.2i];

[dl, d, du, du2, ipiv, x, rcond, errbnd, ifail] = ...
  f04cc(dl, d, du, b);

fprintf('Solution is x:\n');
disp(x);
fprintf('\nApproximate condition number = %8.3f\n',1/rcond);
fprintf('Error bound on solution      = %11.3e\n',errbnd);


f04cc example results

Solution is x:
   1.0000 + 1.0000i   2.0000 - 1.0000i
   3.0000 - 1.0000i   1.0000 + 2.0000i
   4.0000 + 5.0000i  -1.0000 + 1.0000i
  -1.0000 - 2.0000i   2.0000 + 1.0000i
   1.0000 - 1.0000i   2.0000 - 2.0000i


Approximate condition number =  183.970
Error bound on solution      =   2.042e-14

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