.png){kind=icon}
返回
Greedy permanent magnet optimization
.png){kind=icon}
OA
AI
DOI：10.1088/1741-4326/acb4a9.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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 show that the binary permanent magnet problem can be formulated as a quadratic program with quadratic equality constraints, the binary, grid-aligned problem is equivalent to the quadratic knapsack problem with multiple knapsack constraints, and the single-orientation-only problem is equivalent to the unconstrained quadratic binary problem. We then provide a set of simple greedy algorithms for solving variants of permanent magnet optimization, and demonstrate their capabilities by designing magnets for stellarator plasmas. The algorithms can a-priori produce sparse, grid-aligned, binary solutions. Despite its simple design and greedy nature, we provide an algorithm that compares with or even outperforms the state-of-the-art algorithms while being substantially faster, more flexible, and easier to use.
Keyword:
permanent magnets
stellarators
greedy algorithms
sparse regression
combinatorial optimization
binary quadratic programs
quadratic knapsack problems
期刊
IF:
4
论文数:
9.3K
被引数:
2.2W
机构
引用论文
分享收藏Transformation of organic rhizodepositions by rhizosphere bacteria and its influence on the availability of tertiary calcium phosphate.根际细菌对有机根际沉积的转化及其对叔磷酸钙有效性的影响。.png)
IF0
PREAI
分享收藏Knapsack problems - An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems背包问题-最新进展概述。第二部分: 多重、多维和二次背包问题
OAAI
OAAI分享收藏
查看更多内容