Pith. sign in

REVIEW

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2112.01014 v1 pith:CFXFECKB submitted 2021-12-02 math.NA cs.NA

Constructive approach to the monotone rearrangement of functions

classification math.NA cs.NA
keywords functionsprocedurealgorithmcasemonotoneomegarearrangementsequence
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We detail a simple procedure (easily convertible to an algorithm) for constructing from quasi-uniform samples of $f$ a sequence of linear spline functions converging to the monotone rearrangement of $f$, in the case where $f$ is an almost everywhere continuous function defined on a bounded set $\Omega$ with negligible boundary. Under additional assumptions on $f$ and $\Omega$, we prove that the convergence of the sequence is uniform. We also show that the same procedure applies to arbitrary measurable functions too, but with the substantial difference that in this case the procedure has only a theoretical interest and cannot be converted to an algorithm.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.