Highly efficient numerical algorithm based on random trees for accelerating parallel Vlasov-Poisson simulations (Q340902): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65M55 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65C05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65Y05 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6653010 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Monte Carlo and quasi Monte-Carlo methods | |||
Property / zbMATH Keywords: Monte Carlo and quasi Monte-Carlo methods / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
domain decomposition | |||
Property / zbMATH Keywords: domain decomposition / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Vlasov-Poisson system | |||
Property / zbMATH Keywords: Vlasov-Poisson system / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
parallel computing | |||
Property / zbMATH Keywords: parallel computing / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
scalable algorithms | |||
Property / zbMATH Keywords: scalable algorithms / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
random trees | |||
Property / zbMATH Keywords: random trees / rank | |||
Normal rank |
Revision as of 06:09, 28 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Highly efficient numerical algorithm based on random trees for accelerating parallel Vlasov-Poisson simulations |
scientific article |
Statements
Highly efficient numerical algorithm based on random trees for accelerating parallel Vlasov-Poisson simulations (English)
0 references
15 November 2016
0 references
Monte Carlo and quasi Monte-Carlo methods
0 references
domain decomposition
0 references
Vlasov-Poisson system
0 references
parallel computing
0 references
scalable algorithms
0 references
random trees
0 references