An algorithm for chebyshev approximation by rationals with constrained denominators
Identifieur interne : 002801 ( Main/Exploration ); précédent : 002800; suivant : 002802An algorithm for chebyshev approximation by rationals with constrained denominators
Auteurs : M. Gugat [Allemagne]Source :
- Constructive Approximation [ 0176-4276 ] ; 1996-06-01.
Abstract
Abstract: The problem of rational approximation is facilitated by introducing both lower and upper bounds on the denominators. For a general fractional inf-sup problem with constrained denominators, a differential correction algorithm and convergence results are given. Numerical examples are presented. The proposed algorithm has certain advantages compared with the original differential correction method: not only upper but also lower bounds for the optimal value are computed, linear convergence is always guaranteed, and due to a different start convergence is more rapid.
Url:
DOI: 10.1007/BF02433040
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001108
- to stream Istex, to step Curation: 000F97
- to stream Istex, to step Checkpoint: 001075
- to stream Main, to step Merge: 002C75
- to stream Main, to step Curation: 002801
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">An algorithm for chebyshev approximation by rationals with constrained denominators</title><author><name sortKey="Gugat, M" sort="Gugat, M" uniqKey="Gugat M" first="M." last="Gugat">M. Gugat</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:FC3A95E05FAE56E94E64ED7102A92326A05EECC7</idno><date when="1996" year="1996">1996</date><idno type="doi">10.1007/BF02433040</idno><idno type="url">https://api.istex.fr/document/FC3A95E05FAE56E94E64ED7102A92326A05EECC7/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001108</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001108</idno><idno type="wicri:Area/Istex/Curation">000F97</idno><idno type="wicri:Area/Istex/Checkpoint">001075</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001075</idno><idno type="wicri:doubleKey">0176-4276:1996:Gugat M:an:algorithm:for</idno><idno type="wicri:Area/Main/Merge">002C75</idno><idno type="wicri:Area/Main/Curation">002801</idno><idno type="wicri:Area/Main/Exploration">002801</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">An algorithm for chebyshev approximation by rationals with constrained denominators</title><author><name sortKey="Gugat, M" sort="Gugat, M" uniqKey="Gugat M" first="M." last="Gugat">M. Gugat</name><affiliation wicri:level="4"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Department of Mathematics, University of Trier, 54286, Trier</wicri:regionArea><orgName type="university">Université de Trèves</orgName><placeName><settlement type="city">Trèves (Allemagne)</settlement><region type="land" nuts="1">Rhénanie-Palatinat</region></placeName></affiliation></author></analytic><monogr></monogr><series><title level="j">Constructive Approximation</title><title level="j" type="abbrev">Constr. Approx</title><idno type="ISSN">0176-4276</idno><idno type="eISSN">1432-0940</idno><imprint><publisher>Springer-Verlag</publisher><pubPlace>New York</pubPlace><date type="published" when="1996-06-01">1996-06-01</date><biblScope unit="volume">12</biblScope><biblScope unit="issue">2</biblScope><biblScope unit="page" from="197">197</biblScope><biblScope unit="page" to="221">221</biblScope></imprint><idno type="ISSN">0176-4276</idno></series><idno type="istex">FC3A95E05FAE56E94E64ED7102A92326A05EECC7</idno><idno type="DOI">10.1007/BF02433040</idno><idno type="ArticleID">BF02433040</idno><idno type="ArticleID">Art3</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0176-4276</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The problem of rational approximation is facilitated by introducing both lower and upper bounds on the denominators. For a general fractional inf-sup problem with constrained denominators, a differential correction algorithm and convergence results are given. Numerical examples are presented. The proposed algorithm has certain advantages compared with the original differential correction method: not only upper but also lower bounds for the optimal value are computed, linear convergence is always guaranteed, and due to a different start convergence is more rapid.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>Rhénanie-Palatinat</li></region><settlement><li>Trèves (Allemagne)</li></settlement><orgName><li>Université de Trèves</li></orgName></list><tree><country name="Allemagne"><region name="Rhénanie-Palatinat"><name sortKey="Gugat, M" sort="Gugat, M" uniqKey="Gugat M" first="M." last="Gugat">M. Gugat</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002801 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002801 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:FC3A95E05FAE56E94E64ED7102A92326A05EECC7
|texte= An algorithm for chebyshev approximation by rationals with constrained denominators
}}
| This area was generated with Dilib version V0.6.31. |  |