Verification of the Fourier-enhanced 3D finite element Poisson solver of the gyrokinetic full-f code PICLS
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
We report the experimental study of noise in electrochemical biosensors as related to voltage and concentration. A comparison with experiments is performed for H2O2 and Ferrocyanide with bare sensors and with sensors functionalized wi ...
A method and system for computing Fourier coefficients for a Fourier representation of a mask transmission function for a lithography mask. The method includes: sampling a polygon of a mask pattern of the lithography mask to obtain an indicator function wh ...
The field of application of Phasor Measurement Units (PMUs) might be limited by the PMU measurements reporting latencies and achievable reporting rates, particularly with respect to power system protection applications that typically require very low laten ...
We propose two new fast algorithms for the computation of the continuous Fourier series and the continuous Haar transform of rectilinear polygons such as those of mask layouts in optical lithography. These algorithms outperform their discrete counterparts ...
The field of application of Phasor Measurement Units (PMUs) might be limited by the PMU measurements reporting latencies and achievable reporting rates, particularly with respect to power system protection applications that typically require very low laten ...
We present a novel, accurate and fast algorithm to obtain Fourier series coecients from an IC layer whose description consists of rectilinear polygons on a plane, and how to implement it using o-the-shelf hardware components. Based on properties of Fourier ...
We give a cohomological interpretation of both the Kac polynomial and the refined Donaldson-Thomas-invariants of quivers. This interpretation yields a proof of a conjecture of Kac from 1982 and gives a new perspective on recent work of Kontsevich Soibelman ...
One of the method to have a fast acquisition of GNSS signals is the parallel code-phase search, which uses the fast Fourier transform (FFT) to perform the correlation. A problem with this method is the potential sign transition that can happen between two ...
In Part I we introduced the generalized Wiener rational basis functions, and here in Part II we continue our investigation with numerical experiments. Wiener's generalized basis can utilize the fast Fourier transform for integer values of the decay paramet ...
A system, computer program, and/or method for encoding data that can correct r/2 errors. The original symbols are transformed using a Fourier transform of length p. Generator polynomials are used to encode the p blocks separately, and an inverse Fourier tr ...
