Resumen
It is well known that ω" role="presentation">???
?
-circulant matrices with ω≠0" role="presentation" style="position: relative;">???0??0
?
?
0
can be simultaneously diagonalized by a transform matrix, which can be factored as the product of a diagonal matrix, depending on ω" role="presentation" style="position: relative;">???
?
, and of the unitary matrix Fn" role="presentation" style="position: relative;">????Fn
F
n
associated to the Fast Fourier Transform. Hence, all the sets of ω" role="presentation" style="position: relative;">???
?
-circulants form algebras whose computational power, in terms of complexity, is the same as the classical circulants with ω=1" role="presentation" style="position: relative;">??=1?=1
?
=
1
. However, stability is a delicate issue, since the condition number of the transform is equal to that of the diagonal part, tending to max{|ω|,|ω|−1}" role="presentation" style="position: relative;">max{|??|,|??|-1}max{|?|,|?|-1}
max
{
|
?
|
,
|
?
|
-
1
}
. For ω=0" role="presentation" style="position: relative;">??=0?=0
?
=
0
, the set of related matrices is still an algebra, which is the algebra of lower triangular matrices, but they do not admit a common transform since most of them (all except the multiples of the identity) are non-diagonalizable. In the present work, we review two modern applications, ranging from parallel computing in preconditioning of PDE approximations to algorithms for subdivision schemes, and we emphasize the role of such algebra. For the two problems, few numerical tests are conducted and critically discussed and the related conclusions are drawn.