The iterative solution of fully implicit discretizations of three-dimensional transport models (Q1372705): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / reviewed by
 
Property / reviewed by: Rudolf Gorenflo / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Rudolf Gorenflo / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis approximate factorization in iteration methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting methods for three-dimensional bio-chemical transport / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated Runge–Kutta Methods on Parallel Computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting methods for three-dimensional transport models with interaction terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangularly Implicit Iteration Methods for ODE-IVP Solvers / rank
 
Normal rank

Latest revision as of 20:10, 27 May 2024

scientific article
Language Label Description Also known as
English
The iterative solution of fully implicit discretizations of three-dimensional transport models
scientific article

    Statements

    The iterative solution of fully implicit discretizations of three-dimensional transport models (English)
    0 references
    0 references
    23 June 1998
    0 references
    The authors consider systems of spatially three-dimensional weakly coupled advection-diffusion-reaction equations. By spatial difference-discretization (of three-point type in each spatial variable with special upwind modification for the advection terms) they obtain a system of ordinary differential equations for which they discuss in detail a few fully implicit methods of Runge-Kutta type. They investigate some iterative methods of solving the systems of (nonlinear) equations arising at each new time level, with particular emphasis on advantages possible by use of parallel vector computers. Furthermore, they discuss questions of stability of their methods and conclude their paper by displaying results of numerical case studies.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    method of lines
    0 references
    implicit Runge-Kutta method
    0 references
    parallel computation
    0 references
    advection-diffusion-reaction equations
    0 references
    iterative methods
    0 references
    systems of nonlinear equations
    0 references
    stability
    0 references
    numerical examples
    0 references