chirp_scan

Submodules

chirp_scan.classic_algorithms_chirpscan module

class chirp_scan.classic_algorithms_chirpscan.MIIPS(theta, frequency, measured_trace, nonlinear_method, phase_type=None, chirp_parameters=None, **kwargs)[source]

Bases: ClassicAlgorithmsBASE, RetrievePulsesCHIRPSCAN

The (improoved)-MIIPS Algorithm. Doesnt seem to work though.

  1. Comin et al., Opt. Express 24, 2505-2512 (2016)

integration_method

the integration method to use, can be cumsum or euler_maclaurin_k

Type:

str

integration_order

the order to which euler_maclaurin is performed. Is infered from integration_method.

Type:

None, int

global_gamma

the step size

Type:

float

calc_approximate_phase_individual(trace, measurement_info, descent_info)[source]
update_individual(individual, phase_prime, measurement_info, descent_info)[source]
step(descent_state, measurement_info, descent_info)[source]
initialize_run(population)[source]
class chirp_scan.classic_algorithms_chirpscan.Basic(theta, frequency, measured_trace, nonlinear_method, phase_type=None, chirp_parameters=None, **kwargs)[source]

Bases: ClassicAlgorithmsBASE, RetrievePulsesCHIRPSCAN

The Basic Reconstruction Algorithm.

  1. Miranda et al., J. Opt. Soc. Am. B 34, 190-197 (2017)

update_pulse(signal_t_new, gate, phase_matrix, nonlinear_method, sk, rn)[source]

Creates an updated guess for the pulse.

step(descent_state, measurement_info, descent_info)[source]

Performs one iteration of the Basic Algorithm.

Parameters:
  • descent_state – Pytree,

  • measurement_info – Pytree,

  • descent_info – Pytree,

Returns:

tuple[Pytree, jnp.array], the updated descent state and the current errors

initialize_run(population)[source]

Prepares all provided data and parameters for the reconstruction. Here the final shape/structure of descent_state, measurement_info and descent_info are determined.

Parameters:

population – Pytree, the initial guess as created by self.create_initial_population()

Returns:

tuple[Pytree, Callable], the initial descent state and the step-function of the algorithm.

class chirp_scan.classic_algorithms_chirpscan.GeneralizedProjection(theta, frequency, measured_trace, nonlinear_method, phase_type=None, chirp_parameters=None, **kwargs)[source]

Bases: GeneralizedProjectionBASE, RetrievePulsesCHIRPSCAN

Implements the Generalized Projection Algorithm.

    1. DeLong et al., Opt. Lett. 19, 2152-2154 (1994)

no_steps_descent

the numer of descent steps per iteration

Type:

int

optimize_spectral_phase_directly
Type:

bool

calculate_Z_gradient_individual(signal_t, signal_t_new, phase_matrix, measurement_info, pulse_or_gate)[source]

Calculates the Z-error gradient for an individual.

calculate_Z_newton_direction(grad, signal_t_new, signal_t, phase_matrix, descent_state, measurement_info, descent_info, full_or_diagonal, pulse_or_gate)[source]

Calculates the Z-error newton direction for a population.

class chirp_scan.classic_algorithms_chirpscan.PtychographicIterativeEngine(theta, frequency, measured_trace, nonlinear_method, phase_type=None, chirp_parameters=None, **kwargs)[source]

Bases: PtychographicIterativeEngineBASE, RetrievePulsesCHIRPSCAN

Implements a version of the Ptychographic Iterative Engine (PIE).

A. Maiden et al., Optica 4, 736-745 (2017) T. Schweizer, “Time-Domain Ptychography and its Applications in Ultrafast Science”, PhD Thesis, Bern (2021)

alpha

a regularization parameter

Type:

float

pie_method

specifies the PIE variant. Can be one of None, PIE, ePIE, rPIE. Where None indicates that the pure gradient is used.

Type:

None, str

optimize_spectral_phase_directly
Type:

bool

reverse_transform_grad(signal, phase_matrix, measurement_info)[source]

For Chirp-Scan the effects of the phase matrix have to be undone to obtain the actual PIE-direction.

calculate_PIE_descent_direction_m(signal_t, signal_t_new, phase_matrix_m, pie_method, measurement_info, descent_info, pulse_or_gate)[source]

Calculates the PIE direction for a given shift.

calculate_PIE_newton_direction(grad, signal_t, phase_matrix, measured_trace, local_or_global_state, measurement_info, descent_info, pulse_or_gate, local_or_global)[source]

Calculates the PIE newton direction for a population.

class chirp_scan.classic_algorithms_chirpscan.COPRA(theta, frequency, measured_trace, nonlinear_method, phase_type=None, chirp_parameters=None, **kwargs)[source]

Bases: COPRABASE, RetrievePulsesCHIRPSCAN

Implements a version of the Common Pulse Retrieval Algorithm (COPRA).

    1. Geib et al., Optica 6, 495-505 (2019)

get_Z_gradient_individual(signal_t, signal_t_new, phase_matrix, measurement_info, pulse_or_gate)[source]

Calculates the Z-error gradient for an individual.

get_Z_newton_direction(grad, signal_t, signal_t_new, phase_matrix, local_or_global_state, measurement_info, descent_info, full_or_diagonal, pulse_or_gate)[source]

Calculates the Z-error newton direction for a population.

class chirp_scan.classic_algorithms_chirpscan.LSF(theta, frequency, measured_trace, nonlinear_method, phase_type=None, chirp_parameters=None, **kwargs)[source]

Bases: LSFBASE, RetrievePulsesCHIRPSCAN

Implements a version of the Linesearch FROG Algorithm (LSF). Despite its name the algorithm is NOT restricted to FROG.

    1. Krook and V. Pasiskevicius, Opt. Express 33, 33258-33269 (2025)

no_sections

number of sections to split the search line into

Type:

int

number_of_disection_iterations

as the name says

Type:

int

direction_mode

can be random or continuous

Type:

str

ratio_points_for_continuous

smaller value means more randomness/eratic

Type:

int

only_allow_improvements

if true, only steps that decrease the error will be accepted

Type:

bool

chirp_scan.general_algorithms_chirpscan module

class chirp_scan.general_algorithms_chirpscan.DifferentialEvolution(theta, frequency, measured_trace, nonlinear_method, phase_type=None, chirp_parameters=None, strategy='best1_bin', selection_mechanism='greedy', mutation_rate=0.5, crossover_rate=0.7, **kwargs)[source]

Bases: DifferentialEvolutionBASE, RetrievePulsesCHIRPSCAN

Implements a Differential-Evolution Algorithm. Based on Qiang, J., Mitchell, C., A Unified Differential Evolution Algorithm for Global Optimization, 2014, https://www.osti.gov/servlets/purl/1163659

strategy

the mutation and selection strategy, analogous to scipy’s differential evolution.

Type:

str

mutation_rate

the mutation rate

Type:

float

crossover_rate

the crossover rate

Type:

float

selection_mechanism

the selection mechanism, can be greedy or global, defined in select_population().

Type:

str

temperature

a temperature value for the global selection mechanism

Type:

float

class chirp_scan.general_algorithms_chirpscan.Evosax(theta, frequency, measured_trace, nonlinear_method, phase_type=None, chirp_parameters=None, solver=None, **kwargs)[source]

Bases: EvosaxBASE, RetrievePulsesCHIRPSCAN

Employs the evosax package to perform the optimization.

Robert Tjarko Lange, evosax: JAX-based Evolution Strategies, arXiv preprint arXiv:2212.04180 (2022)

solver

any evosax-solver should work

Type:

evosax-solver

solver_params

user defined parameters for the evosax-solver, if None the default params set in evosax are used

Type:

any

solver_kwargs

some evosax-solver require additional input arguments. These can be supplied via this aattribute.

Type:

dict

class chirp_scan.general_algorithms_chirpscan.AutoDiff(theta, frequency, measured_trace, nonlinear_method, phase_type=None, chirp_parameters=None, solver=None, **kwargs)[source]

Bases: AutoDiffBASE, RetrievePulsesCHIRPSCAN

Employs the optimistix package to perform the optimization via Automatic-Differentiation.

J. Rader, T. Lyons and P.Kidger, Optimistix: modular optimisation in JAX and Equinox, arXiv:2402.09983 (2024) DeepMind et al., The DeepMind JAX Ecosystem, http://github.com/google-deepmind (2020)

solver

solvers need to be initialized

Type:

optimistix-solver, optax-solver

alternating_optimization

if true, the optimizer alternates between amplitude and phase

Type:

bool

optimize_group_delay

if true, the group delay will be optimized instead of the spectral phase

Type:

bool

Module contents