On the public citation graph
Matrix Methods for Queuing Problems
0 signed · 97 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1981.tb00255.xopenalex-snapshot
Overflow Models forDimension®; PBX Feature Packages
inferredcites →https://doi.org/10.1007/bf01397879openalex-snapshot
Convergent nonnegative matrices and iterative methods for consistent linear systems
inferredcites →https://doi.org/10.1016/0024-3795(82)90148-3openalex-snapshot
Theorems of Stein-Rosenberg type. III. The singular case
inferredcites →https://doi.org/10.1016/0378-4754(78)90090-3openalex-snapshot
Algorithmic methods in probability
inferredcites →https://doi.org/10.1016/b978-0-12-141050-6.50020-9openalex-snapshot
CONSIDERATIONS IN THE DESIGN OF SOFTWARE FOR SPARSE GAUSSIAN ELIMINATION**This research was supported in part by NSF Grant GJ-43157 and ONR Grant N0014-67-A-0097-0016.
inferredcites →https://doi.org/10.1016/c2013-0-11733-3openalex-snapshot
Iterative Solution of Large Linear Systems
inferredcites →https://doi.org/10.1080/00949657508810122openalex-snapshot
Computation of the stationary distribution of a markov chain
inferredcites →https://doi.org/10.1109/tcom.1981.1095013openalex-snapshot
Analysis of Packet Network Congestion Control Using Sparse Matrix Algorithms
inferredcites →https://doi.org/10.1137/0707049openalex-snapshot
On Direct Methods for Solving Poisson’s Equations
inferredcites →https://doi.org/10.1137/0714064openalex-snapshot
Marching Algorithms for Elliptic Boundary Value Problems. II: The Variable Coefficient Case
inferredcites →https://doi.org/10.1137/0902030openalex-snapshot
Solution of Homogeneous Systems of Linear Equations Arising from Compartmental Models
inferredcites →https://doi.org/10.1137/0905033openalex-snapshot
Comparison of Some Direct Methods for Computing Stationary Distributions of Markov Chains
inferredcites →https://doi.org/10.1137/1.9781611971262openalex-snapshot
Nonnegative Matrices in the Mathematical Sciences
inferredcites →https://doi.org/10.1145/322139.322148openalex-snapshot
Scaling for Numerical Stability in Gaussian Elimination
inferredcites →https://doi.org/10.1145/355815.355817openalex-snapshot
Some Design Features of a Sparse Matrix Code
inferredcites →https://doi.org/10.2307/2005542openalex-snapshot
Iterative Solution of Large Linear Systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4613-8351-2_1openalex-snapshot
Error Bounds for the Computation of Null Vectors with Applications to Markov Chains
inferred← citeshttps://doi.org/10.1007/978-1-4613-8351-2_9openalex-snapshot
Iterative Methods for Finding the Stationary Vector for Markov Chains
inferred← citeshttps://doi.org/10.1007/978-1-4614-6312-2_2openalex-snapshot
Queueing Systems and the Web
inferred← citeshttps://doi.org/10.1007/978-1-4614-6777-9_3openalex-snapshot
Exact Analysis of Discrete Part Production Lines: The Markovian Queueing Network and the Stochastic Automata Networks Formalisms
inferred← citeshttps://doi.org/10.1007/978-1-4615-2241-6_2openalex-snapshot
On Cyclic Reduction Applied to a Class of Toeplitz-Like Matrices Arising in Queueing Problems
inferred← citeshttps://doi.org/10.1007/978-1-4615-2241-6_5openalex-snapshot
A Parallel Block Projection Method of the Cimmino Type for Finite Markov Chains
inferred← citeshttps://doi.org/10.1007/978-1-4757-4828-4_4openalex-snapshot
Numerical Methods for Computing Stationary Distributions of Finite Irreducible Markov Chains
inferred← citeshttps://doi.org/10.1007/978-3-319-46433-6_4openalex-snapshot
Finding Steady States of Communicating Markov Processes Combining Aggregation/Disaggregation with Tensor Techniques
inferred← citeshttps://doi.org/10.1007/978-3-319-97129-2_5openalex-snapshot
Vector–Kronecker Product Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-642-74306-1_6openalex-snapshot
Numerical Solutions for Markovian Event Systems
inferred← citeshttps://doi.org/10.1007/bf01158473openalex-snapshot
Numerical investigation of a multiserver retrial model
inferred← citeshttps://doi.org/10.1007/bf01189232openalex-snapshot
A class of hierarchical queueing networks and their analysis
inferred← citeshttps://doi.org/10.1007/bf01396747openalex-snapshot
Iterative methods for overflow queueing models I
inferred← citeshttps://doi.org/10.1007/bf01403891openalex-snapshot
Iterative methods for overflow queuing models II
inferred← citeshttps://doi.org/10.1007/bf01459075openalex-snapshot
LU decompositions of generalized diagonally dominant matrices
inferred← citeshttps://doi.org/10.1007/bf02247407openalex-snapshot
Queueing models for a single server LAN with processor sharing disciplines
inferred← citeshttps://doi.org/10.1007/bf02575885openalex-snapshot
Solving certain queueing problems modelled by toeplitz matrices
inferred← citeshttps://doi.org/10.1007/bf02576004openalex-snapshot
Scientific applications of iterative Toeplitz solvers
inferred← citeshttps://doi.org/10.1007/bf03008876openalex-snapshot
Use of cyclicity for solving some matrix problems
inferred← citeshttps://doi.org/10.1007/bf03008901openalex-snapshot
Use of an orthogonal projector for accelerating a queuing problem solver
inferred← citeshttps://doi.org/10.1007/s11009-007-9062-2openalex-snapshot
Two Queues with Weighted One-Way Overflow
inferred← citeshttps://doi.org/10.1007/s11009-008-9071-9openalex-snapshot
Two Queues with Weighted One-Way Overflow
inferred← citeshttps://doi.org/10.1016/0024-3795(84)90222-2openalex-snapshot
Theorems on M-splittings of a singular M-matrix which depend on graph structure
inferred← citeshttps://doi.org/10.1016/0024-3795(86)90210-7openalex-snapshot
Sensitivity of the stationary distribution vector for an ergodic Markov chain
inferred← citeshttps://doi.org/10.1016/0024-3795(86)90214-4openalex-snapshot
Block iterative algorithms for stochastic matrices
inferred← citeshttps://doi.org/10.1016/0024-3795(91)90374-6openalex-snapshot
Iterative algorithms for large stochastic matrices
inferred← citeshttps://doi.org/10.1016/0024-3795(93)90242-gopenalex-snapshot
Finite precision behavior of stationary iteration for solving singular systems
inferred← citeshttps://doi.org/10.1016/0024-3795(94)90401-4openalex-snapshot
The linear algebra of block quasi-newton algorithms
inferred← citeshttps://doi.org/10.1016/0096-3003(94)00159-2openalex-snapshot
The conjugate gradient method for queueing networks
inferred← citeshttps://doi.org/10.1016/0166-5316(96)00029-6openalex-snapshot
Efficient solution for a class of Markov chain models of telecommunication systems
inferred← citeshttps://doi.org/10.1016/0169-7552(94)90064-7openalex-snapshot
Models for performance evaluation of a local area network with a file server
inferred← citeshttps://doi.org/10.1016/0305-0548(93)90103-popenalex-snapshot
Iterative solution methods for obtaining the steady-state probability distributions of Markovian multi-echelon repairable item inventory systems
inferred← citeshttps://doi.org/10.1016/0305-0548(94)90060-4openalex-snapshot
Using program package NSPCG to analyze the trunk reservation service protection method
inferred← citeshttps://doi.org/10.1016/0377-2217(91)90251-popenalex-snapshot
Analytical perturbations in Markov chains
inferred← citeshttps://doi.org/10.1016/0377-2217(92)90250-dopenalex-snapshot
On the design of a finite-capacity queue with phase-type service times and hysteretic control
inferred← citeshttps://doi.org/10.1016/b978-012487462-6/50001-1openalex-snapshot
Stochastic Processes
inferred← citeshttps://doi.org/10.1016/j.amc.2004.11.014openalex-snapshot
Boundary value methods for solving transient solutions of Markovian queueing networks
inferred← citeshttps://doi.org/10.1016/j.amc.2011.01.108openalex-snapshot
Multigrid algorithm from cyclic reduction for Markovian queueing networks
inferred← citeshttps://doi.org/10.1016/j.camwa.2011.09.041openalex-snapshot
Triangular and skew-symmetric splitting method for numerical solutions of Markov chains
inferred← citeshttps://doi.org/10.1016/s0024-3795(99)00275-xopenalex-snapshot
Comparison theorems for the convergence factor of iterative methods for singular matrices
inferred← citeshttps://doi.org/10.1016/s0168-9274(03)00057-6openalex-snapshot
Weak-convergence theory of quasi-nonnegative splittings for singular matrices
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80169-0openalex-snapshot
Chapter 5 Computational methods in probability theory
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80174-4openalex-snapshot
Chapter 10 Queueing theory
inferred← citeshttps://doi.org/10.1080/00207169908804773openalex-snapshot
Algebraic multigrid method for queueing networks
inferred← citeshttps://doi.org/10.1080/00207543.2012.754550openalex-snapshot
Analysis of exponential reliable production lines using Kronecker descriptors
inferred← citeshttps://doi.org/10.1080/10637199508915496openalex-snapshot
THE ARITHMETIC MEAN METHOD FOR FINDING THE STATIONARY VECTOR OF MARKOV CHAINS
inferred← citeshttps://doi.org/10.1080/15326348808807087openalex-snapshot
Relaxations for the numerical solutions of some stochastic problems
inferred← citeshttps://doi.org/10.1080/15326348908807115openalex-snapshot
Numerical solution of sparse singular systems of equations arising from ergodic markov chains
inferred← citeshttps://doi.org/10.1080/15326349108807182openalex-snapshot
On the convergence of jacobi and gauss-seidel iteration for steady-state probabilities of finite-state continuous-time markov chains
inferred← citeshttps://doi.org/10.1080/15326349908807565openalex-snapshot
A graph-theoretic approach to queueing analysis part ii: applications
inferred← citeshttps://doi.org/10.1090/s0025-5718-1984-0736453-8openalex-snapshot
Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
inferred← citeshttps://doi.org/10.1109/18.52480openalex-snapshot
Steady-state behavior of interacting queues-a numerical approach
inferred← citeshttps://doi.org/10.1109/49.62851openalex-snapshot
Modeling and analysis of communication systems based on computational methods for Markov chains
inferred← citeshttps://doi.org/10.1109/sicon.1995.526033openalex-snapshot
LAN file server performance: a processor sharing model
inferred← citeshttps://doi.org/10.1109/tcom.1981.1095013openalex-snapshot
Analysis of Packet Network Congestion Control Using Sparse Matrix Algorithms
inferred← citeshttps://doi.org/10.1134/s0005117911040096openalex-snapshot
Model of joint servicing of real-time service traffic and data traffic. I
inferred← citeshttps://doi.org/10.1137/0605006openalex-snapshot
A Combined Direct-Iterative Method for Certain M -Matrix Linear Systems
inferred← citeshttps://doi.org/10.1137/0607004openalex-snapshot
Updating $LU$ Factorizations for Computing Stationary Distributions
inferred← citeshttps://doi.org/10.1137/0607031openalex-snapshot
Using the QR Factorization and Group Inversion to Compute, Differentiate, and Estimate the Sensitivity of Stationary Probabilities for Markov Chains
inferred← citeshttps://doi.org/10.1137/0607044openalex-snapshot
Convergent Iterations for Computing Stationary Distributions of Markov Chains
inferred← citeshttps://doi.org/10.1137/0607047openalex-snapshot
On the Smallest Positive Singular Value of a Singular M -Matrix with Applications to Ergodic Markov Chains
inferred← citeshttps://doi.org/10.1137/0608020openalex-snapshot
Further Comparisons of Direct Methods for Computing Stationary Distributions of Markov Chains
inferred← citeshttps://doi.org/10.1137/0609014openalex-snapshot
Semi-Iterative and Iterative Methods for Singular M -Matrices
inferred← citeshttps://doi.org/10.1137/0614056openalex-snapshot
Error Bounds for the Computation of Null Vectors with Applications to Markov Chains
inferred← citeshttps://doi.org/10.1137/0905033openalex-snapshot
Comparison of Some Direct Methods for Computing Stationary Distributions of Markov Chains
inferred← citeshttps://doi.org/10.1137/0911040openalex-snapshot
Bordered Matrices, Singular Systems, and Ergodic Markov Chains
inferred← citeshttps://doi.org/10.1137/140994447openalex-snapshot
Multigrid Methods for Tensor Structured Markov Chains with Low Rank Approximation
inferred← citeshttps://doi.org/10.1137/s0036144594276474openalex-snapshot
Conjugate Gradient Methods for Toeplitz Systems
inferred← citeshttps://doi.org/10.1137/s0895479800375989openalex-snapshot
Comparison of Convergence of General Stationary Iterative Methods for Singular Matrices
inferred← citeshttps://doi.org/10.1137/s0895479898342419openalex-snapshot
Multilevel Solutions for Structured Markov Chains
inferred← citeshttps://doi.org/10.1137/s1064827596303612openalex-snapshot
State Space Orderings for Gauss--Seidel in Markov Chains Revisited
inferred← citeshttps://doi.org/10.1145/1099554.1099705openalex-snapshot
Distributed PageRank computation based on iterative aggregation-disaggregation methods
inferred← citeshttps://doi.org/10.1287/ijoc.1120.0537openalex-snapshot
Efficient Transient Analysis of Markovian Models Using a Block Reduction Approach
inferred← citeshttps://doi.org/10.1515/math-2018-0083openalex-snapshot
Multipreconditioned GMRES for simulating stochastic automata networks
inferred← citeshttps://doi.org/10.1553/etna_vol48s348openalex-snapshot
Multigrid methods combined with low-rank approximation for tensor-structured Markov chains
inferred← citeshttps://doi.org/10.3745/kipsta.2004.11a.1.067openalex-snapshot
A Synchronous/Asynchronous Hybrid Parallel Power Iteration for Large Eigenvalue Problems by the MPMD Methodology
inferred← citeshttps://doi.org/10.4108/icst.valuetools2008.4271openalex-snapshot
Iterative Aggregation - Disaggregation Methods and Ordering Algorithms
inferred← citeshttps://doi.org/10.70675/f7b80b05z85cdz467az903az19188510a3b4openalex-snapshot
Prognosis and Maintenance Modelling for Wind Turbines
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.