05-13-2006
wish to thank both of you for the neat solution to my problem.
10 More Discussions You Might Find Interesting
1. HP-UX
Hi,
How can find the size of the directory. If the directory has 1000 files. I want the total size of directory including all the files. the bdf command is just able to give only the volume size. It is not heling my cause. (2 Replies)
Discussion started by: truth
2 Replies
2. UNIX for Dummies Questions & Answers
Hi,
i know only directory name
I want to find location of tat directory(full path)
is there any option to find directory (1 Reply)
Discussion started by: arulkumar
1 Replies
3. Shell Programming and Scripting
hi,
i am using korn shell...............
Any one please help me in solving the below question:
question: i need to find the size of the directory alone...
let us assume /root/kamal/hash1 is the directory, now i want to find the hash1 size ..
... (7 Replies)
Discussion started by: G.K.K
7 Replies
4. UNIX for Dummies Questions & Answers
I need to find whether there is a file named vijay is there or not in folder named "opt" .I tried "ls *|grep vijay" but it showed permission problem.
so i need to use find command (6 Replies)
Discussion started by: amirthraj_12
6 Replies
5. UNIX for Dummies Questions & Answers
I'm trying to find this string 'preparing string IBE_Quote_W1_Pvt.SaveWrapper for quote_header_id’ in my Apache log file directory. The log file that contains this string may be in a parent direcotry or a sub-directory. I have tried 'grep' and 'awk' with no success.
I would like to get the path... (3 Replies)
Discussion started by: gross
3 Replies
6. Shell Programming and Scripting
Hey All,
New to Bash Scripting I have a find command to count the current directories it is:
dirCount=`find $2/ -type d | wc -l`
What I get is a count of all directories in $2 as well as $2 itself.
What I need to do is ignore $2 itself and just get the folders inside $2.
Thank in... (6 Replies)
Discussion started by: brandonpal
6 Replies
7. UNIX for Advanced & Expert Users
I am looking for the directory ".Private". Can someone tell me why my first search does not work?
~ $ sudo find / -iname -type d ".Private" 2>/dev/null
And why does this one work?
~ $ sudo find / -type d -iname '.Private' 2>/dev/null... (3 Replies)
Discussion started by: cokedude
3 Replies
8. UNIX for Dummies Questions & Answers
Hi
I wish to find only files in dir /srv/container/content/imz06/. It means exclude subfolder /srv/container/content/imz06/archive/
> uname -a
SunOS testbox6 5.10 Generic_139555-08 sun4v sparc SUNW,Sun-Blade-T6320Its Solaris default "find"
> find /srv/container/content/imz06/* -name... (4 Replies)
Discussion started by: slashdotweenie
4 Replies
9. Shell Programming and Scripting
I only want to find files under each branch of the directory tree inside directories named XYZ and there are multiple XYZ directories? (7 Replies)
Discussion started by: emc^24sho
7 Replies
10. UNIX for Beginners Questions & Answers
How to get a file 'zlib.h' in an entire directory with an excluded directory specified lives under that starting directory by using find command, as it failed on:
$ find . -name 'zlib.h' -a -ipath 'CHROME.TMP' -prune -o -print
it'll just list entirely up (2 Replies)
Discussion started by: abdulbadii
2 Replies
LEARN ABOUT REDHAT
zgglse
ZGGLSE(l) ) ZGGLSE(l)
NAME
ZGGLSE - solve the linear equality-constrained least squares (LSE) problem
SYNOPSIS
SUBROUTINE ZGGLSE( M, N, P, A, LDA, B, LDB, C, D, X, WORK, LWORK, INFO )
INTEGER INFO, LDA, LDB, LWORK, M, N, P
COMPLEX*16 A( LDA, * ), B( LDB, * ), C( * ), D( * ), WORK( * ), X( * )
PURPOSE
ZGGLSE solves the linear equality-constrained least squares (LSE) problem:
minimize || c - A*x ||_2 subject to B*x = d
where A is an M-by-N matrix, B is a P-by-N matrix, c is a given M-vector, and d is a given P-vector. It is assumed that
P <= N <= M+P, and
rank(B) = P and rank( ( A ) ) = N.
( ( B ) )
These conditions ensure that the LSE problem has a unique solution, which is obtained using a GRQ factorization of the matrices B and A.
ARGUMENTS
M (input) INTEGER
The number of rows of the matrix A. M >= 0.
N (input) INTEGER
The number of columns of the matrices A and B. N >= 0.
P (input) INTEGER
The number of rows of the matrix B. 0 <= P <= N <= M+P.
A (input/output) COMPLEX*16 array, dimension (LDA,N)
On entry, the M-by-N matrix A. On exit, A is destroyed.
LDA (input) INTEGER
The leading dimension of the array A. LDA >= max(1,M).
B (input/output) COMPLEX*16 array, dimension (LDB,N)
On entry, the P-by-N matrix B. On exit, B is destroyed.
LDB (input) INTEGER
The leading dimension of the array B. LDB >= max(1,P).
C (input/output) COMPLEX*16 array, dimension (M)
On entry, C contains the right hand side vector for the least squares part of the LSE problem. On exit, the residual sum of
squares for the solution is given by the sum of squares of elements N-P+1 to M of vector C.
D (input/output) COMPLEX*16 array, dimension (P)
On entry, D contains the right hand side vector for the constrained equation. On exit, D is destroyed.
X (output) COMPLEX*16 array, dimension (N)
On exit, X is the solution of the LSE problem.
WORK (workspace/output) COMPLEX*16 array, dimension (LWORK)
On exit, if INFO = 0, WORK(1) returns the optimal LWORK.
LWORK (input) INTEGER
The dimension of the array WORK. LWORK >= max(1,M+N+P). For optimum performance LWORK >= P+min(M,N)+max(M,N)*NB, where NB is an
upper bound for the optimal blocksizes for ZGEQRF, CGERQF, ZUNMQR and CUNMRQ.
If LWORK = -1, then a workspace query is assumed; the routine only calculates the optimal size of the WORK array, returns this
value as the first entry of the WORK array, and no error message related to LWORK is issued by XERBLA.
INFO (output) INTEGER
= 0: successful exit.
< 0: if INFO = -i, the i-th argument had an illegal value.
LAPACK version 3.0 15 June 2000 ZGGLSE(l)