scientific article; zbMATH DE number 4028752

From MaRDI portal
Publication:3769857





[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.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3769857)