Least Absolute Deviations Curve-Fitting

A method is proposed for least absolute deviations curve fitting. It may be used to obtain least absolute deviations fits of general linear regressions. As a special case it includes a minor variant of a method for fitting straight lines by least absolute deviations that was previously thought to po...

Full description

Saved in:
Bibliographic Details
Published in:SIAM journal on scientific and statistical computing 1980-06, Vol.1 (2), p.290-301
Main Authors: Bloomfield, Peter, Steiger, William
Format: Article
Language:English
Subjects:
Algorithms
Computer science
Linear programming
R&D
Ratios
Research & development
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c182t-c73c43dae0b3fa8ceb32ed39509088ba3e681f7808679a2b5f90542db60cd2b33
cites cdi_FETCH-LOGICAL-c182t-c73c43dae0b3fa8ceb32ed39509088ba3e681f7808679a2b5f90542db60cd2b33
container_end_page 301
container_issue 2
container_start_page 290
container_title SIAM journal on scientific and statistical computing
container_volume 1
creator Bloomfield, Peter
Steiger, William
description A method is proposed for least absolute deviations curve fitting. It may be used to obtain least absolute deviations fits of general linear regressions. As a special case it includes a minor variant of a method for fitting straight lines by least absolute deviations that was previously thought to possess no generalization. The method has been tested on a computer and was found on a range of problems to execute in as little as ${1 /3 }$ the CPU time required by a published algorithm based on linear programming. More important, this advantage appears to increase indefinitely with the number of data points
doi_str_mv 10.1137/0901019
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_921998501</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2588874491</sourcerecordid><originalsourceid>FETCH-LOGICAL-c182t-c73c43dae0b3fa8ceb32ed39509088ba3e681f7808679a2b5f90542db60cd2b33</originalsourceid><addsrcrecordid>eNotkEFLxDAUhIMoWFfxLxQve4q-l9e0yXFZXRUKXvQckjaVLmu7JumC_94uu6eB4WNmGMbuER4RqXoCDQioL1gmsFScCqwuWTY7JZcCimt2E-MWgFDqImPL2tuY8pWL425KPn_2h96mfhxivp7CwfNNn1I_fN-yq87uor8764J9bV4-12-8_nh9X69q3qASiTcVNQW11oOjzqrGOxK-JS3nVUo5S75U2FUKVFlpK5zsNMhCtK6EphWOaMEeTrn7MP5OPiazHacwzJVGC9RaScAZWp6gJowxBt-Zfeh_bPgzCOZ4gjmfQP8jSEwq</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>921998501</pqid></control><display><type>article</type><title>Least Absolute Deviations Curve-Fitting</title><source>ABI/INFORM Global</source><source>LOCUS - SIAM's Online Journal Archive</source><creator>Bloomfield, Peter ; Steiger, William</creator><creatorcontrib>Bloomfield, Peter ; Steiger, William</creatorcontrib><description>A method is proposed for least absolute deviations curve fitting. It may be used to obtain least absolute deviations fits of general linear regressions. As a special case it includes a minor variant of a method for fitting straight lines by least absolute deviations that was previously thought to possess no generalization. The method has been tested on a computer and was found on a range of problems to execute in as little as ${1 /3 }$ the CPU time required by a published algorithm based on linear programming. More important, this advantage appears to increase indefinitely with the number of data points</description><identifier>ISSN: 0196-5204</identifier><identifier>ISSN: 1064-8275</identifier><identifier>EISSN: 2168-3417</identifier><identifier>EISSN: 1095-7197</identifier><identifier>DOI: 10.1137/0901019</identifier><language>eng</language><publisher>Philadelphia: Society for Industrial and Applied Mathematics</publisher><subject>Algorithms ; Computer science ; Linear programming ; R&amp;D ; Ratios ; Research &amp; development</subject><ispartof>SIAM journal on scientific and statistical computing, 1980-06, Vol.1 (2), p.290-301</ispartof><rights>[Copyright] © 1980 Society for Industrial and Applied Mathematics</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c182t-c73c43dae0b3fa8ceb32ed39509088ba3e681f7808679a2b5f90542db60cd2b33</citedby><cites>FETCH-LOGICAL-c182t-c73c43dae0b3fa8ceb32ed39509088ba3e681f7808679a2b5f90542db60cd2b33</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/921998501?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,777,781,3172,11669,27905,27906,36041,44344</link.rule.ids></links><search><creatorcontrib>Bloomfield, Peter</creatorcontrib><creatorcontrib>Steiger, William</creatorcontrib><title>Least Absolute Deviations Curve-Fitting</title><title>SIAM journal on scientific and statistical computing</title><description>A method is proposed for least absolute deviations curve fitting. It may be used to obtain least absolute deviations fits of general linear regressions. As a special case it includes a minor variant of a method for fitting straight lines by least absolute deviations that was previously thought to possess no generalization. The method has been tested on a computer and was found on a range of problems to execute in as little as ${1 /3 }$ the CPU time required by a published algorithm based on linear programming. More important, this advantage appears to increase indefinitely with the number of data points</description><subject>Algorithms</subject><subject>Computer science</subject><subject>Linear programming</subject><subject>R&amp;D</subject><subject>Ratios</subject><subject>Research &amp; development</subject><issn>0196-5204</issn><issn>1064-8275</issn><issn>2168-3417</issn><issn>1095-7197</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1980</creationdate><recordtype>article</recordtype><sourceid>M0C</sourceid><recordid>eNotkEFLxDAUhIMoWFfxLxQve4q-l9e0yXFZXRUKXvQckjaVLmu7JumC_94uu6eB4WNmGMbuER4RqXoCDQioL1gmsFScCqwuWTY7JZcCimt2E-MWgFDqImPL2tuY8pWL425KPn_2h96mfhxivp7CwfNNn1I_fN-yq87uor8764J9bV4-12-8_nh9X69q3qASiTcVNQW11oOjzqrGOxK-JS3nVUo5S75U2FUKVFlpK5zsNMhCtK6EphWOaMEeTrn7MP5OPiazHacwzJVGC9RaScAZWp6gJowxBt-Zfeh_bPgzCOZ4gjmfQP8jSEwq</recordid><startdate>19800601</startdate><enddate>19800601</enddate><creator>Bloomfield, Peter</creator><creator>Steiger, William</creator><general>Society for Industrial and Applied Mathematics</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7X2</scope><scope>7XB</scope><scope>87Z</scope><scope>88A</scope><scope>88F</scope><scope>88I</scope><scope>88K</scope><scope>8AL</scope><scope>8FE</scope><scope>8FG</scope><scope>8FH</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>ATCPS</scope><scope>AZQEC</scope><scope>BBNVY</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>BHPHI</scope><scope>CCPQU</scope><scope>D1I</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>KB.</scope><scope>L.-</scope><scope>L6V</scope><scope>LK8</scope><scope>M0C</scope><scope>M0K</scope><scope>M0N</scope><scope>M1Q</scope><scope>M2O</scope><scope>M2P</scope><scope>M2T</scope><scope>M7P</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PATMY</scope><scope>PDBOC</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>PYCSY</scope><scope>Q9U</scope></search><sort><creationdate>19800601</creationdate><title>Least Absolute Deviations Curve-Fitting</title><author>Bloomfield, Peter ; Steiger, William</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c182t-c73c43dae0b3fa8ceb32ed39509088ba3e681f7808679a2b5f90542db60cd2b33</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1980</creationdate><topic>Algorithms</topic><topic>Computer science</topic><topic>Linear programming</topic><topic>R&amp;D</topic><topic>Ratios</topic><topic>Research &amp; development</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bloomfield, Peter</creatorcontrib><creatorcontrib>Steiger, William</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>Agricultural Science Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection</collection><collection>Biology Database (Alumni Edition)</collection><collection>Military Database (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Telecommunications (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Natural Science Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>Agricultural &amp; Environmental Science Collection</collection><collection>ProQuest Central Essentials</collection><collection>Biological Science Collection</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>Natural Science Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Materials Science Collection</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>Materials Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ProQuest Biological Science Collection</collection><collection>ABI/INFORM Global</collection><collection>Agriculture Science Database</collection><collection>Computing Database</collection><collection>Military Database</collection><collection>Research Library</collection><collection>Science Database</collection><collection>Telecommunications Database</collection><collection>Biological Science Database</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>Environmental Science Database</collection><collection>Materials science collection</collection><collection>One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>Environmental Science Collection</collection><collection>ProQuest Central Basic</collection><jtitle>SIAM journal on scientific and statistical computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bloomfield, Peter</au><au>Steiger, William</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Least Absolute Deviations Curve-Fitting</atitle><jtitle>SIAM journal on scientific and statistical computing</jtitle><date>1980-06-01</date><risdate>1980</risdate><volume>1</volume><issue>2</issue><spage>290</spage><epage>301</epage><pages>290-301</pages><issn>0196-5204</issn><issn>1064-8275</issn><eissn>2168-3417</eissn><eissn>1095-7197</eissn><abstract>A method is proposed for least absolute deviations curve fitting. It may be used to obtain least absolute deviations fits of general linear regressions. As a special case it includes a minor variant of a method for fitting straight lines by least absolute deviations that was previously thought to possess no generalization. The method has been tested on a computer and was found on a range of problems to execute in as little as ${1 /3 }$ the CPU time required by a published algorithm based on linear programming. More important, this advantage appears to increase indefinitely with the number of data points</abstract><cop>Philadelphia</cop><pub>Society for Industrial and Applied Mathematics</pub><doi>10.1137/0901019</doi><tpages>12</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0196-5204
ispartof SIAM journal on scientific and statistical computing, 1980-06, Vol.1 (2), p.290-301
issn 0196-5204
1064-8275
2168-3417
1095-7197
language eng
recordid cdi_proquest_journals_921998501
source ABI/INFORM Global; LOCUS - SIAM's Online Journal Archive
subjects Algorithms
Computer science
Linear programming
R&D
Ratios
Research & development
title Least Absolute Deviations Curve-Fitting
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-18T23%3A08%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Least%20Absolute%20Deviations%20Curve-Fitting&rft.jtitle=SIAM%20journal%20on%20scientific%20and%20statistical%20computing&rft.au=Bloomfield,%20Peter&rft.date=1980-06-01&rft.volume=1&rft.issue=2&rft.spage=290&rft.epage=301&rft.pages=290-301&rft.issn=0196-5204&rft.eissn=2168-3417&rft_id=info:doi/10.1137/0901019&rft_dat=%3Cproquest_cross%3E2588874491%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c182t-c73c43dae0b3fa8ceb32ed39509088ba3e681f7808679a2b5f90542db60cd2b33%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=921998501&rft_id=info:pmid/&rfr_iscdi=true