An efficient linearity-and-bound-preserving remapping method
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F03%3A00095059" target="_blank" >RIV/68407700:21340/03:00095059 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
An efficient linearity-and-bound-preserving remapping method
Original language description
In this paper we describe an efficient, local-bound-preserving conservative interpolation (remapping) algorithm, which is exact for a global linear function (linearity-preserving). The algorithm is based on reconstruction, approximate integration and mass re-distribution. We demonstrate our new algorithm on a series of numerical examples.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
V - Vyzkumna aktivita podporovana z jinych verejnych zdroju
Others
Publication year
2003
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Journal of Computational Physics
ISSN
0021-9991
e-ISSN
—
Volume of the periodical
188
Issue of the periodical within the volume
2
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
10
Pages from-to
—
UT code for WoS article
000183822900006
EID of the result in the Scopus database
—