On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,694 papers · 148 categories

Trend · papers per month

count % of corpus

4 results for “time-parallel”

RandNet-Parareal: a time-parallel PDE solver using Random Neural Networksstat.CO

RandNet-Parareal uses neural networks to speed up time-parallel PDE solving.

problem Solving systems of time-dependent differential equations efficiently.

method Combines Parareal's sequential and parallel approach with random neural networks.

result Achieves up to 125x and 22x speedup compared to existing methods.

time-parallel PDE Parareal random neural networks speedup

2024-11-09abs ↗pdf ↗

Parallel-in-Time Probabilistic Numerical ODE Solversmath.NA

Parallel-in-time solver reduces ODE simulation time from linear to logarithmic.

problem Efficiently solving ordinary differential equations (ODEs) with reduced computational cost.

method Formulated a parallel-in-time probabilistic numerical ODE solver using time-parallel formulation of iterated extended Kalman smoothers.

result Reduces span cost from linear to logarithmic in the number of time steps.

ODEs parallel-in-time probabilistic numerical solvers Bayesian filtering Kalman smoothing

2023-10-02abs ↗pdf ↗

Differentiable Multiple Shooting Layerscs.LG

MSLs use parallelizable root-finding for efficient ODE and PDE solutions.

problem Efficiently solving initial value problems for ODEs and PDEs.

method Leveraging time-parallel methods, MSLs use parallelizable root-finding algorithms.

result MSLs offer significant speedups in NFEs and inference time.

neural networks differential equations optimization control sequence generation

2021-06-07abs ↗pdf ↗

A parallel algorithm for the computation of the Jones polynomialmath.GT

Parallel algorithm speeds up Jones polynomial computation.

problem Efficient computation of knot complexity measures.

method First parallel algorithm for exact Jones polynomial computation.

result Reduces computational time by an exponential factor.

Jones polynomial parallel algorithm knot theory topological invariants exponential time

2025-05-29abs ↗pdf ↗