Stiffness in numerical initial-value problems
MN Spijker - Journal of Computational and Applied Mathematics, 1996 - Elsevier
This paper reviews various aspects of stiffness in the numerical solution of initial-value
problems for systems of ordinary differential equations. In the literature on numerical …
problems for systems of ordinary differential equations. In the literature on numerical …
[图书][B] Solving ordinary differential equations in R
K Soetaert, J Cash, F Mazzia, K Soetaert, J Cash… - 2012 - Springer
Abstract Both Runge-Kutta and linear multistep methods are available to solve initial value
problems for ordinary differential equations in the R packages deSolve and deTestSet …
problems for ordinary differential equations in the R packages deSolve and deTestSet …
Symplectic exponential Runge–Kutta methods for solving nonlinear Hamiltonian systems
L Mei, X Wu - Journal of Computational Physics, 2017 - Elsevier
Symplecticity is also an important property for exponential Runge–Kutta (ERK) methods in
the sense of structure preservation once the underlying problem is a Hamiltonian system …
the sense of structure preservation once the underlying problem is a Hamiltonian system …
Control strategies for the iterative solution of nonlinear equations in ODE solvers
K Gustafsson, G Söderlind - SIAM Journal on Scientific Computing, 1997 - SIAM
In the numerical solution of ODEs by implicit time-stepping methods, a system of (nonlinear)
equations has to be solved each step. It is common practice to use fixed-point iterations or …
equations has to be solved each step. It is common practice to use fixed-point iterations or …
Convergence behaviour of inexact Newton methods
B Morini - Mathematics of Computation, 1999 - ams.org
In this paper we investigate local convergence properties of inexact Newton and Newton-
like methods for systems of nonlinear equations. Processes with modified relative residual …
like methods for systems of nonlinear equations. Processes with modified relative residual …
Numerical approximation of a metastable system
J Carr, DB Duncan, CH Walshaw - IMA journal of numerical …, 1995 - academic.oup.com
Using the Becker-Döring cluster equations as an example, we highlight some of the
problems that can arise in the numerical approximation of dynamical systems with slowly …
problems that can arise in the numerical approximation of dynamical systems with slowly …
An efficient and unconditionally stable numerical algorithm for nonlinear structural dynamics
This article proposes an algorithm for express solutions in nonlinear structural dynamics.
Our strategy is to adopt a typical time integrator and accept the solution after a constant …
Our strategy is to adopt a typical time integrator and accept the solution after a constant …
Runge-Kutta methods for the numerical solution of stiff semilinear systems
M Calvo, S González-Pinto, JI Montijano - BIT Numerical Mathematics, 2000 - Springer
This paper studies the stability and convergence properties of general Runge-Kutta methods
when they are applied to stiff semilinear systems y′(t)= J (t) y (t)+ g (t, y (t)) with the stiffness …
when they are applied to stiff semilinear systems y′(t)= J (t) y (t)+ g (t, y (t)) with the stiffness …
An efficient family of strongly A-stable Runge–Kutta collocation methods for stiff systems and DAEs. Part II: Convergence results
S González-Pinto, D Hernández-Abreu… - Applied Numerical …, 2012 - Elsevier
The convergence properties of a newly defined uniparametric family of collocation Runge–
Kutta methods on non-stiff systems, stiff semi-linear problems and Differential-Algebraic …
Kutta methods on non-stiff systems, stiff semi-linear problems and Differential-Algebraic …
The Newton-arithmetic mean method for the solution of systems of nonlinear equations
E Galligani - Applied mathematics and computation, 2003 - Elsevier
This paper is concerned with the development of the Newton-arithmetic mean method for
large systems of nonlinear equations with block-partitioned Jacobian matrix. This method is …
large systems of nonlinear equations with block-partitioned Jacobian matrix. This method is …