enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. DF-space - Wikipedia

    en.wikipedia.org/wiki/DF-space

    Let be a DF-space and let be a convex balanced subset of . Then is a neighborhood of the origin if and only if for every convex, balanced, bounded subset , is a neighborhood of the origin in . [1] Consequently, a linear map from a DF-space into a locally convex space is continuous if its restriction to each bounded subset of the domain is continuous.

  3. Double Fourier sphere method - Wikipedia

    en.wikipedia.org/wiki/Double_Fourier_sphere_method

    The DFS method has been the subject of relatively few investigations since (a notable exception is Fornberg's work), [3] perhaps due to the dominance of spherical harmonics expansions. Over the last fifteen years it has begun to be used for the computation of gravitational fields near black holes [ 4 ] and to novel space-time spectral analysis .

  4. Strongly connected component - Wikipedia

    en.wikipedia.org/wiki/Strongly_connected_component

    Several algorithms based on depth-first search compute strongly connected components in linear time.. Kosaraju's algorithm uses two passes of depth-first search. The first, in the original graph, is used to choose the order in which the outer loop of the second depth-first search tests vertices for having been visited already and recursively explores them if not.

  5. List of mathematical functions - Wikipedia

    en.wikipedia.org/wiki/List_of_mathematical_functions

    Algebraic functions are functions that can be expressed as the solution of a polynomial equation with integer coefficients.. Polynomials: Can be generated solely by addition, multiplication, and raising to the power of a positive integer.

  6. Discrete Fourier transform - Wikipedia

    en.wikipedia.org/wiki/Discrete_Fourier_transform

    In mathematics, the discrete Fourier transform (DFT) converts a finite sequence of equally-spaced samples of a function into a same-length sequence of equally-spaced samples of the discrete-time Fourier transform (DTFT), which is a complex-valued function of frequency. The interval at which the DTFT is sampled is the reciprocal of the duration ...

  7. Macaulay2 - Wikipedia

    en.wikipedia.org/wiki/Macaulay2

    Macaulay2 is built around fast implementations of algorithms useful for computation in commutative algebra and algebraic geometry. This core functionality includes arithmetic on rings, modules, and matrices, as well as algorithms for Gröbner bases, free resolutions, Hilbert series, determinants and Pfaffians, factoring, and similar.

  8. Discrete Fourier series - Wikipedia

    en.wikipedia.org/wiki/Discrete_Fourier_series

    The result of the series is also a function of the discrete variable, i.e. a discrete sequence. A Fourier series, by nature, has a discrete set of components with a discrete set of coefficients, also a discrete sequence. So a DFS is a representation of one sequence in terms of another sequence.

  9. Algebraic geometry and analytic geometry - Wikipedia

    en.wikipedia.org/wiki/Algebraic_geometry_and...

    In mathematics, algebraic geometry and analytic geometry are two closely related subjects. While algebraic geometry studies algebraic varieties, analytic geometry deals with complex manifolds and the more general analytic spaces defined locally by the vanishing of analytic functions of several complex variables.