Revisiting the matrix‐free solution of Markov regenerative processes

DOI10.1002/nla.819zbMath1265.60144OpenAlexW1716163710MaRDI QIDQ4897518

Elvio Gilberto Amparore, Susanna Donatelli

Publication date: 19 December 2012

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nla.819

zbMATH Keywords

preconditioningKrylov methodsmatrix freeMarkov regenerative processfill-in avoidance

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22)

Uses Software

• DSPNexpress
• CGS
• ILUT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A comparative study of sparse approximate inverse preconditioners
• Jacobian-free Newton-Krylov methods: a survey of approaches and applications.
• Relaxation strategies for nested Krylov methods
• Preconditioning techniques for large linear systems: A survey
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Iterative analysis of Markov regenerative models
• ILUT: A dual threshold incomplete LU factorization

This page was built for publication: Revisiting the matrix‐free solution of Markov regenerative processes