Parallel Decomposition Approach to Wide-Range Parametric Modeling With Applications to Microwave Filters
Bibliographic record
Abstract
This article proposes a novel decomposition technique to address the challenges of electromagnetic (EM) parametric modeling, where the values of geometrical parameters change in a large range. In this method, a systematic and automated algorithm based on second-order derivative information is proposed to decompose the overall geometrical range into a set of subranges. Using the proposed technique, a smooth region is decomposed into a few large subregions, while a highly nonlinear region is decomposed into many small subregions. The proposed technique provides an efficient mathematical methodology to perform the decomposition in a systematic and automated process. An artificial neural network (ANN) model with a simple structure, hereby referred to as a submodel, is developed with geometrical parameters as variables in each subregion. When the values of geometrical parameters change from the region of one submodel to another submodel, the discontinuity of the EM responses is observed at the boundary between the adjacent submodels. There are many submodel boundaries in the overall model resulting in the complex multidimensional discontinuity problem. A submodel modification process is proposed to solve this multidimensional discontinuity problem to obtain a continuous model over the entire region. Parallel data generation, parallel submodel training, and parallel submodel modification are proposed to speed up the modeling development process. Compared with standard modeling methods using a single model to cover the entire wide geometrical range, the proposed method can obtain better model accuracy with short model-development time. Two microwave filter examples are used to illustrate the validity of the proposed technique.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 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.002 | 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".