A partitioning algorithm for solving systems of linear equations
From MaRDI portal
Publication:4359682
Recommendations
Cites work
- scientific article; zbMATH DE number 3140173 (Why is no real title available?)
- scientific article; zbMATH DE number 3140820 (Why is no real title available?)
- scientific article; zbMATH DE number 3145626 (Why is no real title available?)
- scientific article; zbMATH DE number 3433450 (Why is no real title available?)
- scientific article; zbMATH DE number 3350966 (Why is no real title available?)
- Computing absorption probabilities for a Markov chain
- Manifestations of the Schur complement
- Matrix inversion by augmentation and reduction
- Stochastic Complementation, Uncoupling Markov Chains, and the Theory of Nearly Reducible Systems
- Technical Note—A Markov Chain Partitioning Algorithm for Computing Steady State Probabilities
Cited in
(6)- scientific article; zbMATH DE number 4141392 (Why is no real title available?)
- A new efficient solution method for a system of linear equations: Partially Solving Method (PSM)
- Linear-shaped partition problems
- A new algorithm for parallel solution of linear equations
- A new algorithm solving a system of linear equations with block cycle coefficient matrix
- A Krylov multisplitting algorithm for solving linear systems of equations
This page was built for publication: A partitioning algorithm for solving systems of linear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4359682)