6 problems

Let $P$ and $P^{\vee}$ be the projective spaces replacing the dual projective spaces in the Radon transform, and let $D(P)_{\boldsymbol\nu}$ and $D_{\boldsymbol\nu}$ be the corresp…

Katsevich's error estimate conjecture. The error term is $O(\epsilon^{1/2}\ln(1/\epsilon))$ as $\epsilon\to0$.

Let $\widehat{\mathbb{C}}^{n+1}$ and $\mathbb{C}^{n+1}$ be dual affine spaces, and let…

Computational complexity conjecture. Although the computational cost of the inversion could be high, it is conjectured to be

Computational-complexity conjecture. The computational cost of a DRT inversion for an $N\times N$ image is conjectured to be $\mathcal{O}(N^{5/2}\log N)$. This estimate concerns in…

Let $N\times N$ be the computational grid, and let the solution be computed using a forward discrete Radon transform (DRT), a one-dimensional local time-stepping (LTS) method, and…