Sparse orthogonal matrices and the Haar wavelet

DOI10.1016/S0166-218X(99)00182-1MaRDI QIDQ1975364zbMATH OpenWikidataFDO

Authors Gi-Sang Cheon, Bryan L. Shader

Publication date 10 February 2002

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0166-218X(99)00182-1

zbMATH Keywords

Haar waveletsparse orthogonal matrices

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical methods for wavelets (65T60)

Review text

The authors discuss the sparsity of orthogonal matrices which have a column of nonzero entries. It is shown that the minimun number of nonzero entries in such a matrix of size \(m\times m\) is \[ (\lfloor m\rfloor +3)m-2^{\lfloor m\rfloor+1}. \] This is optimal, as the paper characterizes the matrices which achieve this number. It turns out that this is related to the orthogonal Haar wavelet matrix. The analogous sparsity of \(m\times n\) row-orthogonal matrices is studied.

Recommendations

• scientific article; zbMATH DE number 1300134
• Sparsity of orthogonal matrices with restrictions
• Sparse orthogonal matrices.

Cites work

• A simple proof of Fiedler's conjecture concerning orthogonal matrices
• How sparse can a matrix with orthogonal rows be?
• Ten Lectures on Wavelets

Cited in

(5)

• Sparse orthogonal matrices.
• Sparsity of orthogonal matrices with restrictions
• Boolean invertible matrices identified from two permutations and their corresponding Haar-type matrices
• Sparse data structure design for wavelet-based methods
• Improved algorithm about NSFOT

This page was built for publication: Sparse orthogonal matrices and the Haar wavelet

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