05-03-2013
Hi Corona688,
Thanks, that is helpful to the extent that I can't learn anything about the solution to my problem. Any insight into any of the other mysteries?
Thanks for the help,
Chris.
8 More Discussions You Might Find Interesting
1. Solaris
Hello Everyone,
I am currently running a large Server with Veritas Volumen Manager, attached to a EMC.
uname -a
SunOS 5.8 Generic_117350-47 sun4u sparc SUNW,Sun-Fire-880
I have one directory that tends to change to a file.Once in a while and always in different time.The file is the... (1 Reply)
Discussion started by: Peterh
1 Replies
2. Shell Programming and Scripting
hi
i'm very new to mod_rewrite.
I can't seem to have this work.
I have a site which has 4 pages : home, links, adverts and contacts page.
the adverts page is linked to this url http://www.xxxxxx.com/adverts.php. What i want is that whenever the adverts page is clicked , it will show... (0 Replies)
Discussion started by: arsonist
0 Replies
3. UNIX for Advanced & Expert Users
A perplexing mystery...
please note that i am not a lacky, and the error below is misleading
recently something i do all the time broke (a script).
now when i run this script i get this error.
/usr/bin/awk: 0403-027 The parameter list is too long.
note that the (parameter list is... (9 Replies)
Discussion started by: nullwhat
9 Replies
4. Web Development
Here's my situation.
When a user access the site domain.com it redirects to /portal which displays SKIN1 by default.
When a user accesses the site domain.com/portal?branding=SKIN1 it displays SKIN1 by default as well.
When a user access the site domain.com/portal?branding=SKIN2 it... (0 Replies)
Discussion started by: Adrnalnrsh
0 Replies
5. Web Development
I'd like to translate a friendly url such as:
http://www.xxxyyyzzz.com/page/12345678/
to:
http://www.xxxyyyzzz.com/page/12/34/56/78/
Seems simple enough, but I cannot figure out how. Any one done this before? (2 Replies)
Discussion started by: markericksen
2 Replies
6. Filesystems, Disks and Memory
I burned identical raw encrypted data to three cds using my new external Toshiba drive. My internal IBM read only drive does not get an I/O Error when reading in Circumstance #1, but does get an I/O Error in Circumstance #2. But, the Toshiba drive can do both circumstances without an error.
... (1 Reply)
Discussion started by: darkstarxor
1 Replies
7. Shell Programming and Scripting
Hi everyone,
I can't seem to understand the behavior of sort on a particular case.
cat tmp25
1 a
10 b
20 c
2 d
I do that:
sort -k1,1 tmp25
1 a
10 b
2 d
20 c
This one I understand, it's what i expected, from a string point of view 1<10<2<20
sort -k1... (9 Replies)
Discussion started by: a.brassac
9 Replies
8. Web Development
Hi Team,
I have a question on the apache mod_rewrite module. I have a requirement of rewriting only specific url's to https.
Requirement below:-
want to match a word (test) on the url and if matches then it should rewrite to https.
example:-
... (1 Reply)
Discussion started by: arumon
1 Replies
LEARN ABOUT REDHAT
cgglse
CGGLSE(l) ) CGGLSE(l)
NAME
CGGLSE - solve the linear equality-constrained least squares (LSE) problem
SYNOPSIS
SUBROUTINE CGGLSE( M, N, P, A, LDA, B, LDB, C, D, X, WORK, LWORK, INFO )
INTEGER INFO, LDA, LDB, LWORK, M, N, P
COMPLEX A( LDA, * ), B( LDB, * ), C( * ), D( * ), WORK( * ), X( * )
PURPOSE
CGGLSE 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 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 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 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 array, dimension (P)
On entry, D contains the right hand side vector for the constrained equation. On exit, D is destroyed.
X (output) COMPLEX array, dimension (N)
On exit, X is the solution of the LSE problem.
WORK (workspace/output) COMPLEX 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 CGEQRF, CGERQF, CUNMQR 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 CGGLSE(l)