Namespaces
Variants
Views
Actions

Search results

Jump to: navigation, search
  • ...f a priori bounds on the computational complexity). This requires that the control, information and frequency relations arising in these processes between sta ...other zones, or a hammock (a subgraph connected with the other part of the control flow graph at precisely two vertices — the input and output; the input ve
    5 KB (775 words) - 17:05, 7 February 2011
  • ...lifting theorem can also be used to solve problems in [[H^infinity-control-theory| $ H ^ \infty $ control theory]] and inverse scattering [[#References|[a1]]], [[#References|[a2]]].
    6 KB (815 words) - 09:51, 26 March 2023
  • ...rgy minimization problems is presented. For the optimal control problem of systems governed by variational inequalities see [[#References|[a13]]]. ...TR><TR><TD valign="top">[a13]</TD> <TD valign="top"> V. Barbu, "Optimal control of variational inequalities" , ''Res. Notes Math.'' , '''100''' , Pitman (
    5 KB (737 words) - 20:35, 18 March 2024
  • ...ary to consider statistical states of systems; for classical (non-quantum) systems they are described by probability distributions on the phase space. The rul ...ferentiable [[Dynamical system|dynamical system]] (which includes the main systems considered in analytical mechanics and classical statistical physics), the
    6 KB (906 words) - 21:49, 30 April 2014
  • ...f natural parallelism occurring in computer-modelling and computer-control systems and processes; and b) a parallelization of information processing in multi- ...and subprograms; and independent problems and programs in multi-processor systems.
    11 KB (1,714 words) - 03:17, 5 June 2016
  • $#C+1 = 128 : ~/encyclopedia/old_files/data/O068/O.0608500 Optimal synthesis control ...n of a positional strategy makes possible an a posteriori realization of a control $ u $,
    32 KB (4,621 words) - 08:04, 6 June 2020
  • ...op"> G.E.P. Box, G.M. Jenkins, "Time series analysis. Forecasting and control" , '''1–2''' , Holden-Day (1976)</TD></TR><TR><TD valign="top">[2]</TD> ...TD valign="top">[a5]</TD> <TD valign="top"> L. Ljung, T. Söderström, "Theory and practice of recursive identification" , M.I.T. (1983)</TD></TR></table
    5 KB (645 words) - 08:01, 6 June 2020
  • ...ies of the system itself (see also [[Oscillations, theory of|Oscillations, theory of]]). The term "auto-oscillation" was introduced by A.A. Andronov (see [[# ...mous auto-oscillating systems with one degree of freedom may be defined as systems whose equations of motion have one or more limit cycles in the phase plane
    9 KB (1,404 words) - 16:55, 15 April 2012
  • ...ments, a rule for combining them and a means of using the structure of the control system to define the function which it realizes are given. ...s of functions. A synthesis problem originally consisted of constructing a control system realizing a given function from this class.
    27 KB (4,142 words) - 14:55, 7 June 2020
  • ...orks), which is oriented to the qualitative analysis and synthesis of such systems (discovering deadlocks or conflict situations and bottlenecks, computer-aid ...ine is the use of Petri nets as the basis of models for discrete dynamical systems in information technology, economics, digital engineering, etc.
    6 KB (897 words) - 19:23, 16 August 2016
  • ...of dynamical processes with memory requires the further development of the theory of functional equations with abstract Volterra operators. Numerous applicat ...equations involving classical integral operators of Volterra type when the theory is framed in abstract spaces, see [[#References|[a2]]], [[#References|[a7]]
    5 KB (745 words) - 15:29, 13 July 2014
  • ...yclopedia/old_files/data/P071/P.0701560 Parametric resonance, mathematical theory of The branch of the theory of ordinary differential equations that studies the phenomenon of parametri
    10 KB (1,385 words) - 09:16, 13 May 2022
  • ...at follows it will be assumed that such an extension has been made for all control sequences. For systems in which $ \{ \tau _ {j} ^ {s} - \tau _ {j} ^ {e} \} \in G _ {I} $
    24 KB (3,620 words) - 16:42, 30 December 2020
  • ...duction, $L$-systems constituted a significant part of [[formal language]] theory, allowing one to compare parallel rewriting to a more classical sequential ...d with these notions, in particular with D$0$L-sequences, which made D$0$L-systems mathematically very fruitful. The most famous problem is the D$0$L-sequence
    10 KB (1,542 words) - 11:21, 26 March 2023
  • ...rmational processes in [[#References|[a11]]], and in networks of cognitive systems in [[#References|[a15]]] and [[#References|[a16]]]. ...o be used in more complex social processes, involving many self-organizing systems.
    9 KB (1,251 words) - 18:24, 14 January 2021
  • ...of motion (understood in the same wide form). Thus, stability theory is a theory in the widest sense of this word. Among the different concepts of the stabi ...]]) and having a large intersection with the theory of linear systems, the theory of Lyapunov characteristic exponents (cf. [[Lyapunov characteristic exponen
    9 KB (1,252 words) - 10:41, 15 April 2014
  • ...cience concerned with the construction of mathematical models of dynamical systems from measured input/output data. The constructed models are mostly of finit ...tworks form an example of common non-linear black-box models for dynamical systems.
    7 KB (1,131 words) - 14:45, 16 December 2023
  • ...ried applications as system identification, adaptive control, transmission systems, adaptive filtering for signal processing, and several aspects of pattern r The study of adaptive algorithms is generally made through the theory of [[Stochastic approximation|stochastic approximation]].
    8 KB (1,242 words) - 15:31, 1 July 2020
  • ...nsformational grammars; some of them are intended for processing component systems, others for processing hierarchy trees. As an example, one can quote the so grammars, which are finite systems of elementary transformations of the form $ t _ {1} \Rightarrow t _ {2} \
    4 KB (600 words) - 19:42, 5 June 2020
  • ...g range of computer applications. The term is often understood to mean the theory of numerical methods and algorithms for the solution of typical mathematica ...als with the simplification of the man-computer interaction, including the theory and practice of [[Programming|programming]] computer problems and of [[Auto
    13 KB (1,892 words) - 20:11, 31 December 2018

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