IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 2011 · 32 citations · 9 references
ComputingComputer ScienceMathematicsAlgorithmsComputational MechanicsComputational Structural AnalysisIterative SolversMatrix ComputationNumerical AlgorithmsNumerical AnalysisNumerical IntegrationNumerical Linear AlgebraHigh-order Numerical IntegrationJacobian Matrix AnalysisJacobian Matrix ApproximationJacobian Matrix RankStable Integration
This paper presents structural characterization and performance enhancement strategies for the recently proposed <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">A</i> -stable and L-stable high-order integration methods based on the Obreshkov formula. It is demonstrated that although the Jacobian matrix in these methods has a bigger size than the Jacobian matrix in classical low-order methods, it enjoys a special structure that can be used to develop efficient factorization techniques. In addition, the paper proposes a method to reduce the number of Newton-Raphson iterations needed to converge in the large Jacobian domain.
9
Order stars and stability theorems
Gerhard Wanner, Ernst Hairer, Syvert P. Nørsett · BIT Numerical Mathematics · 1978 · 245 citations · Full text
Vacuum · 1965 · 196 citations