An algorithm is a sequence of well-defined steps that defines in abstract the solution to a problem.
13
votes
5answers
962 views
Finding all elements within a certain range in a sorted list
Suppose we have a sorted list of values. Let's use list = Sort@RandomReal[1, 1000000]; for this example.
I need a fast function ...
17
votes
3answers
1k views
Plotting a set of trajectories (not a vector field) in 3D
Consider a set of trajectories in 3D space, that possibly converge. By visualizing trajectories as arrows the result will look crowded as each arrowhead will be placed where the attractor is. In 2D, ...
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, ...
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 ...
