ACM Home Page
Please provide us with feedback. Feedback
Algorithm 551: A Fortran Subroutine for the L1 Solution of Overdetermined Systems of Linear Equations [F4]
Full text PdfPdf (153 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 6 ,  Issue 2  (June 1980) table of contents
Pages: 228 - 230  
Year of Publication: 1980
ISSN:0098-3500
Author
Nabih N. Abdelmalek  Division of Electrical Engineering, National Research Council of Canada, Ottawa, Ont., Canada, KIA OR8
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 56,   Citation Count: 4
Additional Information:

appendices and supplements   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/355887.355895
What is a DOI?

APPENDICES and SUPPLEMENTS
gZipL1 (551.gz) (7 KB)
a dual simplex algorithm to the linear programming formulation of the given problem: overdetermined system of linear equations in the L1 norm
Gams: D9a3


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
ABDELMALEK, N.N. An efficient method for the discrete hnear Lt approxlmahon problem Math Comput 29 (1975), 844-850.
2


Collaborative Colleagues:
Nabih N. Abdelmalek: colleagues

Peer to Peer - Readers of this Article have also read: