Publications

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

This document provides the instructions for participating in the 2021 blind photovoltaic (PV) modeling intercomparison organized by the PV Performance Modeling Collaborative (PVPMC). It describes the system configurations, metadata, and other information necessary for the modeling exercise. The practical details of the validation datasets are also described. The datasets were published online in open access in April 2023, after completing the analysis of the results.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

Abstract not provided.

In magneto-inertial fusion, the ratio of the characteristic fuel length perpendicular to the applied magnetic field R to the α-particle Larmor radius Q α is a critical parameter setting the scale of electron thermal-conduction loss and charged burn-product confinement. Using a previously developed deep-learning-based Bayesian inference tool, we obtain the magnetic-field fuel-radius product B R ∝ R / Q α from an ensemble of 16 magnetized liner inertial fusion (MagLIF) experiments. Observations of the trends in BR are consistent with relative trade-offs between compression and flux loss as well as the impact of mix from 1D resistive radiation magneto-hydrodynamics simulations in all but two experiments, for which 3D effects are hypothesized to play a significant role. Finally, we explain the relationship between BR and the generalized Lawson parameter χ. Our results indicate the ability to improve performance in MagLIF through careful tuning of experimental inputs, while also highlighting key risks from mix and 3D effects that must be mitigated in scaling MagLIF to higher currents with a next-generation driver.

We propose primal–dual mesh optimization algorithms that overcome shortcomings of the standard algorithm while retaining some of its desirable features. “Hodge-Optimized Triangulations” defines the “HOT energy” as a bound on the discretization error of the diagonalized Delaunay Hodge star operator. HOT energy is a natural choice for an objective function, but unstable for both mathematical and algorithmic reasons: it has minima for collapsed edges, and its extrapolation to non-regular triangulations is inaccurate and has unbounded minima. We propose a different extrapolation with a stronger theoretical foundation, and avoid extrapolation by recalculating the objective just beyond the flip threshold. We propose new objectives, based on normalizations of the HOT energy, with barriers to edge collapses and other undesirable configurations. We propose mesh improvement algorithms coupling these. When HOT optimization nearly collapses an edge, we actually collapse the edge. Otherwise, we use the barrier objective to update positions and weights and remove vertices. By combining discrete connectivity changes with continuous optimization, we more fully explore the space of possible meshes and obtain higher quality solutions.

Abstract not provided.

Abstract not provided.

Interval Assignment (IA) is the problem of selecting the number of mesh edges (intervals) for each curve for conforming quad and hex meshing. The intervals x is fundamentally integer-valued. Many other approaches perform numerical optimization then convert a floating-point solution into an integer solution, which is slow and error prone. We avoid such steps: we start integer, and stay integer. Incremental Interval Assignment (IIA) uses integer linear algebra (Hermite normal form) to find an initial solution to the meshing constraints, satisfying the integer matrix equation Ax=b. Solving for reduced row echelon form provides integer vectors spanning the nullspace of A. We add vectors from the nullspace to improve the initial solution, maintaining Ax=b. Heuristics find good integer linear combinations of nullspace vectors that provide strict improvement towards variable bounds or goals. IIA always produces an integer solution if one exists. In practice we usually achieve solutions close to the user goals, but there is no guarantee that the solution is optimal, nor even satisfies variable bounds, e.g. has positive intervals. We describe several algorithmic changes since first publication that tend to improve the final solution. The software is freely available.