NAG FL Interface
f06wpf (ztfsm)

1 Purpose

f06wpf performs one of the matrix-matrix operations
BαA-1B , BαA-HB , BαBA-1   or BαBA-H ,  
where A is a complex triangular matrix stored in Rectangular Full Packed (RFP) format, B is an m by n complex matrix, and α is a complex scalar. A-H denotes AH-1 or equivalently A-1H .
No test for singularity or near-singularity of A is included in this routine. Such tests must be performed before calling this routine.

2 Specification

Fortran Interface
Subroutine f06wpf ( transr, side, uplo, trans, diag, m, n, alpha, a, b, ldb)
Integer, Intent (In) :: m, n, ldb
Complex (Kind=nag_wp), Intent (In) :: alpha, a(*)
Complex (Kind=nag_wp), Intent (Inout) :: b(ldb,*)
Character (1), Intent (In) :: transr, side, uplo, trans, diag
C Header Interface
#include <nag.h>
void  f06wpf_ (const char *transr, const char *side, const char *uplo, const char *trans, const char *diag, const Integer *m, const Integer *n, const Complex *alpha, const Complex a[], Complex b[], const Integer *ldb, const Charlen length_transr, const Charlen length_side, const Charlen length_uplo, const Charlen length_trans, const Charlen length_diag)
The routine may be called by the names f06wpf, nagf_blas_ztfsm or its LAPACK name ztfsm.

3 Description

f06wpf solves (for X) a triangular linear system of one of the forms
AX=αB , AHX=αB , XA=αB   or XAH=αB ,  
where A is a complex triangular matrix stored in RFP format, B, X are m by n complex matrices, and α is a complex scalar. The RFP storage format is described in Section 3.3.3 in the F07 Chapter Introduction.

4 References

Gustavson F G, Waśniewski J, Dongarra J J and Langou J (2010) Rectangular full packed format for Cholesky's algorithm: factorization, solution, and inversion ACM Trans. Math. Software 37, 2

5 Arguments

1: transr Character(1) Input
On entry: specifies whether the normal RFP representation of A or its conjugate transpose is stored.
transr='N'
The matrix A is stored in normal RFP format.
transr='C'
The conjugate transpose of the RFP representation of the matrix A is stored.
Constraint: transr='N' or 'C'.
2: side Character(1) Input
On entry: specifies whether B is operated on from the left or the right, or similarly whether A (or its transpose) appears to the left or right of the solution matrix in the linear system to be solved.
side='L'
B is pre-multiplied from the left. The system to be solved has the form AX=αB or AHX=αB.
side='R'
B is post-multiplied from the right. The system to be solved has the form XA=αB or XAH=αB.
Constraint: side='L' or 'R'.
3: 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'.
4: trans Character(1) Input
On entry: specifies whether the operation involves A-1 or A-H, i.e., whether or not A is transpose conjugated in the linear system to be solved.
trans='N'
The operation involves A-1, i.e., A is not transpose conjugated.
trans='C'
The operation involves A-H, i.e., A is transpose conjugated.
Constraint: trans='N' or 'C'.
5: diag Character(1) Input
On entry: specifies whether A has nonunit or unit diagonal elements.
diag='N'
The diagonal elements of A are stored explicitly.
diag='U'
The diagonal elements of A are assumed to be 1, the corresponding elements of a are not referenced.
Constraint: diag='N' or 'U'.
6: m Integer Input
On entry: m, the number of rows of the matrix B.
Constraint: m0.
7: n Integer Input
On entry: n, the number of columns of the matrix B.
Constraint: n0.
8: alpha Complex (Kind=nag_wp) Input
On entry: the scalar α.
9: a* Complex (Kind=nag_wp) array Input
Note: the dimension of the array a must be at least max1,m×m+1/2 if side='L' and at least max1,n×n+1/2 if side='R'.
On entry: A, the m by m triangular matrix A if side='L' or the n by n triangular matrix A if side='R', stored in RFP format (as specified by transr). The storage format is described in detail in Section 3.3.3 in the F07 Chapter Introduction. If alpha=0.0, a is not referenced.
10: bldb* Complex (Kind=nag_wp) array Input/Output
Note: the second dimension of the array b must be at least max1,n.
On entry: the m by n matrix B.
If alpha=0, b need not be set.
On exit: the updated matrix B, or similarly the solution matrix X.
11: ldb Integer Input
On entry: the first dimension of the array b as declared in the (sub)program from which f06wpf is called.
Constraint: ldb max1,m .

6 Error Indicators and Warnings

None.

7 Accuracy

Not applicable.

8 Parallelism and Performance

f06wpf 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

None.

10 Example

This example reads in the upper triangular part of a symmetric matrix A which it converts to RFP format. It also reads in α and a 4 by 3 matrix B and then performs the matrix-matrix operation BαA-1B.

10.1 Program Text

Program Text (f06wpfe.f90)

10.2 Program Data

Program Data (f06wpfe.d)

10.3 Program Results

Program Results (f06wpfe.r)