Geodesic
A method to cut convex polyhedrons and its application to ill-posed problems
Numerical methods and programming, Tome 1 (2000) no. 1, pp. 8-13

Voir la notice de l'article provenant de la source Math-Net.Ru

We first consider linear ill-posed problems on compact sets of a special structure. Second, two approaches based on the method to cut convex polyhedrons for estimation of an error of an approximate solution are proposed. Finally, the domain the exact solution of the inverse problem for the heat conduction equation belongs to is constructed.
Keywords: ill-posed problems, method to cut convex polyhedrons, heat conduction equation.
Mots-clés : error estimation 
V. N. Titarenko; A. G. Yagola. A method to cut convex polyhedrons and its application to ill-posed problems. Numerical methods and programming, Tome 1 (2000) no. 1, pp. 8-13. http://geodesic.mathdoc.fr/item/VMP_2000_1_1_a1/
@article{VMP_2000_1_1_a1,
     author = {V. N. Titarenko and A. G. Yagola},
     title = {A method to cut convex polyhedrons and its application to ill-posed problems},
     journal = {Numerical methods and programming},
     pages = {8--13},
     year = {2000},
     volume = {1},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VMP_2000_1_1_a1/}
}
TY  - JOUR
AU  - V. N. Titarenko
AU  - A. G. Yagola
TI  - A method to cut convex polyhedrons and its application to ill-posed problems
JO  - Numerical methods and programming
PY  - 2000
SP  - 8
EP  - 13
VL  - 1
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/VMP_2000_1_1_a1/
LA  - ru
ID  - VMP_2000_1_1_a1
ER  - 
%0 Journal Article
%A V. N. Titarenko
%A A. G. Yagola
%T A method to cut convex polyhedrons and its application to ill-posed problems
%J Numerical methods and programming
%D 2000
%P 8-13
%V 1
%N 1
%U http://geodesic.mathdoc.fr/item/VMP_2000_1_1_a1/
%G ru
%F VMP_2000_1_1_a1