An algorithm for uniform random sampling of points in and on a hypersphere (Q1075007): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(85)90102-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2016143993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4197958 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a method for generating points uniformly on <i>n</i> -dimensional spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4745749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for generating uniformly distributed points on \(N\)-dimensional spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosing a Point from the Surface of a Sphere / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements on fast methods for generating normal random variables / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:51, 17 June 2024

scientific article
Language Label Description Also known as
English
An algorithm for uniform random sampling of points in and on a hypersphere
scientific article

    Statements

    An algorithm for uniform random sampling of points in and on a hypersphere (English)
    0 references
    0 references
    0 references
    0 references
    1985
    0 references
    A new algorithm is given for random sampling in the interior or on the surface of an n-dimensional hypersphere. The involved parametrization is some kind of polar coordinates. The authors compare also the computation time of this algorithm with earlier published ones on some high speed computers. They conclude that no algorithm is best for all computers.
    0 references
    0 references
    analysis of algorithms
    0 references
    simulation
    0 references
    random sampling
    0 references
    hypersphere
    0 references
    0 references