Namespaces
Variants
Views
Actions

Search results

Jump to: navigation, search
  • ...the system of grid equations that arises, the program realization of these methods, etc.
    634 bytes (96 words) - 17:07, 7 February 2011
  • $#C+1 = 19 : ~/encyclopedia/old_files/data/P071/P.0701680 Partial problem of eigen values The problem of calculating one or a few eigen values of a square matrix, usually real o
    5 KB (763 words) - 08:05, 6 June 2020
  • A method for solving initial and boundary value problems for ordinary differential equations. It Suppose that the [[Cauchy problem|Cauchy problem]]
    4 KB (528 words) - 08:13, 6 June 2020
  • ...e question of architecture, of developing methods of data-base and problem-solving control, it brings the problems of creating libraries of standard procedure
    3 KB (372 words) - 17:12, 7 February 2011
  • ...is one of the methods of approximating the original problem by a discrete problem. For this the given region $ G $ ...y distort the representation of the behaviour of the original differential problem.
    5 KB (788 words) - 11:03, 27 April 2024
  • of a stationary problem ...equation involving the same operator $ A $ (cf. [[Cauchy problem|Cauchy problem]]). This evolution equation may e.g. be of the form
    4 KB (649 words) - 05:25, 19 March 2022
  • ...m|program]] for partially solving a problem that is part of another larger problem; it is a fundamental construction in algorithmic languages (cf. [[Algorithm ...preserved so that it can be used as an elementary action in the future for solving wider problems.
    3 KB (398 words) - 16:54, 7 February 2011
  • ...ped for the solution of the problems of quadratic programming; among them, methods of the [[Simplex method|simplex method]] type, which lead to a solution in ...of the direction of descent at each iteration reduces to the solution of a problem in quadratic programming. Problems of unconditional minimization of quadrat
    3 KB (372 words) - 08:07, 22 November 2014
  • $#C+1 = 7 : ~/encyclopedia/old_files/data/D032/D.0302370 Diffusion methods Methods for solving the kinetic equations of neutron (or other particle) transport, modifying t
    4 KB (524 words) - 19:35, 5 June 2020
  • ...encyclopediaofmath.org/legacyimages/c/c025/c025520/c0255202.png" /> with a problem that is known to be solvable <img align="absmiddle" border="0" src="https:/ ..., that one has to prove the solvability in a Hölder class of the Dirichlet problem
    9 KB (1,325 words) - 17:26, 7 February 2011
  • ...lving boundary value problems. Suppose one has to solve the boundary value problem The solution of the problem (*) minimizes the functional
    3 KB (407 words) - 08:26, 6 June 2020
  • ...include a method for the directed synthesis of an algorithm from a compact problem description, restricted to some fixed class of problems. At present (the 19
    2 KB (219 words) - 16:58, 7 February 2011
  • ...oordinates of the neutron velocity vector. In a single-velocity stationary problem it leads to a [[Diffusion equation|diffusion equation]]. ...ved forms of the diffusion approximation see [[Diffusion methods|Diffusion methods]].
    2 KB (336 words) - 17:10, 7 February 2011
  • A method for solving a minimization problem for a differentiable function on a Euclidean space $ E ^ {n} $. ...n methods for functions depending strongly on a few variables|Minimization methods for functions depending strongly on a few variables]]; [[Conjugate gradient
    4 KB (519 words) - 22:10, 5 June 2020
  • ...s in greater detail, it is possible to obtain an $n$-level standardization problem. Unification problems are $n$-level standardization problems, where $n>1$. The simplest quantitative method for solving problems of standardization by the establishment of reasonable parameters a
    5 KB (732 words) - 06:42, 15 August 2014
  • .../old_files/data/D032/D.0302030 Differential equation, partial, variational methods Methods for solving boundary value problems for partial differential equations by reducing them
    7 KB (969 words) - 17:33, 5 June 2020
  • ...to the problem of the optimal choice of these parameters. The optimization problem can take various forms, and may reduce, for example, to a transition from a ...arly for the solution of systems of grid equations, modifications of these methods are often used, these can be defined by the fact that they are used not for
    6 KB (948 words) - 15:32, 14 February 2020
  • ...pendently or defined in accordance with the characteristic features of the problem. The above limitation on $\Delta t$ is, essentially, the condition of stabi ...decomposition-discontinuity method has become widely used for numerically solving problems in mathematical physics.
    3 KB (431 words) - 10:52, 16 April 2014
  • must be sufficiently large for the problem not to be solvable by direct inspections of the values of $ f ( a _ {i} ) ...e [[travelling salesman problem]] (which is a typical discrete programming problem), the number of possibilities to traverse $ m $
    10 KB (1,391 words) - 12:30, 17 February 2021
  • ...solution of classical additive problems resulted in the development of new methods in number theory. The classical additive problems include: ..., larger than 5, as the sum of three prime numbers, and the Euler–Goldbach problem on the representation of an even integer, larger than 2, as the sum of two
    4 KB (528 words) - 17:45, 4 December 2014

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)