Splitting Circle Overview

09/12/2022

∙

This paper derives numerical bounds for and implements the splitting circle method for finding roots of a univariate polynomial in the presence of fixed precision.

READ FULL TEXT

Splitting Circle Overview

The operator-splitting method for Cahn-Hilliard is stable

A note on data splitting with e-values: online appendix to my comment on Glenn Shafer's "Testing by betting"

Improved uniform error bounds on time-splitting methods for the long-time dynamics of the weakly nonlinear Dirac equation

Conservation laws with discontinuous flux function on networks: a splitting algorithm

Sampling Conditionally on a Rare Event via Generalized Splitting

Analyzing the Structure of Mondrian's 1920-1940 Compositions

Steepest Descent Neural Architecture Optimization: Escaping Local Optimum with Signed Neural Splitting

Splitting Circle Overview

Related Research

The operator-splitting method for Cahn-Hilliard is stable

A note on data splitting with e-values: online appendix to my comment on Glenn Shafer's "Testing by betting"

Improved uniform error bounds on time-splitting methods for the long-time dynamics of the weakly nonlinear Dirac equation

Conservation laws with discontinuous flux function on networks: a splitting algorithm

Sampling Conditionally on a Rare Event via Generalized Splitting

Analyzing the Structure of Mondrian's 1920-1940 Compositions

Steepest Descent Neural Architecture Optimization: Escaping Local Optimum with Signed Neural Splitting