Well I took your advice and went back to the statement that you referenced and everything seems to be behaving now! I don't know what I was getting to throw me off. However, I did notice that the setting the upper limit i<=NF also counted whitespace so I had to divide NF/2 to get the number of fields I originally wanted.
I have no idea what I did wrong, looking over my past examples, but it was probably something straight forward. I appreciate all of your help and list the code I used to get 400 fields at the beginning of each file, throughout the whole file iterating up by twenty and at the end of each file.
Hi all,
What I want is that can we manage printing a text file on a Dot Matrix printer installed on a Linux machine and the printer should not take the normal A4 format, but should print only to the extent the text file has text in it. What happen usually is that when we give print comand to any... (0 Replies)
Hello,
I have a matrix 200*10,000 and I need to extract the columns between 40 and 77. I dont want to write in awk all the columns. eg: awk '{print $40, $41, $42,$43 ... $77}'. I think should exist a better way to do this. (10 Replies)
All,
I have a problem with grep/fgrep/egrep. Basically I am building a 200 times 200 correlation matrix. The entries of this matrix need to be retrieved from another very large matrix (~100G). I tried to use the grep/fgrep/egrep to locate each entry and put them into one file. It looks very... (1 Reply)
Hi Experts,
My requirement is to compare the second field/column in two files, if the second column is same in both the files then compare the first field. If the first is not matching then print the first and second fields of both the files.
first file (a .txt)
< 1210018971FF0000,... (6 Replies)
Hi guys,
here https://www.unix.com/shell-programming-scripting/193043-3-column-csv-correlation-matrix-awk-perl.html I found awk script converting
awk '{
OFS = ";"
if (t) {
if (l != $1)
t = t OFS $1
} else t = OFS $1
x = x ? x OFS $NF : $NF
l = $1
}... (2 Replies)
Hello all,
I am quite new in this but I need some help to keep going with my analysis.
I am struggling with a short script to read a square matrix and convert it in two collumns.
A B C D
A 0.00 0.06 0.51 0.03
B 0.06 0.00 0.72 0.48
C 0.51 0.72 0.00 ... (7 Replies)
Hi Experts,
I want to print this charts diagonal data into straight lines.
This is a matrix 24X24 Horizontal and vertical.
- I want to print all the diagonal cutting characters into straight line:
Data:
E F S S A H A L L A T M C N O T S O B O D U Q H
I W I B N L O C N I L N L A N S I N... (9 Replies)
The following code transform the matrix to columns. Is it possible to do it other way around ( get the input from the output) ?
input
y1 y2 y3 y4 y5
x1 0.3 0.5 2.3 3.1 5.1
x2 1.2 4.1 3.5 1.7 1.2
x3 3.1 2.1 1.0 4.1 2.1
x4 5.0 4.0 6.0 7.0 1.1
output
x1 y1 0.3
x2 y1 1.2
x3... (1 Reply)
I do have a large matrix of the following format and it is tab delimited
ch-ab1-20 ch-bb2-23 ch-ab1-34 ch-ab1-24 er-cc1-45 bv-cc1-78
ch-ab1-20 0 2 3 4 5 6
ch-bb2-23 3 0 5 ... (6 Replies)
Discussion started by: Kanja
6 Replies
LEARN ABOUT REDHAT
zlahrd
ZLAHRD(l) ) ZLAHRD(l)
NAME
ZLAHRD - reduce the first NB columns of a complex general n-by-(n-k+1) matrix A so that elements below the k-th subdiagonal are zero
SYNOPSIS
SUBROUTINE ZLAHRD( N, K, NB, A, LDA, TAU, T, LDT, Y, LDY )
INTEGER K, LDA, LDT, LDY, N, NB
COMPLEX*16 A( LDA, * ), T( LDT, NB ), TAU( NB ), Y( LDY, NB )
PURPOSE
ZLAHRD reduces the first NB columns of a complex general n-by-(n-k+1) matrix A so that elements below the k-th subdiagonal are zero. The
reduction is performed by a unitary similarity transformation Q' * A * Q. The routine returns the matrices V and T which determine Q as a
block reflector I - V*T*V', and also the matrix Y = A * V * T.
This is an auxiliary routine called by ZGEHRD.
ARGUMENTS
N (input) INTEGER
The order of the matrix A.
K (input) INTEGER
The offset for the reduction. Elements below the k-th subdiagonal in the first NB columns are reduced to zero.
NB (input) INTEGER
The number of columns to be reduced.
A (input/output) COMPLEX*16 array, dimension (LDA,N-K+1)
On entry, the n-by-(n-k+1) general matrix A. On exit, the elements on and above the k-th subdiagonal in the first NB columns are
overwritten with the corresponding elements of the reduced matrix; the elements below the k-th subdiagonal, with the array TAU,
represent the matrix Q as a product of elementary reflectors. The other columns of A are unchanged. See Further Details. LDA
(input) INTEGER The leading dimension of the array A. LDA >= max(1,N).
TAU (output) COMPLEX*16 array, dimension (NB)
The scalar factors of the elementary reflectors. See Further Details.
T (output) COMPLEX*16 array, dimension (LDT,NB)
The upper triangular matrix T.
LDT (input) INTEGER
The leading dimension of the array T. LDT >= NB.
Y (output) COMPLEX*16 array, dimension (LDY,NB)
The n-by-nb matrix Y.
LDY (input) INTEGER
The leading dimension of the array Y. LDY >= max(1,N).
FURTHER DETAILS
The matrix Q is represented as a product of nb elementary reflectors
Q = H(1)H(2) . . . H(nb).
Each H(i) has the form
H(i) = I - tau * v * v'
where tau is a complex scalar, and v is a complex vector with v(1:i+k-1) = 0, v(i+k) = 1; v(i+k+1:n) is stored on exit in A(i+k+1:n,i), and
tau in TAU(i).
The elements of the vectors v together form the (n-k+1)-by-nb matrix V which is needed, with T and Y, to apply the transformation to the
unreduced part of the matrix, using an update of the form: A := (I - V*T*V') * (A - Y*V').
The contents of A on exit are illustrated by the following example with n = 7, k = 3 and nb = 2:
( a h a a a )
( a h a a a )
( a h a a a )
( h h a a a )
( v1 h a a a )
( v1 v2 a a a )
( v1 v2 a a a )
where a denotes an element of the original matrix A, h denotes a modified element of the upper Hessenberg matrix H, and vi denotes an ele-
ment of the vector defining H(i).
LAPACK version 3.0 15 June 2000 ZLAHRD(l)