An algorithm is a sequence of well-defined steps that defines in abstract the solution to a problem.
22
votes
7answers
779 views
Splitting words into specific fragments
I am looking into splitting words into a succession of chemical elements symbols, where possible. For example:
Titanic = Ti Ta Ni C (titanium, tantalum, nickel, carbon)
A word may or may not be ...
14
votes
3answers
663 views
Effective matrix power like algorithm
First example
Suppose you want to calculate the 6th power of some matrix $A$. The brute force attempt of doing this is considering
$$(((AA)A)A)A)A$$
which requires a total of 5 matrix ...
33
votes
1answer
881 views
Adaptive sampling for slow to compute functions in 2D
EDIT: Although I have posted an answer based on my current progress, this in incomplete. Please see the "open issues" section in the answer.
Most plotting functions in Mathematica adjust the ...
15
votes
5answers
332 views
Alternative ways to implement a triangular recursion
Triangular recursions are a class of algorithms that frequently turn up in computational mathematics. These recursions are expressible in the general form
...
12
votes
2answers
657 views
How to get actual triangles from DelaunayTriangulation[]?
The ComputationalGeometry package has a DelaunayTriangulation[] function. It returns a list of points connected to each point, ...
