NAG FL Interface
f08ksf (zgebrd)

1 Purpose

f08ksf reduces a complex m by n matrix to bidiagonal form.

2 Specification

Fortran Interface
Subroutine f08ksf ( m, n, a, lda, d, e, tauq, taup, work, lwork, info)
Integer, Intent (In) :: m, n, lda, lwork
Integer, Intent (Out) :: info
Real (Kind=nag_wp), Intent (Inout) :: d(*), e(*)
Complex (Kind=nag_wp), Intent (Inout) :: a(lda,*), tauq(*), taup(*)
Complex (Kind=nag_wp), Intent (Out) :: work(max(1,lwork))
C Header Interface
#include <nag.h>
void  f08ksf_ (const Integer *m, const Integer *n, Complex a[], const Integer *lda, double d[], double e[], Complex tauq[], Complex taup[], Complex work[], const Integer *lwork, Integer *info)
The routine may be called by the names f08ksf, nagf_lapackeig_zgebrd or its LAPACK name zgebrd.

3 Description

f08ksf reduces a complex m by n matrix A to real bidiagonal form B by a unitary transformation: A=QBPH, where Q and PH are unitary matrices of order m and n respectively.
If mn, the reduction is given by:
A =Q B1 0 PH = Q1 B1 PH ,  
where B1 is a real n by n upper bidiagonal matrix and Q1 consists of the first n columns of Q.
If m<n, the reduction is given by
A =Q B1 0 PH = Q B1 P1H ,  
where B1 is a real m by m lower bidiagonal matrix and P1H consists of the first m rows of PH.
The unitary matrices Q and P are not formed explicitly but are represented as products of elementary reflectors (see the F08 Chapter Introduction for details). Routines are provided to work with Q and P in this representation (see Section 9).

4 References

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

5 Arguments

1: m Integer Input
On entry: m, the number of rows of the matrix A.
Constraint: m0.
2: n Integer Input
On entry: n, the number of columns of the matrix A.
Constraint: n0.
3: alda* Complex (Kind=nag_wp) array Input/Output
Note: the second dimension of the array a must be at least max1,n.
On entry: the m by n matrix A.
On exit: if mn, the diagonal and first superdiagonal are overwritten by the upper bidiagonal matrix B, elements below the diagonal are overwritten by details of the unitary matrix Q and elements above the first superdiagonal are overwritten by details of the unitary matrix P.
If m<n, the diagonal and first subdiagonal are overwritten by the lower bidiagonal matrix B, elements below the first subdiagonal are overwritten by details of the unitary matrix Q and elements above the diagonal are overwritten by details of the unitary matrix P.
4: lda Integer Input
On entry: the first dimension of the array a as declared in the (sub)program from which f08ksf is called.
Constraint: ldamax1,m.
5: d* Real (Kind=nag_wp) array Output
Note: the dimension of the array d must be at least max1,minm,n.
On exit: the diagonal elements of the bidiagonal matrix B.
6: e* Real (Kind=nag_wp) array Output
Note: the dimension of the array e must be at least max1,minm,n-1.
On exit: the off-diagonal elements of the bidiagonal matrix B.
7: tauq* Complex (Kind=nag_wp) array Output
Note: the dimension of the array tauq must be at least max1,minm,n.
On exit: further details of the unitary matrix Q.
8: taup* Complex (Kind=nag_wp) array Output
Note: the dimension of the array taup must be at least max1,minm,n.
On exit: further details of the unitary matrix P.
9: workmax1,lwork Complex (Kind=nag_wp) array Workspace
On exit: if info=0, the real part of work1 contains the minimum value of lwork required for optimal performance.
10: lwork Integer Input
On entry: the dimension of the array work as declared in the (sub)program from which f08ksf is called.
If lwork=-1, a workspace query is assumed; the routine only calculates the optimal size of the work array, returns this value as the first entry of the work array, and no error message related to lwork is issued.
Suggested value: for optimal performance, lworkm+n×nb, where nb is the optimal block size.
Constraint: lworkmax1,m,n or lwork=-1.
11: 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.

7 Accuracy

The computed bidiagonal form B satisfies QBPH=A+E, where
E2 c n ε A2 ,  
cn is a modestly increasing function of n, and ε is the machine precision.
The elements of B themselves may be sensitive to small perturbations in A or to rounding errors in the computation, but this does not affect the stability of the singular values and vectors.

8 Parallelism and Performance

f08ksf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
f08ksf 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 16n23m-n/3 if mn or 16m23n-m/3 if m<n.
If mn, it can be more efficient to first call f08asf to perform a QR factorization of A, and then to call f08ksf to reduce the factor R to bidiagonal form. This requires approximately 8n2m+n floating-point operations.
If mn, it can be more efficient to first call f08avf to perform an LQ factorization of A, and then to call f08ksf to reduce the factor L to bidiagonal form. This requires approximately 8m2m+n operations.
To form the m by m unitary matrix Q f08ksf may be followed by calls to f08ktf . For example
Call zungbr('Q',m,m,n,a,lda,tauq,work,lwork,info)
but note that the second dimension of the array a must be at least m, which may be larger than was required by f08ksf.
To form the n by n unitary matrix PH another call to f08kff may be made . For example
Call zungbr('P',n,n,m,a,lda,taup,work,lwork,info)
but note that the first dimension of the array a must be at least n, which may be larger than was required by f08ksf.
To apply Q or P to a complex rectangular matrix C, f08ksf may be followed by a call to f08kuf.
The real analogue of this routine is f08kef.

10 Example

This example reduces the matrix A to bidiagonal form, where
A = 0.96-0.81i -0.03+0.96i -0.91+2.06i -0.05+0.41i -0.98+1.98i -1.20+0.19i -0.66+0.42i -0.81+0.56i 0.62-0.46i 1.01+0.02i 0.63-0.17i -1.11+0.60i -0.37+0.38i 0.19-0.54i -0.98-0.36i 0.22-0.20i 0.83+0.51i 0.20+0.01i -0.17-0.46i 1.47+1.59i 1.08-0.28i 0.20-0.12i -0.07+1.23i 0.26+0.26i .  

10.1 Program Text

Program Text (f08ksfe.f90)

10.2 Program Data

Program Data (f08ksfe.d)

10.3 Program Results

Program Results (f08ksfe.r)