Fractal-like matrices

DOI10.1007/S00607-005-0138-YMaRDI QIDQ817032zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

Publication date 2 March 2006

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00607-005-0138-y

zbMATH Keywords

fractal-like matricesmatrix multiplication and inversionmatrix ringrecurrence equationsSierpinski trianglesparse matrixstorage scheme

Mathematics Subject Classification ID

Hermitian, skew-Hermitian, and related matrices (15B57) Fractals (28A80) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20)

Review text

The authors define the set of \(n\)-ordered fractal-like matrices \(F_n\), for each \(n=2^k\), inductively: \(F_{2^0}:={\mathbf R}^{1\times 1}\) and for each \(k>0\), \(f_{2^k}=\left\{\left[\begin{smallmatrix} A & B\\ 0 & C \end{smallmatrix}\right]:A,B,C\in F_{2{k-1}}\right\}\). As \(n\to\infty\) the structure of \(E_n\) reminds us of the Sierpinski triangle which is a famous fractal. It is shown that \(F_n\) is an algebra over \({\mathbf R}\) containing \(E_n\). The number of arithmetic operations required to add, multiply or invert fractal-like matrices is obtained recursively by solving recurrence equations. A special storage scheme is proposed that saves memory and is convenient for arithmetic operations.

Recommendations

• A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
• ON A CLASS OF FRACTAL MATRICES (I) EXCESS-MATRICES AND THEIR SELF-SIMILAR PROPERTIES
• Fast sparse matrix multiplication
• Algorithms – ESA 2004
• Fractal generalized Pascal matrices

Cites work

• scientific article; zbMATH DE number 194082 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• On the Complexity of Matrix Product

Cited in

(5)

• A Class of Sparse Unimodular Matrices Generating Multiresolution and Sampling Analysis for Data of Any Length
• scientific article; zbMATH DE number 1230481 (Why is no real title available?)
• A MATRIX METHOD FOR APPROXIMATING FRACTAL MEASURES
• A Class of Sparse Invertible Matrices and Their Use for Nonlinear Prediction of Nearly Periodic Time Series with Fixed Period
• Fractal structures from the band matrices for matrix algorithms

This page was built for publication: Fractal-like matrices

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