On the worst scenario method: Application to uncertain nonlinear differential equations with numerical examples

Harasim, Petr

  • Programs and Algorithms of Numerical Mathematics, Publisher: Institute of Mathematics AS CR(Prague), page 84-88

How to cite

top

Harasim, Petr. "On the worst scenario method: Application to uncertain nonlinear differential equations with numerical examples." Programs and Algorithms of Numerical Mathematics. Prague: Institute of Mathematics AS CR, 2010. 84-88. <http://eudml.org/doc/271412>.

@inProceedings{Harasim2010,
author = {Harasim, Petr},
booktitle = {Programs and Algorithms of Numerical Mathematics},
keywords = {worst scenario problem; boundary value problem; nonlinear ordinary differential equation; uncertain input parameters; Kachanov method},
location = {Prague},
pages = {84-88},
publisher = {Institute of Mathematics AS CR},
title = {On the worst scenario method: Application to uncertain nonlinear differential equations with numerical examples},
url = {http://eudml.org/doc/271412},
year = {2010},
}

TY - CLSWK
AU - Harasim, Petr
TI - On the worst scenario method: Application to uncertain nonlinear differential equations with numerical examples
T2 - Programs and Algorithms of Numerical Mathematics
PY - 2010
CY - Prague
PB - Institute of Mathematics AS CR
SP - 84
EP - 88
KW - worst scenario problem; boundary value problem; nonlinear ordinary differential equation; uncertain input parameters; Kachanov method
UR - http://eudml.org/doc/271412
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.