photo

Thomas


self employed

Last seen: 4 mois il y a Actif depuis 2019

Followers: 0   Following: 0

Message

Statistiques

All
  • Thankful Level 3
  • First Answer
  • Thankful Level 2
  • 5-Star Galaxy Level 2
  • Personal Best Downloads Level 1
  • First Review
  • First Submission

Afficher les badges

Feeds

Afficher par

A soumis


A simple quaternion class
class with some basic operations on quaternions

environ un an il y a | 1 téléchargement |

Thumbnail

A soumis


discrete logarithm
compute the discrete logarithm using Shank's algorithm

environ un an il y a | 1 téléchargement |

Réponse apportée
How to create an array of matrices?
function aM = arrayofmatrices(A,B,C) aM(:,:,1) = A; aM(:,:,2) = B; aM(:,:,3) = C; end This only works when A, B and C hav...

plus d'un an il y a | 0

Question


I try to find a general vector base for all magic squares of dimension n . Why does this program work for n = 3, but not vor n > 3?
The program below is supposed to find a general vector base for all magic squares of dimension n . Why does this program work fo...

plus d'un an il y a | 1 réponse | 0

1

réponse

Réponse apportée
How can i check if a matrix is magic square or not?
try: function ismagic = ismagic(M) %ISMAGIC checks if a matrix M is a magic square or not if size(M,1) ~= size(M,2) is...

plus d'un an il y a | 0

Réponse apportée
How can i create array of symbolic expressions?
does this help? function array_of_symbolicExpressions(mx) syms t y(t); y(t) = t^3+t^2; % just an example d = diff(y); ...

plus d'un an il y a | 0

A soumis


Simple Chess game
I tried to keep it "minimalistic", so strength isn't great.

environ 2 ans il y a | 11 téléchargements |

Thumbnail

A soumis


Two versions of Pollard's rho factorization algorithm
one version with Brent's style cycle detection, one without but using vectors and matrices

plus de 2 ans il y a | 2 téléchargements |

Thumbnail

A soumis


sieve of Erathostenes
a simple number sieve, which could (in theory) run forever, because it does not require an interval to be sieved.

plus de 2 ans il y a | 1 téléchargement |

Thumbnail

Question


why is this Matlab Code faster than the C++ code below? I want to understand what Matlab internally does better and faster than C++
why is this Matlab Code function primes = sieve_era2(N) % sieve of Erathostenes without upper bound of search space (could th...

plus de 2 ans il y a | 2 réponses | 2

2

réponses

A soumis


find zeros of the Riemann zeta function
This function finds zeros of the Riemann zeta function on the critical line 0.5 + i*t in an interval von <= t <= bis

presque 3 ans il y a | 2 téléchargements |

Thumbnail

A soumis


Hashlife
a Matlab version of Gosper's hashlife

environ 3 ans il y a | 1 téléchargement |

Thumbnail

Question


Approximation of pi is "too precise" .
The function below should approximate pi adding about 2 digits of precision for increasing n. Why is piApprox2(3) exactly = pi ...

plus de 3 ans il y a | 1 réponse | 0

1

réponse

A soumis


two ways to compute Riemanns prime counting function
one version which works (J2) and one which does not work (J1).

plus de 3 ans il y a | 1 téléchargement |

Thumbnail

Question


Cannot start Matlab - getting error "std::exception: Loading D:\Program Files\MATLAB\R2019b\bin\win64\matlab_startup_plugins\Imgrimpl\lib
When I start Matlab from the Desktop Icon or from the task bar, I get this error: "std::exception: Loading D:\Program Files\M...

presque 4 ans il y a | 1 réponse | 4

0

réponse

A soumis


convert integer to binary or binary to integer
convert a column vetor of integers to a column vector of binaries or vice versa

presque 4 ans il y a | 1 téléchargement |

Thumbnail

A soumis


zetaRS approximates Riemann's zeta(0.5 + i*t) for large t
Fast computation of Riemann's zeta function on the critical strip using the Riemann Siegel formula.

presque 4 ans il y a | 1 téléchargement |

Thumbnail

Question


using fzero with arrayfun searching for zeros inside an interval
I have a function f = @(x) -x.^2+4 with a zero at -2 and +2 using fzero(f, [-3, 1.9]) I get the (correct) zero inside the inte...

presque 4 ans il y a | 1 réponse | 0

1

réponse

A soumis


Fast approximation of Pi
Approximate Pi with 16th order convergence

environ 4 ans il y a | 1 téléchargement |

Thumbnail

A soumis


Create and run Turing machines
Some tools and examples for creating and simulating Turing machines and macro-Turing machines.

environ 4 ans il y a | 1 téléchargement |

Thumbnail

A soumis


Computation of the rado function
More sophisticated check for endless loops, support for parallel execution and the use of macro-Turing-machines

plus de 4 ans il y a | 1 téléchargement |

Thumbnail

A soumis


uncover the call structure of a recursive function call
recurse(tree) helps to uncover the call structure of a recursive function call.

plus de 4 ans il y a | 1 téléchargement |

Thumbnail

A soumis


GaussLegendre
quick approximation of pi using the Gauss-Legendre algorithm

plus de 4 ans il y a | 2 téléchargements |

Thumbnail

A soumis


two versions of the Euler-phi function
two brief implementations of the Eulerphi function

plus de 4 ans il y a | 1 téléchargement |

Thumbnail

Question


Extract lines of a three dimensional matrix using an array of indices and NO for-loop
I have a three dimensional 10x5x2 array. Example: r(:,:,1) = [1 0 2 1 1; 2 0 3 1 1; 3 0 4 1 1; 4 0 1 1 -1; 5 0 -1 1 1; 1 1 3 1...

plus de 4 ans il y a | 1 réponse | 0

1

réponse

A soumis


Computation of Rado-function
Recursive computation of the "uncomputable" Rado-function.

presque 5 ans il y a | 1 téléchargement |

A soumis


Karatsuba algorithm for fast multiplication
Multiplication of "x" and "y" with Karatsuba method using base "base" x , y and base can be freely chosen

environ 5 ans il y a | 3 téléchargements |

A soumis


Shor Algorithm for prime factoring
A Version of the Shor-Algorithm for prime Factoring. Please feel free to comment on it or recommend improvements.

environ 5 ans il y a | 2 téléchargements |

Question


trying to compute Riemann's prime counting function J(x)
I am trying to compute Riemann's prime counting function J(x): J(x) should approximate the numbers of primes <= x using thi...

environ 5 ans il y a | 2 réponses | 0

2

réponses

Question


isprime function seems to have poor performance
Why is MatLab's "isprime" function so much slower than Octave's "isprime" function? I am using MatLab's "isprime" function to c...

plus de 5 ans il y a | 4 réponses | 2

4

réponses