Results 81 to 90 of about 143 (130)

DIMSEMs - Diagonally Implicit Single-Eigenvalue Methods for the Numerical Solution of Stiff ODEs on Parallel Computers: A Preliminary Report

open access: yes, 1995
We describe a new class of General Linear Methods (GLMs) with the following properties: the methods are strictly diagonally implicit, allowing efficient parallel implementation; the stability matrix has no spurious eigenvalues (i.e., only one eigenvalue ...
Robert F. Enenkel, Kenneth R. Jackson
core  

An Algorithm For The Numerical Solution Of Differential Equations Of Fractional Order

open access: yes, 1997
. Differential equations involving derivatives of non-integer order have shown to be adequate models for various physical phenomena in areas like damping laws, diffusion processes, etc.
Kai Diethelm
core  

Spectral approximation of time windows in the solution of dissipative linear differential equations, submitted to IMA

open access: yes, 2008
. We establish a relation between the length T of the integration window of a linear differential equation x ′ + Ax = b and a spectral parameter s ∗. This parameter is determined by comparing the exact solution x(T) at the end of the integration window ...
B. D. Welfert, K. Burrage, Z. Jackiewicz
core  

The Numerical Solution of Constrained Hamiltonian Systems.

open access: yes, 1992
A Hamiltonian system subject to smooth constraints can typically be viewed as a Hamiltonian system on a manifold. Numerical computations, however, must be performed in $ R^n$.
Leimkuhler, Benedict, Reich, Sebastian
core   +1 more source

Solving Stiff Differential Equations with the Method of Patches

open access: yes, 2007
We introduce a new method for solving very stiff sets of ordinary differential equations. The basic idea is to replace the original nonlinear equations with a set of equally stiff equations that are piecewise linear, and therefore can be solved exactly ...
Michael Marder   +2 more
core  

Symplectic Runge-Kutta Schemes II: Classification Of Symmetric Methods

open access: yes
. A complete classification of all symplectic self-adjoint Runge-Kutta methods with up to 6 stages is given and the derivation process used is outlined.
M. Sofroniou, W. Oevel
core  

Home - About - Disclaimer - Privacy