Compact semiconductor device models are essential for efficiently designing and analyzing large circuits. However, traditional compact model development requires a large amount of manual effort and can span many years. Moreover, inclusion of new physics (e.g., radiation effects) into an existing model is not trivial and may require redevelopment from scratch. Machine Learning (ML) techniques have the potential to automate and significantly speed up the development of compact models. In addition, ML provides a range of modeling options that can be used to develop hierarchies of compact models tailored to specific circuit design stages. In this paper, we explore three such options: (1) table-based interpolation, (2) Generalized Moving Least-Squares, and (3) feedforward Deep Neural Networks, to develop compact models for a p-n junction diode. We evaluate the performance of these "data-driven" compact models by (1) comparing their voltage-current characteristics against laboratory data, and (2) building a bridge rectifier circuit using these devices, predicting the circuit's behavior using SPICE-like circuit simulations, and then comparing these predictions against laboratory measurements of the same circuit.
We present an optimization-based coupling method for local and nonlocal continuum models. Our approach couches the coupling of the models into a control problem where the states are the solutions of the nonlocal and local equations, the objective is to minimize their mismatch on the overlap of the local and nonlocal problem domains, and the virtual controls are the nonlocal volume constraint and the local boundary condition. We present the method in the context of Local-to-Nonlocal diffusion coupling. Numerical examples illustrate the theoretical properties of the approach.
This report summarizes the work performed under a three year LDRD project aiming to develop mathematical and software foundations for compatible meshfree and particle discretizations. We review major technical accomplishments and project metrics such as publications, conference and colloquia presentations and organization of special sessions and minisimposia. The report concludes with a brief summary of ongoing projects and collaborations that utilize the products of this work.
Traditional explicit partitioned schemes exchange boundary conditions between subdomains and can be related to iterative solution methods for the coupled problem. As a result, these schemes may require multiple subdomain solves, acceleration techniques, or optimized transmission conditions to achieve sufficient accuracy and/or stability. We present a new synchronous partitioned method derived from a well-posed mixed finite element formulation of the coupled problem. We transform the resulting Differential Algebraic Equation (DAE) to a Hessenberg index-1 form in which the algebraic equation defines the Lagrange multiplier as an implicit function of the states. Using this fact we eliminate the multiplier and reduce the DAE to a system of explicit ODEs for the states. Explicit time integration both discretizes this system in time and decouples its equations. As a result, the temporal accuracy and stability of our formulation are governed solely by the accuracy and stability of the explicit scheme employed and are not subject to additional stability considerations as in traditional partitioned schemes. We establish sufficient conditions for the formulation to be well-posed and prove that classical mortar finite elements on the interface are a stable choice for the Lagrange multiplier. We show that in this case the condition number of the Schur complement involved in the elimination of the multiplier is bounded by a constant. The paper concludes with numerical examples illustrating the approach for two different interface problems.