Computing L1 Straight-Line Fits to Data

Simple item page
dc.contributor.authorBarrodale, I
dc.date.accessioned2020-01-23T19:24:05Z
dc.date.available2020-01-23T19:24:05Z
dc.date.copyright2020en_US
dc.date.issued2020-01-23
dc.description.abstractIn 1971 Frank D.K. Roberts and I developed the BR algorithm ([i],[ii]), complete with Fortran code [iii], for calculating L1 solutions to overdetermined systems of m linear equations in n unknown parameters2. The challenge here is to develop fast code for L1 fitting by straight lines (n = 2) to big data sets (m ≥ 106) that largely avoids the frustration of sluggish run times.en_US
dc.description.reviewstatusUnrevieweden_US
dc.description.scholarlevelFacultyen_US
dc.identifier.urihttp://hdl.handle.net/1828/11501
dc.language.isoenen_US
dc.titleComputing L1 Straight-Line Fits to Dataen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
An L1 Algorithmic and Coding Challenge.pdf
Size:
246.25 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 Publications (Engineering and Computer Science)
 
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.