Construction of group transforms subject to several performance criteria (Q3757262)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4007579
Language Label Description Also known as
default for all languages
No label defined
    English
    Construction of group transforms subject to several performance criteria
    scientific article; zbMATH DE number 4007579

      Statements

      Construction of group transforms subject to several performance criteria (English)
      0 references
      0 references
      1985
      0 references
      discrete Fourier transform
      0 references
      Walsh-Hadamard transform
      0 references
      fast Fourier transform
      0 references
      computational effectiveness
      0 references
      unitary transform
      0 references
      Hilbert- Schmidt norm
      0 references
      group matrices
      0 references
      computational complexity
      0 references
      fast Haar transform
      0 references
      A transform, L, is defined and studied subject to the two opposing performance criteria, computational effectiveness and accuracy of approximation of a given unitary transform measured in distance related to the Hilbert-Schmidt norm. The matrices which represent the L-transform constitute a special class of group matrices, which were introduced by Frobenius in 1895. These (n\(\times n)\)-matrices depend upon certain free parameters whose choice determines their behavior with respect to the two criteria. Hence, part of these parameters can be chosen to affect the computational performance of L whereas the other part is used to minimize its distance from a given unitary transform. The computational complexity of L is eased by making L sparse rather than a product of sparse matrices as in the FFT algorithm. It is shown that if only one of these two criteria is used then either all the parameters can be used to reduce the computational complexity of L to that of the fast Haar transform (in nontrivial cases) or else all of these parameters can be used to achieve (asymptotically) distance zero from a given unitary transform. If both criteria are used, then the more parameters that are used for one of them, the less parameters we have to deal with for the other one and vice versa - an inverse proportional dependence. Various examples are given.
      0 references

      Identifiers