Computing best discrete least-squares approximations by first-degree splines with free knots
We present an algorithm to compute best least-squares approximations of discrete real-valued functions by first-degree splines (broken lines) with free knots. We demonstrate that the algorithm delivers after a finite number of steps a (global) best approximation. The analysis is complemented by rema...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Cromme, Ludwig J Kunath, Jens Krebs, Andreas |
| description | We present an algorithm to compute best least-squares approximations of
discrete real-valued functions by first-degree splines (broken lines) with free
knots. We demonstrate that the algorithm delivers after a finite number of
steps a (global) best approximation. The analysis is complemented by remarks on
programming and by a number of numerical examples including applications from
medicine (MBC, MIC). |
| doi_str_mv | 10.48550/arxiv.1704.05670 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1704_05670</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1704_05670</sourcerecordid><originalsourceid>FETCH-LOGICAL-a670-bcbee5c67af3c180341ca09b40859c806cd2c3c8688745515fd35d2518f86c453</originalsourceid><addsrcrecordid>eNotj8tOwzAURL1hgQofwAr_QIJd-zruEkW8pEpsukSK_LguFmkSbBfavyctXY00MxrNIeSOs1pqAPZg0iH-1LxhsmagGnZNPtpxN-1LHLbUYi7Ux-wSFqQ9mlyq_L03CTM105TGQ9yZEschU3ukIaY597hNiDRPfRzm2m8snzScnK9hLPmGXAXTZ7y96IJsnp827Wu1fn95ax_XlZk_VNZZRHCqMUE4rpmQ3Bm2spJpWDnNlPNLJ5xWWjcSgEPwAvwSuA5aOQliQe7_Z8943ZTmn-nYnTC7M6b4A2vETu4</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Computing best discrete least-squares approximations by first-degree splines with free knots</title><source>arXiv.org</source><creator>Cromme, Ludwig J ; Kunath, Jens ; Krebs, Andreas</creator><creatorcontrib>Cromme, Ludwig J ; Kunath, Jens ; Krebs, Andreas</creatorcontrib><description>We present an algorithm to compute best least-squares approximations of
discrete real-valued functions by first-degree splines (broken lines) with free
knots. We demonstrate that the algorithm delivers after a finite number of
steps a (global) best approximation. The analysis is complemented by remarks on
programming and by a number of numerical examples including applications from
medicine (MBC, MIC).</description><identifier>DOI: 10.48550/arxiv.1704.05670</identifier><language>eng</language><subject>Mathematics - Numerical Analysis</subject><creationdate>2017-04</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,781,886</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1704.05670$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1704.05670$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Cromme, Ludwig J</creatorcontrib><creatorcontrib>Kunath, Jens</creatorcontrib><creatorcontrib>Krebs, Andreas</creatorcontrib><title>Computing best discrete least-squares approximations by first-degree splines with free knots</title><description>We present an algorithm to compute best least-squares approximations of
discrete real-valued functions by first-degree splines (broken lines) with free
knots. We demonstrate that the algorithm delivers after a finite number of
steps a (global) best approximation. The analysis is complemented by remarks on
programming and by a number of numerical examples including applications from
medicine (MBC, MIC).</description><subject>Mathematics - Numerical Analysis</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj8tOwzAURL1hgQofwAr_QIJd-zruEkW8pEpsukSK_LguFmkSbBfavyctXY00MxrNIeSOs1pqAPZg0iH-1LxhsmagGnZNPtpxN-1LHLbUYi7Ux-wSFqQ9mlyq_L03CTM105TGQ9yZEschU3ukIaY597hNiDRPfRzm2m8snzScnK9hLPmGXAXTZ7y96IJsnp827Wu1fn95ax_XlZk_VNZZRHCqMUE4rpmQ3Bm2spJpWDnNlPNLJ5xWWjcSgEPwAvwSuA5aOQliQe7_Z8943ZTmn-nYnTC7M6b4A2vETu4</recordid><startdate>20170419</startdate><enddate>20170419</enddate><creator>Cromme, Ludwig J</creator><creator>Kunath, Jens</creator><creator>Krebs, Andreas</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20170419</creationdate><title>Computing best discrete least-squares approximations by first-degree splines with free knots</title><author>Cromme, Ludwig J ; Kunath, Jens ; Krebs, Andreas</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a670-bcbee5c67af3c180341ca09b40859c806cd2c3c8688745515fd35d2518f86c453</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Mathematics - Numerical Analysis</topic><toplevel>online_resources</toplevel><creatorcontrib>Cromme, Ludwig J</creatorcontrib><creatorcontrib>Kunath, Jens</creatorcontrib><creatorcontrib>Krebs, Andreas</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Cromme, Ludwig J</au><au>Kunath, Jens</au><au>Krebs, Andreas</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Computing best discrete least-squares approximations by first-degree splines with free knots</atitle><date>2017-04-19</date><risdate>2017</risdate><abstract>We present an algorithm to compute best least-squares approximations of
discrete real-valued functions by first-degree splines (broken lines) with free
knots. We demonstrate that the algorithm delivers after a finite number of
steps a (global) best approximation. The analysis is complemented by remarks on
programming and by a number of numerical examples including applications from
medicine (MBC, MIC).</abstract><doi>10.48550/arxiv.1704.05670</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.1704.05670 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_1704_05670 |
| source | arXiv.org |
| subjects | Mathematics - Numerical Analysis |
| title | Computing best discrete least-squares approximations by first-degree splines with free knots |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-17T07%3A04%3A57IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Computing%20best%20discrete%20least-squares%20approximations%20by%20first-degree%20splines%20with%20free%20knots&rft.au=Cromme,%20Ludwig%20J&rft.date=2017-04-19&rft_id=info:doi/10.48550/arxiv.1704.05670&rft_dat=%3Carxiv_GOX%3E1704_05670%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |