10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
Hello,
I am running ubuntu 16.04 and trying to list all files inside a directory, I need to sort them in ascending order. While surfing on the site, I found an old thread but somehow it did not work.
Link
Ascending order with sort -nk2 myfile.txt command gives below output:
file... (5 Replies)
Discussion started by: baris35
5 Replies
2. Shell Programming and Scripting
Hi All
I have a file like this:
ID1 ref_A 10 ref_B 30 ref_C 5
ID2 ref_F 69 ref_G 12 ref_H 5
Every ID is followed by a string(ref_X) followed by a number(every number is referred to the previous ref)
I would like to order the file like this(the column could be more, but always with the same... (4 Replies)
Discussion started by: giuliangiuseppe
4 Replies
3. Shell Programming and Scripting
Hi,
I need to list files in ascending order. Filenames are in format inpTDT_1, inpTDT_2, inpTDT_3 and so on.
I want to list them in the ascending order based on the digit after underscore and send the output to a file.
Please help (5 Replies)
Discussion started by: Neelkanth
5 Replies
4. Shell Programming and Scripting
HI
I have a file
# vi assc
values order fin
100 34 45
200 12 64
120 10 23
Here I need to check whether the values of second column"order"
is arranged ascendingly
Note: Always order column will be arranged either in ascending or descending order
How to make it?... (1 Reply)
Discussion started by: Priya Amaresh
1 Replies
5. UNIX for Dummies Questions & Answers
Hi,
I have a sequence which has 30000 strings which looks like this
>string2991 234445
>string224 470561
>string121 675386
>string4098 177229
>string8049 255838
>string8 672382
>string1115 578415
I want it to be arranged in ascending order
>string8 672382
>string121... (5 Replies)
Discussion started by: siya@
5 Replies
6. Shell Programming and Scripting
I have a multiple file with the following name
like.
file_0.csv
file_1.csv
file_2.csv
file_3.csv
file_4.csv
file_5.csv
file_6.csv
file_7.csv
file_7.csv
file_8.csv
file_9.csv
file_10.csv
file_11.csv
file_12.csv
file_13.csv
file_14.csv (2 Replies)
Discussion started by: rakesh_arxmind
2 Replies
7. UNIX for Dummies Questions & Answers
Hi,
I have this single file with a number of sequence inside it of format
>string1
data
>string100
data
>string10
.....
>string5
...
>string67
......
the dots represent data.
I wanted to get the sequences arranged in ascending order like
>string1
data
>string5 (5 Replies)
Discussion started by: sonia102
5 Replies
8. UNIX for Advanced & Expert Users
Hello Friends,
I want to merge two files in ascending order on the first field. And if the first field matches sort on 3rd field i.e, TXADDR should come ahead of RXADDR .
file1
9 : TXADDR : 00000000
65 : TXDATA 0000000000000011
83 : TXDATA 0000000000000012
453 :... (10 Replies)
Discussion started by: user_prady
10 Replies
9. Shell Programming and Scripting
I appreciate all the help that I've already received but am running into one problem. I can find how to add something before a file with ascending numbers but not like this. I basically have a file that looks like this:
100
101
102
103
104
I need to add the following before each line with... (5 Replies)
Discussion started by: kerpm
5 Replies
10. UNIX for Dummies Questions & Answers
What's the command to sort a file in ascending order and redirect the output to another file?
Thanks!!!!!! (1 Reply)
Discussion started by: gyik
1 Replies
SLAED1(l) ) SLAED1(l)
NAME
SLAED1 - compute the updated eigensystem of a diagonal matrix after modification by a rank-one symmetric matrix
SYNOPSIS
SUBROUTINE SLAED1( N, D, Q, LDQ, INDXQ, RHO, CUTPNT, WORK, IWORK, INFO )
INTEGER CUTPNT, INFO, LDQ, N
REAL RHO
INTEGER INDXQ( * ), IWORK( * )
REAL D( * ), Q( LDQ, * ), WORK( * )
PURPOSE
SLAED1 computes the updated eigensystem of a diagonal matrix after modification by a rank-one symmetric matrix. This routine is used only
for the eigenproblem which requires all eigenvalues and eigenvectors of a tridiagonal matrix. SLAED7 handles the case in which eigenvalues
only or eigenvalues and eigenvectors of a full symmetric matrix (which was reduced to tridiagonal form) are desired.
T = Q(in) ( D(in) + RHO * Z*Z' ) Q'(in) = Q(out) * D(out) * Q'(out)
where Z = Q'u, u is a vector of length N with ones in the
CUTPNT and CUTPNT + 1 th elements and zeros elsewhere.
The eigenvectors of the original matrix are stored in Q, and the
eigenvalues are in D. The algorithm consists of three stages:
The first stage consists of deflating the size of the problem
when there are multiple eigenvalues or if there is a zero in
the Z vector. For each such occurence the dimension of the
secular equation problem is reduced by one. This stage is
performed by the routine SLAED2.
The second stage consists of calculating the updated
eigenvalues. This is done by finding the roots of the secular
equation via the routine SLAED4 (as called by SLAED3).
This routine also calculates the eigenvectors of the current
problem.
The final stage consists of computing the updated eigenvectors
directly using the updated eigenvalues. The eigenvectors for
the current problem are multiplied with the eigenvectors from
the overall problem.
ARGUMENTS
N (input) INTEGER
The dimension of the symmetric tridiagonal matrix. N >= 0.
D (input/output) REAL array, dimension (N)
On entry, the eigenvalues of the rank-1-perturbed matrix. On exit, the eigenvalues of the repaired matrix.
Q (input/output) REAL array, dimension (LDQ,N)
On entry, the eigenvectors of the rank-1-perturbed matrix. On exit, the eigenvectors of the repaired tridiagonal matrix.
LDQ (input) INTEGER
The leading dimension of the array Q. LDQ >= max(1,N).
INDXQ (input/output) INTEGER array, dimension (N)
On entry, the permutation which separately sorts the two subproblems in D into ascending order. On exit, the permutation which will
reintegrate the subproblems back into sorted order, i.e. D( INDXQ( I = 1, N ) ) will be in ascending order.
RHO (input) REAL
The subdiagonal entry used to create the rank-1 modification.
CUTPNT (input) INTEGER The location of the last eigenvalue in the leading sub-matrix. min(1,N) <= CUTPNT <= N/2.
WORK (workspace) REAL array, dimension (4*N + N**2)
IWORK (workspace) INTEGER array, dimension (4*N)
INFO (output) INTEGER
= 0: successful exit.
< 0: if INFO = -i, the i-th argument had an illegal value.
> 0: if INFO = 1, an eigenvalue did not converge
FURTHER DETAILS
Based on contributions by
Jeff Rutter, Computer Science Division, University of California
at Berkeley, USA
Modified by Francoise Tisseur, University of Tennessee.
LAPACK version 3.0 15 June 2000 SLAED1(l)