Answers are grounded in this paper and cite their sources.
We consider the convolution equation <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"><m:mi>F</m:mi><m:mo>*</m:mo><m:mi>X</m:mi><m:mo>=</m:mo><m:mi>B</m:mi></m:math> F* X=B , where <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"><m:mi>F</m:mi><m:mo>∈</m:mo><m:msup><m:mrow><m:mi mathvariant="double-struck">R</m:mi></m:mrow><m:mrow><m:mn>3</m:mn><m:mo>×</m:mo><m:mn>3</m:mn></m:mrow></m:msup></m:math> F∈ {{R}}3× 3 and <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"><m:mi>B</m:mi><m:mo>∈</m:mo><m:msup><m:mrow><m:mi mathvariant="double-struck">R</m:mi></m:mrow><m:mrow><m:mi>m</m:mi><m:mo>×</m:mo><m:mi>n</m:mi></m:mrow></m:msup></m:math> B∈ {{R}}m× n are given and <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"><m:mi>X</m:mi><m:mo>∈</m:mo><m:msup><m:mrow><m:mi mathvariant="double-struck">R</m:mi></m:mrow><m:mrow><m:mi>m</m:mi><m:mo>×</m:mo><m:mi>n</m:mi></m:mrow></m:msup></m:math> X∈ {{R}}m× n is to be determined. The convolution equation can be regarded as a linear system with a coefficient matrix of special structure. This fact has led to many studies including efficient numerical algorithms for solving the convolution equation. In this study, we show that the convolution equation can be represented as a generalized Sylvester equation. Furthermore, for some realistic examples arising from image processing, we show that the generalized Sylvester equation can be reduced to a simpler form, and we analyze the unique solvability of the convolution equation.
No takes yet. Share an insight, caveat, or question.
Satake et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: