L1 solution of overdetermined systems of linear equations

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

L1 solution of overdetermined systems of linear equations

Full text

Pdf (434 KB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 6 , Issue 2 (June 1980) table of contents

Pages: 220 - 227

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): 4, Downloads (12 Months): 38, Citation Count: 3

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/355887.355894 What is a DOI?

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	Nabih N. Abdelmalek, Algorithm 551: A Fortran Subroutine for the L₁ Solution of Overdetermined Systems of Linear Equations [F4], ACM Transactions on Mathematical Software (TOMS), v.6 n.2, p.228-230, June 1980 [doi>10.1145/355887.355895]
	2	ABDELMALEK, N.N. An efficient method for the discrete linear L~ approximation problem. Math. Comput. 29 (1975), 844-850.
	3	ABDELMALEK, N.N. The discrete linear restricted Chebyshev approxnnation. BIT 17 (1977), 249-261
	4	BARRODALE, I., AND ROBERTS, F.D.K. An Improved algorithm for dtscretee 11 linear approximation. MRC Tech. Rep. 1172, Umv. Wmconsm, Madison, 1972.
	5	I. Barroda , F. D. K. Roberts, Solution of an overdetermined system of equations in the l1 norm [F4], Communications of the ACM, v.17 n.6, p.319-320, June 1974 [doi>10.1145/355616.361024]
	6	BARTELS, R.H., STOER, J., AND ZENGER, C. A realization of the simplex method based on triangular decomposition. In Handbook for Automatic Computation, Vol II: Linear Algebra, J.H. Wilkinson and C. Reinsch (Eds.), Springer-Verlag, New York, 1972, pp. 152-190.

CITED BY 3

	R. D. Armstrong , P. O. Beck , M. T. Kung, Algorithm 615: the best subset of parameters in leasst absolute value regression, ACM Transactions on Mathematical Software (TOMS), v.10 n.2, p.202-206, June 1984
	Chaitanya Mishra , Nick Koudas , Calisto Zuzarte, Generating targeted queries for database testing, Proceedings of the 2008 ACM SIGMOD international conference on Management of data, June 09-12, 2008, Vancouver, Canada
	Nabih N. Abdelmalek, Algorithm 551: A Fortran Subroutine for the L₁ Solution of Overdetermined Systems of Linear Equations [F4], ACM Transactions on Mathematical Software (TOMS), v.6 n.2, p.228-230, June 1980