method of approximation
21Discrete dipole approximation — In discrete dipole approximation larger object is approximated in terms of discrete dipoles The discrete dipole approximation (DDA) is a method for computing scattering of radiation by particles of arbitrary shape and by periodic structures.… …
22Monte Carlo method — Not to be confused with Monte Carlo algorithm. Computational physics …
23Rectangle method — In mathematics, specifically in integral calculus, the rectangle method (also called the midpoint or mid ordinate rule) computes an approximation to a definite integral, made by finding the area of a collection of rectangles whose heights are… …
24Finite difference method — In mathematics, finite difference methods are numerical methods for approximating the solutions to differential equations using finite difference equations to approximate derivatives. Intuitive derivation Finite difference methods approximate the …
25Born approximation — Not to be confused with the Born–Oppenheimer approximation. In scattering theory and, in particular in quantum mechanics, the Born approximation consists of taking the incident field in place of the total field as the driving field at each point… …
26Householder's method — In numerical analysis, the class of Householder s methods are root finding algorithms used for functions of one real variable with continuous derivatives up to some order d+1 , where d will be the order of the Householder s method.The algorithm… …
27Galerkin method — In mathematics, in the area of numerical analysis, Galerkin methods are a class of methods for converting a continuous operator problem (such as a differential equation) to a discrete problem. In principle, it is the equivalent of applying the… …
28Aberth method — The Aberth method, sometimes named Aberth Ehrlich method is a root finding algorithm for simultaneous approximation of all the roots of a univariate polynomial. The fundamental theorem of algebra states that for each polynomial with complex… …
29Beam propagation method — (BPM) refers to a computational technique in Electromagnetics, usedto solve the Helmholtz equation under conditions of a time harmonic wave. BPM works under slowly varying envelope approximation, for linear and nonlinear equations.The beam… …
30Coherent potential approximation — The coherent potential approximation (or CPA) is a method, in physics, of finding the Green s function of an effective medium. It is a useful concept in understanding how waves scatter in a material which displays spatial inhomogeneity. One… …
