TAGGED: adjoint-solver, lumopt, optimisation
-
-
July 11, 2023 at 9:32 am
Ruzan Sokhoyan
SubscriberHi,
I am thinking of implementing adjoined optimization in Lumerical, and I am trying to identify the best place to start.
I previously used the SQP method, like in this example https://optics.ansys.com/hc/en-us/articles/360042304834-Grating-coupler-Matlab-driven-optimization-2D-
 The issue with this method was that with 3 parameters to be optimized, I had to run from 40 to 60 FDTD simulations to reach convergence. I believe the adjoined method should reduce the number of required FDTD simulations.
Would optimizing the LumOpt code be the best place to start? Would you suggest using Matlab or the Python version? I found the following presentation online: https://www2.lumerical.com/resources/OFC_Hackathon_Lumerical.pdf
Would you recommend some other resources?
Thanks!
-
July 21, 2023 at 11:07 pm
Taylor Robertson
Ansys EmployeeHello Ruzan,
Â
The adjoint method is already implemented in Lumerical. I don't think it will reduce the number of simulations, but it is a more sophisticated approach to doing gradient descent. You will still need a good starting point, some physical inution and experience with FDTD\python. We ship lumopt with the Lumerical install no need to use the github, this landing page is a good place to start.
The examples can be found here.
Good luck
-
- The topic ‘Implementing adjoined optimization in Lumerical’ is closed to new replies.
-
3912
-
1414
-
1256
-
1118
-
1015
© 2025 Copyright ANSYS, Inc. All rights reserved.