Skip to main content
Commonmark migration
Source Link

Given a list of variables $u_1,\dots,u_m\in\mathbb R$ and $v_1,\dots,v_n\in\mathbb R$ the standard convolution is defined

$$U*V(t)={\sum_{i}} u_iv_{t-i}.$$

Given a list of vectors $u_1,\dots,u_m\in\mathbb R^d$ and $v_1,\dots,v_n\in\mathbb R^d$ define vector-convolution $$U*V(t)={\sum_{i}}u_iv_{t-i}^T.$$

  1. Is there a Fourier transform for this convolutions that converts this to a 'product' $\widetilde U(f)\cdot\widetilde V(f)$ from which we can perform inverse fourier transform to get the convolution?

    Is there a Fourier transform for this convolutions that converts this to a 'product' $\widetilde U(f)\cdot\widetilde V(f)$ from which we can perform inverse fourier transform to get the convolution?

  2. Can we replace $u_iv_{t-i}^T$ by a polynomial or a rational function with $u_i,v_i\in\mathbb R^d$ arguments ($2d$ variables)?

  1. Can we replace $u_iv_{t-i}^T$ by a polynomial or a rational function with $u_i,v_i\in\mathbb R^d$ arguments ($2d$ variables)?

Do these admit $FFT$`s?

Given a list of variables $u_1,\dots,u_m\in\mathbb R$ and $v_1,\dots,v_n\in\mathbb R$ the standard convolution is defined

$$U*V(t)={\sum_{i}} u_iv_{t-i}.$$

Given a list of vectors $u_1,\dots,u_m\in\mathbb R^d$ and $v_1,\dots,v_n\in\mathbb R^d$ define vector-convolution $$U*V(t)={\sum_{i}}u_iv_{t-i}^T.$$

  1. Is there a Fourier transform for this convolutions that converts this to a 'product' $\widetilde U(f)\cdot\widetilde V(f)$ from which we can perform inverse fourier transform to get the convolution?
  1. Can we replace $u_iv_{t-i}^T$ by a polynomial or a rational function with $u_i,v_i\in\mathbb R^d$ arguments ($2d$ variables)?

Do these admit $FFT$`s?

Given a list of variables $u_1,\dots,u_m\in\mathbb R$ and $v_1,\dots,v_n\in\mathbb R$ the standard convolution is defined

$$U*V(t)={\sum_{i}} u_iv_{t-i}.$$

Given a list of vectors $u_1,\dots,u_m\in\mathbb R^d$ and $v_1,\dots,v_n\in\mathbb R^d$ define vector-convolution $$U*V(t)={\sum_{i}}u_iv_{t-i}^T.$$

  1. Is there a Fourier transform for this convolutions that converts this to a 'product' $\widetilde U(f)\cdot\widetilde V(f)$ from which we can perform inverse fourier transform to get the convolution?

  2. Can we replace $u_iv_{t-i}^T$ by a polynomial or a rational function with $u_i,v_i\in\mathbb R^d$ arguments ($2d$ variables)?

Do these admit $FFT$`s?

Bumped by Community user
added 27 characters in body; edited title
Source Link
Turbo
  • 1
  • 1
  • 29
  • 82

Is there (fast) fourier transform for vector convolution?

Given a list of variables $u_1,\dots,u_m\in\mathbb R$ and $v_1,\dots,v_n\in\mathbb R$ the standard convolution is defined

$$U*V(t)={\sum_{i}} u_iv_{t-i}.$$

Given a list of vectors $u_1,\dots,u_m\in\mathbb R^d$ and $v_1,\dots,v_n\in\mathbb R^d$ define vector-convolution $$U*V(t)={\sum_{i}}u_iv_{t-i}^T.$$

  1. Is there a Fourier transform for this convolutions that converts this to a 'product' $\widetilde U(f)\cdot\widetilde V(f)$ from which we can perform inverse fourier transform to get the convolution?
  1. Can we replace $u_iv_{t-i}^T$ by a polynomial or a rational function with $u_i,v_i\in\mathbb R^d$ arguments ($2d$ variables)?

Do these admit $FFT$`s?

Is there fourier transform for vector convolution?

Given a list of variables $u_1,\dots,u_m\in\mathbb R$ and $v_1,\dots,v_n\in\mathbb R$ the standard convolution is defined

$$U*V(t)={\sum_{i}} u_iv_{t-i}.$$

Given a list of vectors $u_1,\dots,u_m\in\mathbb R^d$ and $v_1,\dots,v_n\in\mathbb R^d$ define vector-convolution $$U*V(t)={\sum_{i}}u_iv_{t-i}^T.$$

  1. Is there a Fourier transform for this convolutions that converts this to a 'product' $\widetilde U(f)\cdot\widetilde V(f)$ from which we can perform inverse fourier transform to get the convolution?
  1. Can we replace $u_iv_{t-i}^T$ by a polynomial or a rational function with $u_i,v_i\in\mathbb R^d$ arguments ($2d$ variables)?

Is there (fast) fourier transform for vector convolution?

Given a list of variables $u_1,\dots,u_m\in\mathbb R$ and $v_1,\dots,v_n\in\mathbb R$ the standard convolution is defined

$$U*V(t)={\sum_{i}} u_iv_{t-i}.$$

Given a list of vectors $u_1,\dots,u_m\in\mathbb R^d$ and $v_1,\dots,v_n\in\mathbb R^d$ define vector-convolution $$U*V(t)={\sum_{i}}u_iv_{t-i}^T.$$

  1. Is there a Fourier transform for this convolutions that converts this to a 'product' $\widetilde U(f)\cdot\widetilde V(f)$ from which we can perform inverse fourier transform to get the convolution?
  1. Can we replace $u_iv_{t-i}^T$ by a polynomial or a rational function with $u_i,v_i\in\mathbb R^d$ arguments ($2d$ variables)?

Do these admit $FFT$`s?

added 27 characters in body
Source Link
Turbo
  • 1
  • 1
  • 29
  • 82

Given a list of variables $u_1,\dots,u_m\in\mathbb R$ and $v_1,\dots,v_n\in\mathbb R$ the standard convolution is defined

$$U*V(t)={\sum_{i}} u_iv_{t-i}.$$

Given a list of vectors $u_1,\dots,u_m\in\mathbb R^d$ and $v_1,\dots,v_n\in\mathbb R^d$ define vector-convolution $$U*V(t)={\sum_{i}}{\langle u_i,v_{t-i}\rangle}.$$$$U*V(t)={\sum_{i}}u_iv_{t-i}^T.$$

  1. Is there a Fourier transform for this convolutions that converts this to a 'product' $\widetilde U(f)\cdot\widetilde V(f)$ from which we can perform inverse fourier transform to get the convolution?
  1. Can we replace $\langle\cdot,\cdot\rangle$$u_iv_{t-i}^T$ by a polynomial or a rational function with $u_i,v_i\in\mathbb R^d$ arguments ($2d$ variables)?

Given a list of variables $u_1,\dots,u_m\in\mathbb R$ and $v_1,\dots,v_n\in\mathbb R$ the standard convolution is defined

$$U*V(t)={\sum_{i}} u_iv_{t-i}.$$

Given a list of vectors $u_1,\dots,u_m\in\mathbb R^d$ and $v_1,\dots,v_n\in\mathbb R^d$ define vector-convolution $$U*V(t)={\sum_{i}}{\langle u_i,v_{t-i}\rangle}.$$

  1. Is there a Fourier transform for this convolutions that converts this to a 'product' $\widetilde U(f)\cdot\widetilde V(f)$ from which we can perform inverse fourier transform to get the convolution?
  1. Can we replace $\langle\cdot,\cdot\rangle$ by a polynomial or a rational function?

Given a list of variables $u_1,\dots,u_m\in\mathbb R$ and $v_1,\dots,v_n\in\mathbb R$ the standard convolution is defined

$$U*V(t)={\sum_{i}} u_iv_{t-i}.$$

Given a list of vectors $u_1,\dots,u_m\in\mathbb R^d$ and $v_1,\dots,v_n\in\mathbb R^d$ define vector-convolution $$U*V(t)={\sum_{i}}u_iv_{t-i}^T.$$

  1. Is there a Fourier transform for this convolutions that converts this to a 'product' $\widetilde U(f)\cdot\widetilde V(f)$ from which we can perform inverse fourier transform to get the convolution?
  1. Can we replace $u_iv_{t-i}^T$ by a polynomial or a rational function with $u_i,v_i\in\mathbb R^d$ arguments ($2d$ variables)?
deleted 314 characters in body; edited title
Source Link
Turbo
  • 1
  • 1
  • 29
  • 82
Loading
added 505 characters in body; edited tags
Source Link
Turbo
  • 1
  • 1
  • 29
  • 82
Loading
Post Undeleted by Turbo
Post Deleted by Turbo
Source Link
Turbo
  • 1
  • 1
  • 29
  • 82
Loading