Cover Image

Scalable Domain-decomposed Monte Carlo Neutral Transport for Nuclear Fusion

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lappi, Oskar, Leggate, Huw, Marandet, Yannick, Åström, Jan, Heljanko, Keijo, Borodin, Dmitriy V.
Format:	Preprint
Published:	2025
Subjects:	Computational Physics Distributed, Parallel, and Cluster Computing Performance 68W10 (Primary), 68W15, 65C05 (Secondary) D.1.3; G.3; I.6.8; J.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Runtime Analyses of NSGA-III on Many-Objective Problems
by: Opris, Andre, et al.
Published: (2024)

Achieving Tight $O(4^k)$ Runtime Bounds on Jump$_k$ by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
by: Opris, Andre, et al.
Published: (2024)

A First Runtime Analysis of the PAES-25: An Enhanced Variant of the Pareto Archived Evolution Strategy
by: Opris, Andre
Published: (2025)

Runtime Analyses of NSGA-III on Many-Objective Problems: Provable Exponential Speedup via Stochastic Population Update
by: Opris, Andre
Published: (2025)

Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm
by: Doerr, Benjamin, et al.
Published: (2025)

Random-Order Online Independent Set of Intervals and Hyperrectangles
by: Garg, Mohit, et al.
Published: (2024)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
by: Chen, Zongchen, et al.
Published: (2022)

How to Compute a Moving Sum
by: Maslen, David K., et al.
Published: (2025)

Domain-decomposed image classification algorithms using linear discriminant analysis and convolutional neural networks
by: Klawonn, Axel, et al.
Published: (2024)

Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime Bounds
by: Opris, Andre
Published: (2025)

Population Protocols Revisited: Parity and Beyond
by: Gąsieniec, Leszek, et al.
Published: (2025)

Robust Classification of Dynamic Bichromatic point Sets in R2
by: Glazenburg, Erwin, et al.
Published: (2024)

Sub-Token Routing in LoRA for Adaptation and Query-Aware KV Compression
by: Jiang, Wei, et al.
Published: (2026)

Parameter Tuning of the Firefly Algorithm by Standard Monte Carlo and Quasi-Monte Carlo Methods
by: Joy, Geethu, et al.
Published: (2024)

Shortest Paths without a Map, but with an Entropic Regularizer
by: Bubeck, Sébastien, et al.
Published: (2022)

Many Objective Problems Where Crossover is Provably Essential
by: Opris, Andre
Published: (2024)

Naively Sorting Evolving Data is Optimal and Robust
by: Giakkoupis, George, et al.
Published: (2024)

Point Location in Constant Time
by: Chaganti, Sairam, et al.
Published: (2023)

CUBO: Self-Contained Retrieval-Augmented Generation on Consumer Laptops 10 GB Corpora, 16 GB RAM, Single-Device Deployment
by: Astrino, Paolo
Published: (2026)

Generating uniform linear extensions using few random bits
by: Huber, Mark
Published: (2025)

Random feature-based double Vovk-Azoury-Warmuth algorithm for online multi-kernel learning
by: Rokhlin, Dmitry B., et al.
Published: (2025)

A hierarchical Vovk-Azoury-Warmuth forecaster with discounting for online regression in RKHS
by: Rokhlin, Dmitry B.
Published: (2025)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
by: DasGupta, Bhaskar, et al.
Published: (2026)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
by: Sopp, Braeden, et al.
Published: (2026)

An Improved Drift Theorem for Balanced Allocations
by: Los, Dimitrios, et al.
Published: (2023)

Optimizing Genetic Algorithms Using the Binomial Distribution
by: Cicirello, Vincent A.
Published: (2024)

Design, Configuration, Implementation, and Performance of a Simple 32 Core Raspberry Pi Cluster
by: Cicirello, Vincent A.
Published: (2017)

Towards LLM-based Generation of Human-Readable Proofs in Polynomial Formal Verification
by: Drechsler, Rolf
Published: (2025)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
by: Friggstad, Zachary, et al.
Published: (2018)

Building a Nest by an Automaton
by: Czyzowicz, Jurek, et al.
Published: (2019)

Model Parallel Training and Transfer Learning for Convolutional Neural Networks by Domain Decomposition
by: Klawonn, Axel, et al.
Published: (2024)

Oblivious subspace embeddings for compressed Tucker decompositions
by: Pietrosanu, Matthew, et al.
Published: (2024)

Separating Geometric Data with Minimum Cost: Two Disjoint Convex Hulls
by: Bigham, Bahram Sadeghi
Published: (2021)

Incremental-Decremental Maximization
by: Disser, Yann, et al.
Published: (2025)

On sampling two spin models using the local connective constant
by: Efthymiou, Charilaos
Published: (2024)

Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models
by: Kumar, Mrinal, et al.
Published: (2018)

Domain-Informed Genetic Superposition Programming: A Case Study on SFRC Beams
by: Khorshidi, Mohammad Sadegh, et al.
Published: (2025)

Balanced Group Convolution: An Improved Group Convolution Based on Approximability Estimates
by: Lee, Youngkyu, et al.
Published: (2023)

A Domain Decomposition-Based CNN-DNN Architecture for Model Parallel Training Applied to Image Recognition Problems
by: Klawonn, Axel, et al.
Published: (2023)

Euclidean k-center Fair Clusterings
by: Moritaka, Ayano, et al.
Published: (2025)