{"entities":{"Q6915907":{"pageid":20997811,"ns":120,"title":"Item:Q6915907","lastrevid":75673477,"modified":"2026-04-20T14:22:08Z","type":"item","id":"Q6915907","labels":{"en":{"language":"en","value":"Interpolation of set-valued functions"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8106206"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6915907$511EF18C-A0E3-4833-AB6C-5DEF68FBB050","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"16e40f0033abf4dd5869bcb1996b6d4ddf587ba4","datavalue":{"value":{"text":"Interpolation of set-valued functions","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6915907$30C5BFF0-E0A0-4FE1-8D3F-31E8E36A91DA","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"e9d9cd5dafbdd12ec7fc473e792c886b237870ca","datavalue":{"value":"10.1093/IMANUM/DRAE031","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6915907$24F807DB-963A-448F-B83E-A7778F65BD96","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"0c347d79024284f14e3f2c82219f3afe0d00f59a","datavalue":{"value":{"entity-type":"item","numeric-id":1226243,"id":"Q1226243"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6915907$D44AF051-63B2-45CB-A60B-93A948FA2E5B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"ccf75ff3403c3511d3459fa9d45b1a0d63ef5515","datavalue":{"value":{"entity-type":"item","numeric-id":6880547,"id":"Q6880547"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6915907$F930F902-F2A2-4D63-9697-0C74D3584AF4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"5c597c24b000f3aeb30b42de785c39905ff046a3","datavalue":{"value":{"entity-type":"item","numeric-id":6409372,"id":"Q6409372"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6915907$F3EB3D39-3A5C-4A57-8197-5437A2CB2FD4","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"25d0e0f50f81a9191da925dbc443d13304756d3f","datavalue":{"value":{"entity-type":"item","numeric-id":146785,"id":"Q146785"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6915907$59984138-97A0-4527-8CCB-BF17EE3C2580","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"1be1a084743b7fe843755b397196118f7c063294","datavalue":{"value":{"time":"+2025-10-15T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6915907$9B9D6FFE-1548-4E7C-B1E6-06B858C71319","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"bc1513ba6c36abe3c5a8d1928012167b3cd2139e","datavalue":{"value":"It has become more and more relevant to approximate and interpolate set-valued functions rather than functions with single (complex or real, for instance) values. In this paper, a general approach with detailed algorithms is presented in this frame-work. The arguments of the set-valued approximands live in inervals while the values are sets of all different forms.\\N\\NOne of the central ideas is to mimick polynomial interpolation which is of course one of the work horses of approximation theory when forming the set-valued interpolants (or in fact any approximation algorithms). Of course given the complexity of the task, neither polynomials nor piecewise polynomials (splines) are sufficiently general. But the authors propose highly useful methods that prepare the interpolation process by preceding it by forming so-called metric chains of the data. These could be finite or infinite, the latter being potentially useless for their implementations, but the idea is to select subsets of these metric chains before in an intermediate approximation process. Those are then called significant metric chains. On those the actual interpolation is carried out.\\N\\NError estimates are of course fundamental to most work in approximation theory. The author provide error bounds for Lipschitz data with samples at roots of orthogonal polynomials (Chebyshev in this instance). The goal that the approximation becomes better with more interpolation point samples is achieved. One hopes that smoother underlying domains also improve the convergence properties, and the authors establish that too.\\N\\NFinally, changes in the topology of the underlying domains and holes are being dealt with. One form of improving the approximation error in those situation is the creation of local changes to the interpolants. This too is taken care of in the provided error bounds and implementations in great detail, and in the many examples that are included in the interesting article.","type":"string"},"datatype":"string"},"type":"statement","id":"Q6915907$B34AADC5-F4C1-4832-BF12-7E87A1880C2C","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"57517494b25f5328eb9a6d2c44038a6d20040d33","datavalue":{"value":{"entity-type":"item","numeric-id":504888,"id":"Q504888"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6915907$07CD7A2C-E596-4AAA-B21E-449D7E7AA2F4","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"1d97fa68dd4f971b8cbd10801313cf3fd95c3e3e","datavalue":{"value":"41A05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6915907$743B441C-19D7-4A82-AC39-E9B14EEABF90","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"f5c0ca7a0535c712f5b87250d341960178b408d3","datavalue":{"value":"8106206","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6915907$DAE8640C-450C-42E0-B45F-73301B3AC9F3","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"384ce42b9d56318867b290c0b2e557c464c31b38","datavalue":{"value":"approximation theory","type":"string"},"datatype":"string"},"type":"statement","id":"Q6915907$C3D74F4A-A98C-47E9-A607-3F73695EDAE0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3924f264f18428f4ca392e443e140020ac96cc43","datavalue":{"value":"set-valued functions","type":"string"},"datatype":"string"},"type":"statement","id":"Q6915907$A76DD862-AD1F-4896-95C5-943C5FA8883B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d9bc6474ad8409ef4528af84655741b6b5be3d7c","datavalue":{"value":"interpolation","type":"string"},"datatype":"string"},"type":"statement","id":"Q6915907$476613D0-2EF5-40C1-9EC6-FC9C527E46CE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"48ddf43eca498c7e7087cd696beb82ea63925320","datavalue":{"value":"algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q6915907$63D26276-E4FD-40B1-8424-1ED0C4C1AA88","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6915907$6125D261-6E36-4428-80A7-F8A43112697E","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Interpolation of set-valued functions","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Interpolation_of_set-valued_functions"}}}}}