Thermal Models for Optical Circuit Simulation Using a Finite Cloud Method and Model Reduction Techniques
Bibliographic record
Abstract
This paper presents a procedure for the creation of versatile and powerful thermal compact models of integrated optical devices and demonstrates their use in an optical circuit level simulator. A detailed 3-D model of the device is first built using a meshless finite cloud method, producing a large linear sparse set of equations. This model is then reduced to a compact representation using a Krylov subspace model reduction (MR) technique. Such a reduced model is described by small dense matrices, but can reproduce the original temperature distribution within acceptable error. Three devices are used as demonstration models for the technique: a microdisc laser and two microring-based devices, a modulator, and an optical switch. All three devices are built in a silicon on oxide platform. Using MR the linear systems describing these models are reduced from thousands of unknowns to systems with less than 100 reduced variables. It is then demonstrated how the reduced compact models can be linked together to describe a complete optical system with solution errors of lower than 1%. Finally, it is shown how this reduced thermal model can be utilized in a circuit level opto-electronic circuit simulator and simulations are presented, demonstrating the effectiveness of the reduced models in speeding up simulation times or enabling otherwise intractable problems.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".