Staircase Matrices and Systems
From MaRDI portal
Publication:3321332
DOI10.1137/1026001zbMath0536.65020OpenAlexW1965915143MaRDI QIDQ3321332
Publication date: 1984
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1026001
Computational methods for sparse matrices (65F50) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (13)
The classical Braess paradox problem revisited: a generalized inverse method on non-unique path flow cases ⋮ Consistency Cuts for Dantzig-Wolfe Reformulations ⋮ A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems ⋮ Staircase compatibility and its applications in scheduling and piecewise linearization ⋮ A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations ⋮ Parallel treatment of block-bidiagonal matrices in the solution of ordinary differential boundary value problems ⋮ On solving almost block diagonal (staircase) linear systems ⋮ Almost block diagonal linear systems: sequential and parallel solution techniques, and applications ⋮ Optimization with staircase structure: An application to generation scheduling ⋮ Parallel processors for planning under uncertainty ⋮ A CMV-Based Eigensolver for Companion Matrices ⋮ On recognizing staircase compatibility ⋮ Solving staircase linear programs by the simplex method, 1: Inversion
This page was built for publication: Staircase Matrices and Systems
