Related papers: Efficient Fast Multipole Accelerated Boundary Elem…
We present an implementation of the fast multipole method for computing coulombic electrostatic and polarization forces from polarizable force-fields based on induced point dipole moments. We demonstrate the expected $O(N)$ scaling of that…
Efficient long-time integration of nonlinear fractional differential equations is significantly challenging due to the integro-differential nature of the fractional operators. In addition, the inherent non-smoothness introduced by the…
The recurrence rebuild and retrieval method (R3M) is proposed in this paper to accelerate the electromagnetic (EM) validations of large-scale digital coding metasurfaces (DCMs). R3M aims to accelerate the EM validations of DCMs with varied…
This paper presents a new fast power series solution method to solve the Hierarchal Method of Moment(MoM) matrix for a large complex,perfectly electric conducting (PEC) 3D structures. The proposed power series solution converges in just two…
Characteristic mode (CM) analysis poses challenges in computational electromagnetics (CEM) as it calls for efficient solutions of dense generalized eigenvalue problems (GEP). Multilevel fast multipole algorithm (MLFMA) can greatly reduce…
This work develops a polygonal finite element method (PFEM) for the analysis of steady-state and transient thermal stresses in two dimensional continua. The method employs Wachspress rational basis functions to construct conforming…
Magnetostatic field calculations in micromagnetic simulations can be numerically expensive, particularly in the case of large-scale finite element simulations. The established finite element / boundary element method (FEM/BEM) by Fredkin &…
Accurate and fast calculations of localized surface plasmon resonances (LSPR) in metallic nanoparticles is essential for applications in sensing, nano-optics, and energy harvesting. Although full-wave numerical techniques such as the…
Emulation has been successfully applied across a wide variety of scientific disciplines for efficiently analysing computationally intensive models. We develop known boundary emulation strategies which utilise the fact that, for many…
In this paper, we introduce novel fast matrix inversion algorithms that leverage triangular decomposition and recurrent formalism, incorporating Strassen's fast matrix multiplication. Our research places particular emphasis on triangular…
In this paper we extend the polynomial time integration framework to include exponential integration for both partitioned and unpartitioned initial value problems. We then demonstrate the utility of the exponential polynomial framework by…
This paper presents a novel boundary-optimized fast Fourier extension algorithm for efficient approximation of non-periodic functions. The proposed methodology constructs periodic extensions through strategic utilization of boundary…
Nonlinear energy functionals appearing in the calculus of variations can be discretized by the finite element (FE) method and formulated as a sum of energy contributions from local elements. A fast evaluation of energy functionals…
We demonstrate a new, hybrid symbolic-numerical method for the automatic synthesis of all families of translation operators required for the execution of the Fast Multipole Method (FMM). Our method is applicable in any dimensionality and to…
The use of nonlinear PDEs has led to significant advancements in various fields, such as physics, biology, ecology, and quantum mechanics. However, finding multiple solutions for nonlinear PDEs can be a challenging task, especially when…
General matrix-matrix multiplication (GEMM) is a cornerstone of AI computations, making tensor processing engines (TPEs) increasingly critical in GPUs and domain-specific architectures. Existing architectures primarily optimize dataflow or…
To address increasing compute demand from recent multi-model workloads with heavy models like large language models, we propose to deploy heterogeneous chiplet-based multi-chip module (MCM)-based accelerators. We develop an advanced…
Recent hardware-aware matrix-free algorithms for higher-order finite-element (FE) discretized matrix-vector multiplications reduce floating point operations and data access costs compared to traditional sparse matrix approaches. This work…
In this article, we present Bembel, the C++ library featuring higher order isogeometric Galerkin boundary element methods for Laplace, Helmholtz, and Maxwell problems. Bembel is compatible with geometries from the Octave NURBS package and…
Combining sum factorization, weighted quadrature, and row-based assembly enables efficient higher-order computations for tensor product splines. We aim to transfer these concepts to immersed boundary methods, which perform simulations on a…