Linearization techniques for band structure calculations in absorbing photonic crystals
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.
Solar energy has seen tremendous advances in the past years. For thin film photovoltaics, which use less of the expensive semiconductor materials, insufficient light absorption can be a limiting factor. It is hoped that by using diffractive optics to impro ...
We develop an analytical formulation to calculate the induced resonance frequency shifts of an electrostatically actuated torsional microsensor due to an added bio-mass (E. coli). Based on a lumped-parameter model, we investigate the static and the linear ...
The efficient and accurate QR decomposition for matrices with hierarchical low-rank structures, such as HODLR and hierarchical matrices, has been challenging. Existing structure-exploiting algorithms are prone to numerical instability as they proceed indi- ...
We consider the numerical approximation of high order Partial Differential Equations (PDEs) defined on surfaces in the three dimensional space, with particular emphasis on closed surfaces. We consider computational domains that can be represented by B-spli ...
The QZ algorithm for computing eigenvalues and eigenvectors of a matrix pencil A - lambda B requires that the matrices first be reduced to Hessenberg-triangular (HT) form. The current method of choice for HT reduction relies entirely on Givens rotations re ...
In this thesis, we consider the numerical approximation of high order geometric Partial Differential Equations (PDEs). We first consider high order PDEs defined on surfaces in the 3D space that are represented by single-patch tensor product NURBS. Then, we ...
This work is concerned with the numerical solution of large-scale linear matrix equations A1XB1T++AKXBKT=C. The most straightforward approach computes XRmxn from the solution of an mn x mn linear system, typically limiting the feasible values of m,n to a f ...
We consider the numerical approximation of high order Partial Differential Equations (PDEs) defined on surfaces in the three dimensional space, with particular emphasis on closed surfaces. We consider computational domains that can be represented by B-spli ...
The matrix Sylvester equation for congruence, or T-Sylvester equation, has recently attracted considerable attention as a consequence of its close relation to palindromic eigenvalue problems. The theory concerning T-Sylvester equations is rather well under ...
The numerical solution of partial differential equations on high-dimensional domains gives rise to computationally challenging linear systems. When using standard discretization techniques, the size of the linear system grows exponentially with the number ...
