A partitioning algorithm for solving systems of linear equations

DOI10.1080/0020739960270502zbMath0884.65017OpenAlexW2047994775MaRDI QIDQ4359682

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

zbMATH Keywords

numerical experimentsGaussian eliminationpartitioning algorithm

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Cites Work

• Manifestations of the Schur complement
• Technical Note—A Markov Chain Partitioning Algorithm for Computing Steady State Probabilities
• Computing absorption probabilities for a Markov chain
• Stochastic Complementation, Uncoupling Markov Chains, and the Theory of Nearly Reducible Systems
• Matrix inversion by augmentation and reduction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A partitioning algorithm for solving systems of linear equations