10-03-2012
This is not an apt place to discuss mathematics. But here's a hint. Try converting a 2D matrix into a linear matrix. Think of some way to map each element of a 2D array to a 1D array. Cheers
9 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
Hello one and all,
I have a basic background in UNIX, but I was wondering if there is a way to perform simple mathematical equations (like multiplication, addition)? If so, is there a way to multiply values from a column by a value to produce a column with the answers? :confused:
I am... (4 Replies)
Discussion started by: VioletFairy
4 Replies
2. Programming
Hi all,
Even after reading many explanation the question still haunting me what's the difference between physical and linear addresses.Can we directly access physical addresses .If not then paging circuitry would have ensure contiguous physical addresses regardless of any linear addresses but this... (2 Replies)
Discussion started by: joshighanshyam
2 Replies
3. High Performance Computing
I`m having a cluster with Rocks 5.2 distribution and I want to solve differential equations and I`m interested to know if are some programs already developed to do this. (3 Replies)
Discussion started by: rapo
3 Replies
4. Programming
Given an in-between(any node not at the start and end of the linked list) node within a singly linear linked list, how to delete that node, when head pointer of list is not given? (13 Replies)
Discussion started by: rupeshkp728
13 Replies
5. Programming
Hi,
I'm looking for linear hashing implementation in C language. Please help.
PS: I have implement this on Ubuntu 10.04 Linux on 64 bit machine. (1 Reply)
Discussion started by: sajjar
1 Replies
6. UNIX for Dummies Questions & Answers
I really know barely anything about awk and the like but I have a bit of code I need help with.
The bash script is meant to get my usage numbers from my ISP and it does so perfectly. However I want to know how much I can use each day. So to do this I would need to divide its output by the number... (5 Replies)
Discussion started by: Light_
5 Replies
7. Shell Programming and Scripting
count=`cat /filecount.txt | tail -1 |head -1| awk '{print $1}'`
exact_count=`expr $value \* 24`
i want to subtract a="$exact_count" - "$count"
but its not taking o/p of "count" as number
$a is wrong answer
hence not getting proper output.
plz help me out
:confused:
Please use... (3 Replies)
Discussion started by: sagar_1986
3 Replies
8. Shell Programming and Scripting
my code is like this
count=`cat /filecount.txt | tail -1 |head -1| awk '{print $1}'` ###file is having value 264 ####
echo "actual count = $count"
exact_count=`expr $value \* 24`
echo "exact_count= $exact_count"
diff=`expr "$exact_count" - "$count"`
a= exact_count - count
... (8 Replies)
Discussion started by: sagar_1986
8 Replies
9. Shell Programming and Scripting
Hi everyone,
I am trying to write a bash script which reads a data file and does some algebraic operations.
here is the structure of data.xml file that I have;
1 <data>
2 .
3 .
4 .
5 </data>
6 <data>
7 .
8 .
9 .
10</data>
etc.
Each data block contains same number of lines (say... (4 Replies)
Discussion started by: hayreter
4 Replies
CPOSV(l) ) CPOSV(l)
NAME
CPOSV - compute the solution to a complex system of linear equations A * X = B,
SYNOPSIS
SUBROUTINE CPOSV( UPLO, N, NRHS, A, LDA, B, LDB, INFO )
CHARACTER UPLO
INTEGER INFO, LDA, LDB, N, NRHS
COMPLEX A( LDA, * ), B( LDB, * )
PURPOSE
CPOSV computes the solution to a complex system of linear equations A * X = B, where A is an N-by-N Hermitian positive definite matrix and
X and B are N-by-NRHS matrices.
The Cholesky decomposition is used to factor A as
A = U**H* U, if UPLO = 'U', or
A = L * L**H, if UPLO = 'L',
where U is an upper triangular matrix and L is a lower triangular matrix. The factored form of A is then used to solve the system of
equations A * X = B.
ARGUMENTS
UPLO (input) CHARACTER*1
= 'U': Upper triangle of A is stored;
= 'L': Lower triangle of A is stored.
N (input) INTEGER
The number of linear equations, i.e., 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 matrix B. NRHS >= 0.
A (input/output) COMPLEX array, dimension (LDA,N)
On entry, the Hermitian matrix A. If UPLO = 'U', the leading N-by-N upper triangular part of A contains the upper triangular part
of the matrix A, and the strictly lower triangular part of A is not referenced. If UPLO = 'L', the leading N-by-N lower triangular
part of A contains the lower triangular part of the matrix A, and the strictly upper triangular part of A is not referenced.
On exit, if INFO = 0, the factor U or L from the Cholesky factorization A = U**H*U or A = L*L**H.
LDA (input) INTEGER
The leading dimension of the array A. LDA >= max(1,N).
B (input/output) COMPLEX array, dimension (LDB,NRHS)
On entry, the N-by-NRHS right hand side matrix B. On exit, if INFO = 0, the N-by-NRHS solution matrix X.
LDB (input) INTEGER
The leading dimension of the array B. LDB >= max(1,N).
INFO (output) INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
> 0: if INFO = i, the leading minor of order i of A is not positive definite, so the factorization could not be completed, and the
solution has not been computed.
LAPACK version 3.0 15 June 2000 CPOSV(l)