Triangularly Implicit Iteration Methods for ODE-IVP Solvers

DOI10.1137/S1064827595287456zbMath0872.65072OpenAlexW2033886849MaRDI QIDQ3124017

P. J. van der Houwen, Jacques J. B. de Swart

Publication date: 22 July 1997

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1064827595287456

zbMATH Keywords

convergenceparallel computationblock triangular approximationparallel, diagonally implicit iterative Runge-Kutta methodtriangular iteration strategy

Mathematics Subject Classification ID

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

Related Items (33)

Blended implicit methods for the numerical solution of DAE problems ⋮ Efficient iterations for Gauss methods on second-order problems ⋮ Fast Solution of Fully Implicit Runge--Kutta and Discontinuous Galerkin in Time for Numerical PDEs, Part I: the Linear Setting ⋮ Approximating Runge-Kutta matrices by triangular matrices ⋮ An iterated Radau method for time-dependent PDEs ⋮ Parallel linear system solvers for Runge-Kutta-Nyström methods ⋮ A simple ODE solver based on 2-stage Radau IIA ⋮ The iterative solution of fully implicit discretizations of three-dimensional transport models ⋮ The solution of implicit differential equations on parallel computers ⋮ Parallel iterative linear solvers for multistep Runge-Kutta methods ⋮ A note on the efficient implementation of implicit methods for ODEs ⋮ A block Krylov subspace implementation of the time-parallel Paraexp method and its extension for nonlinear partial differential equations ⋮ Blended implicit methods for solving ODE and DAE problems, and their extension for second-order problems ⋮ Generalized Kronecker product splitting iteration for the solution of implicit Runge-Kutta and boundary value methods ⋮ On solving implicit differential equations on parallel computers ⋮ Unnamed Item ⋮ The BiM code for the numerical solution of ODEs. ⋮ A parallelizable preconditioner for the iterative solution of implicit Runge-Kutta-type methods ⋮ Efficient implementation of Radau collocation methods ⋮ A splitting preconditioner for the iterative solution of implicit Runge-Kutta and boundary value methods ⋮ Efficient implementation of Gauss collocation and Hamiltonian boundary value methods ⋮ Blended block BVMs (B\(_3\)VMs): A family of economical implicit methods for ODEs ⋮ Theoretically optimal inexact spectral deferred correction methods ⋮ Optimal and Low-Memory Near-Optimal Preconditioning of Fully Implicit Runge--Kutta Schemes for Parabolic PDEs ⋮ A note on efficient preconditioner of implicit Runge-Kutta methods with application to fractional diffusion equations ⋮ Speeding up Newton-type iterations for stiff problems ⋮ CWI contributions to the development of parallel Runge-Kutta methods ⋮ Kronecker product splitting preconditioners for implicit Runge-Kutta discretizations of viscous wave equations ⋮ Recent advances in linear analysis of convergence for splittings for solving ODE problems ⋮ Solving ordinary differential equations by generalized Adams methods: Properties and implementation techniques ⋮ Analysis approximate factorization in iteration methods ⋮ A variable-step variable-order algorithm for systems of stiff odes ⋮ Blended implementation of block implicit methods for ODEs

This page was built for publication: Triangularly Implicit Iteration Methods for ODE-IVP Solvers