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 na.numerical-analysis
Search options not deleted
user 28104
Numerical algorithms for problems in analysis and algebra, scientific computation
11
votes
Accepted
Compute an arbitrary decimal place of $\pi$
Yes, there are such algorithms.
-- See e.g. Xavier Gourdon: Computation of the $n$-th decimal digit of $\pi$ with low memory.
There also is the Bailey-Borwein-Plouffe formula already mentioned by Geof …
- 19.6k
6
votes
Algorithm for solving systems of linear Diophantine inequalities
GAP provides a function NullspaceIntMat which solves systems
of linear diophantine equations. The documentation says:
25.1-2 SolutionIntMat
* SolutionIntMat( mat, vec ) ───────────────────────────── …
- 19.6k
2
votes
How to calculate log or exp of a value in GF(2^n) using log/exp table of GF((2^k)^m) where n...
Efficient algorithms to compute in finite fields are based on
Conway polynomials. Such algorithms are implemented in several
computer algebra systems, for example in GAP. For details, see e.g.
the cha …
- 19.6k