統計
ランク
of 154,105
コントリビューション
0 問題
0 解答
スコア
0
バッジ数
0
コントリビューション
0 投稿
コントリビューション
0 パブリック チャネル
平均評価
コントリビューション
0 ハイライト
平均いいねの数
Feeds
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...
1年以上 前 | 0
質問
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...
1年以上 前 | 1 件の回答 | 0
1
回答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...
1年以上 前 | 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); ...
1年以上 前 | 0
送信済み
Simple Chess game
I tried to keep it "minimalistic", so strength isn't great.
約2年 前 | ダウンロード 11 件 |
送信済み
Two versions of Pollard's rho factorization algorithm
one version with Brent's style cycle detection, one without but using vectors and matrices
2年以上 前 | ダウンロード 2 件 |
送信済み
sieve of Erathostenes
a simple number sieve, which could (in theory) run forever, because it does not require an interval to be sieved.
2年以上 前 | ダウンロード 1 件 |
質問
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...
2年以上 前 | 2 件の回答 | 2
2
回答送信済み
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
3年弱 前 | ダウンロード 2 件 |
質問
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 ...
3年以上 前 | 1 件の回答 | 0
1
回答送信済み
two ways to compute Riemanns prime counting function
one version which works (J2) and one which does not work (J1).
3年以上 前 | ダウンロード 1 件 |
質問
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...
4年弱 前 | 0 件の回答 | 4
0
回答送信済み
convert integer to binary or binary to integer
convert a column vetor of integers to a column vector of binaries or vice versa
4年弱 前 | ダウンロード 1 件 |
送信済み
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.
4年弱 前 | ダウンロード 1 件 |
質問
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...
4年弱 前 | 1 件の回答 | 0
1
回答送信済み
Create and run Turing machines
Some tools and examples for creating and simulating Turing machines and macro-Turing machines.
約4年 前 | ダウンロード 1 件 |
送信済み
Computation of the rado function
More sophisticated check for endless loops, support for parallel execution and the use of macro-Turing-machines
4年以上 前 | ダウンロード 1 件 |
送信済み
uncover the call structure of a recursive function call
recurse(tree) helps to uncover the call structure of a recursive function call.
4年以上 前 | ダウンロード 1 件 |
送信済み
GaussLegendre
quick approximation of pi using the Gauss-Legendre algorithm
4年以上 前 | ダウンロード 2 件 |
送信済み
two versions of the Euler-phi function
two brief implementations of the Eulerphi function
4年以上 前 | ダウンロード 1 件 |
質問
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...
4年以上 前 | 1 件の回答 | 0
1
回答送信済み
Computation of Rado-function
Recursive computation of the "uncomputable" Rado-function.
5年弱 前 | ダウンロード 1 件 |
送信済み
Karatsuba algorithm for fast multiplication
Multiplication of "x" and "y" with Karatsuba method using base "base" x , y and base can be freely chosen
約5年 前 | ダウンロード 3 件 |
送信済み
Shor Algorithm for prime factoring
A Version of the Shor-Algorithm for prime Factoring. Please feel free to comment on it or recommend improvements.
約5年 前 | ダウンロード 2 件 |
質問
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...
約5年 前 | 2 件の回答 | 0
2
回答質問
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...
5年以上 前 | 4 件の回答 | 2