Brownian matrices: properties and extensions

Brownian matrices arise in certain models used in digital signal processing. Fast algorithms for solving brownian systems of linear equations can be derived because any brownian matrix is congruent to a tridiagonal matrix. This, and related properties, are developed and extended to matrices having a...

Full description

Saved in:
Bibliographic Details
Published in:International journal of systems science 1986-02, Vol.17 (2), p.381-386
Main Authors: GOVER, M. J. C., BARNETT, S.
Format: Article
Language:English
Subjects:
Applied sciences
Exact sciences and technology
Information, signal and communications theory
Telecommunications and information theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Brownian matrices arise in certain models used in digital signal processing. Fast algorithms for solving brownian systems of linear equations can be derived because any brownian matrix is congruent to a tridiagonal matrix. This, and related properties, are developed and extended to matrices having a more general patterned structure.
ISSN:0020-7721
1464-5319
DOI:10.1080/00207728608926813