NAG FL Interface
f08ggf (dopmtr)

1 Purpose

f08ggf multiplies an arbitrary real matrix C by the real orthogonal matrix Q which was determined by f08gef when reducing a real symmetric matrix to tridiagonal form.

2 Specification

Fortran Interface
Subroutine f08ggf ( side, uplo, trans, m, n, ap, tau, c, ldc, work, info)
Integer, Intent (In) :: m, n, ldc
Integer, Intent (Out) :: info
Real (Kind=nag_wp), Intent (In) :: tau(*)
Real (Kind=nag_wp), Intent (Inout) :: ap(*), c(ldc,*), work(*)
Character (1), Intent (In) :: side, uplo, trans
C Header Interface
#include <nag.h>
void  f08ggf_ (const char *side, const char *uplo, const char *trans, const Integer *m, const Integer *n, double ap[], const double tau[], double c[], const Integer *ldc, double work[], Integer *info, const Charlen length_side, const Charlen length_uplo, const Charlen length_trans)
The routine may be called by the names f08ggf, nagf_lapackeig_dopmtr or its LAPACK name dopmtr.

3 Description

f08ggf is intended to be used after a call to f08gef, which reduces a real symmetric matrix A to symmetric tridiagonal form T by an orthogonal similarity transformation: A=QTQT. f08gef represents the orthogonal matrix Q as a product of elementary reflectors.
This routine may be used to form one of the matrix products
QC , QTC , CQ ​ or ​ CQT ,  
overwriting the result on C (which may be any real rectangular matrix).
A common application of this routine is to transform a matrix Z of eigenvectors of T to the matrix QZ of eigenvectors of A.

4 References

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

5 Arguments

1: side Character(1) Input
On entry: indicates how Q or QT is to be applied to C.
Q or QT is applied to C from the left.
Q or QT is applied to C from the right.
Constraint: side='L' or 'R'.
2: uplo Character(1) Input
On entry: this must be the same argument uplo as supplied to f08gef.
Constraint: uplo='U' or 'L'.
3: trans Character(1) Input
On entry: indicates whether Q or QT is to be applied to C.
Q is applied to C.
QT is applied to C.
Constraint: trans='N' or 'T'.
4: m Integer Input
On entry: m, the number of rows of the matrix C; m is also the order of Q if side='L'.
Constraint: m0.
5: n Integer Input
On entry: n, the number of columns of the matrix C; n is also the order of Q if side='R'.
Constraint: n0.
6: ap* Real (Kind=nag_wp) array Input/Output
Note: the dimension of the array ap 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: details of the vectors which define the elementary reflectors, as returned by f08gef.
On exit: is used as internal workspace prior to being restored and hence is unchanged.
7: tau* Real (Kind=nag_wp) array Input
Note: the dimension of the array tau must be at least max1,m-1 if side='L' and at least max1,n-1 if side='R'.
On entry: further details of the elementary reflectors, as returned by f08gef.
8: cldc* Real (Kind=nag_wp) array Input/Output
Note: the second dimension of the array c must be at least max1,n.
On entry: the m by n matrix C.
On exit: c is overwritten by QC or QTC or CQ or CQT as specified by side and trans.
9: ldc Integer Input
On entry: the first dimension of the array c as declared in the (sub)program from which f08ggf is called.
Constraint: ldcmax1,m.
10: work* Real (Kind=nag_wp) array Workspace
Note: the dimension of the array work must be at least max1,n if side='L' and at least max1,m if side='R'.
11: info Integer Output
On exit: info=0 unless the routine detects an error (see Section 6).

6 Error Indicators and Warnings

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

7 Accuracy

The computed result differs from the exact result by a matrix E such that
E2 = Oε C2 ,  
where ε is the machine precision.

8 Parallelism and Performance

f08ggf 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 floating-point operations is approximately 2m2n if side='L' and 2mn2 if side='R'.
The complex analogue of this routine is f08guf.

10 Example

This example computes the two smallest eigenvalues, and the associated eigenvectors, of the matrix A, where
A = 2.07 3.87 4.20 -1.15 3.87 -0.21 1.87 0.63 4.20 1.87 1.15 2.06 -1.15 0.63 2.06 -1.81 ,  
using packed storage. Here A is symmetric and must first be reduced to tridiagonal form T by f08gef. The program then calls f08jjf to compute the requested eigenvalues and f08jkf to compute the associated eigenvectors of T. Finally f08ggf is called to transform the eigenvectors to those of A.

10.1 Program Text

Program Text (f08ggfe.f90)

10.2 Program Data

Program Data (f08ggfe.d)

10.3 Program Results

Program Results (f08ggfe.r)