scientific article; zbMATH DE number 729460
From MaRDI portal
Publication:4324960
Lanczos methodtransient probabilitiessuccessive overrelaxationstochastic automata networksstationary probabilitiesstabilitysoftwarerecursive algorithmsqueueing networksprojection methodspreconditioningpower methodMarkov chainsArnoldi methodKrylov subspacesJacobi methoditerative methodsgeneralized minimal residual algorithmGauss-Seidel methoderror analysisdiscrete-timedirect methodsconvergencecontinuous-timeconjugate gradientsconditioning
Research exposition (monographs, survey articles) pertaining to probability theory (60-02) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Probabilistic methods, stochastic differential equations (65C99)
Recommendations
Cited in
(only showing first 100 items - show all)- Convergence and quotient convergence of iterative methods for solving singular linear equations with index one
- Discrete-time stochastic modeling and simulation of biochemical networks
- Modelling spatio-temporal movement of tourists using finite Markov chains
- Learning the structure of dynamic Bayesian networks from time series and steady state measurements
- Krylov and steady-state techniques for the solution of the chemical master equation for the mitogen-activated protein kinase cascade
- A computational analysis of localized \(\text{Ca}^{2+}\)-dynamics generated by heterogeneous release sites
- Alternating two-stage methods for consistent linear systems with applications to the parallel solution of Markov chains
- Algorithms for finding steady state probabilities for some special classes of finite state Markov chains
- Numerical transient analysis of Markov models
- Steady state solution and convergence rate of time-dependent Markov chains of queuing networks
- A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems
- A numerical study of large sparse matrix exponentials arising in Markov chains.
- Exact performance equivalence: An equivalence relation for stochastic automata
- Analysis of a versatile multi-class delay-loss system with a superimposed Markovian arrival process
- Uniform acceleration expansions for Markov chains with time-varying rates
- Countable state Markov process bootstrap
- A note on the extended convergence of SOR for two-periodic Markov chains
- Iterative methods based on splittings for stochastic automata networks
- A parallel solver for large-scale Markov chains
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields
- An analytical formula for variance of output from a series-parallel production system with no interstation buffers and time-dependent failures
- On the use of MTBDDs for performability analysis and verification of stochastic systems.
- Model-checking large structured Markov chains.
- Rapid, efficient analysis of the \(\lambda(n)/C_{k}/r/N\) queue, with application to decomposition of closed queuing networks.
- The theory of elementary landscapes
- A QBD approach to evolutionary game theory
- A direct projection method for Markov chains
- Algebraic Schwarz methods for the numerical solution of Markov chains
- Block SOR for Kronecker structured representations
- Aggregation of stochastic automata networks with replicas
- Symbolic state-space exploration and numerical analysis of state-sharing composed models
- Algorithms for an irreducible and lumpable strong stochastic bound
- Rate-tilting for fast simulation of level/phase processes
- On the exact simulation of functionals of stationary Markov chains
- Approximate mean value analysis based on Markov chain aggregation by composition
- Comparison theorems for the convergence factor of iterative methods for singular matrices
- Solution of infinite linear systems by automatic adaptive iterations
- An adaptive aggregation/disaggregation algorithm for hierarchical Markovian models
- Reliability prediction of repairable redundant system with imperfect switching and repair
- A compositional model to reason about end-to-end QoS in stochastic Reo connectors
- Optimal decisions for continuous time Markov decision processes over finite planning horizons
- A relaxed two-step splitting iteration method for computing PageRank
- A cost-effective smoothed multigrid with modified neighborhood-based aggregation for Markov chains
- SOS specifications for uniformly continuous operators
- Security screening queues with impatient applicants: a new model with a case study
- \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics
- Random walks and diffusion on networks
- Spectral clustering for non-reversible Markov chains
- A multi-cluster time aggregation approach for Markov chains
- Measuring security in IoT communications
- Implicit ODE solvers with good local error control for the transient analysis of Markov models
- Opinion influence and evolution in social networks: a Markovian agents model
- Models of perishable queueing-inventory systems with server vacations
- Steady state analysis of level dependent quasi-birth-and-death processes with catastrophes
- Componentwise bounds for nearly completely decomposable Markov chains using stochastic comparison and reordering
- Analysis of assembly systems controlled with kanbans
- Calcium-dependent inactivation and the dynamics of calcium puffs and sparks
- Computation tree measurement language (CTML)
- Lumpable continuous-time stochastic automata networks.
- Performance measure sensitive congruences for Markovian process algebras
- An improved saddlepoint approximation based on the negative binomial distribution for the general birth process
- Convergence theory of some classes of iterative aggregation/disaggregation methods for computing stationary probability vectors of stochastic matrices
- Quasi-birth-and-death processes, level-geometric distributions. An aggregation/disaggregation approach
- Iterative aggregation/disaggregation methods for computing some characteristics of Markov chains. II: Fast convergence
- Monotone iterative methods to Markov chains
- Twenty years of rewriting logic
- The jump start power method: a new approach for computing the ergodic projector of a finite Markov chain
- Matrix analysis for continuous-time Markov chains
- Parallel computing for Markov chains with islands and ports
- Simulation of multidimensional diffusions with sticky boundaries via Markov chain approximation
- A probabilistic algorithm for aggregating vastly undersampled large Markov chains
- Graph coarsening: from scientific computing to machine learning
- Stochastic modeling on M/M/1/N inventory system with queue-dependent service rate and retrial facility
- Stochastic dynamics and stable equilibrium of evolutionary optional public goods game in finite populations
- The effect of increasing returns to scale in public goods investment on threshold values of cooperation under social exclusion mechanism
- Computing hitting probabilities of Markov chains: structural results with regard to the solution space of the corresponding system of equations
- Recursive blocked algorithms for linear systems with Kronecker product structure
- Block-accelerated aggregation multigrid for Markov chains with application to PageRank problems
- Computing branching distances with quantitative games
- Time-bounded termination analysis for probabilistic programs with delays
- Towards general axiomatizations for bisimilarity and trace semantics
- Perturbed Markov chains with damping component
- Kronecker representation and decompositional analysis of closed queueing networks with phase-type service distributions and arbitrary buffer sizes
- Heuristics as Markov chains
- Computing the shortest reset words of synchronizing automata
- Computer aided solving the high-order transition probability matrix of the finite Markov chain
- Comparative branching-time semantics for Markov chains
- A disaster queue with Markovian arrivals and impatient customers
- Precisely deciding CSL formulas through approximate model checking for CTMCs
- Approximation of the non-stationary \(M(t)/M(t)/c(t)\)-queue using stationary queueing models: The stationary backlog-carryover approach
- Bounds and approximations for continuous-time Markovian transition probabilities and large systems
- Fixation in haploid populations exhibiting density dependence. I: The non-neutral case
- Adaptive solution of infinite linear systems by Krylov subspace methods
- Bisimulation relations for weighted automata
- Algorithmic analysis of the \(Geo/Geo/c\) retrial queue
- Supply disruptions with time-dependent parameters
- Markov property for a function of a Markov chain: A linear algebra approach
- A periodic Krylov-Schur algorithm for large matrix products
- The periodic QR algorithm is a disguised QR algorithm
- Iterant recombination with one-norm minimization for multilevel Markov chain algorithms via the ellipsoid method
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4324960)
