Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with performance-tuning
Search options not deleted
user 69749
Questions on optimizing Mathematica code for higher performance. This may mean faster execution, lower memory usage or both. Not to be confused with mathematical optimization.
2
votes
1
answer
75
views
Efficient ways to generate a matrix from multiplying two elements of some matrix
I am working on the single particle entanglement entropy and in the process I have something like
Table[
Sum[
states[[eindex, spaceindex]] * states[[eindex, spaceindex2]],
{eindex …
- 319
4
votes
1
answer
121
views
Building projection operators efficiently
The projection operator $P$ is defined in quantum mechanics as $$
P=\sum_i^n \vert\psi_i\rangle \langle \psi_i\vert, $$
where $\vert\psi_i\rangle$ is a column vector and $(\langle
\psi_i\vert=(\ …
- 319