Parallel diagonally implicit Runge-Kutta-Nyström methods (Q1184014)

From MaRDI portal





scientific article; zbMATH DE number 33980
Language Label Description Also known as
default for all languages
No label defined
    English
    Parallel diagonally implicit Runge-Kutta-Nyström methods
    scientific article; zbMATH DE number 33980

      Statements

      Parallel diagonally implicit Runge-Kutta-Nyström methods (English)
      0 references
      0 references
      0 references
      0 references
      28 June 1992
      0 references
      The authors report the results of the integration of initial-value problem for systems of special second-order ordinary differential equations \(y''(t)=f(y(t))\) of dimension \(d\) with large Lipschitz constants. An iterative solution procedure is constructed in such a way that it can be easily implemented on parallel computers. In each step the iterative method is a diagonally implicit Runge-Kutta-Nyström method; because the number of states of this method varies considerably from step to step, the application of the parallelism is especially efficient. Additionally, by a suitable choice of the iteration parameters based on the minimization of the spectral radius of the stage vector iteration matrix, the parallel computers can keep fairly small the total number of stages. This allows to overcome the phenomenon of order reduction due to high harmonics observed in many problems with large Lipschitz constants. Four numerical examples show the advantage of the new approach, which can be also extended to the problem \(y^{(\nu)}(t)=f(y(t))\), \(\nu > 2\).
      0 references
      second order equations
      0 references
      initial-value problem
      0 references
      large Lipschitz constants
      0 references
      parallel computers
      0 references
      iterative method
      0 references
      diagonally implicit Runge-Kutta- Nyström method
      0 references
      spectral radius
      0 references
      order reduction
      0 references
      numerical examples
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references