No label defined (Q3769857)

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 4028752
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4028752

      Statements

      0 references
      1987
      0 references
      array and vector processors
      0 references
      parallel processors
      0 references
      sparse and very large systems
      0 references
      trees
      0 references
      computation of fast Fourier transform
      0 references
      algorithms
      0 references
      Matrix algebra algorithms
      0 references
      sparseness measures
      0 references
      [For the entire collection see Zbl 0621.00026.] Matrix algebra algorithms are discussed from the point of view of functional programming and highly parallel functional architectures. The author advocates the thesis that d-dimensional arrays should be represented by \(2^ d\)-ary trees. This idea, especially for the situation \(d=2\) and quadtrees, respectively, is demonstrated in some detail on several numerical algorithms (a pivot step algorithm, an FFT algorithm, etc.). New sparseness measures for matrices are introduced and motivated.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references