The L2-optimality of the IIPG method for odd degrees of polynomial approximation in 1D
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10022127" target="_blank" >RIV/00216208:11320/10:10022127 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
The L2-optimality of the IIPG method for odd degrees of polynomial approximation in 1D
Original language description
The paper proves the L2-optimality of the incomplete interior penalty method for odd degrees of polynomial approximation for 1D elliptic problems.
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
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2010
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 Scientific Computing
ISSN
0885-7474
e-ISSN
—
Volume of the periodical
42
Issue of the periodical within the volume
1
Country of publishing house
US - UNITED STATES
Number of pages
22
Pages from-to
—
UT code for WoS article
000273034200008
EID of the result in the Scopus database
—