Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

New tutorial idea: 2D grating coupler with levelsets #2011

Open
smartalecH opened this issue Mar 21, 2022 · 0 comments
Open

New tutorial idea: 2D grating coupler with levelsets #2011

smartalecH opened this issue Mar 21, 2022 · 0 comments

Comments

@smartalecH
Copy link
Collaborator

As discussed in #2002, it might be nice to write a new tutorial that shows how to design a simple 2D grating coupler using the adjoint solver. This particular design problem easily illustrates the many advantages of our new hybrid density-levelset approach. Specifically, the tutorial could cover the following scenarios:

  1. A simple density-based approach where the DOF are just the MaterialGrid variables themselves. The grating evolution consists of just two or three betas, where the last beta goes to infinity for levelset (i.e. shape) optimization (e.g. β=8, β=32, β=∞). This is the most straightforward way to design a GC using the current framework.
  2. A parameterized version (perhaps using a signed distance function) that abstracts fundamental parameters like grating period, duty cycle, etc using a simple autograd function mapping (as described here). There isn't as much flexibility with this "parameterization", but it illustrates many important applications (e.g. fabrication sensitivity analysis). β=∞ throughout the entire process.
  3. A combination of approaches 1 and 2, where the degrees of freedom are the individual grating widths and gaps themselves. This means that after each optimization iteration, a new MaterialGrid object and geometry must be generated (and consequently, a simulation object too) as the individual lengths continually rescale the "design region". This is similar to the "remeshing" step that often takes place with various differentiate-then-discretize schemes. Practically, this relaxes an implicit constraint placed by idea 1 above, where the grating length itself cannot change. The new constraint is that the number of grating "teeth" cannot change. β=∞ throughout the entire process.

(cc @oskooi)

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant