10-30-2015
Thanks a lot RudiC for the solution and explaination!
Regards,
Veeresham
9 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
I am looking for a file with 'MCR0000000716214' in it. I tried the following command:
grep MCR0000000716214 *
The problem is that the folder I am searching in has over 87000 files and I am getting the following:
bash: /bin/grep: Arg list too long
Is there any command I can use that can... (6 Replies)
Discussion started by: runnerpaul
6 Replies
2. Shell Programming and Scripting
Hi,
i need to use --alternative option of getopt
for ex . getopt -o a:c: --alternative pw: -- "$@"
if i use like this, i am not getting any output.Please help me how to correct this.i need to have a combination of long and short options.But long options have to begin with - and not... (0 Replies)
Discussion started by: padmisri
0 Replies
3. Shell Programming and Scripting
How to find a particular line in a file without using grep? (3 Replies)
Discussion started by: proactiveaditya
3 Replies
4. Shell Programming and Scripting
Hello,
I am processing a text file which contains only words with few combination of characters (it is a dictionary file).
example:
havana
have
haven
haven't
havilland
havoc
Is there a way to exclude only 1 to 8 character long words which not include space or special characters : '-`~.. so... (5 Replies)
Discussion started by: alekkz
5 Replies
5. Shell Programming and Scripting
Hi,
what is the meaning of -n option before the grep command ?
grep command searches for the specified string in the file tmp_crontab.txt
but what does -n mean ?
With Regards (1 Reply)
Discussion started by: milink
1 Replies
6. UNIX for Dummies Questions & Answers
Hi,
We used to use the below commands often.
ps -ef|grep bc
ps -ef|grep abc|grep -v grep
Both fairly returns the same result.
For example, the process name is dynamic and we are having the process name in a variable, how we can apply the above trick.
For example "a" is the... (11 Replies)
Discussion started by: pandeesh
11 Replies
7. Shell Programming and Scripting
Hi Experts,
PFB my requirement:
I have a file (named file1) containing numbers like:
372846078543002
372846078543003
372846078543004
372846078543005
372846078543006
I have another file (nemed file2)where lines containing these numbers(present in file1) are present; Eg:
lppza087; <PERFB >... (6 Replies)
Discussion started by: niladri29
6 Replies
8. Shell Programming and Scripting
Hi All,
I am trying to select 30 days older files under current directory ,but not from subdirectory using below command.
find <Dir> -type f -mtime + 30
This command selecting all the files from current directory and also from sub directory .
I read some documention through internet ,... (1 Reply)
Discussion started by: kommineni
1 Replies
9. Shell Programming and Scripting
say I have a big list of something like:
sdg2000
weghre10
fewg53
gwg99
jwegwejjwej43
afg10293
I want to remove the numbers of any line that has letters + 1 to 4 numbers
output:
sdg
weghre
fewg
gwg
jwegwejjwej
afg10293 (7 Replies)
Discussion started by: Siwon
7 Replies
LEARN ABOUT REDHAT
ssprfs
SSPRFS(l) ) SSPRFS(l)
NAME
SSPRFS - improve the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite and packed, and
provides error bounds and backward error estimates for the solution
SYNOPSIS
SUBROUTINE SSPRFS( UPLO, N, NRHS, AP, AFP, IPIV, B, LDB, X, LDX, FERR, BERR, WORK, IWORK, INFO )
CHARACTER UPLO
INTEGER INFO, LDB, LDX, N, NRHS
INTEGER IPIV( * ), IWORK( * )
REAL AFP( * ), AP( * ), B( LDB, * ), BERR( * ), FERR( * ), WORK( * ), X( LDX, * )
PURPOSE
SSPRFS improves the computed solution to a system of linear equations when the coefficient matrix is symmetric indefinite and packed, and
provides error bounds and backward error estimates for the solution.
ARGUMENTS
UPLO (input) CHARACTER*1
= 'U': Upper triangle of A is stored;
= 'L': Lower triangle of A is stored.
N (input) INTEGER
The order of the matrix A. N >= 0.
NRHS (input) INTEGER
The number of right hand sides, i.e., the number of columns of the matrices B and X. NRHS >= 0.
AP (input) REAL array, dimension (N*(N+1)/2)
The upper or lower triangle of the symmetric matrix A, packed columnwise in a linear array. The j-th column of A is stored in the
array AP as follows: if UPLO = 'U', AP(i + (j-1)*j/2) = A(i,j) for 1<=i<=j; if UPLO = 'L', AP(i + (j-1)*(2*n-j)/2) = A(i,j) for
j<=i<=n.
AFP (input) REAL array, dimension (N*(N+1)/2)
The factored form of the matrix A. AFP contains the block diagonal matrix D and the multipliers used to obtain the factor U or L
from the factorization A = U*D*U**T or A = L*D*L**T as computed by SSPTRF, stored as a packed triangular matrix.
IPIV (input) INTEGER array, dimension (N)
Details of the interchanges and the block structure of D as determined by SSPTRF.
B (input) REAL array, dimension (LDB,NRHS)
The right hand side matrix B.
LDB (input) INTEGER
The leading dimension of the array B. LDB >= max(1,N).
X (input/output) REAL array, dimension (LDX,NRHS)
On entry, the solution matrix X, as computed by SSPTRS. On exit, the improved solution matrix X.
LDX (input) INTEGER
The leading dimension of the array X. LDX >= max(1,N).
FERR (output) REAL array, dimension (NRHS)
The estimated forward error bound for each solution vector X(j) (the j-th column of the solution matrix X). If XTRUE is the true
solution corresponding to X(j), FERR(j) is an estimated upper bound for the magnitude of the largest element in (X(j) - XTRUE)
divided by the magnitude of the largest element in X(j). The estimate is as reliable as the estimate for RCOND, and is almost
always a slight overestimate of the true error.
BERR (output) REAL array, dimension (NRHS)
The componentwise relative backward error of each solution vector X(j) (i.e., the smallest relative change in any element of A or B
that makes X(j) an exact solution).
WORK (workspace) REAL array, dimension (3*N)
IWORK (workspace) INTEGER array, dimension (N)
INFO (output) INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
PARAMETERS
ITMAX is the maximum number of steps of iterative refinement.
LAPACK version 3.0 15 June 2000 SSPRFS(l)