Computational physics Computational physics is the study and implementation of numerical analysis to solve problems in physics for which a quantitative theory already exists. Historically, computational physics was the fir... Computational physics - Wikipedia
 Molecular dynamics Molecular dynamics (MD) is a computer simulation of physical movements of atoms and molecules in the context of N-body simulation. The atoms and molecules are allowed to interact for a period of time,... Molecular dynamics - Wikipedia
 Monte Carlo method Monte Carlo methods (or Monte Carlo experiments) are a broad class of computational algorithms that rely on repeated random sampling to obtain numerical results. They are often used in physical and ma... Monte Carlo method - Wikipedia
 Monte Carlo particle physics software
 PYTHIA PYTHIA is a computer simulation program for particle collisions at very high energies (see event (particle physics)) in particle accelerators.PYTHIA was originally written in FORTRAN 77, until th...
 Decorrelation Decorrelation is a general term for any process that is used to reduce autocorrelation within a signal, or cross-correlation within a set of signals, while preserving other aspects of the signal. A fr...
 Multicanonical ensemble In statistics and physics, multicanonical ensemble (also called multicanonical sampling or flat histogram) is a Markov chain Monte Carlo sampling technique that uses the Metropolis–Hastings algorithm...
 Fisher–Yates shuffle The Fisher–Yates shuffle (named after Ronald Fisher and Frank Yates), also known as the Knuth shuffle (after Donald Knuth), is an algorithm for generating a random permutation of a finite set—in plain... Fisher–Yates shuffle - Wikipedia
 Time-dependent density functional theory Time-dependent density functional theory (TDDFT) is a quantum mechanical theory used in physics and chemistry to investigate the properties and dynamics of many-body systems in the presence of time-de...
 Metropolis–Hastings algorithm In statistics and in statistical physics, the Metropolis–Hastings algorithm is a Markov chain Monte Carlo (MCMC) method for obtaining a sequence of random samples from a probability distribution for w... Metropolis–Hastings algorithm - Wikipedia
 Forward kinematics Forward kinematics refers to the use of the kinematic equations of a robot to compute the position of the end-effector from specified values for the joint parameters.The kinematics equations of the ro... Forward kinematics - Wikipedia
 Navigation mesh A navigation mesh, or navmesh, is a data structure which is used to model the traversable areas of a virtual map. It is primarily used by pathfinding algorithms in video games.A navigation mesh ...
 Atomistix ToolKit Atomistix ToolKit (ATK) is a commercial software for atomic-scale modeling and simulation of nanosystems. The software was originally developed by Atomistix A/S, and was later acquired by QuantumWise ...
 Centre européen de calcul atomique et moléculaire Location: Lausanne, SwitzerlandCECAM - Centre européen de calcul atomique et moléculaire is a European Association founded in 1969. The aims of the association are to promote cooperation amongst Europ...
 Car–Parrinello molecular dynamics Car–Parrinello molecular dynamics or CPMD usually refers to either the computational chemistry software package CPMD, a parallelized plane wave / pseudopotential implementation of density functional t...
 T-matrix method The T-matrix method is a computational technique of light scattering by nonspherical particles originally formulated by P. C. Waterman (1928-2012) in 1965. The technique is also known as null field me...
 Softening Softening is a numerical trick used in N-body techniques to prevent numerical divergences when a particle comes too close to another (and the force goes to infinity). This is obtained by modifying the...
 Simplified perturbations models Simplified perturbations models are a set of five mathematical models (SGP, SGP4, SDP4, SGP8 and SDP8) used to calculate orbital state vectors of satellites and space debris relative to the Earth-cent...
 Multiscale modeling In engineering, mathematics, physics, meteorology and computer science, multiscale modeling (Steinhauser 2008) is the field of solving physical problems which have important features at multiple scale...
 Discontinuous Deformation Analysis Discontinuous Deformation Analysis (DDA) is a type of discrete element method (DEM) originally proposed by Shi in 1988. DDA is somewhat similar to the finite element method for solving stress-displace... Discontinuous Deformation Analysis - Wikipedia
 Tau-leaping In probability theory, tau-leaping, or τ-leaping, is an approximate method for the simulation of a stochastic system. It is based on the Gillespie algorithm, performing all reactions for an interval o...
 Geant4 Geant4 (for GEometry ANd Tracking) is a platform for "the simulation of the passage of particles through matter," using Monte Carlo methods. It is the successor of the GEANT series of software toolk... Geant4 - Wikipedia
 Swendsen–Wang algorithm The Swendsen–Wang algorithm is an algorithm for Monte Carlo simulation of the Ising model in which the entire sample is divided into same-spin clusters. Each cluster is then assigned a new rando...
 Projection method (fluid dynamics) The projection method is an effective means of numerically solving time-dependent incompressible fluid-flow problems. It was originally introduced by Alexandre Chorin in 1967 as an efficient means of ...
 Ziff–Gulari–Barshad model The Ziff–Gulari–Barshad (ZGB) model is a simple Monte Carlo method for catalytic reactions of oxidation of carbon monoxide to carbon dioxide on a surface using Monte-Carlo methods which captures corre...
 FreeHEP FreeHEP is an open source Java library designed to make programming high energy physics applications easier. While the name and main focus of the project is high energy physics, many self-contained AP...
 Joint constraints Joint constraints are rotational constraints on the joints of an artificial bone system. They are used in an inverse kinematics chain, for such things as 3D animation or robotics. Joint constraints c...
 Dynamical simulation Dynamical simulation, in computational physics, is the simulation of systems of objects that are free to move, usually in three dimensions according to Newton's laws of dynamics, or approximations the... Dynamical simulation - Wikipedia
 Optical lens design Optical lens design is the process of designing a lens to meet a set of performance requirements and constraints, including cost and manufacturing limitations. Parameters include surface profile types...
 Collision detection Collision detection typically refers to the computational problem of detecting the intersection of two or more objects. While the topic is most often associated with its use in video games and other p... Collision detection - Wikipedia
 Demon algorithm The demon algorithm is a Monte Carlo method for efficiently sampling members of a microcanonical ensemble with a given energy. An additional degree of freedom, called 'the demon', is added to the syst...