Beowulf – Sonnet Software
Beowulf the revolutionary EM solver that combines extreme speed and unparalleled accuracy.
The Unified-FFT Method
Beowulf will be the first commercial tool to leverage the award-winning Unified-FFT (UFFT) method, which scales as O(N log N) without sacrificing accuracy or precision. Developed at Syracuse University in 2014, Unified-FFT is an iterative method which leverages FFTs for both matrix fill and matrix solve. It utilizes an implicit matrix which leverages lossless compression, via redefining the moment matrix as a series of Toeplitz and Hankel arrays.
Extreme Speed, Reduced Memory
As no full-matrix factorization is necessary, the O(n log n) scaling allows Beowulf to run large circuits much faster. For large, well-conditioned problems, this can be orders of magnitude improvement. All while taking less memory to simulate due to the lossless compression.
Solve Huge Problems without Huge Server Rooms
With the efficiency of Sonnet’s 3D Planar framework combined with the UFFT method, Beowulf can solve tremendously large EM problems on relatively modest hardware. This 1,024 element patch antenna array was solved on a miniITX Intel Desktop system.