Related papers: Improved recursive Green's function formalism for …
The theoretical investigation of charge (and spin) transport at nanometer length scales requires the use of advanced and powerful techniques able to deal with the dynamical properties of the relevant physical systems, to explicitly include…
The rising interest in Dirac materials, condensed matter systems where low-energy electronic excitations are described by the relativistic Dirac Hamiltonian, entails a need for microscopic effective models to analytically describe their…
Designing nanoscale electronic devices such as the currently manufactured nanoribbon field-effect transistors (NRFETs) requires advanced modeling tools capturing all relevant quantum mechanical effects. State-of-the-art approaches combine…
Fast Fourier transform (FFT) based methods have turned out to be an effective computational approach for numerical homogenisation. In particular, Fourier-Galerkin methods are computational methods for partial differential equations that are…
This paper presents a transfer learning approach which enables fast and efficient adaptation of Recurrent Neural Network (RNN) models of dynamical systems. A nominal RNN model is first identified using available measurements. The system…
Due to their unique electrical properties, graphene nanoribbons (GNRs) show great promise as the building blocks of novel electronic devices. However, these properties are strongly dependent on the geometry of the edges of the graphene…
Motivated by recent experimental refinements of stellar reaction rates, we establish a non-perturbative Green's function formalism based on the exact solution of the Dyson equation for sub-barrier proton-nucleus resonant scattering. By…
We describe the numerical modeling of current flow in graphene heterojunctions, within the Keldysh Landauer Non-equilibrium Green's function (NEGF) formalism. By implementing a $k$-space approach along the transverse modes, coupled with…
We present a comprehensive study for common second order PDE's in two dimensional disk-like systems and show how their solution can be approximated by finding the Green function of an effective one dimensional system. After elaborating on…
Recurrent quantum models (RQMs) realize sequential quantum processes through repeated application of a unitary operation on a memory system coupled with a series of output registers. However, such models often rely on unnecessarily large…
We propose a new procedure by using the recursive Green's functions which remove all the repetition terms from the time-independent perturbation series for finite-level quantum systems. These Green's functions are introduced as a…
The Hierarchical Schur Complement method (HSC), and the HSC-extension, have significantly accelerated the evaluation of the retarded Green's function, particularly the lesser Green's function, for two-dimensional nanoscale devices. In this…
We introduce the \emph{graphical reconfigurable circuits (GRC)} model as an abstraction for distributed graph algorithms whose communication scheme is based on local mechanisms that collectively construct long-range reconfigurable channels…
The Replica Fourier Transform is the generalization of the discrete Fourier Transform to quantities defined on an ultrametric tree. It finds use in con- junction of the replica method used to study thermodynamics properties of disordered…
The graph Fourier transform (GFT) is in general dense and requires O(n^2) time to compute and O(n^2) memory space to store. In this paper, we pursue our previous work on the approximate fast graph Fourier transform (FGFT). The FGFT is…
This review deals with the nonequilibrium Green's function (NEGF) method applied to the problems of energy transport due to atomic vibrations (phonons), primarily for small junction systems. We present a pedagogical introduction to the…
Previous work in the literature has studied gravitational radiation in black-hole collisions at the speed of light. In particular, it had been proved that the perturbative field equations may all be reduced to equations in only two…
Using particle-scale models to accurately describe property enhancements and phase transitions in macroscopic behavior is a major engineering challenge in composite materials science. To address some of these challenges, we use the graph…
The FIND algorithm is a fast algorithm designed to calculate certain entries of the inverse of a sparse matrix. Such calculation is critical in many applications, e.g., quantum transport in nano-devices. We extended the algorithm to other…
We propose the redistribution-reconfiguration (red-rec) algorithm to prepare large configurations of atoms using arrays of dynamic optical traps. Red-rec exploits simple heuristics and exact subroutines to solve atom reconfiguration…