mathworld.wolfram.com/vanderCorputSequence.html

Preview meta tags from the mathworld.wolfram.com website.

Linked Hostnames

5

Thumbnail

Search Engine Appearance

Google

https://mathworld.wolfram.com/vanderCorputSequence.html

van der Corput Sequence -- from Wolfram MathWorld

Van der Corput sequences are a means of generating sequences of points that are maximally self-avoiding (a.k.a. quasirandom sequences). In the one-dimensional case, the simplest approach to generate such a sequence is to simply divide the interval into a number of equal subintervals. Similarly, one can divide an n-dimensional volume by uniformly partitioning each of its dimensions. However, these approaches, have a number of drawbacks for numerical integration, especially for high...



Bing

van der Corput Sequence -- from Wolfram MathWorld

https://mathworld.wolfram.com/vanderCorputSequence.html

Van der Corput sequences are a means of generating sequences of points that are maximally self-avoiding (a.k.a. quasirandom sequences). In the one-dimensional case, the simplest approach to generate such a sequence is to simply divide the interval into a number of equal subintervals. Similarly, one can divide an n-dimensional volume by uniformly partitioning each of its dimensions. However, these approaches, have a number of drawbacks for numerical integration, especially for high...



DuckDuckGo

https://mathworld.wolfram.com/vanderCorputSequence.html

van der Corput Sequence -- from Wolfram MathWorld

Van der Corput sequences are a means of generating sequences of points that are maximally self-avoiding (a.k.a. quasirandom sequences). In the one-dimensional case, the simplest approach to generate such a sequence is to simply divide the interval into a number of equal subintervals. Similarly, one can divide an n-dimensional volume by uniformly partitioning each of its dimensions. However, these approaches, have a number of drawbacks for numerical integration, especially for high...

  • General Meta Tags

    20
    • title
      van der Corput Sequence -- from Wolfram MathWorld
    • DC.Title
      van der Corput Sequence
    • DC.Creator
      Weisstein, Eric W.
    • DC.Description
      Van der Corput sequences are a means of generating sequences of points that are maximally self-avoiding (a.k.a. quasirandom sequences). In the one-dimensional case, the simplest approach to generate such a sequence is to simply divide the interval into a number of equal subintervals. Similarly, one can divide an n-dimensional volume by uniformly partitioning each of its dimensions. However, these approaches, have a number of drawbacks for numerical integration, especially for high...
    • description
      Van der Corput sequences are a means of generating sequences of points that are maximally self-avoiding (a.k.a. quasirandom sequences). In the one-dimensional case, the simplest approach to generate such a sequence is to simply divide the interval into a number of equal subintervals. Similarly, one can divide an n-dimensional volume by uniformly partitioning each of its dimensions. However, these approaches, have a number of drawbacks for numerical integration, especially for high...
  • Open Graph Meta Tags

    5
    • og:image
      https://mathworld.wolfram.com/images/socialmedia/share/ogimage_vanderCorputSequence.png
    • og:url
      https://mathworld.wolfram.com/vanderCorputSequence.html
    • og:type
      website
    • og:title
      van der Corput Sequence -- from Wolfram MathWorld
    • og:description
      Van der Corput sequences are a means of generating sequences of points that are maximally self-avoiding (a.k.a. quasirandom sequences). In the one-dimensional case, the simplest approach to generate such a sequence is to simply divide the interval into a number of equal subintervals. Similarly, one can divide an n-dimensional volume by uniformly partitioning each of its dimensions. However, these approaches, have a number of drawbacks for numerical integration, especially for high...
  • Twitter Meta Tags

    5
    • twitter:card
      summary_large_image
    • twitter:site
      @WolframResearch
    • twitter:title
      van der Corput Sequence -- from Wolfram MathWorld
    • twitter:description
      Van der Corput sequences are a means of generating sequences of points that are maximally self-avoiding (a.k.a. quasirandom sequences). In the one-dimensional case, the simplest approach to generate such a sequence is to simply divide the interval into a number of equal subintervals. Similarly, one can divide an n-dimensional volume by uniformly partitioning each of its dimensions. However, these approaches, have a number of drawbacks for numerical integration, especially for high...
    • twitter:image:src
      https://mathworld.wolfram.com/images/socialmedia/share/ogimage_vanderCorputSequence.png
  • Link Tags

    4
    • canonical
      https://mathworld.wolfram.com/vanderCorputSequence.html
    • preload
      //www.wolframcdn.com/fonts/source-sans-pro/1.0/global.css
    • stylesheet
      /css/styles.css
    • stylesheet
      /common/js/c2c/1.0/WolframC2CGui.css.en

Links

33