Sparse data structure design for wavelet-based methods

DOI10.1051/PROC/201134005MaRDI QIDQ2880173zbMATH OpenOpenAlexFDO

Authors Guillaume Latu

Publication date 12 April 2012

Published in European Series in Applied and Industrial Mathematics (ESAIM): Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1051/proc/201134005

Mathematics Subject Classification ID

Numerical methods for wavelets (65T60) Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs (65M50)

Recommendations

• Adaptive wavelets for sparse representations of scattered data
• Efficient computation of sparse structures
• Data structures to vectorize CG algorithms for general sparsity patterns
• Wavelet based preconditioners for sparse linear systems
• Sparse orthogonal matrices and the Haar wavelet
• Fast Algorithms for Periodic Spline Wavelets on Sparse Grids
• A sparse data fast fourier transform (SDFFT)
• Basis selection for wavelet processing of sparse signals

Cited in

(2)

• Scalable angular adaptivity for Boltzmann transport
• Design of a wavelet based data mining technique

Describes a project that uses

Uses Software

• Stony Brook

This page was built for publication: Sparse data structure design for wavelet-based methods

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