Parallel computation of invariant measures
From MaRDI portal
The paper deals with the numerical computation of a fixed density of the Frobenius-Perron operator by a combination of Ulan's method with a modified Monte Carlo scheme (fixed test points). The MC scheme is easily parallelizable. Numerical tests on 64 processors of an Origin 2000 give 64\% efficiency.
Recommendations
- Analysis of an algorithm for computing invariant measures
- Invariant imbedding and the method of lines for parallel computers
- scientific article; zbMATH DE number 4129953
- Complexity measures on systems of parallel algorithms
- scientific article; zbMATH DE number 4037198
- Parallel methods for initial value problems
- Fine-grained parallelism in computational mathematics
- Parallel Computation of Combinatorial Symmetries.
- Parallelism in spectral methods
- Parallel integration (extended abstract)
Cited in
(6)- Sampling chaotic trajectories quickly in parallel
- Finite approximations of Markov operators
- A piecewise constant method for Frobenius-Perron operators via delta function approximations
- Piecewise convex deterministic dynamical systems and weakly convex random dynamical systems and their invariant measures
- Arnold maps with noise: differentiability and non-monotonicity of the rotation number
- Web graphics for the computation of invariant measures
This page was built for publication: Parallel computation of invariant measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5959301)
