Greedy permanent magnet optimization

Greedy permanent magnet optimization

A number of scientific fields rely on placing permanent magnets in order to produce a desired magnetic field. We have shown in recent work that the placement process can be formulated as sparse regression. However, binary, grid-aligned solutions are desired for realistic engineering designs. We now...

Full description

Bibliographic Details
Main Authors: Alan A. Kaptanoglu, Rory Conlin, Matt Landreman
Format: Article
Language:English
Published: IOP Publishing 2023-01-01
Series:Nuclear Fusion
Subjects:
permanent magnets
stellarators
greedy algorithms
sparse regression
combinatorial optimization
binary quadratic programs
Online Access:https://doi.org/10.1088/1741-4326/acb4a9

Internet

https://doi.org/10.1088/1741-4326/acb4a9

Similar Items