Namespaces
Variants
Views
Actions

Search results

Jump to: navigation, search
  • Let $X$ be a finite or infinite set (of variables) and consider the ring of polynomials $R[X]$ and the ring ...ences|[a2]]], in connection with the combinatorics of plane partitions and descent sets of permutations [[#References|[a3]]]. This time one takes a totally or
    4 KB (708 words) - 13:51, 20 March 2023
  • ...with any given integer, so that the number of solutions of the problem is infinite. Considering the Galois groups of infinite extensions of a given field (cf. [[Galois topological group|Galois topologi
    4 KB (586 words) - 04:07, 25 February 2022
  • ...the one that makes an acute angle with the direction $g(x_p)$ of steepest descent of the objective function (with the vector $g(x_p)=-\left.\frac{d \phi(x)}{ ...thod of feasible directions. Thus, in a gradient-projection method, as the descent direction at the point $x_p$ one takes $s_p=y_p - x_p$, where $y_p$ is the
    12 KB (2,034 words) - 09:14, 9 June 2016
  • ...ction, including a functional, considered as a function on a corresponding infinite-dimensional functional space, one studies the variation of various topologi gradient descent is commonly employed, i.e. the motion of points in accordance with the [[Gr
    14 KB (2,052 words) - 08:27, 6 June 2020
  • coincides with the direction of steepest descent (in gradient) of the surface $ f ( x) = c $ iterations, and it can be regarded as an infinite iterative process for minimizing a functional. Modifications of the calcula
    9 KB (1,376 words) - 17:46, 4 June 2020
  • ...nt article. Non-linear operator equations connected with the discussion of infinite-dimensional spaces (see, for example [[#References|[4]]]–[[#References|[8 A large number of iteration methods (the so-called descent methods) (see [[#References|[1]]]–[[#References|[3]]], [[#References|[9]]
    20 KB (2,830 words) - 19:25, 9 January 2024
  • ...the method of steepest descent (cf. [[Steepest descent, method of|Steepest descent, method of]]), etc., as well as the method of variation of the parameter (d ..., let a non-linear operator ordinary differential equation be given on the infinite interval:
    23 KB (3,277 words) - 19:16, 16 January 2024
  • are elements of a complete infinite system of linearly independent functions which satisfy the boundary conditi ...w direct methods. The most popular methods are those involving the idea of descent in the space of controls and of successive analysis of variants (of the typ
    23 KB (3,462 words) - 08:27, 6 June 2020
  • ...agin's method is to construct a family of cohomology classes indexed by an infinite set of square-free integral ideals of the base field $K$. These elements sa ...ditions that the global cohomology classes $c_L$ satisfy. Then Kolyvagin's descent procedure gives good control over corresponding arithmetic objects such as
    19 KB (2,901 words) - 17:41, 25 November 2023
  • ...onding to a partition of its spectrum. The first results of this sort (for infinite-dimensional spaces) were obtained by F. Riesz (1909), who proposed the foll one can define the concept of a determinant (the infinite product of the eigenvalues). The function $ \mathop{\rm det} ( I - \mu T
    24 KB (3,593 words) - 18:51, 13 January 2024
  • ...te or finite (by Jensen's theorem the number of irregular prime numbers is infinite [[#References|[4]]]). Kummer [[#References|[5]]] proved the theorem for som
    16 KB (2,596 words) - 09:27, 13 February 2024
  • ...the interest of scholars. The first proof that the set of prime numbers is infinite is due to Euclid. Only in the middle of the 19th century did P.L. Chebyshev ...ons of it. Fermat (17th century) discovered another method, the "method of descent", and solved by it a number of equations, but the so-called [[Fermat great
    13 KB (2,043 words) - 20:28, 13 October 2014
  • ...form|Exterior form]]; [[Exterior algebra|Exterior algebra]]) acting on the infinite-dimensional space $ {\mathcal G} $. In this context one now searches for an obstacle to the descent of the determinant $ { \mathop{\rm det} } ( {/\partial } _ \rho ^ {*}
    27 KB (3,739 words) - 06:51, 26 March 2023
  • ...ame algorithms: coordinate relaxation, sequential overrelaxation, steepest descent, and conjugate gradients (cf. [[#References|[7]]]). ...vectors by no means form an orthogonal basis, rather they are steps in an (infinite) iteration process. Sometimes convergence to an eigen value temporarily hal
    19 KB (2,830 words) - 19:42, 27 February 2021
  • ...one|brachistochrone]] problem, or the problem of curves of minimum time of descent. This problem is usually considered to be the starting point in the history ...; if the lengths of only two of these geodesics are equal, there exists an infinite number of closed geodesics of equal length. Such problems indicate a close
    28 KB (4,182 words) - 07:56, 16 April 2023
  • of rational numbers; then there exists an infinite set of values $ t _{1} ^{0} \dots t _{k} ^{0} \in \mathbf Q $ Another generalization of Hilbert's theorem is Grothendieck's descent theorem; one of its applications in [[Etale topology|étale topology]], whi
    18 KB (2,720 words) - 19:17, 19 December 2019
  • realizes the descent of the optimal trajectory $ x ^ {0} ( t) $ ...ty and observability of linear systems have many generalizations to linear infinite-dimensional systems (equations in a Banach space, systems with deviating ar
    32 KB (4,621 words) - 08:04, 6 June 2020
  • descent. They were a family of dissenters truths to the relation of the finite to the infinite'.
    23 KB (3,421 words) - 16:34, 24 March 2023