Partitioning and Tearing Systems of Equations

DOI10.1137/0702028MaRDI QIDQ5515763zbMATH OpenOpenAlexFDO

Authors D. W. Steward

Publication date 1965

Published in Journal of the Society for Industrial and Applied Mathematics Series B Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0702028

zbMATH Keywords

numerical analysis

Cited in

(14)

• Degree switching operations in networks and large scale systems assignment problems
• Computational methods of linear algebra
• Partitioning, tearing and modification of sparse linear systems
• Multilevel stabilization of large-scale systems: A spinning flexible spacecraft
• Constructing blockmodels: how and why
• Optimum tearing in large scale systems and minimum feedback cutsets of a digraph
• Diakoptics as a general approach in engineering
• Dynamic programming on a functional memory computer
• A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations
• On the Gaussian elimination method for inverting sparse matrices
• An algorithm for the computer simulation of very large dynamic systems
• A method for finding minimal bottle-neck cells for grouping part-machine families†
• Hierarchical partition—a new optimal pivoting algorithm
• Robust object-oriented formulation of directed thermofluid stream networks

This page was built for publication: Partitioning and Tearing Systems of Equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5515763)