Fast Multiresolution Algorithms for Matrix-Vector Multiplication

Abstract

In this paper we present a class of multiresolution algorithms for fast application of structured dense matrices to arbitrary vectors, which includes the fast wavelet transform of Beylkin, Coifman and Rokhlin and the multilevel matrix multiplication of Brandt and Lubrecht. In designing these algorithms we first apply data compression techniques to the matrix and then show how to compute the desired matrix-vector multiplication from the compressed form of the matrix. In describing this class we pay special attention to an algorithm which is based on discretization by cell-averages as it seems to be suitable for discretization of integral transforms with integrably singular kernels. multiresolution analysis; fast matrix vector multiplication.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1992
Accession Number
ADA257888

Entities

People

  • Ami Harten
  • Itai Yad-shalom

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Abstracts
  • Accuracy
  • Aeronautics
  • Algorithms
  • Boundaries
  • Coefficients
  • Compression
  • Computers
  • Convergence
  • Data Compression
  • Engineering
  • Equations
  • Integral Transforms
  • Integrals
  • Interpolation
  • Mathematics
  • Numerical Analysis

Readers

  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Image Processing and Computer Vision.
  • Linear Algebra