Computing L1 Straight-Line Fits to Data (Part 1)

Simple item page
dc.contributor.authorBarrodale, I
dc.date.accessioned2020-01-04T18:52:35Z
dc.date.available2020-01-04T18:52:35Z
dc.date.copyright2019en_US
dc.date.issued2020-01-04
dc.description.abstractThis report outlines improvements to an old algorithm for fitting L1 straight lines to data. The improvements are designed to accommodate L1 line fitting to much larger data sets than previously practical. The algorithmic details are provided in a form suitable for students and others to implement in any programming language of their choice.en_US
dc.description.reviewstatusUnrevieweden_US
dc.description.scholarlevelFacultyen_US
dc.identifier.urihttp://hdl.handle.net/1828/11460
dc.language.isoenen_US
dc.rightsAttribution-ShareAlike 2.5 Canada*
dc.rights.urihttp://creativecommons.org/licenses/by-sa/2.5/ca/*
dc.subjectL1 Straight-Line Fits to Data, Simplex Method, Faster Algorithm, Coding Challenge
dc.subject.departmentDepartment of Computer Science
dc.titleComputing L1 Straight-Line Fits to Data (Part 1)en_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Computing L1 Straight-Line Fits to Data (Part 1).pdf
Size:
886.39 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Faculty and Staff Publications
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.