A multi-orthogonal polynomials' approach to bulk queueing theory

07/10/2021

∙

by Ulises Fidalgo, et al.

∙

Case Western Reserve University,

∙

We consider a stationary Markov process that models certain queues with a bulk service of fixed number m of admitted customers. We find an integral expression of its transition probability function in terms of certain multi-orthogonal polynomials. We study the convergence of the appropriate scheme of simultaneous quadrature rules to design an algorithm for computing this integral expression.

READ FULL TEXT

A multi-orthogonal polynomials' approach to bulk queueing theory

Orthogonal polynomials on planar cubic curves

A note on a stable algorithm for computing the fractional integrals of orthogonal polynomials

There are EXACTLY 1493804444499093354916284290188948031229880469556 Ways to Derange a Standard Deck of Cards (ignoring suits) [and many other such useful facts]

Spline quadrature and semi-classical orthogonal Jacobi polynomials

A Riemann–Hilbert approach to computing the inverse spectral map for measures supported on disjoint intervals

PolyChaos.jl – A Julia Package for Polynomial Chaos in Systems and Control

Modified discrete Laguerre polynomials for efficient computation of exponentially bounded Matsubara sums

A multi-orthogonal polynomials' approach to bulk queueing theory

Related Research

Orthogonal polynomials on planar cubic curves

A note on a stable algorithm for computing the fractional integrals of orthogonal polynomials

There are EXACTLY 1493804444499093354916284290188948031229880469556 Ways to Derange a Standard Deck of Cards (ignoring suits) [and many other such useful facts]

Spline quadrature and semi-classical orthogonal Jacobi polynomials

A Riemann–Hilbert approach to computing the inverse spectral map for measures supported on disjoint intervals

PolyChaos.jl – A Julia Package for Polynomial Chaos in Systems and Control

Modified discrete Laguerre polynomials for efficient computation of exponentially bounded Matsubara sums