Tchebycheff Systems for Probabilistic Analysis

DOI10.1080/01966324.1993.10737346zbMath0792.41018OpenAlexW2074807616WikidataQ58124538 ScholiaQ58124538MaRDI QIDQ4280085

Michael R. Taaffe, Mary A. Johnson

Publication date: 1993

Published in: American Journal of Mathematical and Management Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01966324.1993.10737346

zbMATH Keywords

Chebyshev systemT-systemsTchebycheff systems

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50)

Related Items (4)

SET-VALUED PERFORMANCE APPROXIMATIONS FOR THE QUEUE GIVEN PARTIAL INFORMATION ⋮ Extremal models for the \(G I \slash G I \slash K\) waiting-time tail-probability decay rate ⋮ Extremal \(GI/GI/1\) queues given two moments: exploiting Tchebycheff systems ⋮ On matrix exponential distributions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An investigation of phase-distribution moment-matching algorithms for use in queueing models
• A graphical investigation of error bounds for moment-based queueing approximations
• On Approximations for Queues, I: Extremal Distributions
• On Approximations for Queues, III: Mixtures of Exponential Distributions
• Probability bounds on downtimes
• A Chebyshev system approach to optimal input design
• Approximating a Point Process by a Renewal Process, I: Two Basic Methods
• Sharp Bounds on Laplace-Stieltjes Transforms, with Applications to Various Queueing Problems
• Matching moments to phase distributions: Mixtures of erlang distributions of common order
• Extreme Points of Certain Sets of Probability Measures, with Applications
• The Accuracy of the Equivalent Random Method With Renewal Inputs*

This page was built for publication: Tchebycheff Systems for Probabilistic Analysis