A partitioning algorithm for solving systems of linear equations
From MaRDI portal
Publication:4359682
DOI10.1080/0020739960270502zbMATH Open0884.65017OpenAlexW2047994775MaRDI QIDQ4359682FDOQ4359682
Authors: Theodore J. Sheskin
Publication date: 12 March 1998
Published in: International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/0020739960270502
Recommendations
Cites Work
- Title not available (Why is that?)
- Technical Note—A Markov Chain Partitioning Algorithm for Computing Steady State Probabilities
- Manifestations of the Schur complement
- Stochastic Complementation, Uncoupling Markov Chains, and the Theory of Nearly Reducible Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing absorption probabilities for a Markov chain
- Title not available (Why is that?)
- Title not available (Why is that?)
- Matrix inversion by augmentation and reduction
Cited In (6)
- A Krylov multisplitting algorithm for solving linear systems of equations
- Title not available (Why is that?)
- A new algorithm solving a system of linear equations with block cycle coefficient matrix
- 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
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)