Search results

Jump to: navigation, search
  • Computation of quasi-discrete Hankel transforms of integer order for propagating optical wave fields.
    7 KB (1,063 words) - 18:25, 30 July 2019
  • </ref>. Often, it is assumed that \(\nu\) is complex, of real or integer.
    3 KB (388 words) - 18:26, 30 July 2019
  • Also, [[billion]] can be interpreted as an [[integer number]]; its value may vary from \(10^{9}\) to \(10^{12}\).
    2 KB (334 words) - 18:25, 30 July 2019
  • For the precise evaluation at integer \(v\), three steps of the Newton iteration to adjust the value seem to be s
    13 KB (1,592 words) - 18:25, 30 July 2019
  • The second argument is unsigned integer, that indicates value \(N=2^q\); where \(q\) is assumed to be real number.
    6 KB (825 words) - 18:25, 30 July 2019
  • ...quence seems to be the most "natural" and most "physical" extension of the integer sequence considered in the literature; this extension appears at the constr
    7 KB (886 words) - 18:26, 30 July 2019
  • These [[superfunction]] and [[abelfunction]] are used to plot the non-integer [[iterate]]s of the LogisticOperator; these iterates are shown with colored For integer \(c\), the \(c\)th iteration of function \(T=\mathrm{LogisticOperator}_s\)
    6 KB (817 words) - 19:54, 5 August 2020
  • ...y with other [[superfunction]]s, where value at zero is choosen as minimal integer that is still larger than the [[fixed point]] used for the construction wit ...er values of \(k\). However, the same relation can be postulated for non–integer values of \(k\), extending definition of \(\mathrm{LambertW}_k\).
    4 KB (610 words) - 10:22, 20 July 2020
  • ...unction]] has series of branchpoints at \(r+\pi(1\!+\!2 n) \mathrm i\) for integer values of \(n\); and the series of cutlines \(r+\pi(1\!+\!2 n)\mathrm i + t\) for integer values of \(n\) and positive values of \(t\).
    10 KB (1,507 words) - 18:25, 30 July 2019
  • : \( x+ (1\!+\!2n) \mathrm i \pi ~\) at real \(x\) and integer \(n\).
    3 KB (421 words) - 10:23, 20 July 2020
  • The number \(n\) of iteration hax no need to be integer. For several real values of \(n\), the \(n\)th iteration of [[zex]] by (8)
    3 KB (499 words) - 18:25, 30 July 2019
  • ...P_{96}(z\!-\!n)~\)is used as approximation of \(\mathrm{SuZex}(z)\), with integer \(~n \!\approx\! \Re(z)\). ...hi(z\!-\!n)\Big)~\)is used as approximation of \(\mathrm{SuZex}(z)\), with integer \(~n \!\approx\! \Re(z)\).
    14 KB (2,037 words) - 18:25, 30 July 2019
  • ...n some realizations, there may be some problems while one of arguments are integer and another one is complex. In some programming languages, including [[Math In some cases of integer \(a\) the function has specific names.
    15 KB (2,495 words) - 18:43, 30 July 2019
  • ...the building-up its [[superfunction]], the [[Abel function]] and the non–integer [[iterate]]s of function Tra. SuZex has a countable set of saddle points, \(\mathrm 2 i \pi (n+1/2)\) for integer values of \(n\).
    9 KB (1,320 words) - 11:38, 20 July 2020
  • ...~\), \(~g~\) and \(~s~\), equation (9) provides a tool to evaluate the non-integer iterates of function \(T\). ...~\), \(~g~\) and \(~s~\), equation (9) provides a tool to evaluate the non-integer iterates of function \(T\).
    8 KB (1,239 words) - 11:32, 20 July 2020
  • [[Fractional iterate]] is concept used to construct non-integer iterates of functions. ...is called as \(~r\)th [[fractional iterate]], iff \(~r\!=\!m/n~\) for some integer numbers \(~m, n~\) and
    2 KB (272 words) - 18:25, 30 July 2019
  • Regular iteration is procedure that leads to non-integer iterates of a transfer function, that are regular in some vicinity of its f ...Schroeder function]] \(~g\!=\!f^{-1}~\) can be used to construct the non–integer [[iterate]] \(~T^n~\), that is regular in vicinity of zero, id est, the [[r
    10 KB (1,627 words) - 18:26, 30 July 2019
  • Then, for any complex \(z\) and some positive integer \(m\) function SuTra can be defined with ...ction]]; the number \(n\) of iteration in expression (7) has no need to be integer. As usually, the [[superfunction]] can be iterated any real (can even compl
    9 KB (1,285 words) - 18:25, 30 July 2019
  • For some fixed integer \(M\), define the primary approximation as truncation of the series above:
    6 KB (1,009 words) - 18:48, 30 July 2019
  • ...write the arighmetic expression "as is", in the in the form, accepted for integer, folod, double, etc, the internal GSL format impllies writing of the call o
    6 KB (975 words) - 18:47, 30 July 2019

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