Efficiency of embedded explicit pseudo two-step RKN methods on a shared memory parallel computer

MaRDI QIDQ863767zbMATH OpenFDO

Authors Nguyen Huu Cong, H. Podhaisky, R. Weiner

Publication date 31 January 2007

Published in Vietnam Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

numerical examplesparallel computationcomparison of methodsnonstiff initial-value problems[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=embedded+explicit+pseudo+two-step+Runge-Kutta-Nystr%EF%BF%BD%EF%BF%BDm+methods&go=Go embedded explicit pseudo two-step Runge-Kutta-Nystr��m methods]

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Nonlinear ordinary differential equations and systems (34A34) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Numerical methods for initial value problems involving ordinary differential equations (65L05)

Recommendations

• Numerical experiments with some explicit pseudo two-step RK methods on a shared memory computer
• A general class of explicit pseudo--two-step RKN methods on parallel computers
• Improved parallel-iterated pseudo two-step RKN methods for nonstiff problems
• Explicit pseudo two-step runge-kutta methods for parallel computers^∗
• A class of explicit parallel two-step Runge-Kutta methods
• Explicit parallel two-step Runge-Kutta-Nyström methods
• Parallel predictor-corrector iteration of pseudo two-step RK methods for nonstiff IVPs
• An improvement for explicit parallel Runge-Kutta methods
• Improved parallel-iterated pseudo two-step RK methods for nonstiff IVPs

Cited in

(2)

• Explicit pseudo two-step RKN methods with stepsize control
• A general class of explicit pseudo--two-step RKN methods on parallel computers

This page was built for publication: Efficiency of embedded explicit pseudo two-step RKN methods on a shared memory parallel computer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q863767)