Namespaces
Variants
Views
Actions

Search results

Jump to: navigation, search
  • ...nd indicating an explicit minimal set of generators (a minimal base in the terminology of Severi), cf. e.g. [[#References|[a4]]], Sect. V.7 (for the case of surfa ..."top">[a3]</TD> <TD valign="top"> T. Shioda, "An explicit algorithm for computing the Picard number of certain algebraic surfaces" ''Amer. J. Math.'' , '''1
    4 KB (687 words) - 05:47, 15 April 2023
  • ...the choice of the initial approximation, in standard computer programs for computing zeros of continuous functions this method is combined with some method for Another terminology for the method (2) is the method of false position, or regula falsi. This m
    5 KB (766 words) - 08:12, 6 June 2020
  • Sometimes a more general terminology is used, connected with the theory of theta-functions (cf. [[Theta-function ...be of the first kind, or an elliptic function in the proper sense. In this terminology the Jacobi theta-functions (see [[Jacobi elliptic functions|Jacobi elliptic
    9 KB (1,292 words) - 19:08, 20 January 2022
  • .../d/d032/d032080/d03208012.png" />. This fact, as well as the necessity for computing a large number of partial derivatives, strongly restricts the scope of appl ...valign="top">[2]</TD> <TD valign="top"> I.S. Berezin, N.P. Zhidkov, "Computing methods" , Pergamon (1973) (Translated from Russian)</TD></TR><TR><TD val
    32 KB (4,604 words) - 16:55, 7 February 2011
  • An iterative optimization procedure [[#References|[a4]]] for computing ...such (e.g., with latent-variable modeling) and is a very popular method of computing maximum likelihood, restricted maximum likelihood, penalized maximum likeli
    26 KB (3,858 words) - 05:39, 23 August 2025
  • The final optimal controls are found by successively computing the values In the terminology of [[Automatic control theory|automatic control theory]] one could say that
    10 KB (1,500 words) - 16:50, 20 January 2024
  • ...valign="top">[3]</TD> <TD valign="top"> I.S. Berezin, N.P. Zhidkov, "Computing methods" , Pergamon (1973) (Translated from Russian)</TD></TR><TR><TD val ...equations (including Fredholm and Voltera equations as well), one uses the terminology [[Degenerate kernel|degenerate kernel]] (of rank $ n $)
    12 KB (1,747 words) - 13:26, 14 January 2022
  • ...cient Greek philosopher Plato appears to have been the first to apply this terminology to control in the general sense. A.M. Ampère (1834) suggested the name "C ...branches of mathematics (for example, queueing theory), as well as modern computing methods. In the first place, this has to do with various kinds of methods o
    35 KB (5,424 words) - 11:17, 26 March 2023
  • ...is known about the development that led to this situation. In statistical terminology, the data is not an unordered set of two closed doors, but an ordered set, ...Doviak (1991a), in another paper in ''The American Statistician'', for not computing the conditional probability that switching will give the car, given the cho
    22 KB (3,718 words) - 20:19, 12 March 2016
  • ...ed in gas dynamics a fairly-long time ago and was successfully employed in computing one-dimensional non-stationary flows with a small number of singularities, of the body; and the problem of computing the viscous flow near the body, where the gradients of the magnitudes are l
    28 KB (3,843 words) - 19:41, 5 June 2020
  • statistics facilitating an analysis of fit. In the early days of statistical computing - from 1972 to 1990 - the GLM estimation algorithm also provided a substantial savings of computing
    30 KB (4,314 words) - 13:25, 30 May 2016
  • ...[#References|[6]]]). Operating systems have become an integral part of any computing system. Without operating systems computers could not function, since the c The ideas and terminology in the domain of software and system programming are not yet clearly establ
    19 KB (2,814 words) - 17:16, 7 February 2011
  • These problems led to the problem of computing the Galois cohomology principle]] applies to $G$. This terminology
    17 KB (2,785 words) - 22:37, 23 December 2014
  • ..., being practically oriented, scheduling theory does not seek to unify its terminology; along with the term "job" , terms like "task" , "operation" , etc., are ...ity of theorem-proving procedures" ''Proc. 3rd Annual ACM Symp. Theory of Computing'' , '''3''' (1971) pp. 151–158</TD></TR><TR><TD valign="top">[a5]</TD>
    21 KB (3,117 words) - 10:04, 18 February 2021
  • Since prime ideal numbers are defined relative to a field or, in modern terminology, since they are prime ideals in a field, the third problem on the factoriza ...$ f _{i} $ be the relative degree of the ideal $ \mathfrak P _{i} $ . Computing the relative norms $ N _ {K / k} $ of both parts of (1) leads to $$ \tag
    28 KB (4,440 words) - 22:00, 11 December 2019
  • ...of partial sums, we might restate his insightful conclusion in more modern terminology as follows:<ref>Boyer p. 556</ref> ...unsound, and were replaced with the common $\varepsilon, \delta$ method of computing limits and derivatives.
    91 KB (14,186 words) - 16:58, 23 November 2023