About the Project

difference operators

AdvancedHelp

(0.002 seconds)

21—30 of 40 matching pages

21: 1.18 Linear Second Order Differential Operators and Eigenfunction Expansions
For T to be actually self adjoint it is necessary to also show that 𝒟 ( T ) = 𝒟 ( T ) , as it is often the case that T and T have different domains, see Friedman (1990, p 148) for a simple example of such differences involving the differential operator d d x . …
22: Bibliography G
  • J. S. Geronimo, O. Bruno, and W. Van Assche (2004) WKB and turning point theory for second-order difference equations. In Spectral Methods for Operators of Mathematical Physics, Oper. Theory Adv. Appl., Vol. 154, pp. 101–138.
  • 23: Bibliography K
  • C. Kormanyos (2011) Algorithm 910: a portable C++ multiple-precision system for special-function calculations. ACM Trans. Math. Software 37 (4), pp. Art. 45, 27.
  • 24: Bibliography R
  • M. Reed and B. Simon (1978) Methods of Modern Mathematical Physics, Vol. 4, Analysis of Operators. Academic Press, New York.
  • RISC Combinatorics Group (website) Research Institute for Symbolic Computation, Hagenberg im Mühlkreis, Austria.
  • S. Ritter (1998) On the computation of Lamé functions, of eigenvalues and eigenfunctions of some potential operators. Z. Angew. Math. Mech. 78 (1), pp. 66–72.
  • G. Rota, D. Kahaner, and A. Odlyzko (1973) On the foundations of combinatorial theory. VIII. Finite operator calculus. J. Math. Anal. Appl. 42, pp. 684–760.
  • J. Rushchitsky and S. Rushchitska (2000) On Simple Waves with Profiles in the form of some Special Functions—Chebyshev-Hermite, Mathieu, Whittaker—in Two-phase Media. In Differential Operators and Related Topics, Vol. I (Odessa, 1997), Operator Theory: Advances and Applications, Vol. 117, pp. 313–322.
  • 25: 23.1 Special Notation
    𝕃 lattice in .
    S 1 / S 2 set of all elements of S 1 , modulo elements of S 2 . Thus two elements of S 1 / S 2 are equivalent if they are both in S 1 and their difference is in S 2 . (For an example see §20.12(ii).)
    G × H Cartesian product of groups G and H , that is, the set of all pairs of elements ( g , h ) with group operation ( g 1 , h 1 ) + ( g 2 , h 2 ) = ( g 1 + g 2 , h 1 + h 2 ) .
    26: 21.7 Riemann Surfaces
    Define the operation
    21.7.12 T 1 T 2 = ( T 1 T 2 ) ( T 1 T 2 ) .
    21.7.14 𝜼 ( T 1 T 2 ) = 𝜼 ( T 1 ) + 𝜼 ( T 2 ) ,
    21.7.15 4 𝜼 1 ( T ) 𝜼 2 ( T ) = 1 2 ( | T U | g 1 ) ( mod 2 ) ,
    27: 2.1 Definitions and Elementary Properties
    means that for each n , the difference between f ( x ) and the n th partial sum on the right-hand side is O ( ( x c ) n ) as x c in 𝐗 . …
    28: 1.15 Summability Methods
    1.15.47 𝐼 α f ( x ) = 1 Γ ( α ) 0 x ( x t ) α 1 f ( t ) d t .
    1.15.48 𝐼 α 𝐼 β = 𝐼 α + β , α > 0 , β > 0 .
    1.15.50 𝐼 α f ( x ) = k = 0 k ! Γ ( k + α + 1 ) a k x k + α .
    1.15.51 𝐷 α f ( x ) = d n d x n 𝐼 n α f ( x ) ,
    1.15.52 𝐷 k 𝐼 α = 𝐷 n 𝐼 α + n k , k = 1 , 2 , , n .
    29: 1.16 Distributions
    1.16.30 𝐃 = ( 1 i x 1 , 1 i x 2 , , 1 i x n ) .
    30: Guide to Searching the DLMF
    Search queries are made up of terms, textual phrases, and math expressions, combined with Boolean operators: …
  • Boolean operator:

    and and or

  • proximity operator:

    adj, prec/n, and near/n, where n is any positive natural number.

  • To recognize the math symbols and structures, and to accommodate equivalence between various notations and various forms of expression, the search system maps the math part of your queries into a different form. … DLMF search recognizes just the essential font differences, that is, the font style differences deemed important for the DLMF contents: …