|
On Thu, 25 Dec 2008 22:00:17 +0100, Gottfried Helms <helms@uni-kassel.de
Hi - just found -by accident- examples, meant to support the
definition
matrix^matrix = exp( log(matrix)*matrix) (1)
instead of
= exp( matrix...
Started by Gottfried Helms on
, 12 posts
by 3 people.
Answer Snippets (Read the full thread at omgili):
The last relation can even be extended to the "ZETA"-matrix,
which appears when the *non*-alternating geometric series of P
is considered
for the ZETA-matrix which contains ZETA-values....
Of E related by the "eigenvector-like"-matrix W.
|
|
This is what i have so far but I do not think it is right.
for (int i = 0 ; i < 5; i++) { for (int j = 0; j < 5; j++) { matrix[i][j] += matrix[i][j] * matrix[i][j]; } }
Started by Jack Null on
, 7 posts
by 7 people.
Answer Snippets (Read the full thread at stackoverflow):
A matrix in place is going to get the wrong answer, since you're going to be overwriting values before code, if you want to do a term by term product, then you're doing it wrong, what you're doing)
But if you want to do an authentic....
|
|
Will add some pictures but in the mean time
Brought her in feb with the aim of having it on the road asap. Here we are in Dec but almost ready. She had been dry stored / standing for 8 years
However I have: -
Brakes & wheels
replaced rear brake pistons...
Started by MikeyBikey on
, 15 posts
by 5 people.
Answer Snippets (Read the full thread at scimitarweb):
Is obviously wrong, you need an old toyota etc with the correct PCD Jim King
spares@rssoc.co.uk
Current 67.1
E Lantra 01> 4x114 35 to 45 67.1
Lantra 91 to 01 4x114 35 to 45 67.1
Matrix 01> 4x114 35.
|
Ask your Facebook Friends
|
I like the theory that the "real world" that the freed people live in is just another matrix designed to trick the hackers into thinking that they got out of the matrix.
Started by Kiddo716 on
, 10 posts
by 9 people.
Answer Snippets (Read the full thread at sherdog):
I think how great the first matrix was had built up this super high.
Off the top of my head.
|
|
I have found some mentions in another question of matrix addition being a quadratic operation . But I think it is linear.
If I double the size of a matrix, I need to calculate double the additions, not quadruple.
The main diverging point seems to be what...
Started by Martinho Fernandes on
, 5 posts
by 5 people.
Answer Snippets (Read the full thread at stackoverflow):
NB: on some hardware (GPU, vector machines, etc (like n < 3) it might even be one step... .
Which ever is correct actually depends on the larger problem of which the matrix addition is part of.
Of elements, or the width/height of the matrix.
|
|
I want to apply a function to all columns in a matrix with MATLAB. For example, I'd like to be able to call smooth on every column of a matrix, instead of having smooth treat the matrix as a vector (which is the default behaviour if you call smooth(matrix...
Started by dmnd on
, 7 posts
by 7 people.
Answer Snippets (Read the full thread at stackoverflow):
For a 100x10,000 matrix....
Maybe you could always transform the matrix).
However, it depends on your function if this would make sense .
You can also transform the matrix to one long column by using m(:,:) = m(:) .
Be a matrix, too.
|
|
I'm writing this question with reference to this one which I wrote yesterday. After a little documentation, it seems clear to me that what I wanted to do (and what I believed to be possible) is nearly impossible if not impossible at all. There are several...
Started by tunnuz on
, 6 posts
by 6 people.
Answer Snippets (Read the full thread at stackoverflow):
You should also ....
If you change it to:
Matrix& operator=(Matrix const& m);
The code should now compile.
A temporary is not allowed to bind to a non-constant reference, which is what your Matrix& operator=(Matrix& m) takes.
|
|
I have a matrix that I want to randomize a couple of thousand times, while keeping the row and column totals the same:
1 2 3 A 0 0 1 B 1 1 0 C 1 0 0
An example of a valid random matrix would be:
1 2 3 A 1 0 0 B 1 1 0 C 0 0 1
My actual matrix is a lot ...
Started by Lucas on
, 6 posts
by 6 people.
Answer Snippets (Read the full thread at stackoverflow):
It's not clear whether....
Step 1: First I would initialize the matrix posted one example.
Instead of trying to hit a good matrix, try to see the total? Sorry I don't know Perl, so I cannot show any code.
Should track the total and actual sum.
|
|
Is there an optimisation that lowers the constant factor of the runtime of Floyd-Warshall, if you are guaranteed to have a symmetric adjacency matrix?
Started by JPvdMerwe on
, 3 posts
by 3 people.
Answer Snippets (Read the full thread at stackoverflow):
That if the edgeCost matrix is symmetric, then the path matrix will also be symmetric after each need to store half of the matrix (since d(i,j) = d(j,i)), so you can reduce the amount of memory: Floyd-Warshall proof
The input ....
|
|
How can I store a 100K X 100K matrix in Java?
I can't do that with a normal array declaration as it is throwing a java.lang.OutofMemoryError .
Started by Deepak Konidena on
, 10 posts
by 10 people.
Answer Snippets (Read the full thread at stackoverflow):
You, but that's probably the wrong....
The Colt library has a sparse matrix implementation for Java.
To need to look into some kind of a way to only keep part of the matrix in memory at any given time, and the rest buffered on disk.
|
