3 papers
math.NA2026
A Memory-Efficient Adjoint State Optimization Method Based on Time-Reversible Dynamical Low-Rank Approximation
Lukas Einkemmer, Julian Mangott
The primary challenge of conducting PDE-constrained optimization for high-dimensional problems, such as kinetic equations, is the often prohibitive memory cost. Computing gradients…
math.NA2025
Automatic partitioning for the low-rank integration of stochastic Boolean reaction networks
Lukas Einkemmer, Julian Mangott, Martina Prugger
Boolean reaction networks are an important tool in biochemistry for studying mechanisms in the biological cell. However, the stochastic formulation of such networks requires the so…
math.NA2024
A hierarchical dynamical low-rank algorithm for the stochastic description of large reaction networks
Lukas Einkemmer, Julian Mangott, Martina Prugger
The stochastic description of chemical reaction networks with the kinetic chemical master equation (CME) is important for studying biological cells, but it suffers from the curse o…