Jump to ContentJump to Main Navigation
Numerical Methods for Structured Markov Chains$
Users without a subscription are not able to see the full content.

Dario A. Bini, Guy Latouche, and Beatrice Meini

Print publication date: 2005

Print ISBN-13: 9780198527688

Published to Oxford Scholarship Online: September 2007

DOI: 10.1093/acprof:oso/9780198527688.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2018. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see www.oxfordscholarship.com/page/privacy-policy).date: 15 November 2018

STRUCTURED MATRIX ANALYSIS

STRUCTURED MATRIX ANALYSIS

Chapter:
(p.23) 2 STRUCTURED MATRIX ANALYSIS
Source:
Numerical Methods for Structured Markov Chains
Author(s):

D. A. Bini

G. Latouche

B. Meini

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780198527688.003.0002

This chapter describes structural and computational properties which are the basis of the design and analysis of fast algorithms for the numerical solution of structured Markov chains. Toeplitz matrices, circulant and z-circulant matrices with their block analogs are introduced together with the fast algorithms for their manipulation. The concept of discrete Fourier transform is recalled with the FFT algorithm for its computation. Attention is given to the concept of displacement operator and of displacement rank needed to design efficient algorithms for a wide class of matrices related to Toeplitz matrices.

Keywords:   Toeplitz matrices, circulant matrices, displacement rank, fast Fourier transform, discrete Fourier transform

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .