zunmr2 man page on OpenIndiana

Man page or keyword search:  
man Server   20441 pages
apropos Keyword Search (all sections)
Output format
OpenIndiana logo
[printable version]

zunmr2(3P)		    Sun Performance Library		    zunmr2(3P)

NAME
       zunmr2  - overwrite the general complex m-by-n matrix C with   Q * C if
       SIDE = 'L' and TRANS = 'N', or	Q'* C if SIDE = 'L' and TRANS  =  'C',
       or   C * Q if SIDE = 'R' and TRANS = 'N', or   C * Q' if SIDE = 'R' and
       TRANS = 'C',

SYNOPSIS
       SUBROUTINE ZUNMR2(SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, WORK,
	     INFO)

       CHARACTER * 1 SIDE, TRANS
       DOUBLE COMPLEX A(LDA,*), TAU(*), C(LDC,*), WORK(*)
       INTEGER M, N, K, LDA, LDC, INFO

       SUBROUTINE ZUNMR2_64(SIDE, TRANS, M, N, K, A, LDA, TAU, C, LDC, WORK,
	     INFO)

       CHARACTER * 1 SIDE, TRANS
       DOUBLE COMPLEX A(LDA,*), TAU(*), C(LDC,*), WORK(*)
       INTEGER*8 M, N, K, LDA, LDC, INFO

   F95 INTERFACE
       SUBROUTINE UNMR2(SIDE, TRANS, [M], [N], [K], A, [LDA], TAU, C, [LDC],
	      [WORK], [INFO])

       CHARACTER(LEN=1) :: SIDE, TRANS
       COMPLEX(8), DIMENSION(:) :: TAU, WORK
       COMPLEX(8), DIMENSION(:,:) :: A, C
       INTEGER :: M, N, K, LDA, LDC, INFO

       SUBROUTINE UNMR2_64(SIDE, TRANS, [M], [N], [K], A, [LDA], TAU, C,
	      [LDC], [WORK], [INFO])

       CHARACTER(LEN=1) :: SIDE, TRANS
       COMPLEX(8), DIMENSION(:) :: TAU, WORK
       COMPLEX(8), DIMENSION(:,:) :: A, C
       INTEGER(8) :: M, N, K, LDA, LDC, INFO

   C INTERFACE
       #include <sunperf.h>

       void zunmr2(char side, char trans, int m, int n, int  k,	 doublecomplex
		 *a,  int  lda, doublecomplex *tau, doublecomplex *c, int ldc,
		 int *info);

       void zunmr2_64(char side, char trans, long m, long n, long  k,  double‐
		 complex  *a,  long lda, doublecomplex *tau, doublecomplex *c,
		 long ldc, long *info);

PURPOSE
       zunmr2 overwrites the general complex m-by-n matrix C with

       where Q is a complex unitary matrix defined as the product of k elemen‐
       tary reflectors

	     Q = H(1)' H(2)' . . . H(k)'

       as  returned by ZGERQF. Q is of order m if SIDE = 'L' and of order n if
       SIDE = 'R'.

ARGUMENTS
       SIDE (input)
		 = 'L': apply Q or Q' from the Left
		 = 'R': apply Q or Q' from the Right

       TRANS (input)
		 = 'N': apply Q	 (No transpose)
		 = 'C': apply Q' (Conjugate transpose)

       M (input) The number of rows of the matrix C. M >= 0.

       N (input) The number of columns of the matrix C. N >= 0.

       K (input) The number of elementary reflectors whose product defines the
		 matrix	 Q.  If SIDE = 'L', M >= K >= 0; if SIDE = 'R', N >= K
		 >= 0.

       A (input) (LDA,M) if SIDE = 'L', (LDA,N) if SIDE =  'R'	The  i-th  row
		 must  contain the vector which defines the elementary reflec‐
		 tor H(i), for i = 1,2,...,k, as returned  by  ZGERQF  in  the
		 last  k  rows	of its array argument A.  A is modified by the
		 routine but restored on exit.

       LDA (input)
		 The leading dimension of the array A. LDA >= max(1,K).

       TAU (input)
		 TAU(i) must contain  the  scalar  factor  of  the  elementary
		 reflector H(i), as returned by ZGERQF.

       C (input/output)
		 On  entry, the m-by-n matrix C.  On exit, C is overwritten by
		 Q*C or Q'*C or C*Q' or C*Q.

       LDC (input)
		 The leading dimension of the array C. LDC >= max(1,M).

       WORK (workspace)
		 (N) if SIDE = 'L', (M) if SIDE = 'R'

       INFO (output)
		 = 0: successful exit
		 < 0: if INFO = -i, the i-th argument had an illegal value

				  6 Mar 2009			    zunmr2(3P)
[top]

List of man pages available for OpenIndiana

Copyright (c) for man pages and the logo by the respective OS vendor.

For those who want to learn more, the polarhome community provides shell access and support.

[legal] [privacy] [GNU] [policy] [cookies] [netiquette] [sponsors] [FAQ]
Tweet
Polarhome, production since 1999.
Member of Polarhome portal.
Based on Fawad Halim's script.
....................................................................
Vote for polarhome
Free Shell Accounts :: the biggest list on the net