An algorithm for best generalised rational approximation of continuous functions
The motivation of this paper is the development of an optimisation method for solving optimisation problems appearing in Chebyshev rational and generalised rational approximation problems, where the approximations are constructed as ratios of linear forms (linear combinations of basis functions). Th...
Saved in:
| Main Authors | , , |
|---|---|
| Format | Journal Article |
| Language | English |
| Published |
05.11.2020
|
| Subjects | |
| Online Access | Get full text |
| DOI | 10.48550/arxiv.2011.02721 |
Cover
| Abstract | The motivation of this paper is the development of an optimisation method for
solving optimisation problems appearing in Chebyshev rational and generalised
rational approximation problems, where the approximations are constructed as
ratios of linear forms (linear combinations of basis functions). The
coefficients of the linear forms are subject to optimisation and the basis
functions are continuous function. It is known that the objective functions in
generalised rational approximation problems are quasi-convex. In this paper we
also prove a stronger result, the objective functions are pseudo-convex in the
sense of Penot and Quang. Then we develop numerical methods, that are efficient
for a wide range of pseudo-convex functions and test them on generalised
rational approximation problems. |
|---|---|
| AbstractList | The motivation of this paper is the development of an optimisation method for
solving optimisation problems appearing in Chebyshev rational and generalised
rational approximation problems, where the approximations are constructed as
ratios of linear forms (linear combinations of basis functions). The
coefficients of the linear forms are subject to optimisation and the basis
functions are continuous function. It is known that the objective functions in
generalised rational approximation problems are quasi-convex. In this paper we
also prove a stronger result, the objective functions are pseudo-convex in the
sense of Penot and Quang. Then we develop numerical methods, that are efficient
for a wide range of pseudo-convex functions and test them on generalised
rational approximation problems. |
| Author | Ugon, Julien Millán, R. Díaz Sukhorukova, Nadezda |
| Author_xml | – sequence: 1 givenname: R. Díaz surname: Millán fullname: Millán, R. Díaz – sequence: 2 givenname: Nadezda surname: Sukhorukova fullname: Sukhorukova, Nadezda – sequence: 3 givenname: Julien surname: Ugon fullname: Ugon, Julien |
| BackLink | https://doi.org/10.48550/arXiv.2011.02721$$DView paper in arXiv |
| BookMark | eNqFjr0OwjAQgzPAwN8DMHEvQEkKFawIgRgZ2Ku0JCVSelddUlTeHlqxM1m2bPmbihESGiGWSia7Q5bJjebOvZJUKpXIdJ-qibgdEbSviF181mCJoTAhQmXQsPYumAewjo5Qe9BNw9S5evBAFkrC6LClNoBtsezjMBdjq30wi5_OxOpyvp-u6-E7b_i753feM-QDw_Z_4wPJLz9q |
| ContentType | Journal Article |
| Copyright | http://arxiv.org/licenses/nonexclusive-distrib/1.0 |
| Copyright_xml | – notice: http://arxiv.org/licenses/nonexclusive-distrib/1.0 |
| DBID | AKY AKZ GOX |
| DOI | 10.48550/arxiv.2011.02721 |
| DatabaseName | arXiv Computer Science arXiv Mathematics arXiv.org |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: GOX name: arXiv.org url: http://arxiv.org/find sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| ExternalDocumentID | 2011_02721 |
| GroupedDBID | AKY AKZ GOX |
| ID | FETCH-arxiv_primary_2011_027213 |
| IEDL.DBID | GOX |
| IngestDate | Tue Jul 22 23:01:22 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-arxiv_primary_2011_027213 |
| OpenAccessLink | https://arxiv.org/abs/2011.02721 |
| ParticipantIDs | arxiv_primary_2011_02721 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-11-05 |
| PublicationDateYYYYMMDD | 2020-11-05 |
| PublicationDate_xml | – month: 11 year: 2020 text: 2020-11-05 day: 05 |
| PublicationDecade | 2020 |
| PublicationYear | 2020 |
| Score | 3.4823537 |
| SecondaryResourceType | preprint |
| Snippet | The motivation of this paper is the development of an optimisation method for
solving optimisation problems appearing in Chebyshev rational and generalised... |
| SourceID | arxiv |
| SourceType | Open Access Repository |
| SubjectTerms | Computer Science - Numerical Analysis Mathematics - Numerical Analysis Mathematics - Optimization and Control |
| Title | An algorithm for best generalised rational approximation of continuous functions |
| URI | https://arxiv.org/abs/2011.02721 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwdVxLSwMxEB5qT15EUanPzsHromRf2WMRaynYelDY25JssnVBt7J90J_vTLKil16TEIZJyHzfTOYDuNNZKLUyNtCxVEEkKxPIpCKyUspMhUkqVMkV3ZdZMnmPpnmc9wB_e2FUu6u3Xh9Yr-69wqZIuVP8QAgmV8_z3BcnnRRXt_5vHWFMN_QvSIyP4ahDdzjyx3ECPducwuuoQfW5WBIN__hCAomo6SnGhRd8rlfWYNul5NBJfO9q30-Iywr5K3ndbIifI4cgd0vOYDh-enucBM6G4tsLRhRsXuHMC8-hT7TeDrhZ2ugsDoXSkSFMQji_zCz5KtIPKXlQXMBg3y6X-6eu4FAwI-TEZ3wN_XW7sTcUNtf61vnuB91ic5M |
| linkProvider | Cornell University |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+algorithm+for+best+generalised+rational+approximation+of+continuous+functions&rft.au=Mill%C3%A1n%2C+R.+D%C3%ADaz&rft.au=Sukhorukova%2C+Nadezda&rft.au=Ugon%2C+Julien&rft.date=2020-11-05&rft_id=info:doi/10.48550%2Farxiv.2011.02721&rft.externalDocID=2011_02721 |