We have a 2D order-2 polynomial, a Gaussian and a 'box' indicator function. Let:

$\begin{eqnarray} p(x,y) &=& c_0+c_1x+c_2y+c_3xy+c_4x^2+c_5y^2+c_6xy^2 \\ G(x,y) &=& c_k\cdot\exp\left(\frac{-(x^2+y^2)}{2\sigma^2}\right) \\ \square_a(x,y) &=& \mathbf{1}_{[-a,a]\times[-a,a]}(x,y) \end{eqnarray}$

all functions of reals, all real constants, and $a,\sigma>0$.

Let $\otimes$ denote convolution, and $\mathcal{F\{\dots\}}$ denote the Fourier transform.

Is there a "closed form" for the deconvolution of $\square_a\otimes G$ from $p$ (when $\mathcal{F}\{\square_a\otimes G\}$ is away from 0)? In other words, can the following expression be significantly reduced:

$$\mathcal{F}^{-1}\left\lbrace\frac{\mathcal{F}\{p(x,y)\}}{\mathcal{F}\{\square_a\}\cdot \mathcal{F}\{G\}}\right\rbrace $$

I am trying to start computing this in Maple.

This looks like the inverse Fourier transform of a bunch of derivatives delta functions divided by a sinc scaled by a Gaussian. Is there any reason to believe that this has a nice closed form? If so, is there a better way of performing the deconvolution?

Thank you very much

EDIT: Amazingly, Maple says its nothing but a polynomial!

$$-\frac{1}{24\pi c_k a^2 \sigma^2}\cdot \left[c_4\cdot(3\sigma^2+a^2-3x^2)+c_5(-3y^2+3\sigma^2+a^2)-3c_0+3c_1x+3c_2y\right]$$

We have a 2D order-2 polynomial, a Gaussian and a 'box' indicator function. Let:

$\begin{eqnarray} p(x,y) &=& c_0+c_1x+c_2y+c_3xy+c_4x^2+c_5y^2+c_6xy^2 \\ G(x,y) &=& c_k\cdot\exp\left(\frac{-(x^2+y^2)}{2\sigma^2}\right) \\ \square_a(x,y) &=& \mathbf{1}_{[-a,a]\times[-a,a]}(x,y) \end{eqnarray}$

all functions of reals, all real constants, and $a,\sigma>0$.

Let $\otimes$ denote convolution, and $\mathcal{F\{\dots\}}$ denote the Fourier transform.

Is there a "closed form" for the deconvolution of $\square_a\otimes G$ from $p$ (when $\mathcal{F}\{\square_a\otimes G\}$ is away from 0)? In other words, can the following expression be significantly reduced:

$$\mathcal{F}^{-1}\left\lbrace\frac{\mathcal{F}\{p(x,y)\}}{\mathcal{F}\{\square_a\}\cdot \mathcal{F}\{G\}}\right\rbrace $$

I am trying to start computing this in Maple.

This looks like the inverse Fourier transform of a bunch of derivatives delta functions divided by a sinc scaled by a Gaussian. Is there a better way of performing the deconvolution?

Thank you very much

EDIT: Maple says its nothing but a polynomial

$$-\frac{1}{8}\frac{(c_4+c_5)\cdot \sigma^2-c_0}{\pi\cdot c_g\cdot \sigma^2\cdot a^2}$$

We have a 2D order-2 polynomial, a Gaussian and a 'box' indicator function. Let:

$\begin{eqnarray} p(x,y) &=& c_0+c_1x+c_2y+c_3xy+c_4x^2+c_5y^2+c_6xy^2 \\ G(x,y) &=& c_k\cdot\exp\left(\frac{-(x^2+y^2)}{2\sigma^2}\right) \\ \square_a(x,y) &=& \mathbf{1}_{[-a,a]\times[-a,a]}(x,y) \end{eqnarray}$

all functions of reals, all real constants, and $a,\sigma>0$.

Let $\otimes$ denote convolution, and $\mathcal{F\{\dots\}}$ denote the Fourier transform.

Is there a "closed form" for the deconvolution of $\square_a\otimes G$ from $p$ (when $\mathcal{F}\{\square_a\otimes G\}$ is away from 0)? In other words, can the following expression be significantly reduced:

$$\mathcal{F}^{-1}\left\lbrace\frac{\mathcal{F}\{p(x,y)\}}{\mathcal{F}\{\square_a\}\cdot \mathcal{F}\{G\}}\right\rbrace $$

I am trying to start computing this in Maple.

This looks like the inverse Fourier transform of a bunch of derivatives delta functions divided by a sinc scaled by a Gaussian. Is there any reason to believe that this has a nice closed form? If so, is there a better way of performing the deconvolution?

Thank you very much

EDIT: Amazingly, Maple says its nothing but a polynomial quotient!

$$\frac{-1}{24\pi}\cdot \frac{c_4\cdot(3\sigma^2+a^2-3x^2)+c_5(-3y^2+3\sigma^2+a^2)-3c_0+3c_1x+3c_2y}{a^2c_k\sigma^2}$$

We have a 2D order-2 polynomial, a Gaussian and a 'box' indicator function. Let:

$\begin{eqnarray} p(x,y) &=& c_0+c_1x+c_2y+c_3xy+c_4x^2+c_5y^2+c_6xy^2 \\ G(x,y) &=& c_k\cdot\exp\left(\frac{-(x^2+y^2)}{2\sigma^2}\right) \\ \square_a(x,y) &=& \mathbf{1}_{[-a,a]\times[-a,a]}(x,y) \end{eqnarray}$

all functions of reals, all real constants, and $a,\sigma>0$.

Let $\otimes$ denote convolution, and $\mathcal{F\{\dots\}}$ denote the Fourier transform.

Is there a "closed form" for the deconvolution of $\square_a\otimes G$ from $p$ (when $\mathcal{F}\{\square_a\otimes G\}$ is away from 0)? In other words, can the following expression be significantly reduced:

$$\mathcal{F}^{-1}\left\lbrace\frac{\mathcal{F}\{p(x,y)\}}{\mathcal{F}\{\square_a\}\cdot \mathcal{F}\{G\}}\right\rbrace $$

I am trying to start computing this in Maple.

This looks like the inverse Fourier transform of a bunch of derivatives delta functions divided by a sinc scaled by a Gaussian. Is there any reason to believe that this has a nice closed form? If so, is there a better way of performing the deconvolution?

Thank you very much

EDIT: Amazingly, Maple says its nothing but a polynomial!

$$-\frac{1}{24\pi c_k a^2 \sigma^2}\cdot \left[c_4\cdot(3\sigma^2+a^2-3x^2)+c_5(-3y^2+3\sigma^2+a^2)-3c_0+3c_1x+3c_2y\right]$$

We have a 2D order-2 polynomial, a Gaussian and a 'box' indicator function. Let:

$\begin{eqnarray} p(x,y) &=& c_0+c_1x+c_2y+c_3xy+c_4x^2y \\ G(x,y) &=& \exp\left(\frac{-(x^2+y^2)}{2\sigma^2}\right) \\ \square_a(x,y) &=& \mathbf{1}_{[-a,a]\times[-a,a]}(x,y) \end{eqnarray}$

all functions of reals, all real constants, and $a,\sigma>0$.

Let $\otimes$ denote convolution, and $\mathcal{F\{\dots\}}$ denote the Fourier transform.

Is there a "closed form" for the deconvolution of $\square_a\otimes G$ from $p$ (when $\mathcal{F}\{\square_a\otimes G\}$ is away from 0)? In other words, can the following expression be significantly reduced:

$$\mathcal{F}^{-1}\left\lbrace\frac{\mathcal{F}\{p(x,y)\}}{\mathcal{F}\{\square_a\}\cdot \mathcal{F}\{G\}}\right\rbrace $$

I am trying to start computing this in Maple.

This looks like the inverse Fourier transform of a bunch of derivatives delta functions divided by a sinc scaled by a Gaussian. Is there any reason to believe that this has a nice closed form? If so, is there a better way of performing the deconvolution?

Thank you very much

We have a 2D order-2 polynomial, a Gaussian and a 'box' indicator function. Let:

$\begin{eqnarray} p(x,y) &=& c_0+c_1x+c_2y+c_3xy+c_4x^2+c_5y^2+c_6xy^2 \\ G(x,y) &=& c_k\cdot\exp\left(\frac{-(x^2+y^2)}{2\sigma^2}\right) \\ \square_a(x,y) &=& \mathbf{1}_{[-a,a]\times[-a,a]}(x,y) \end{eqnarray}$

all functions of reals, all real constants, and $a,\sigma>0$.

Let $\otimes$ denote convolution, and $\mathcal{F\{\dots\}}$ denote the Fourier transform.

Is there a "closed form" for the deconvolution of $\square_a\otimes G$ from $p$ (when $\mathcal{F}\{\square_a\otimes G\}$ is away from 0)? In other words, can the following expression be significantly reduced:

$$\mathcal{F}^{-1}\left\lbrace\frac{\mathcal{F}\{p(x,y)\}}{\mathcal{F}\{\square_a\}\cdot \mathcal{F}\{G\}}\right\rbrace $$

I am trying to start computing this in Maple.

This looks like the inverse Fourier transform of a bunch of derivatives delta functions divided by a sinc scaled by a Gaussian. Is there any reason to believe that this has a nice closed form? If so, is there a better way of performing the deconvolution?

Thank you very much

EDIT: Amazingly, Maple says its nothing but a polynomial quotient!

$$\frac{-1}{24\pi}\cdot \frac{c_4\cdot(3\sigma^2+a^2-3x^2)+c_5(-3y^2+3\sigma^2+a^2)-3c_0+3c_1x+3c_2y}{a^2c_k\sigma^2}$$