NAG CL Interfacef08nsc (zgehrd)

Settings help

CL Name Style:

1Purpose

f08nsc reduces a complex general matrix to Hessenberg form.

2Specification

 #include
 void f08nsc (Nag_OrderType order, Integer n, Integer ilo, Integer ihi, Complex a[], Integer pda, Complex tau[], NagError *fail)
The function may be called by the names: f08nsc, nag_lapackeig_zgehrd or nag_zgehrd.

3Description

f08nsc reduces a complex general matrix $A$ to upper Hessenberg form $H$ by a unitary similarity transformation: $A=QH{Q}^{\mathrm{H}}$. $H$ has real subdiagonal elements.
The matrix $Q$ is not formed explicitly, but is represented as a product of elementary reflectors (see the F08 Chapter Introduction for details). Functions are provided to work with $Q$ in this representation (see Section 9).
The function can take advantage of a previous call to f08nvc, which may produce a matrix with the structure:
 $( A11 A12 A13 A22 A23 A33 )$
where ${A}_{11}$ and ${A}_{33}$ are upper triangular. If so, only the central diagonal block ${A}_{22}$, in rows and columns ${i}_{\mathrm{lo}}$ to ${i}_{\mathrm{hi}}$, needs to be reduced to Hessenberg form (the blocks ${A}_{12}$ and ${A}_{23}$ will also be affected by the reduction). Therefore, the values of ${i}_{\mathrm{lo}}$ and ${i}_{\mathrm{hi}}$ determined by f08nvc can be supplied to the function directly. If f08nvc has not previously been called however, then ${i}_{\mathrm{lo}}$ must be set to $1$ and ${i}_{\mathrm{hi}}$ to $n$.

4References

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

5Arguments

1: $\mathbf{order}$Nag_OrderType Input
On entry: the order argument specifies the two-dimensional storage scheme being used, i.e., row-major ordering or column-major ordering. C language defined storage is specified by ${\mathbf{order}}=\mathrm{Nag_RowMajor}$. See Section 3.1.3 in the Introduction to the NAG Library CL Interface for a more detailed explanation of the use of this argument.
Constraint: ${\mathbf{order}}=\mathrm{Nag_RowMajor}$ or $\mathrm{Nag_ColMajor}$.
2: $\mathbf{n}$Integer Input
On entry: $n$, the order of the matrix $A$.
Constraint: ${\mathbf{n}}\ge 0$.
3: $\mathbf{ilo}$Integer Input
4: $\mathbf{ihi}$Integer Input
On entry: if $A$ has been output by f08nvc, ilo and ihi must contain the values returned by that function. Otherwise, ilo must be set to $1$ and ihi to n.
Constraints:
• if ${\mathbf{n}}>0$, $1\le {\mathbf{ilo}}\le {\mathbf{ihi}}\le {\mathbf{n}}$;
• if ${\mathbf{n}}=0$, ${\mathbf{ilo}}=1$ and ${\mathbf{ihi}}=0$.
5: $\mathbf{a}\left[\mathit{dim}\right]$Complex Input/Output
Note: the dimension, dim, of the array a must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{pda}}×{\mathbf{n}}\right)$.
The $\left(i,j\right)$th element of the matrix $A$ is stored in
• ${\mathbf{a}}\left[\left(j-1\right)×{\mathbf{pda}}+i-1\right]$ when ${\mathbf{order}}=\mathrm{Nag_ColMajor}$;
• ${\mathbf{a}}\left[\left(i-1\right)×{\mathbf{pda}}+j-1\right]$ when ${\mathbf{order}}=\mathrm{Nag_RowMajor}$.
On entry: the $n×n$ general matrix $A$.
On exit: a is overwritten by the upper Hessenberg matrix $H$ and details of the unitary matrix $Q$. The subdiagonal elements of $H$ are real.
6: $\mathbf{pda}$Integer Input
On entry: the stride separating row or column elements (depending on the value of order) in the array a.
Constraint: ${\mathbf{pda}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$.
7: $\mathbf{tau}\left[\mathit{dim}\right]$Complex Output
Note: the dimension, dim, of the array tau must be at least $\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}-1\right)$.
On exit: further details of the unitary matrix $Q$.
8: $\mathbf{fail}$NagError * Input/Output
The NAG error argument (see Section 7 in the Introduction to the NAG Library CL Interface).

6Error Indicators and Warnings

NE_ALLOC_FAIL
Dynamic memory allocation failed.
See Section 3.1.2 in the Introduction to the NAG Library CL Interface for further information.
On entry, argument $⟨\mathit{\text{value}}⟩$ had an illegal value.
NE_INT
On entry, ${\mathbf{n}}=⟨\mathit{\text{value}}⟩$.
Constraint: ${\mathbf{n}}\ge 0$.
On entry, ${\mathbf{pda}}=⟨\mathit{\text{value}}⟩$.
Constraint: ${\mathbf{pda}}>0$.
NE_INT_2
On entry, ${\mathbf{pda}}=⟨\mathit{\text{value}}⟩$ and ${\mathbf{n}}=⟨\mathit{\text{value}}⟩$.
Constraint: ${\mathbf{pda}}\ge \mathrm{max}\phantom{\rule{0.125em}{0ex}}\left(1,{\mathbf{n}}\right)$.
NE_INT_3
On entry, ${\mathbf{n}}=⟨\mathit{\text{value}}⟩$, ${\mathbf{ilo}}=⟨\mathit{\text{value}}⟩$ and ${\mathbf{ihi}}=⟨\mathit{\text{value}}⟩$.
Constraint: if ${\mathbf{n}}>0$, $1\le {\mathbf{ilo}}\le {\mathbf{ihi}}\le {\mathbf{n}}$;
if ${\mathbf{n}}=0$, ${\mathbf{ilo}}=1$ and ${\mathbf{ihi}}=0$.
NE_INTERNAL_ERROR
An internal error has occurred in this function. Check the function call and any array sizes. If the call is correct then please contact NAG for assistance.
See Section 7.5 in the Introduction to the NAG Library CL Interface for further information.
NE_NO_LICENCE
Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library CL Interface for further information.

7Accuracy

The computed Hessenberg matrix $H$ is exactly similar to a nearby matrix $\left(A+E\right)$, where
 $‖E‖2 ≤ c (n) ε ‖A‖2 ,$
$c\left(n\right)$ is a modestly increasing function of $n$, and $\epsilon$ is the machine precision.
The elements of $H$ 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 eigenvalues, eigenvectors or Schur factorization.

8Parallelism and Performance

f08nsc 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 function. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

The total number of real floating-point operations is approximately $\frac{8}{3}{q}^{2}\left(2q+3n\right)$, where $q={i}_{\mathrm{hi}}-{i}_{\mathrm{lo}}$; if ${i}_{\mathrm{lo}}=1$ and ${i}_{\mathrm{hi}}=n$, the number is approximately $\frac{40}{3}{n}^{3}$.
To form the unitary matrix $Q$ f08nsc may be followed by a call to f08ntc :
nag_lapackeig_zunghr(order,n,ilo,ihi,&a,pda,tau,&fail)
To apply $Q$ to an $m×n$ complex matrix $C$ f08nsc may be followed by a call to f08nuc. For example,
nag_lapackeig_zunmhr(order,Nag_LeftSide,Nag_NoTrans,m,n,ilo,ihi,&a,pda,
tau,&c,pdc,&fail)
forms the matrix product $QC$.
The real analogue of this function is f08nec.

10Example

This example computes the upper Hessenberg form of the matrix $A$, where
 $A = ( -3.97-5.04i -4.11+3.70i -0.34+1.01i 1.29-0.86i 0.34-1.50i 1.52-0.43i 1.88-5.38i 3.36+0.65i 3.31-3.85i 2.50+3.45i 0.88-1.08i 0.64-1.48i -1.10+0.82i 1.81-1.59i 3.25+1.33i 1.57-3.44i ) .$

10.1Program Text

Program Text (f08nsce.c)

10.2Program Data

Program Data (f08nsce.d)

10.3Program Results

Program Results (f08nsce.r)