-
1 derivative approximation method
авт. метод приближения производнымиEnglish-Russian dictionary of computer science and programming > derivative approximation method
-
2 method
1) метод; способ (см. тж. technique 1)2) ООП метод (функция - элемент определения класса (class) в языке Smalltalk, в C++ - см. member function)•- alphageometric method
- Amble's method
- ancestor method
- assembly method
- basic access method
- bibliography method
- bit-level method
- branch and bounds method
- buffering method
- building-block method
- chaining method
- checksum method
- coded pattern method
- conditional delay method
- constraint satisfaction method
- critical path method
- cut-and-try method
- cutset method
- dark-spot method
- data access method
- deductive method
- derivative approximation method
- diagonal method
- diagram method
- dichotomy method
- digital sorting method
- direct access method
- exhaustive method
- false position method
- finished method
- finitary method
- finite difference method
- flip-chip method
- flooding method
- flowgraph method
- frequency analysis method
- gradient method
- graphic access method
- heuristic method
- hierarchical access method
- hit-and-miss method
- Horner's method
- hunt-and-stick method
- index register method
- indexed-sequential access method
- inline-code method
- inverse power method
- inverse transformation method
- issue method
- iteration method
- least-squares method
- left-edge method
- lightweight formal method
- linkage method
- longest route method
- machine method
- maximum-likelihood method
- method of quickest descent
- method of selected point
- method of successive approximations
- Monte-Carlo method
- net method
- Newton's method
- nonrestoring method
- N-pass method
- numerical method
- operational method
- opposition method
- overlay method
- part-continuous method
- partitioned access method
- pencil-and-paper method
- perturbation method
- piezoelectric sensing method
- ping-pong method
- power method
- predictor-corrector method
- programming method
- progressive-part method
- proprietary method
- pure virtual method
- queued access method
- queued indexed sequential access method
- radial exploration method
- random-walk method
- recursive descendant method
- regular falsi method
- resetting method
- resident access method
- review article method
- row-by-row method
- rubber band method
- Runge-Kutta method
- saddle point method
- sampling method
- scale factor method
- scan-set method
- scheduling method
- scissors and paste method
- secant method
- sectioning method
- semigroup method
- sequential access method
- shortcut method
- shortcut multiplication method
- sieve method
- simplex method
- single-path instruction method
- sit-by-me instuction method
- state-space method
- steepest descent method
- step-by-step method
- stroke method
- subject profile method
- symbolic method
- symbolical method
- syntactic method
- synthetic method
- target method
- telecommunication access method
- temporal difference method
- time-domain method
- touch method with ten fingers
- trial-and-error method
- truth table method
- variable separation method
- variable-metric method
- variational method
- variation method
- V-brush method
- vernier pulse-timing method
- virtual method
- wire-wrap method
- zero-deflection methodEnglish-Russian dictionary of computer science and programming > method
См. также в других словарях:
Derivative — This article is an overview of the term as used in calculus. For a less technical overview of the subject, see Differential calculus. For other uses, see Derivative (disambiguation) … Wikipedia
Approximation theory — In mathematics, approximation theory is concerned with how functions can best be approximated with simpler functions, and with quantitatively characterizing the errors introduced thereby. Note that what is meant by best and simpler will depend on … Wikipedia
Method of steepest descent — For the optimization algorithm, see Gradient descent. In mathematics, the method of steepest descent or stationary phase method or saddle point method is an extension of Laplace s method for approximating an integral, where one deforms a contour… … Wikipedia
Stochastic approximation — methods are a family of iterative stochastic optimization algorithms that attempt to find zeroes or extrema of functions which cannot be computed directly, but only estimated via noisy observations. The first, and prototypical, algorithms of this … Wikipedia
Newton's method — In numerical analysis, Newton s method (also known as the Newton–Raphson method), named after Isaac Newton and Joseph Raphson, is a method for finding successively better approximations to the roots (or zeroes) of a real valued function. The… … Wikipedia
Finite 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 … Wikipedia
Finite element method — The finite element method (FEM) (sometimes referred to as finite element analysis) is a numerical technique for finding approximate solutions of partial differential equations (PDE) as well as of integral equations. The solution approach is based … Wikipedia
WKB approximation — In physics, the WKB (Wentzel–Kramers–Brillouin) approximation, also known as WKBJ (Wentzel–Kramers–Brillouin–Jeffreys) approximation, is the most familiar example of a semiclassical calculation in quantum mechanics in which the wavefunction is… … Wikipedia
Householder'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… … Wikipedia
Newton's method in optimization — A comparison of gradient descent (green) and Newton s method (red) for minimizing a function (with small step sizes). Newton s method uses curvature information to take a more direct route. In mathematics, Newton s method is an iterative method… … Wikipedia
Aberth 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… … Wikipedia
