interesting links2024-02-01T19:11:29+01:00https://roland.iwasno.net/links/https://roland.iwasno.net/links/https://roland.iwasno.net/links/The Pi-Search Pagehttps://roland.iwasno.net/links/?zuLlbA2024-02-01T19:11:29+01:00Website to search for patterns in the first 2e8 decimal digits of π.<br>(<a href="https://roland.iwasno.net/links/?zuLlbA">Permalink</a>)Structural insight: The relativity-quantum splithttps://roland.iwasno.net/links/?HxkZRQ2023-10-16T17:48:36+02:00Found via <a href="https://hyper.dev/2023/seed-0-freedom-of-expression-john-shutt-kernel/" rel="nofollow">https://hyper.dev/2023/seed-0-freedom-of-expression-john-shutt-kernel/</a> on Planet Scheme<br />
See also <a href="https://fexpr.blogspot.com/2019/04/nabla_18.html" rel="nofollow">https://fexpr.blogspot.com/2019/04/nabla_18.html</a><br>(<a href="https://roland.iwasno.net/links/?HxkZRQ">Permalink</a>)Simple Linux Utility for Resource Managementhttps://roland.iwasno.net/links/?lt9xfQ2023-09-30T22:53:50+02:00The SLURM Workload Manager is an open source, fault-tolerant and highly scalable cluster management and job scheduling system[1] used on the DEAC cluster. Formerly known as Simple Linux Utility for Resource Management (aka SLURM)[2], it provides three key functions:<br />
<br />
Allocates exclusive and/or non-exclusive access to resources (compute nodes) to users for X period of time<br />
Provides a framework for starting, executing, and monitoring work on allocated nodes<br />
Arbitrates contention for resources by managing a queue of pending jobs<br />
<br />
See also <a href="https://wiki.deac.wfu.edu/user/Software:OpenPFGW" rel="nofollow">https://wiki.deac.wfu.edu/user/Software:OpenPFGW</a> a primality test program<br>(<a href="https://roland.iwasno.net/links/?lt9xfQ">Permalink</a>)Mathematical Problem Solvinghttps://roland.iwasno.net/links/?mNOhvA2023-07-17T11:38:04+02:00(<a href="https://roland.iwasno.net/links/?mNOhvA">Permalink</a>)Online Mathematics Editor a fast way to write and share mathematicshttps://roland.iwasno.net/links/?4k8Ing2023-05-19T23:31:56+02:00Found via a comment on <a href="https://github.com/excalidraw/excalidraw" rel="nofollow">https://github.com/excalidraw/excalidraw</a><br>(<a href="https://roland.iwasno.net/links/?4k8Ing">Permalink</a>)Explicit-Formulas Databasehttps://roland.iwasno.net/links/?IqsKsA2023-05-15T14:10:31+02:00The Explicit-Formulas Database [for elliptic curves] is joint work by Daniel J. Bernstein and Tanja Lange, building on work by many authors.<br>(<a href="https://roland.iwasno.net/links/?IqsKsA">Permalink</a>)6.896: Essential Coding Theoryhttps://roland.iwasno.net/links/?tBnMVA2023-03-20T14:03:34+01:00Lecture notes by Dr. Madhu Sudan, found on Wikipedia <a href="https://en.wikipedia.org/wiki/Berlekamp%E2%80%93Welch_algorithm" rel="nofollow">https://en.wikipedia.org/wiki/Berlekamp%E2%80%93Welch_algorithm</a><br>(<a href="https://roland.iwasno.net/links/?tBnMVA">Permalink</a>)Gold Code Sequenceshttps://roland.iwasno.net/links/?BG06qg2023-03-16T16:51:34+01:00Information about m-sequences and Gold codes. The condition l ≠ 0 (mod 4) is missing.<br />
The site has a lot of information about wireless communciation, e.g. <a href="http://www.wirelesscommunication.nl/reference/xtra/story.htm" rel="nofollow">http://www.wirelesscommunication.nl/reference/xtra/story.htm</a><br>(<a href="https://roland.iwasno.net/links/?BG06qg">Permalink</a>)Landon Curt Nollhttps://roland.iwasno.net/links/?sevdbA2023-01-26T11:38:54+01:00Found via a comment about calc <a href="http://www.isthe.com/chongo/tech/comp/calc/index.html" rel="nofollow">http://www.isthe.com/chongo/tech/comp/calc/index.html</a><br />
on <a href="https://groups.google.com/g/comp.lang.tcl/c/7JXGt-Uxqag/m/rcHDLLu6MpEJ" rel="nofollow">https://groups.google.com/g/comp.lang.tcl/c/7JXGt-Uxqag/m/rcHDLLu6MpEJ</a><br />
See also <a href="https://www.systutorials.com/docs/linux/man/1-calc/" rel="nofollow">https://www.systutorials.com/docs/linux/man/1-calc/</a> for a man page.<br>(<a href="https://roland.iwasno.net/links/?sevdbA">Permalink</a>)Everything and More: A Compact History of Infinity by David Foster Wallacehttps://roland.iwasno.net/links/?j6YLwg2023-01-08T21:14:47+01:00Found via an interview with David Foster Wallace <a href="https://neugierig.org/content/dfw/believer_interview.pdf" rel="nofollow">https://neugierig.org/content/dfw/believer_interview.pdf</a><br />
Reviews are mixed, so I am undecided whether I should read it.<br>(<a href="https://roland.iwasno.net/links/?j6YLwg">Permalink</a>)Emacs – Nick Highamhttps://roland.iwasno.net/links/?LmQGmg2022-11-17T16:03:45+01:00Emacs-related articles on Nick Higham's blog.<br />
See also the interesting "What Is" series of articles, mostly on numerical linear algebra.<br>(<a href="https://roland.iwasno.net/links/?LmQGmg">Permalink</a>)MaiZure's Projects - Just another place to dispose of personal programming projectshttps://roland.iwasno.net/links/?m6SW2Q2022-07-28T12:18:44+02:00Found <a href="http://www.maizure.org/projects/decoded-gnu-coreutils/index.html" rel="nofollow">http://www.maizure.org/projects/decoded-gnu-coreutils/index.html</a> via <a href="https://www.gnu.org/software/coreutils/#source" rel="nofollow">https://www.gnu.org/software/coreutils/#source</a><br />
Recommended reading: <a href="http://www.maizure.org/projects/printf/index.html" rel="nofollow">http://www.maizure.org/projects/printf/index.html</a><br>(<a href="https://roland.iwasno.net/links/?m6SW2Q">Permalink</a>)GitHub - kimwalisch/primecount: 🚀 Fast prime counting function implementationshttps://roland.iwasno.net/links/?kxh09g2022-06-27T10:40:50+02:00primecount is a command-line program and C/C++ library that counts the number of primes ≤ x (maximum 1031) using highly optimized implementations of the combinatorial prime counting algorithms.<br />
Found via <a href="https://www.cliki.net/primecount" rel="nofollow">https://www.cliki.net/primecount</a> and <a href="https://github.com/AaronChen0/primecount" rel="nofollow">https://github.com/AaronChen0/primecount</a><br>(<a href="https://roland.iwasno.net/links/?kxh09g">Permalink</a>)Polynomial Rootfinder reposthttps://roland.iwasno.net/links/?UNcafg2022-05-28T19:20:00+02:00The HP 48 object listed below in ->ASC form is a high-performance polynomial root finder. Those of you who remember the HP 71B Math Pac will recognize this as the same as the PROOT command from that Pac; it is in fact the same assembly-language code, given an RPL front end to operate in the HP 48.<br />
Found on <a href="https://www.hpmuseum.org/forum/thread-10967-post-160700.html#pid160700" rel="nofollow">https://www.hpmuseum.org/forum/thread-10967-post-160700.html#pid160700</a><br />
See also <a href="http://www.jeffcalc.hp41.eu/emu71/mathrom.html#src" rel="nofollow">http://www.jeffcalc.hp41.eu/emu71/mathrom.html#src</a> for the uncommented source code of PROOT and other functions of the HP71B math pack.<br>(<a href="https://roland.iwasno.net/links/?UNcafg">Permalink</a>)mpmath - Python library for arbitrary-precision floating-point arithmetichttps://roland.iwasno.net/links/?1-ODBw2022-05-17T15:57:41+02:00mpmath is a free (BSD licensed) Python library for real and complex floating-point arithmetic with arbitrary precision. It has been developed by Fredrik Johansson since 2007, with help from many contributors.<br>(<a href="https://roland.iwasno.net/links/?1-ODBw">Permalink</a>)Research Notes with Org-Modehttps://roland.iwasno.net/links/?9Q5TnQ2022-04-20T09:57:59+02:00Found on Sacha Chua's blog <a href="https://sachachua.com/blog/2022/04/2022-04-18-emacs-news/" rel="nofollow">https://sachachua.com/blog/2022/04/2022-04-18-emacs-news/</a><br>(<a href="https://roland.iwasno.net/links/?9Q5TnQ">Permalink</a>)Joris van der Hoevenhttps://roland.iwasno.net/links/?ygv9qw2022-04-16T22:12:53+02:00Found on Fredrik Johansson's blog <a href="https://fredrikj.net/blog/2022/04/arb-is-10/" rel="nofollow">https://fredrikj.net/blog/2022/04/arb-is-10/</a><br />
What are transseries?<br>(<a href="https://roland.iwasno.net/links/?ygv9qw">Permalink</a>)Blog about the whole ecosystem of PicoLisphttps://roland.iwasno.net/links/?xdj-IQ2022-04-03T16:07:01+02:00(<a href="https://roland.iwasno.net/links/?xdj-IQ">Permalink</a>)Laguerre's method for polynomial rootshttps://roland.iwasno.net/links/?EoOFwA2022-03-14T12:38:38+01:00Implementations in Basic and C.<br>(<a href="https://roland.iwasno.net/links/?EoOFwA">Permalink</a>)GitHub - johnsonjh/matlab: matlab: MATLAB (with FORTRAN source code)https://roland.iwasno.net/links/?xkYOdQ2021-08-17T16:26:34+02:00Source Code for MATLAB (1982-05-25)<br />
A matrix computation System.<br />
<br />
Written in FORTRAN by:<br />
<br />
Cleve Moler<br />
Department of Computer Science<br />
University of New Mexico<br />
Albuquerque, NM 87131<br />
<br />
Source code distributed by:<br />
<br />
Jim Kweeder<br />
Department of Chemical Engineering<br />
Clarkson University<br />
Potsdam, NY 13676<br />
Internet: kweeder@sun.soe.clarkson.edu<br />
Bitnet: kweeder%sun.soe.clarkson.edu@clutx<br>(<a href="https://roland.iwasno.net/links/?xkYOdQ">Permalink</a>)Blog about programming and mathematicshttps://roland.iwasno.net/links/?bj-udg2021-06-07T19:14:39+02:00The book reviews on <a href="https://catonmat.net/top-100-books-part-eight" rel="nofollow">https://catonmat.net/top-100-books-part-eight</a> are short, but cover many interesting books.<br>(<a href="https://roland.iwasno.net/links/?bj-udg">Permalink</a>)C. R. Bond's sitehttps://roland.iwasno.net/links/?y6703Q2021-03-22T19:19:22+01:00Found via the Wikipedia page about Optimum "L" filters<br />
<a href="https://en.wikipedia.org/wiki/Optimum_%22L%22_filter" rel="nofollow">https://en.wikipedia.org/wiki/Optimum_%22L%22_filter</a><br>(<a href="https://roland.iwasno.net/links/?y6703Q">Permalink</a>)Blog with only Org Modehttps://roland.iwasno.net/links/?bAFTEw2021-03-03T22:59:05+01:00Nice blog (in appearance, contents and implementation). See <a href="https://archive.casouri.cat/note/2018/blog-in-org-mode-revisited/index.html" rel="nofollow">https://archive.casouri.cat/note/2018/blog-in-org-mode-revisited/index.html</a> for an update.<br />
An interesting idea for entering mathematical symbols is presented on <a href="https://archive.casouri.cat/note/2020/insert-math-symbol-in-emacs/index.html" rel="nofollow">https://archive.casouri.cat/note/2020/insert-math-symbol-in-emacs/index.html</a><br>(<a href="https://roland.iwasno.net/links/?bAFTEw">Permalink</a>)Numerical Recipes Books On-Linehttps://roland.iwasno.net/links/?uDNuhw2021-02-08T12:15:48+01:00Not only older issues of the Numerical Recipes books, but also classics such as <br />
Handbook Abramowitz and Stegun, Handbook of Mathematical Functions (10th corrected printing, 1972)<br />
<br />
Bateman, Erdelyi et al. (Bateman Manuscript Project)<br />
Higher Transcendental Functions (vols. 1, 2, and 3)<br />
<br />
and<br />
Encyclopaedia Britannica the great 11th Edition (1911)<br />
<br />
Found via <a href="https://www.hpmuseum.org/forum/thread-16251-post-142741.html#pid142741" rel="nofollow">https://www.hpmuseum.org/forum/thread-16251-post-142741.html#pid142741</a><br>(<a href="https://roland.iwasno.net/links/?uDNuhw">Permalink</a>)The Welch-Berlekamp Algorithm for Correcting Errors in Data – Math ∩ Programminghttps://roland.iwasno.net/links/?QdDM0A2021-02-03T15:09:09+01:00Neat description of Reed-Solomon error codes and two simple error-correction algorithms, implemented in Python.<br />
Found on <a href="https://planet.scheme.org/" rel="nofollow">https://planet.scheme.org/</a> via the article<br />
<a href="https://jeremykun.com/2020/09/11/searching-for-rh-counterexamples-setting-up-pytest/" rel="nofollow">https://jeremykun.com/2020/09/11/searching-for-rh-counterexamples-setting-up-pytest/</a><br>(<a href="https://roland.iwasno.net/links/?QdDM0A">Permalink</a>)Uncle Petros and Goldbach's Conjecture - Wikipediahttps://roland.iwasno.net/links/?gkEQEQ2021-01-22T15:00:10+01:00Sounds like an interesting book. See Keith Devlin's review <a href="https://www.maa.org/press/maa-reviews/uncle-petros-and-goldbachs-conjecture" rel="nofollow">https://www.maa.org/press/maa-reviews/uncle-petros-and-goldbachs-conjecture</a><br>(<a href="https://roland.iwasno.net/links/?gkEQEQ">Permalink</a>)PCG, A Family of Better Random Number Generators | PCG, A Better Random Number Generatorhttps://roland.iwasno.net/links/?FXlw9Q2020-10-14T17:50:59+02:00PCG is a family of simple fast space-efficient statistically good algorithms for random number generation. Unlike many general-purpose RNGs, they are also hard to predict.<br>(<a href="https://roland.iwasno.net/links/?FXlw9Q">Permalink</a>)Blog articles from José Antonio Ortega Ruizhttps://roland.iwasno.net/links/?QyWr4g2020-07-10T14:45:27+02:00Interesting blog written in org-mode, using <a href="https://github.com/bastibe/org-static-blog" rel="nofollow">https://github.com/bastibe/org-static-blog</a>, written by Bastian Bechtold <a href="https://bastibe.de/" rel="nofollow">https://bastibe.de/</a><br />
Some highlights: <br />
<a href="https://jao.io/blog/2020-02-26-literate-programming.html" rel="nofollow">https://jao.io/blog/2020-02-26-literate-programming.html</a> literate programming<br />
<a href="https://jao.io/blog/2020-02-23-signel.html" rel="nofollow">https://jao.io/blog/2020-02-23-signel.html</a>, a barebones signal chat on top of signal-cli, written in literate style<br />
<a href="https://jao.io/blog/2006-03-17-programmers-go-bananas.html" rel="nofollow">https://jao.io/blog/2006-03-17-programmers-go-bananas.html</a> category theory<br />
<a href="https://jao.io/blog/2020-05-01-dancers-at-the-end-of-time.html" rel="nofollow">https://jao.io/blog/2020-05-01-dancers-at-the-end-of-time.html</a> sounds like an interesting book.<br />
<a href="https://jao.io/blog/2006-07-06-geometrically-speaking.html" rel="nofollow">https://jao.io/blog/2006-07-06-geometrically-speaking.html</a> geometric proofs, Kindergarten Quantum Mechanics<br />
<a href="https://jao.io/blog/2020-05-04-observatory.html" rel="nofollow">https://jao.io/blog/2020-05-04-observatory.html</a> Mozilla Observatory to check a website's security<br />
<a href="https://jao.io/blog/2022-06-19-simple-note-taking.html" rel="nofollow">https://jao.io/blog/2022-06-19-simple-note-taking.html</a> simple note taking<br>(<a href="https://roland.iwasno.net/links/?QyWr4g">Permalink</a>)There's something about Φ φ phi / Algo pasa con phihttps://roland.iwasno.net/links/?FrYbVQ2020-02-27T16:43:55+01:00I have not watched it, perhaps it is something for MP?<br>(<a href="https://roland.iwasno.net/links/?FrYbVQ">Permalink</a>)A random blog with math, science, and computer content among other things.https://roland.iwasno.net/links/?aLnDDQ2020-01-20T23:44:53+01:00Joe Marshall's non-lisp blog. Lisp/Scheme are the subject of his other blog,<br />
Abstract Heresies, Unorthodox opinions on computer science and programming. <a href="http://funcall.blogspot.com/" rel="nofollow">http://funcall.blogspot.com/</a><br>(<a href="https://roland.iwasno.net/links/?aLnDDQ">Permalink</a>)https://galmon.eu/https://roland.iwasno.net/links/?PsGasw2019-09-25T18:04:17+02:00Galileo/GPS/BeiDou/Glonass open source monitor.<br />
Found via <a href="https://hackaday.com/2019/09/24/tracking-the-satellites-that-keep-us-on-track-monitoring-gps-galileo-beidou-and-glonass/" rel="nofollow">https://hackaday.com/2019/09/24/tracking-the-satellites-that-keep-us-on-track-monitoring-gps-galileo-beidou-and-glonass/</a><br />
The source code can be found on <a href="https://github.com/berthubert/galmon" rel="nofollow">https://github.com/berthubert/galmon</a><br />
<br />
See also the articles <a href="https://berthub.eu/articles/posts/galmon-project/" rel="nofollow">https://berthub.eu/articles/posts/galmon-project/</a> and <a href="https://berthub.eu/articles/posts/improved-galileo-fix-time/" rel="nofollow">https://berthub.eu/articles/posts/improved-galileo-fix-time/</a><br />
Read <a href="https://berthub.eu/articles/posts/galileos-eccentric-satellites/" rel="nofollow">https://berthub.eu/articles/posts/galileos-eccentric-satellites/</a>, all formulas are approximations.<br>(<a href="https://roland.iwasno.net/links/?PsGasw">Permalink</a>)Henry Baker's Archive of Research Papershttps://roland.iwasno.net/links/?IExdnw2019-06-24T11:23:51+02:00Collection of interesting papers, including the famous MIT HAKMEM <a href="http://home.pipeline.com/~hbaker1/hakmem/hakmem.html" rel="nofollow">http://home.pipeline.com/~hbaker1/hakmem/hakmem.html</a><br />
Lisp, garbage collection, modular arithmetic and more.<br>(<a href="https://roland.iwasno.net/links/?IExdnw">Permalink</a>)Fermat's Library | Homehttps://roland.iwasno.net/links/?PY-4Og2019-01-23T11:12:46+01:00Collection of interesting articles. Found via<br />
<a href="https://fermatslibrary.com/s/the-tunnel-of-samos#email-newsletter" rel="nofollow">https://fermatslibrary.com/s/the-tunnel-of-samos#email-newsletter</a><br />
from a post on MoHP.<br>(<a href="https://roland.iwasno.net/links/?PY-4Og">Permalink</a>)Consulting in mathematics, statistics, and scientific computinghttps://roland.iwasno.net/links/?Ldub2g2018-07-09T11:55:42+02:00Apart from the blog, there are technical notes <a href="https://www.johndcook.com/blog/writing/" rel="nofollow">https://www.johndcook.com/blog/writing/</a> and on-line calculators <a href="https://www.johndcook.com/blog/online-calculators/" rel="nofollow">https://www.johndcook.com/blog/online-calculators/</a><br />
As an example, see Camp-Paulson normal approximation to the binomial distribution <a href="https://www.johndcook.com/blog/camp_paulson/" rel="nofollow">https://www.johndcook.com/blog/camp_paulson/</a><br>(<a href="https://roland.iwasno.net/links/?Ldub2g">Permalink</a>)BC NUMBER THEORY PROGRAMShttps://roland.iwasno.net/links/?RL78Iw2018-07-06T09:46:48+02:00Various number theoretic algrorithms written in the bc(1) programming language.<br />
See also the calculator program <a href="http://www.numbertheory.org/calc/krm_calc.htm" rel="nofollow">http://www.numbertheory.org/calc/krm_calc.htm</a> from the same author.<br>(<a href="https://roland.iwasno.net/links/?RL78Iw">Permalink</a>)3Blue1Brownhttps://roland.iwasno.net/links/?faL1ag2018-06-05T13:56:45+02:00Recommended on MoHP.<br>(<a href="https://roland.iwasno.net/links/?faL1ag">Permalink</a>)How to Read Mathematicshttps://roland.iwasno.net/links/?ecv2jQ2018-04-27T18:20:35+02:00A reading protocol is a set of strategies that a reader must use in order to benefit fully from reading the text. Poetry calls for a different set of strategies than fiction, and fiction a different set than non-fiction. It would be ridiculous to read fiction and ask oneself what is the author's source for the assertion that the hero is blond and tanned; it would be wrong to read non-fiction and not ask such a question. This reading protocol extends to a viewing or listening protocol in art and music. Indeed, much of the introductory course material in literature, music and art is spent teaching these protocols.<br />
<br />
Mathematics has a reading protocol all its own, and just as we learn to read literature, we should learn to read mathematics. Students need to learn how to read mathematics, in the same way they learn how to read a novel or a poem, listen to music, or view a painting. Ed Rothstein’s book, Emblems of Mind, a fascinating book emphasizing the relationship between mathematics and music, touches implicitly on the reading protocols for mathematics.<br />
<br />
From the book Rediscovering Mathematics: You Do the Math by Shai Simonson. <a href="http://web.stonehill.edu/compsci/RediscoveringMath/RM.html" rel="nofollow">http://web.stonehill.edu/compsci/RediscoveringMath/RM.html</a><br>(<a href="https://roland.iwasno.net/links/?ecv2jQ">Permalink</a>)Reflections on Relativityhttps://roland.iwasno.net/links/?rpg8oA2018-03-30T16:26:40+02:00There a number of interesting articles such as<br />
- The Mystery of the Grazing Goat <a href="http://www.mathpages.com/home/kmath074/kmath074.htm" rel="nofollow">http://www.mathpages.com/home/kmath074/kmath074.htm</a><br />
- On The Solution of the Cubic Equation <a href="http://www.mathpages.com/home/kmath444/kmath444.htm" rel="nofollow">http://www.mathpages.com/home/kmath444/kmath444.htm</a><br />
- Infinite grid of resistors, ...<br>(<a href="https://roland.iwasno.net/links/?rpg8oA">Permalink</a>)Home Page of Evan Millerhttps://roland.iwasno.net/links/?cisf-g2018-03-28T00:24:51+02:00For a good example, read <a href="http://www.evanmiller.org/dont-kill-math.html" rel="nofollow">http://www.evanmiller.org/dont-kill-math.html</a><br>(<a href="https://roland.iwasno.net/links/?cisf-g">Permalink</a>)Fourier transform definition conventions and formulashttps://roland.iwasno.net/links/?OyXG1A2017-06-26T12:54:29+02:00(<a href="https://roland.iwasno.net/links/?OyXG1A">Permalink</a>)Glad Hobo Express: What's so special about 13532385396179?https://roland.iwasno.net/links/?R7UbyQ2017-06-14T21:13:59+02:0013532385396179 = 13 * 53^2 * 3853 * 96179<br />
is a counterexample to a conjecture of John H. Conway.<br>(<a href="https://roland.iwasno.net/links/?R7UbyQ">Permalink</a>)Bob's Sliderule Sitehttps://roland.iwasno.net/links/?NGHi3A2017-04-28T13:42:05+02:00Just what it says.<br>(<a href="https://roland.iwasno.net/links/?NGHi3A">Permalink</a>)Dan Cross's Webloghttps://roland.iwasno.net/links/?4YGOrA2017-03-19T20:48:47+01:00Interesting blog about programming, mathematics, Lisp and Plan 9.<br>(<a href="https://roland.iwasno.net/links/?4YGOrA">Permalink</a>)spigot: an exact real calculatorhttps://roland.iwasno.net/links/?uas99Q2016-12-31T22:24:04+01:00spigot is a calculating program. It supports the usual arithmetic operations, square and cube roots, trigonometric and exponential functions, and a few other special functions such as erf.<br />
<br />
spigot differs from the average calculating program in that it is an exact real calculator. This means that it does not suffer from rounding errors; in principle, it can keep generating more and more digits of the number you asked for until it runs out of memory.<br />
<br />
In particular, if you ask for a complex expression such as sin(sqrt(pi)), then most calculating systems would compute first pi, then sqrt(pi) and finally sin(sqrt(pi)), accumulating a rounding error at each step, so that the final result had a build-up of error and you would have to do some additional error analysis to decide how much of the output you could trust.<br />
<br />
spigot, on the other hand, does not output any digit until it is sure that digit is correct, so if you ask for (say) 100 digits of sin(sqrt(pi)) then you can be sure they are the right 100 digits.<br>(<a href="https://roland.iwasno.net/links/?uas99Q">Permalink</a>)Online Math - The Trillia Grouphttps://roland.iwasno.net/links/?VsNPrQ2016-10-23T20:26:53+02:00Alexandre Stefanov long maintained a list of online math texts and other materials at Geocities, but it appears that his original web site is no longer available. Because these resources may be of interest to our readers, we present here a modified version of Stefanov's list as of November 18, 2009. We welcome corrections or suggested additions to this list.<br>(<a href="https://roland.iwasno.net/links/?VsNPrQ">Permalink</a>)Apex: My Editor Project | Good Math Bad Mathhttps://roland.iwasno.net/links/?t8aEkA2016-07-12T02:02:28+02:00Mark Chu-Carroll's blog covers many subjects, including mathematics, physics and programming. In this article he describes his design of a programming language suited for an editor (think about a more readable version of TECO's language).<br />
As of 2021-06-21, the site cannot be reached. On 2021-12-22 it is on-line again.<br>(<a href="https://roland.iwasno.net/links/?t8aEkA">Permalink</a>)bit-player | An amateur's outlook on computation and mathematicshttps://roland.iwasno.net/links/?QZ5QPg2016-07-12T00:33:12+02:00Interesting blog. I found the article <a href="http://bit-player.org/2016/prime-after-prime" rel="nofollow">http://bit-player.org/2016/prime-after-prime</a> via Tony Finch's link log <a href="http://dotat.at/" rel="nofollow">http://dotat.at/</a>:<br>(<a href="https://roland.iwasno.net/links/?QZ5QPg">Permalink</a>)Factoring relatively large semi-primes: or, why you should probably just give up, and use YAFU insteadhttps://roland.iwasno.net/links/?rIT7vA2016-04-23T23:44:34+02:00In order to factor (relatively) large semi-primes (i.e. semi-primes larger than 150-bits), you should (probably) just ask YAFU (Yet Another Factoring Utility, <a href="https://github.com/DarkenCode/yafu" rel="nofollow">https://github.com/DarkenCode/yafu</a>) to try to factor the number for you in parallel using a highly-optimized number field sieve such as GGNFS (GPL General Number Field Sieve) or SIQS (Self-Initialising Quadratic Sieve). By using YAFU I was able to factor a 302-bit semi-prime in a little over half an hour , as opposed to over the course of 72 minutes using Sage’s Quadratic Sieve (QS).<br>(<a href="https://roland.iwasno.net/links/?rIT7vA">Permalink</a>)Vincenty's formulae - Wikipedia, the free encyclopediahttps://roland.iwasno.net/links/?LW48Rw2016-01-20T18:41:42+01:00Vincenty's formulae are two related iterative methods used in geodesy to calculate the distance between two points on the surface of a spheroid, developed by Thaddeus Vincenty (1975a) They are based on the assumption that the figure of the Earth is an oblate spheroid, and hence are more accurate than methods such as great-circle distance which assume a spherical Earth.<br />
<br />
The first (direct) method computes the location of a point which is a given distance and azimuth (direction) from another point. The second (inverse) method computes the geographical distance and azimuth between two given points. They have been widely used in geodesy because they are accurate to within 0.5 mm (0.020″) on the Earth ellipsoid.<br>(<a href="https://roland.iwasno.net/links/?LW48Rw">Permalink</a>)Mathematics without Apologies, by Michael Harris | An unapologetic guided tour of the mathematical lifehttps://roland.iwasno.net/links/?4o9cKQ2015-11-10T15:02:50+01:00Sounds like an interesting book. The blog is worth reading as well.<br>(<a href="https://roland.iwasno.net/links/?4o9cKQ">Permalink</a>)