Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Fast algorithms for computing symmetric/Hermitian matrix-vector products

Fast algorithms for computing symmetric/Hermitian matrix-vector products

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Electrical Engineers
Published

An efficient method for computing the product of an N × N symmetric/Hermitian matrix and a length-N vector is presented. About 50% of multiplications are reduced in comparison with direct computations, at the cost of a slightly increased number of additions.

Inspec keywords: signal processing; matrix algebra

Other keywords: fast algorithm; symmetric/Hermitian matrix; multiplications; matrix-vector products; additions

Subjects: Linear algebra (numerical analysis); Signal processing and detection; Information theory; Linear algebra (numerical analysis)

References

    1. 1)
      • Mou, Z.J.: `New 2-D symmetric FIR filter structures', Proc. IEEE Workshop on Visual Signal Processing and Communications, June 1991, Hsinchu Taiwan.
    2. 2)
      • H.J. Nussbaumer . (1982) , Fast Fourier transform and convolution algorithms.
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19910797
Loading

Related content

content/journals/10.1049/el_19910797
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address