Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
List of algorithms
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Physics=== {{further|Computational physics}} * [[Constraint algorithm]]: a class of algorithms for satisfying constraints for bodies that obey Newton's equations of motion * [[Demon algorithm]]: a [[Monte Carlo method]] for efficiently sampling members of a [[microcanonical ensemble]] with a given energy * [[Featherstone's algorithm]]: computes the effects of forces applied to a structure of joints and links * [[Ground state]] approximation ** [[Variational method]] *** [[Ritz method]] * [[N-body problem|''n''-body problems]] ** [[Barnes–Hut simulation]]: Solves the n-body problem in an approximate way that has the order {{math|O(<var>n</var> log <var>n</var>)}} instead of {{math|O(<var>n</var><sup>2</sup>)}} as in a direct-sum simulation. ** [[Fast multipole method]] (FMM): speeds up the calculation of long-ranged forces * [[Rainflow-counting algorithm]]: Reduces a complex [[stress (physics)|stress]] history to a count of elementary stress-reversals for use in [[fatigue (material)|fatigue]] analysis * [[Sweep and prune]]: a broad phase algorithm used during [[collision detection]] to limit the number of pairs of solids that need to be checked for collision * [[VEGAS algorithm]]: a method for reducing error in [[Monte Carlo simulation]]s * [[Glauber dynamics]]: a method for simulating the Ising Model on a computer
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)