Thomas
self employed
Followers: 0 Following: 0
Statistica
RANK
5.738
of 292.676
REPUTAZIONE
8
CONTRIBUTI
8 Domande
3 Risposte
ACCETTAZIONE DELLE RISPOSTE
62.5%
VOTI RICEVUTI
8
RANK
9.249 of 19.931
REPUTAZIONE
74
VALUTAZIONE MEDIA
3.70
CONTRIBUTI
19 File
DOWNLOAD
24
ALL TIME DOWNLOAD
574
RANK
of 147.818
CONTRIBUTI
0 Problemi
0 Soluzioni
PUNTEGGIO
0
NUMERO DI BADGE
0
CONTRIBUTI
0 Post
CONTRIBUTI
0 Pubblico Canali
VALUTAZIONE MEDIA
CONTRIBUTI
0 Punti principali
NUMERO MEDIO DI LIKE
Feeds
Inviato
A simple quaternion class
class with some basic operations on quaternions
10 mesi fa | 1 download |
Inviato
discrete logarithm
compute the discrete logarithm using Shank's algorithm
10 mesi fa | 1 download |
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...
circa un anno fa | 0
Domanda
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...
circa un anno fa | 1 risposta | 0
1
rispostaHow 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...
circa un anno fa | 0
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); ...
circa un anno fa | 0
Inviato
Simple Chess game
I tried to keep it "minimalistic", so strength isn't great.
quasi 2 anni fa | 2 download |
Inviato
Two versions of Pollard's rho factorization algorithm
one version with Brent's style cycle detection, one without but using vectors and matrices
circa 2 anni fa | 1 download |
Inviato
sieve of Erathostenes
a simple number sieve, which could (in theory) run forever, because it does not require an interval to be sieved.
circa 2 anni fa | 1 download |
Domanda
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...
circa 2 anni fa | 2 risposte | 2
2
risposteInviato
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
oltre 2 anni fa | 2 download |
Domanda
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 ...
circa 3 anni fa | 1 risposta | 0
1
rispostaInviato
two ways to compute Riemanns prime counting function
one version which works (J2) and one which does not work (J1).
oltre 3 anni fa | 1 download |
Domanda
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...
oltre 3 anni fa | 0 risposte | 4
0
risposteInviato
convert integer to binary or binary to integer
convert a column vetor of integers to a column vector of binaries or vice versa
oltre 3 anni fa | 1 download |
Inviato
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.
oltre 3 anni fa | 1 download |
Domanda
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...
oltre 3 anni fa | 1 risposta | 0
1
rispostaInviato
Fast approximation of Pi
Approximate Pi with 16th order convergence
oltre 3 anni fa | 1 download |
Inviato
Create and run Turing machines
Some tools and examples for creating and simulating Turing machines and macro-Turing machines.
oltre 3 anni fa | 1 download |
Inviato
Computation of the rado function
More sophisticated check for endless loops, support for parallel execution and the use of macro-Turing-machines
circa 4 anni fa | 1 download |
Inviato
uncover the call structure of a recursive function call
recurse(tree) helps to uncover the call structure of a recursive function call.
circa 4 anni fa | 1 download |
Inviato
GaussLegendre
quick approximation of pi using the Gauss-Legendre algorithm
circa 4 anni fa | 2 download |
Inviato
two versions of the Euler-phi function
two brief implementations of the Eulerphi function
circa 4 anni fa | 1 download |
Domanda
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...
oltre 4 anni fa | 1 risposta | 0
1
rispostaInviato
Computation of Rado-function
Recursive computation of the "uncomputable" Rado-function.
oltre 4 anni fa | 1 download |
Inviato
Karatsuba algorithm for fast multiplication
Multiplication of "x" and "y" with Karatsuba method using base "base" x , y and base can be freely chosen
quasi 5 anni fa | 1 download |
Inviato
Shor Algorithm for prime factoring
A Version of the Shor-Algorithm for prime Factoring. Please feel free to comment on it or recommend improvements.
quasi 5 anni fa | 2 download |
Domanda
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...
quasi 5 anni fa | 2 risposte | 0
2
risposteDomanda
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...
quasi 5 anni fa | 4 risposte | 2