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_zgetrs (f07as)

 Contents

    1  Purpose
    2  Syntax
    7  Accuracy
    9  Example

Purpose

nag_lapack_zgetrs (f07as) solves a complex system of linear equations with multiple right-hand sides,
AX=B ,  ATX=B   or   AHX=B ,  
where A has been factorized by nag_lapack_zgetrf (f07ar).

Syntax

[b, info] = f07as(trans, a, ipiv, b, 'n', n, 'nrhs_p', nrhs_p)
[b, info] = nag_lapack_zgetrs(trans, a, ipiv, b, 'n', n, 'nrhs_p', nrhs_p)

Description

nag_lapack_zgetrs (f07as) is used to solve a complex system of linear equations AX=B, ATX=B or AHX=B, the function must be preceded by a call to nag_lapack_zgetrf (f07ar) which computes the LU factorization of A as A=PLU. The solution is computed by forward and backward substitution.
If trans='N', the solution is computed by solving PLY=B and then UX=Y.
If trans='T', the solution is computed by solving UTY=B and then LTPTX=Y.
If trans='C', the solution is computed by solving UHY=B and then LHPTX=Y.

References

Golub G H and Van Loan C F (1996) Matrix Computations (3rd Edition) Johns Hopkins University Press, Baltimore

Parameters

Compulsory Input Parameters

1:     trans – string (length ≥ 1)
Indicates the form of the equations.
trans='N'
AX=B is solved for X.
trans='T'
ATX=B is solved for X.
trans='C'
AHX=B is solved for X.
Constraint: trans='N', 'T' or 'C'.
2:     alda: – complex array
The first dimension of the array a must be at least max1,n.
The second dimension of the array a must be at least max1,n.
The LU factorization of A, as returned by nag_lapack_zgetrf (f07ar).
3:     ipiv: int64int32nag_int array
The dimension of the array ipiv must be at least max1,n
The pivot indices, as returned by nag_lapack_zgetrf (f07ar).
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 right-hand side matrix B.

Optional Input Parameters

1:     n int64int32nag_int scalar
Default: the first dimension of the arrays a, b and the second dimension of the arrays a, ipiv.
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

   info<0
If info=-i, argument i had an illegal value. An explanatory message is output, and execution of the program is terminated.

Accuracy

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
EcnεPLU ,  
cn is a modest linear function of n, 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 cncondA,xε  
where condA,x = A-1 A x / x condA = A-1 A κ A .
Note that condA,x can be much smaller than condA, and condAH (which is the same as condAT) can be much larger (or smaller) than condA.
Forward and backward error bounds can be computed by calling nag_lapack_zgerfs (f07av), and an estimate for κA can be obtained by calling nag_lapack_zgecon (f07au) with norm_p='I'.

Further Comments

The total number of real floating-point operations is approximately 8n2r.
This function may be followed by a call to nag_lapack_zgerfs (f07av) to refine the solution and return an error estimate.
The real analogue of this function is nag_lapack_dgetrs (f07ae).

Example

This example solves the system of equations AX=B, where
A= -1.34+2.55i 0.28+3.17i -6.39-2.20i 0.72-0.92i -0.17-1.41i 3.31-0.15i -0.15+1.34i 1.29+1.38i -3.29-2.39i -1.91+4.42i -0.14-1.35i 1.72+1.35i 2.41+0.39i -0.56+1.47i -0.83-0.69i -1.96+0.67i  
and
B= 26.26+51.78i 31.32-06.70i 6.43-08.68i 15.86-01.42i -5.75+25.31i -2.15+30.19i 1.16+02.57i -2.56+07.55i .  
Here A is nonsymmetric and must first be factorized by nag_lapack_zgetrf (f07ar).
function f07as_example


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

trans = 'N';
a = [-1.34 + 2.55i,  0.28 + 3.17i, -6.39 - 2.20i,  0.72 - 0.92i;
     -0.17 - 1.41i,  3.31 - 0.15i, -0.15 + 1.34i,  1.29 + 1.38i;
     -3.29 - 2.39i, -1.91 + 4.42i, -0.14 - 1.35i,  1.72 + 1.35i;
      2.41 + 0.39i, -0.56 + 1.47i, -0.83 - 0.69i, -1.96 + 0.67i];
b = [26.26 + 51.78i, 31.32 -  6.70i;
      6.43 -  8.68i, 15.86 -  1.42i;
     -5.75 + 25.31i, -2.15 + 30.19i;
      1.16 +  2.57i, -2.56 +  7.55i];

% Factorize a
[a, ipiv, info] = f07ar(a);

% Compute solution
[x, info] = f07as(trans, a, ipiv, b);

disp('Solution(s)');
fprintf('%11d        ', [1:size(b,2)]);
fprintf('\n');
disp(x);


f07as example results

Solution(s)
          1                  2        
   1.0000 + 1.0000i  -1.0000 - 2.0000i
   2.0000 - 3.0000i   5.0000 + 1.0000i
  -4.0000 - 5.0000i  -3.0000 + 4.0000i
   0.0000 + 6.0000i   2.0000 - 3.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