A new iterative method for solving non-square systems of linear equations

DOI10.1016/j.cam.2017.03.021zbMath1365.65088OpenAlexW2598610981MaRDI QIDQ2628345

Samuel Awoniyi, Ira Wheaton

Publication date: 1 June 2017

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2017.03.021

zbMATH Keywords

numerical examplelinear programmingFourier-Motzkin elimination methodlinear systems iterative procedure

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Iterative numerical methods for linear systems (65F10)

Related Items (1)

A linearly convergent doubly stochastic Gauss-Seidel algorithm for solving linear equations and a certain class of over-parameterized optimization problems

Cites Work

• Extending linear relaxation for non-square matrices and soft constraints
• Iterative Solution Methods
• Approximate solution of systems of linear equations†
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A new iterative method for solving non-square systems of linear equations