Engineering topics

Bochev, Pavel

Publications and source records attributed to Bochev, Pavel.

4 records

DOE OSTI2024

A discontinuous piecewise polynomial generalized moving least squares scheme for robust finite element analysis on arbitrary grids

A variational approach is developed with a meshless discretization to enable accurate and robust numerical simulation of partial differential equations for meshes that are of poor quality. Traditional finite element methods use the mesh to both discretize the geometric domain and to define the finite element shape functions. The latter creates a dependence between the quality of the mesh and the properties of the finite element basis that may adversely affect the accuracy of the discretized problem. Here, we propose a new approach for defining finite element shape functions that breaks this dependence and separates mesh quality from the discretization quality, which we call discontinuous piecewise polynomial generalized moving least squares (DPP-GMLS). At the core of the approach is a meshless definition of the shape functions, which limits the purpose of the mesh to representing the geometric domain and integrating the basis functions without having any role in their approximation quality. The resulting non-conforming space can be utilized within a standard discontinuous Galerkin framework, providing a rigorous foundation for solving partial differential equations on low-quality meshes. We present a collection of numerical experiments demonstrating our approach in a wide range of settings: strongly coercive elliptic problems, linear elasticity in the compressible regime, and the stationary Stokes problem. We demonstrate convergence for all problems and stability for element pairs for problems which usually require inf-sup compatibility for conforming methods, also referring to a minor modification possible through the symmetric interior penalty Galerkin framework for stabilizing element pairs that would otherwise be traditionally unstable. Mesh robustness is particularly critical for elasticity, and we provide an example that our approach provides a greater than 5 x improvement in accuracy and allows for taking an 8 x larger stable timestep for a highly deformed mesh, compared to the continuous Galerkin finite element method.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Entropy Analysis of FPGA Interconnect and Switch Matrices for Physical Unclonable Functions

Random variations in microelectronic circuit structures represent the source of entropy for physical unclonable functions (PUFs). In this paper, we investigate delay variations that occur through the routing network and switch matrices of a field-programmable gate array (FPGA). The delay variations are isolated from other components of the programmable logic, e.g., look-up tables (LUTs), flip-flops (FFs), etc., using a feature of Xilinx FPGAs called dynamic partial reconfiguration (DPR). A set of partial designs is created to fix the placement of a time-to-digital converter (TDC) and supporting infrastructure to enable the path delays through the target interconnect and switch matrices to be extracted by subtracting out common-mode delay components. Delay variations are analyzed in the different levels of routing resources available within FPGAs, i.e., local routing and across-chip routing. Data are collected from a set of Xilinx Zynq 7010 devices, and a statistical analysis of within-die variations in delay through a set of the randomly-generated and hand-crafted interconnects is presented.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Dynamic flux surrogate-based partitioned methods for interface problems

Loosely coupled partitioned methods for multiphysics problems treat each subproblem as a separate entity and advance them independently in time. In so doing these methods enable code reuse, increase concurrency and provide a convenient framework for plug-and-play multiphysics simulations. However, mathematically loosely coupled schemes are equivalent to a single step of an iterative solution method, which can compromise their accuracy and stability. We present a new data-driven partitioned method for coupled parametric PDEs that can improve upon the accuracy of traditional loosely coupled methods without incurring a performance penalty. To that end, we replace conventional field transfers across the interface by a surrogate for the dynamics of the interface flux exchanged between the subdomains. To develop this surrogate we apply dynamic mode decomposition to a non-standard staggered-in-time state, comprising the interface flux and small solution patches near the interface. The new approach shifts the main computational burden to an offline training phase, whereas application of the surrogate in the online phase amounts to a single matrix–vector multiplication. In conclusion, we provide stability analysis of the surrogate-based partitioned scheme and include numerical results that demonstrate its potential.

Dynamic mode decomposition (DMD)↗

DOE OSTI2024

A system identification approach for non-intrusive reduced order modeling of radiation-induced photocurrents

In this study, development of compact photocurrent models is currently dominated by analytical techniques that rely on physical assumptions to render the governing equations solvable in a closed form. Violation of these assumptions can reduce the accuracy of the models and/or limit their scope. In this paper we show that system identification of nonlinear state-space systems can serve as an alternative numerical basis for non-intrusive reduced order modeling of photocurrent effects. To that end we develop a compact gray box photocurrent model (GBPM) by using a state-space representation with a low-dimensional latent state equation that mimics a mathematical model for the response of an idealized class of devices to ionizing radiation. In so doing we obtain a model that learns the dynamics of a quantity of interest directly from its measurements without requiring snapshots of the internal device state or its discretized model, and can be inferred from very small data sets. To demonstrate the approach we train the GBPM using a small experimental data set for a Z5236 Zener diode and a small synthetic data set obtained by simulating a synthetic pn-junction device. We then compare the GBPMs with black box models trained on the same data and show that performance of the latter is limited by the size of the data set, while the former are able to achieve excellent performance in both the reproductive and the predictive regimes.

97 MATHEMATICS AND COMPUTING↗