desc.objectives.FreeSurfaceError
- class desc.objectives.FreeSurfaceError(eq, field, *, grid=None, coil_grid=None, q=None, fix_I_sheet=False, options=None, target=None, bounds=None, weight=1, normalize=True, normalize_target=True, loss_function=None, deriv_mode='auto', jac_chunk_size=None, name='Free surface error', **kwargs)Source
Target for free surface ideal MHD equilirium as described in [1].
References
Notes
Performance is expected to improve significantly by resolving GitHub issues #1034 and #2171.
If reverse mode differentiation is being used, it is of great benefit for the objective residual to be a lower dimensional item. In such cases, it is better to instead use a loss function that reduces the dimension of the residual before computing the derivative relevant for optimization. This can be a mean squared error over all points of the output grid or mean absolute error over blocks of the grid, etc.
- Parameters:
eq (Equilibrium) –
Equilibriumto be optimized.field (FreeSurfaceOuterField or SourceFreeField) –
Laplace solver object.
If is an instance of
FreeSurfaceOuterFieldassumesfield._B_coilis the magnetic field due to coils. If is an instance ofSourceFreeFieldthen assumesfield._B0is the magnetic field due to coils.The net toroidal sheet current
I_sheetis an optimizable scalar parameter initialized to zero.grid (Grid) – Grid for the integral transforms. Tensor-product grid in (θ, ζ) with uniformly spaced nodes (θ, ζ) ∈ [0, 2π) × [0, 2π/NFP) on the boundary. Default is
LinearGrid(M=eq.M_grid,N=eq.N_grid,NFP=eq.NFP).coil_grid (Grid, optional) – Source grid used to discretize coil magnetic field computation. Default is default grid of coil magnetic field.
q (int) – Order of integration on the local singular grid.
fix_I_sheet (bool, optional) – Whether to fix the net toroidal sheet current to zero instead of optimizing it.
options (LaplaceOptions) – Options for the Laplace solver. Defaults to
LaplaceOptions(), which defaults to the GMRES iterative solver. Other options are BiCGStab and direct. Fastest is typically BiCGStab (heed the note in the max_steps option). If an iterative solver errors due to incompatibility with old JAX versions,"fixed_point"can be selected instead ifoptimistixis installed.target ({float, ndarray}, optional) – Target value(s) of the objective. Only used if
boundsisNone. Must be broadcastable toObjective.dim_f. Defaults totarget=0.bounds (tuple of {float, ndarray}, optional) – Lower and upper bounds on the objective. Overrides
target. Both bounds must be broadcastable toObjective.dim_f. Defaults totarget=0.weight ({float, ndarray}, optional) – Weighting to apply to the Objective, relative to other Objectives. Must be broadcastable to
Objective.dim_f.normalize (bool, optional) – Whether to compute the error in physical units or non-dimensionalize.
normalize_target (bool, optional) – Whether target and bounds should be normalized before comparing to computed values. If
normalizeisTrueand the target is in physical units, this should also be set toTrue.loss_function ({None, 'mean', 'min', 'max','sum'}, optional) – Loss function to apply to the objective values once computed. This loss function is called on the raw compute value, before any shifting, scaling, or normalization.
deriv_mode ({"auto", "fwd", "rev"}) – Specify how to compute Jacobian matrix, either forward mode or reverse mode AD.
autoselects forward or reverse mode based on the size of the input and output of the objective. Has no effect onself.gradorself.hesswhich always use reverse mode and forward over reverse mode respectively.name (str, optional) – Name of the objective.
jac_chunk_size (int or
auto, optional) – Will calculate the Jacobianjac_chunk_sizecolumns at a time, instead of all at once. The memory usage of the Jacobian calculation is roughlymemory usage = m0+m1*jac_chunk_size: the smaller the chunk size, the less memory the Jacobian calculation will require (with some baseline memory usage). The time it takes to compute the Jacobian is roughlyt = t0+t1/jac_chunk_sizeso the larger thejac_chunk_size, the faster the calculation takes, at the cost of requiring more memory. IfNone, it will use the largest size i.eobj.dim_x. Can also help with Hessian computation memory, as Hessian is essentiallyjacfwd(jacrev(f)), and each of these operations may be chunked. Defaults tochunk_size=None. Note: When running on a CPU (not a GPU) on a HPC cluster, DESC is unable to accurately estimate the available device memory, so theautochunk_size option will yield a larger chunk size than may be needed. It is recommended to manually choose a chunk_size if an OOM error is experienced in this case.
Methods
build([use_jit, verbose])Build constant arrays.
compute(params[, I_sheet_params, constants])Compute boundary error.
compute_scalar(*args, **kwargs)Compute the scalar form of the objective.
compute_scaled(*args, **kwargs)Compute and apply weighting and normalization.
compute_scaled_error(*args, **kwargs)Compute and apply the target/bounds, weighting, and normalization.
compute_unscaled(*args, **kwargs)Compute the raw value of the objective.
copy([deepcopy])Return a (deep)copy of this object.
equiv(other)Compare equivalence between DESC objects.
grad(*args, **kwargs)Compute gradient vector of self.compute_scalar wrt x.
hess(*args, **kwargs)Compute Hessian matrix of self.compute_scalar wrt x.
jac_scaled(*args, **kwargs)Compute Jacobian matrix of self.compute_scaled wrt x.
jac_scaled_error(*args, **kwargs)Compute Jacobian matrix of self.compute_scaled_error wrt x.
jac_unscaled(*args, **kwargs)Compute Jacobian matrix of self.compute_unscaled wrt x.
jvp_scaled(v, x[, constants])Compute Jacobian-vector product of self.compute_scaled.
jvp_scaled_error(v, x[, constants])Compute Jacobian-vector product of self.compute_scaled_error.
jvp_unscaled(v, x[, constants])Compute Jacobian-vector product of self.compute_unscaled.
load(load_from[, file_format])Initialize from file.
print_value(args[, args0, fse, f0se])Print the value of the objective and return a dict of values.
save(file_name[, file_format, file_mode])Save the object.
xs(*things)Return a tuple of args required by this objective from optimizable things.
Attributes
Lower and upper bounds of the objective.
Whether the transforms have been precomputed (or not).
Constant parameters such as transforms and profiles.
Number of objective equations.
Whether the objective fixes individual parameters (or linear combo).
Whether the objective is a linear function (or nonlinear).
Name of objective (str).
normalizing scale factor.
Whether default "compute" method is a scalar or vector.
Target value(s) of the objective.
Optimizable things that this objective is tied to.
Weighting to apply to the Objective, relative to other Objectives.