Wszystkie pola: Boundary value problems - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Solving boundary value problems in the open source software R: package bvpSolve
Autorzy:: Mazzia, F.
Cash, J. R.
Soetaert, K.
Powiązania:: https://bibliotekanauki.pl/articles/255850.pdf
Data publikacji:: 2014
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:: ordinary differential equations
boundary value problems
singular perturbation problems
test problems
Fortran
R
Opis:: The R package bvpSolve for the numerical solution of Boundary Value Problems (BVPs) is presented. This package is free software which is distributed under the GNU General Public License, as part of the R open source software project. It includes some well known codes to solve boundary value problems of ordinary differential equations (ODEs) and differential algebraic equations (DAEs). In addition to the packages already available for solving initial value problems, the new package now allows non expert users to efficiently solve boundary value problems in the problem solving environment R.
Źródło:: Opuscula Mathematica; 2014, 34, 2; 387-403
1232-9274
2300-6919
Pojawia się w:: Opuscula Mathematica
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: The numerical solution of nonlinear two-point boundary value problems using iterated deferred correction - a survey
Autorzy:: Cash, J. R.
Powiązania:: https://bibliotekanauki.pl/articles/255625.pdf
Data publikacji:: 2006
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:: deferred correction
boundary value problems
conditioning
mesh selection
Opis:: The use of iterated deferred correction has proved to be a very efficient approach to the numerical solution of general first order systems of nonlinear two-point boundary value problems. In particular the two high order codes TWPBVP.f, based on mono-implicit Runge-Kutta (MIRK) formulae, and TWPBVPL.f based on Lobatto Runge-Kutta formulae as well as the continuation codes ACDC.f and COLMOD.f are now widely used. In this survey we describe some of the problems involved in the derivation of efficient deferred correction schemes. In particular we consider the construction of high order methods which preserve the stability of the underlying formulae, the choice of the mesh choosing algorithm which is based both on local accuracy and conditioning, and the computation of continuous solutions.
Źródło:: Opuscula Mathematica; 2006, 26, 2; 269-287
1232-9274
2300-6919
Pojawia się w:: Opuscula Mathematica
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja