NAG FL Interface
f07usf (ztptrs)

Settings help

FL Name Style:


FL Specification Language:


1 Purpose

f07usf solves a complex triangular system of linear equations with multiple right-hand sides, AX=B, ATX=B or AHX=B, using packed storage.

2 Specification

Fortran Interface
Subroutine f07usf ( uplo, trans, diag, n, nrhs, ap, b, ldb, info)
Integer, Intent (In) :: n, nrhs, ldb
Integer, Intent (Out) :: info
Complex (Kind=nag_wp), Intent (In) :: ap(*)
Complex (Kind=nag_wp), Intent (Inout) :: b(ldb,*)
Character (1), Intent (In) :: uplo, trans, diag
C Header Interface
#include <nag.h>
void  f07usf_ (const char *uplo, const char *trans, const char *diag, const Integer *n, const Integer *nrhs, const Complex ap[], Complex b[], const Integer *ldb, Integer *info, const Charlen length_uplo, const Charlen length_trans, const Charlen length_diag)
The routine may be called by the names f07usf, nagf_lapacklin_ztptrs or its LAPACK name ztptrs.

3 Description

f07usf solves a complex triangular system of linear equations AX=B, ATX=B or AHX=B, using packed storage.

4 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

5 Arguments

1: uplo Character(1) Input
On entry: 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 Character(1) Input
On entry: 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 Character(1) Input
On entry: 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: n Integer Input
On entry: n, the order of the matrix A.
Constraint: n0.
5: nrhs Integer Input
On entry: r, the number of right-hand sides.
Constraint: nrhs0.
6: ap(*) Complex (Kind=nag_wp) array Input
Note: the dimension of the array ap must be at least max(1,n×(n+1)/2).
On entry: the n×n triangular matrix A, packed by columns.
More precisely,
  • if uplo='U', the upper triangle of A must be stored with element Aij in ap(i+j(j-1)/2) for ij;
  • if uplo='L', the lower triangle of A must be stored with element Aij in ap(i+(2n-j)(j-1)/2) for ij.
If diag='U', the diagonal elements of A are assumed to be 1, and are not referenced; the same storage scheme is used whether diag='N' or ‘U’.
7: b(ldb,*) Complex (Kind=nag_wp) array Input/Output
Note: the second dimension of the array b must be at least max(1,nrhs).
On entry: the n×r right-hand side matrix B.
On exit: the n×r solution matrix X.
8: ldb Integer Input
On entry: the first dimension of the array b as declared in the (sub)program from which f07usf is called.
Constraint: ldbmax(1,n).
9: info Integer Output
On exit: info=0 unless the routine detects an error (see Section 6).

6 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.
info>0
Element value of the diagonal is exactly zero. A is singular and the solution has not been computed.

7 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+E)x=b, where
|E|c(n)ε|A| ,  
c(n) 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 c(n)cond(A,x)ε ,   provided   c(n)cond(A,x)ε<1 ,  
where cond(A,x)=|A-1||A||x|/x.
Note that cond(A,x)cond(A)=|A-1||A|κ(A); cond(A,x) can be much smaller than cond(A) and it is also possible for cond(AH), which is the same as cond(AT), to be much larger (or smaller) than cond(A).
Forward and backward error bounds can be computed by calling f07uvf, and an estimate for κ(A) can be obtained by calling f07uuf with norm='I'.

8 Parallelism and Performance

f07usf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
f07usf makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.
Please consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

9 Further Comments

The total number of real floating-point operations is approximately 4n2r.
The real analogue of this routine is f07uef.

10 Example

This example solves the system of equations AX=B, where
A= ( 4.78+4.56i 0.00+0.00i 0.00+0.00i 0.00+0.00i 2.00-0.30i -4.11+1.25i 0.00+0.00i 0.00+0.00i 2.89-1.34i 2.36-4.25i 4.15+0.80i 0.00+0.00i -1.89+1.15i 0.04-3.69i -0.02+0.46i 0.33-0.26i )  
and
B= ( -14.78-32.36i -18.02+28.46i 2.98-02.14i 14.22+15.42i -20.96+17.06i 5.62+35.89i 9.54+09.91i -16.46-01.73i ) ,  
using packed storage for A.

10.1 Program Text

Program Text (f07usfe.f90)

10.2 Program Data

Program Data (f07usfe.d)

10.3 Program Results

Program Results (f07usfe.r)