Spline-wavelet coarsening of Courant-type approximations (Q2255517): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Yuri K. Dem'yanovich / rank | |||
| Property / author | |||
| Property / author: Yuri K. Dem'yanovich / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10958-014-1869-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1987726231 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4488070 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Courant type approximations and their wavelet decomposition / rank | |||
Normal rank | |||
Latest revision as of 17:27, 9 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Spline-wavelet coarsening of Courant-type approximations |
scientific article |
Statements
Spline-wavelet coarsening of Courant-type approximations (English)
0 references
17 February 2015
0 references
The authors consider the construction of spline-wavelet coarsening of Courant-type approximations. The strength of their method is the easy way to implement these fast computations; the weakness lies in the reason why this is so easy: very simple triangulations are considered. The algorithm seems really efficient for a scheme that is appropriate to handle this kind of simple mesh.
0 references
splines
0 references
wavelets
0 references
decomposition
0 references
calibration relations
0 references
reconstruction
0 references
triangulation coarsening
0 references
