Results 151 to 160 of about 9,706 (180)
Some of the next articles are maybe not open access.
A class of exponential methods for stiff initial-value problems
International Journal of Computer Mathematics, 1996In this paper, we derive a class of exponential methods for solving the stiff initial-value problems. The present methods are unconditionally stable and satisfy a discrete maximum principle. These include an even order of accuracy when the perturbation parameter, e, is fixed and have the property that if e is of order h they reduce to first order ...
A A Salama
exaly +2 more sources
Inexact Methods in the Numerical Solution of Stiff Initial Value Problems
Computing (Vienna/New York), 1999The paper deals with the analysis of the local convergence properties of the inexact Newton methods (IN-methods) which can be effectively used for solving large stiff initial value problems for nonlinear ordinary differential equations. New conditions assuring linear convergence of IN-methods in terms of a sequence of forcing terms uniformly less than ...
Benedetta Morini
exaly +3 more sources
A modified Adams method for nonstiff and mildly stiff initial value problems
ACM Transactions on Mathematical Software, 1993 Adams predictor-corrector methods, and explicit Runge–Kutta formulas, have been widely used for the numerical solution of nonstiff initial value problems. Both of these classes of methods have certain drawbacks, however, and it has long been the aim of numerical analysts to derive a class of formulas that has the advantages of both Adams and Runge ...
Jeff R. Cash, S. Semnani
openaire +2 more sources
Two classes of implicit–explicit multistep methods for nonlinear stiff initial-value problems
Applied Mathematics and Computation, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aiguo Xiao, Gengen Zhang, Xing Yi
exaly +3 more sources
Implicit parallel peer methods for stiff initial value problems
Applied Numerical Mathematics, 2005The authors consider initial value problems for stiff ordinary differential equations. They derive a class of implicit two-step integration methods having \(s\)-stages which may be computed in parallel. A special representation of the matrices allows to construct a subclass of methods being stable for general stepsize sequences.
Bernhard A Schmitt
exaly +2 more sources
A new variable step size block backward differentiation formula for solving stiff initial value problems [PDF]
International Journal of Computer Mathematics, 2013 A new block backward differentiation formula of order 4 with variable step size is formulated. By varying a parameter in the formula, different sets of formulae with A-stability property can be generated. At the cost of an additional function evaluation,
Norazak Senu
exaly +2 more sources
DESI methods for stiff initial-value problems
ACM Transactions on Mathematical Software, 1996Recently, the so-called DESI (diagonally extended singly implicit) Runge-Kutta methods were introduced to overcome some of the limitations of singly implicit methods. Preliminary experiments have shown that these methods are usually more efficient than the standard singly implicit Runge-Kutta (SIRK) methods and, in many cases, are competitive with ...
John C. Butcher +2 more
openaire +1 more source
Journal of Computational and Applied Mathematics, 2000 For many years the methods of choice for the numerical solution of stiff initial value problems and certain classes of differential algebraic equations have been the well-known backward differentiation formulae (BDF).
J R Cash
exaly +2 more sources
On the neural network solution of stiff initial value problems
AIP Conference Proceedings, 2020Computational Intelligence techniques are becoming more and more popular in the treatment of classical mathematical problems. The use of Neural Networks (NN) for the solution of Differential Equations is not a new perspective, as this scientific area is active for more than twenty five years.
Vaso Kaloutsa, Ioannis Th. Famelis
openaire +1 more source
Achieving tolerance proportionality in software for stiff initial-value problems
Computing, 1989The paper presents a basis for a uniform interpretation of the user's accuracy requirement in codes for solving stiff initial value problems. It is shown that it is possible to design the local error control strategy in a code in such a way as to achieve the tolerance proportionality. The strategy is based on a control of the local error per unit step.
Wayne H. Enright, Wendy Louise Seward
openaire +2 more sources