Michael Poole | Searcharxiv

arXiv2025

Flip Graphs with Symmetry and New Matrix Multiplication Schemes

The flip graph algorithm is a method for discovering new matrix multiplication schemes by following random walks on a graph. We introduce a version of the flip graph algorithm for matrix multiplication schemes that admit certain symmetries. This significantly reduces the size of the search space, allowing for more efficient exploration of the flip graph. The symmetry in the resulting schemes also facilitates the process of lifting solutions from $F_2$ to $\mathbb{Z}$. Our results are new schemes for multiplying $5\times 5$ matrices using $93$ multiplications and $6\times 6$ matrices using $153$ multiplications over arbitrary ground fields.

cs.SC↗

arXiv2010

Minimax Current Density Coil Design

'Coil design' is an inverse problem in which arrangements of wire are designed to generate a prescribed magnetic field when energized with electric current. The design of gradient and shim coils for magnetic resonance imaging (MRI) are important examples of coil design. The magnetic fields that these coils generate are usually required to be both strong and accurate. Other electromagnetic properties of the coils, such as inductance, may be considered in the design process, which becomes an optimization problem. The maximum current density is additionally optimized in this work and the resultant coils are investigated for performance and practicality. Coils with minimax current density were found to exhibit maximally spread wires and may help disperse localized regions of Joule heating. They also produce the highest possible magnetic field strength per unit current for any given surface and wire size. Three different flavours of boundary element method that employ different basis functions (triangular elements with uniform current, cylindrical elements with sinusoidal current and conic section elements with sinusoidal-uniform current) were used with this approach to illustrate its generality.

physics.class-ph↗