The routine may be called by the names f06wpf, nagf_blas_ztfsm or its LAPACK name ztfsm.
f06wpf solves (for ) a triangular linear system of one of the forms
where is a complex triangular matrix stored in RFP format, , are complex matrices, and is a complex scalar.
The RFP storage format is described in Section 3.3.3 in the F07 Chapter Introduction.
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. Software37, 2
1: – Character(1)Input
On entry: specifies whether the normal RFP representation of or its conjugate transpose is stored.
The matrix is stored in normal RFP format.
The conjugate transpose of the RFP representation of the matrix is stored.
2: – Character(1)Input
On entry: specifies whether is operated on from the left or the right, or similarly whether (or its transpose) appears to the left or right of the solution matrix in the linear system to be solved.
is pre-multiplied from the left. The system to be solved has the form or .
is post-multiplied from the right. The system to be solved has the form or .
3: – Character(1)Input
On entry: specifies whether is upper or lower triangular.
is upper triangular.
is lower triangular.
4: – Character(1)Input
On entry: specifies whether the operation involves or , i.e., whether or not is transpose conjugated in the linear system to be solved.
The operation involves , i.e., is not transpose conjugated.
The operation involves , i.e., is transpose conjugated.
5: – Character(1)Input
On entry: specifies whether has nonunit or unit diagonal elements.
The diagonal elements of are stored explicitly.
The diagonal elements of are assumed to be , the corresponding elements of a are not referenced.
6: – IntegerInput
On entry: , the number of rows of the matrix .
7: – IntegerInput
On entry: , the number of columns of the matrix .
8: – Complex (Kind=nag_wp)Input
On entry: the scalar .
9: – Complex (Kind=nag_wp) arrayInput
Note: the dimension of the array a
must be at least
if and at least if .
On entry: , the triangular matrix if or the triangular matrix if , 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 , a is not referenced.
10: – Complex (Kind=nag_wp) arrayInput/Output
Note: the second dimension of the array b
must be at least
On exit: the updated matrix , or similarly the solution matrix .
11: – IntegerInput
On entry: the first dimension of the array b as declared in the (sub)program from which f06wpf is called.
6Error Indicators and Warnings
8Parallelism and Performance
Background information to multithreading can be found in the Multithreading documentation.
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.
This example reads in the upper triangular part of a symmetric matrix which it converts to RFP format. It also reads in and a matrix and then performs the matrix-matrix operation .