Fitting a Sobolev function to data. II. (Q726773)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6603473
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fitting a Sobolev function to data. II. |
scientific article; zbMATH DE number 6603473 |
Statements
Fitting a Sobolev function to data. II. (English)
0 references
14 July 2016
0 references
Summary: In this paper and two companion papers (Part I and Part III) [the authors, ibid. 32, No. 1, 275--376 (2016; Zbl 1338.65028); ibid. 32, No. 3, 1039--1126 (2016; Zbl 1386.65069)], we produce efficient algorithms to solve the following interpolation problem. Let \(\mathfrak{m} \geq 1\) and \(\mathfrak{p} > \mathfrak{n} \geq 1\). Given a finite set \(E \subset \mathbb{R}^{\mathfrak n}\) and a function \(f:E \to \mathbb{R}\), compute an extension \(F\) of \(f\) belonging to the Sobolev space \(W^{\mathfrak {m,p}}(\mathbb{R}^{\mathfrak n})\) with norm having the smallest possible order of magnitude; secondly, compute the order of magnitude of the norm of F. The combined running time of our algorithms is at most \(CN \log N\), where \(N\) denotes the cardinality of \(E\), and \(C\) depends only on \(\mathfrak m\), \(\mathfrak n\), and \(\mathfrak p\).
0 references
algorithm
0 references
interpolation
0 references
Sobolev spaces
0 references
0.996021032333374
0 references
0.9344526529312134
0 references
0.8604444861412048
0 references
0.8343092799186707
0 references
0.8110707998275757
0 references