Cthulhu.calculate

Attributes

version
dots
positions
version
version

Functions

find_index(val, grid_start, grid_end, N_grid)
prior_index(val, grid_start, grid_end, N_grid)
prior_index_generic(value, grid[, start])	Search a grid to find the previous index closest to a specified value (i.e.
compute_transition_frequencies(E, states, upper_state, ...)
compute_line_intensity_EXOMOL(A_trans, g_state, ...)
compute_line_intensity_HITRAN(S_ref, Q_T, Q_ref, ...)
compute_line_intensity_VALD(gf, E_low, nu_0, T, Q_T)
compute_line_intensity(A, g_upper, E_lower, nu_0, T, Q)
compute_cross_section(sigma, nu_grid, nu_0, cutoffs, ...)
compute_cross_section_atom(sigma, nu_grid, nu_0, S, ...)
compute_cross_section_atom_OLD(sigma, N_grid, nu_0, ...)
find_J_low(J, states, lower_state)	Find the lower angular momentum quantum number corresponding to each lower
cross_section_EXOMOL(linelist_files, input_directory, ...)
cross_section_HITRAN(linelist_files, input_directory, ...)
produce_total_cross_section_VALD_atom(nu_grid, sigma, ...)
bin_cross_section_atom(sigma_fine, sigma_out, ...)

Module Contents

Cthulhu.calculate.version

Cthulhu.calculate.dots

Cthulhu.calculate.positions

Cthulhu.calculate.version

Cthulhu.calculate.version

Cthulhu.calculate.find_index(val, grid_start, grid_end, N_grid)

Cthulhu.calculate.prior_index(val, grid_start, grid_end, N_grid)

Cthulhu.calculate.prior_index_generic(value, grid, start=0)

Search a grid to find the previous index closest to a specified value (i.e. the index of the grid where the grid value is last less than the value). This function assumes the input grid monotonically increases.

Parameters:

• value (float) – Value for which the prior grid index is desired.

• grid (np.array of float) – Input grid.

• start (int) – Optional start index when existing knowledge is available.

Returns:

Prior index of the grid corresponding to the value.

Return type:

index (int)

Cthulhu.calculate.compute_transition_frequencies(E, states, upper_state, lower_state)

Cthulhu.calculate.compute_line_intensity_EXOMOL(A_trans, g_state, E_state, nu_0_trans, T, Q_T, states, upper_state, lower_state)

Cthulhu.calculate.compute_line_intensity_HITRAN(S_ref, Q_T, Q_ref, T_ref, T, E_low, nu_0)

Cthulhu.calculate.compute_line_intensity_VALD(gf, E_low, nu_0, T, Q_T)

Cthulhu.calculate.compute_line_intensity(A, g_upper, E_lower, nu_0, T, Q)

Cthulhu.calculate.compute_cross_section(sigma, nu_grid, nu_0, cutoffs, S, J_lower, J_broad_all, alpha, log_alpha, alpha_sampled, log_alpha_sampled, N_Voigt, Voigt_arr, dV_da_arr, dV_dnu_arr, dnu_Voigt, dnu_out)

Cthulhu.calculate.compute_cross_section_atom(sigma, nu_grid, nu_0, S, cutoffs, N_Voigt, Voigt_arr)

Cthulhu.calculate.compute_cross_section_atom_OLD(sigma, N_grid, nu_0, nu_detune, nu_fine_start, nu_fine_end, S, T, alpha, gamma, cutoffs, N_Voigt_points, species_ID, nu_min, nu_max)

Cthulhu.calculate.find_J_low(J, states, lower_state)

Find the lower angular momentum quantum number corresponding to each lower state.

Cthulhu.calculate.cross_section_EXOMOL(linelist_files, input_directory, nu_grid, sigma, alpha_sampled, m, T, Q_T, states, g_arr, E_arr, J_arr, J_max, J_broad_all, N_Voigt, cutoffs, Voigt_arr, dV_da_arr, dV_dnu_arr, dnu_Voigt, S_cut, verbose)

Cthulhu.calculate.cross_section_HITRAN(linelist_files, input_directory, nu_grid, sigma, alpha_sampled, m, T, Q_T, Q_ref, J_max, J_broad_all, N_Voigt, cutoffs, Voigt_arr, dV_da_arr, dV_dnu_arr, dnu_Voigt, S_cut, verbose)

Cthulhu.calculate.produce_total_cross_section_VALD_atom(nu_grid, sigma, nu_0_in, E_low, gf, m, T, Q_T, N_Voigt, cutoffs, Voigt_arr, S_cut)

Cthulhu.calculate.bin_cross_section_atom(sigma_fine, sigma_out, nu_fine_start, nu_fine_end, nu_out, N_fine, N_out, option)