Comparison of subdominant eigenvalues of some linear search schemes

DOI10.1016/J.LAA.2009.05.008zbMATH Open1181.15013OpenAlexW2014215920MaRDI QIDQ840641FDOQ840641

Authors: Alan J. Pryde 

Publication date: 14 September 2009

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2009.05.008

Recommendations

• On the matrix occurring in a linear search problem
• Multiplicities of eigenvalues of some linear search schemes
• On the move-to-front scheme with Markov dependent requests
• On some multi-request move-to-front heuristics
• scientific article; zbMATH DE number 795110

zbMATH Keywords

Markov chaintranspositionsubdominant eigenvaluetransition probability matrixlinear search schemesmove-to-frontRayleigh-Ritz theorem

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Searching and sorting (68P10)

Cites Work

• Matrix Analysis
• On self-organizing sequential search heuristics
• An exact formula for the move-to-front rule for self-organizing lists
• On the matrix occurring in a linear search problem
• The persistent-access-caching algorithm
• On the distribution of the search cost for the move-to-front rule with random weights
• An Account of Self-Organizing Systems
• On the move-to-front scheme with Markov dependent requests
• A Transposition Rule Analysis Based on a Particle Process

Cited In (1)

• Some facts about the choice of the weighting matrices in Larimore type of subspace algorithms

This page was built for publication: Comparison of subdominant eigenvalues of some linear search schemes

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