Preconditioning the Newton-Krylov method for reactive transport

Size: px
Start display at page:

Download "Preconditioning the Newton-Krylov method for reactive transport"

Transcription

1 Preconditioning the Newton-Krylov method for reactive transport Michel Kern, L. Amir, A. Taakili INRIA Paris-Rocquencourt Maison de la Simulation MoMaS workshop Reactive Transport Modeling in the Geological Sciences Institut Henri Poincaré November 2015 M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 1 / 22

2 Outline 1 Model and formulation 2 Elimination and preconditioning 3 Application to MoMaS benchmark M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 2 / 22

3 Motivations Study algorithms for reactive transport that 1 Keep chemistry and transport codes separate 2 Allow strong numerical coupling M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 3 / 22

4 Outline 1 Model and formulation 2 Elimination and preconditioning 3 Application to MoMaS benchmark M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 4 / 22

5 Model setup One phase reactive transport of N s species, undergoing N r reactions Transport operator Lc =.(uc D c) on ω R d,d = 1,2,3. u Darcy velocity, D diffusion dispersion tensor. Chemical system Aqueous and sorption reactions, all equilibrium. ( ( ) ( ) X X) Scc 0 0 S =, S cc S c c)( X X 0 M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 5 / 22

6 Model setup One phase reactive transport of N s species, undergoing N r reactions Transport operator Lc =.(uc D c) on ω R d,d = 1,2,3. u Darcy velocity, D diffusion dispersion tensor. Chemical system Aqueous and sorption reactions, all equilibrium. ( ( ) ( ) X X) Scc 0 0 S =, S cc S c c)( X X 0 Mass conservation Mass action laws φ t c +Lc = S T cc r +ST cc r, φ t c = S T c c r, ( )( ) ( ) Scc 0 logc logk =, log c log K S cc S c c M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 5 / 22

7 Elimination of equilibrium rates: coupled problem The kernel matrix (after Saaltink et al (98)) ( ) U st US T Ucc U = 0, U = c c, φ t (U cc c + U c c c) + U cc Lc = 0 0 U c c φ t U c c c = 0. Transformation T = U cc c + U c c c = T l + T s T = U c c T s Coupled system φ t T l + φ t T s + LT l = 0 φ t T = 0. Completed by mass action laws M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 6 / 22

8 Solving equilibrium chemistry System of non linear equations Mass action law Ŝ log ( ( c c) k k) = log Mass conservation Uc + Ū c = T T known from transport Take concentration logarithms as main unknowns Use globalized Newton s method (line search, trust region). M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 7 / 22

9 Solving equilibrium chemistry System of non linear equations Mass action law Ŝ log ( ( c c) k k) = log Mass conservation Uc + Ū c = T T known from transport Take concentration logarithms as main unknowns Use globalized Newton s method (line search, trust region). Role of chemical model Given total T, split into Liquid T l = Uc, Solid T s = Ū c total concentrations Result of chemical problem T s = Ψ C (T ) M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 7 / 22

10 A note on solving the equilibrium system Chemical system S logc = logk, Uc = T Using QR factorization of S T = ( ) ( ) R 1 Q 1 Q 2 gives U = Q 2. 0 Write z = logc = Q 1 z 1 + Q 2 z 2, mass action law gives R1 T z 1 = logk. Non linear system becomes Q T 2 exp(q 1z 1 + Q 2 z 2 ) = T Only unknown is z 2 (size N s N r ). Recover primary and secondary species! Jacobian is J c = Q T 2 CQ 2, with C = diag(c) = diag(exp(z)). Source of ill-conditioning is C (cf. J. Carrayrou). M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 8 / 22

11 Solution of transport by operator splitting See Chavent-Jaffré, Ackerer et al., Putti et al., Arbogast et al.,... Advection step Explicit, finite volumes Locally mass conservative Allows unstructured mesh CFL condition: use sub-time-steps Dispersion step Mixed finite elements (implicit) M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 9 / 22

12 Solution of transport by operator splitting See Chavent-Jaffré, Ackerer et al., Putti et al., Arbogast et al.,... Advection step Explicit, finite volumes Locally mass conservative Allows unstructured mesh CFL condition: use sub-time-steps Dispersion step Mixed finite elements (implicit) Condense transport solver, one time step (M + t L) C n+1 = MC n + t f n C n+1 = Ψ }{{} T (f n,c n ) A M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 9 / 22

13 Outline 1 Model and formulation 2 Elimination and preconditioning 3 Application to MoMaS benchmark M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 10 / 22

14 Solution strategies Fixed point (aka SI) Yeh-Tripathi, Carrayrou et al., Lagneau et al. + easy to program, code reuse not robust, small time steps M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 11 / 22

15 Solution strategies Fixed point (aka SI) Yeh-Tripathi, Carrayrou et al., Lagneau et al. + easy to program, code reuse not robust, small time steps Direct substitution (DSA) Lichtner et al., Saaltink et al., Steefel et al. + accurate, robust, difficult to code, large non-linear system M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 11 / 22

16 Solution strategies Fixed point (aka SI) Yeh-Tripathi, Carrayrou et al., Lagneau et al. + easy to program, code reuse not robust, small time steps Direct substitution (DSA) Lichtner et al., Saaltink et al., Steefel et al. + accurate, robust, difficult to code, large non-linear system DAE formulation Erhel and de Dieuleveult + use quality DAE software, accurate expensive M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 11 / 22

17 Solution strategies Fixed point (aka SI) Yeh-Tripathi, Carrayrou et al., Lagneau et al. + easy to program, code reuse not robust, small time steps Direct substitution (DSA) Lichtner et al., Saaltink et al., Steefel et al. + accurate, robust, difficult to code, large non-linear system DAE formulation Erhel and de Dieuleveult + use quality DAE software, accurate expensive Reduction technique Knabner et al. + Efficient, accurate, difficult to code M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 11 / 22

18 Solution strategies Fixed point (aka SI) Yeh-Tripathi, Carrayrou et al., Lagneau et al. + easy to program, code reuse not robust, small time steps Direct substitution (DSA) Lichtner et al., Saaltink et al., Steefel et al. + accurate, robust, difficult to code, large non-linear system DAE formulation Erhel and de Dieuleveult + use quality DAE software, accurate expensive Reduction technique Knabner et al. + Efficient, accurate, difficult to code (Try to) use best of SI and DS M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 11 / 22

19 A global method from the fixed-point formulation (1) Discrete non-linear system AT n+1 l + MT n+1 s T n+1 s Ψ C (T n+1 l + T n+1 s ) = 0 = M(T n l + T n s ) }{{} b n M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 12 / 22

20 A global method from the fixed-point formulation (1) Discrete non-linear system AT n+1 l + MT n+1 s T n+1 s Ψ C (T n+1 l + T n+1 s ) = 0 = M(T n l + T n s ) }{{} b n uncoupled Elimination of T l F 2 (T s ) = T s n+1 Ψ C ( Ts n+1 A 1 MT n+1 s + A 1 b n) = 0 Can be solved by block Gauss-Seidel or by Newton s method M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 12 / 22

21 A global method from the fixed-point formulation (1) Discrete non-linear system AT n+1 l + MT n+1 s T n+1 s Ψ C (T n+1 l + T n+1 s ) = 0 = M(T n l + T n s ) }{{} b n uncoupled Elimination of T l F 2 (T s ) = T s n+1 Ψ C ( Ts n+1 A 1 MT n+1 s + A 1 b n) = 0 Can be solved by block Gauss-Seidel or by Newton s method Residual computation 1 Apply Ψ T : solve transport for each species, 2 Apply Ψ C : solve chemistry for each grid cell. M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 12 / 22

22 A global method from the fixed-point formulation (2) + Non-intrusive approach + Precipitation can be included One chemical equilibrium solve for each function evaluation M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 13 / 22

23 A global method from the fixed-point formulation (2) + Non-intrusive approach + Precipitation can be included One chemical equilibrium solve for each function evaluation Solution by Newton-Krylov method Solve the linear system by an iterative method (GMRES) Requires only jacobian matrix by vector products, Jacobian not stored Keep transport and chemistry as black boxes Used for CFD, shallow water, radiative transfer(keyes, Knoll, JCP 04), and for reactive transport (Hammond et al., Adv. Wat. Res. 05) Inexact Newton framework Approximation of the Newton s direction f (x k )d + f(x k ) η k f(x k ) adaptive choice of the forcing term η k (Kelley, Eisenstat and Walker) L. Amir, MK (Comp. Geosci. 09) M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 13 / 22

24 Jacobian computations Coupled formulation Jacobian with block structure ( ) A M J = D I D D is Jacobian of chemistry operator (cf. Knabner et al.: resolution function), computed implicitly Inverting Jacobian ; solve transport Elimination of T l Jacobian of F 2 : J 2 = I D + DA 1 M. Computing Jacobian: solve transport. Solve cannot use matrix form (GMRES OK) M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 14 / 22

25 Preconditioning Essential for good linear performance Difficult for matrix free formulation Block preconditioners preserve problem structure Jacobi ( ) A 0 P Jac = 0 I D ( ) P 1 Jac J = I A 1 M (I D) 1 D I Gauss-Seidel P 1 P GS = ( ) A 0 D (I D) ( ) I A GS J = 1 M 0 (I D) 1 (I D + DA 1 M) Elimination of T l equivalent to Schur comp. of Gauss-Seidel. M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 15 / 22

26 Field of value analysis GMRES convergence not determined by eigenvalues (Greenbaum et al. 96) W(A) {x Ax x C n, x = 1}, convex set, contains eigenvalues of A r k 2 2 min max p(z) r 0 2. p P k z W(A) Simplified system: one species with sorption Λ(P 1 Jac J) [1 ich,1 + ich] Λ(J 2) [1,1 + Ch 2 ] Bounded away from 0 independently of h. Eingenvalues, field of values and pseudospectrum for GS preconditioning M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 16 / 22

27 Preconditioner performance 1D model (Matlab + Sundials), h = 0.05, K L = 1., σ = 1.5, and t = Mesh dependence : constant forcing term h h/2 h/4 h/8 NI LI NI LI NI LI NI LI None Mesh dependence : adaptive forcing term h h/2 h/4 h/8 NI LI NI LI NI LI NI LI None NI: # nonlinear iters, NLI: total # linear iters. M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 17 / 22

28 Preconditioner performance 1D model (Matlab + Sundials), h = 0.05, K L = 1., σ = 1.5, and t = Mesh dependence : constant forcing term h h/2 h/4 h/8 NI LI NI LI NI LI NI LI None BGS Mesh dependence : adaptive forcing term h h/2 h/4 h/8 NI LI NI LI NI LI NI LI None NI: # nonlinear iters, NLI: total # linear iters. M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 17 / 22

29 Preconditioner performance 1D model (Matlab + Sundials), h = 0.05, K L = 1., σ = 1.5, and t = Mesh dependence : constant forcing term h h/2 h/4 h/8 NI LI NI LI NI LI NI LI None BGS Elimination Mesh dependence : adaptive forcing term h h/2 h/4 h/8 NI LI NI LI NI LI NI LI None NI: # nonlinear iters, NLI: total # linear iters. M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 17 / 22

30 Preconditioner performance 1D model (Matlab + Sundials), h = 0.05, K L = 1., σ = 1.5, and t = Mesh dependence : constant forcing term h h/2 h/4 h/8 NI LI NI LI NI LI NI LI None BGS Elimination Mesh dependence : adaptive forcing term h h/2 h/4 h/8 NI LI NI LI NI LI NI LI None BGS NI: # nonlinear iters, NLI: total # linear iters. M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 17 / 22

31 Preconditioner performance 1D model (Matlab + Sundials), h = 0.05, K L = 1., σ = 1.5, and t = Mesh dependence : constant forcing term h h/2 h/4 h/8 NI LI NI LI NI LI NI LI None BGS Elimination Mesh dependence : adaptive forcing term h h/2 h/4 h/8 NI LI NI LI NI LI NI LI None BGS Elimination NI: # nonlinear iters, NLI: total # linear iters. M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 17 / 22

32 Outline 1 Model and formulation 2 Elimination and preconditioning 3 Application to MoMaS benchmark M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 18 / 22

33 MoMaS benchmark (easy, 1D) 9 liquid, 3 sorbed primary species. Huge variation in equilibrium constants, large stoichiometric coeffs. Long simulation time Set-up by J. Carrayrou, MK, P. Knabner (Comp. Geo. 2009) Species concentrations, t = 10 M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 19 / 22

34 Concentration profiles Left: C 1 at t = 10, middle S at t = 10, right: C 2 at t = 5010 Concentrations at right end of the domain as a function of time. Left: X3, middle: C5, right: C2 M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 20 / 22

35 Accuracy, spatial discretization n 192 n 384 n n 192 n 384 n X3 concentration at x = C5 concentration at x= Time Time Elution curves: left X 3, right C 5 Concentration of species S at t = 10, different schemes M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 21 / 22

36 Comparison of preconditioning strategies Non Linear Iterations CFT(None) CFT(JB) CFT(GS) CF(None) F Linear Iterations CFT(None) CFT(JB) CFT(GS) CF(None) F Mesh Mesh Left: Non-linear iterations, right: linear iterations M. Kern (INRIA MdS) Precond. Newton-Krylov for react. transp. MoMas Multiphase Days (Oct. 15) 22 / 22

Reactive transport in porous media: formulations, non-linear solvers and preconditioners

Reactive transport in porous media: formulations, non-linear solvers and preconditioners Reactive transport in porous media: formulations, non-linear solvers and preconditioners Michel Kern with L. Amir, B. Gueslin, A. Taakili Institut National de Recherche en Informatique et Automatique High

More information

Coupling transport with geochemistry Applications to CO2 sequestration

Coupling transport with geochemistry Applications to CO2 sequestration Coupling transport with geochemistry Applications to CO2 sequestration Michel Kern with L. Amir, B. Gueslin, A. Taakili INRIA Paris Rocquencourt 3ème Conférence Internationale de la Société Marocaine de

More information

A Newton Krylov method for coupling transport with chemistry in porous media

A Newton Krylov method for coupling transport with chemistry in porous media A Newton Krylov method for coupling transport with chemistry in porous media Laila Amir 1,2 Michel Kern 2 1 Itasca Consultants, Lyon 2 INRIA Rocquencourt Joint work with J. Erhel (INRIA Rennes /IRISA)

More information

PRECONDITIONING A COUPLED MODEL FOR REACTIVE TRANSPORT IN POROUS MEDIA

PRECONDITIONING A COUPLED MODEL FOR REACTIVE TRANSPORT IN POROUS MEDIA INTERNATIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING Volume 16, Number 1, Pages 18 48 c 2019 Institute for Scientific Computing and Information PRECONDITIONING A COUPLED MODEL FOR REACTIVE TRANSPORT

More information

Newton s Method and Efficient, Robust Variants

Newton s Method and Efficient, Robust Variants Newton s Method and Efficient, Robust Variants Philipp Birken University of Kassel (SFB/TRR 30) Soon: University of Lund October 7th 2013 Efficient solution of large systems of non-linear PDEs in science

More information

Space-Time Domain Decomposition Methods for Transport Problems in Porous Media

Space-Time Domain Decomposition Methods for Transport Problems in Porous Media 1 / 49 Space-Time Domain Decomposition Methods for Transport Problems in Porous Media Thi-Thao-Phuong Hoang, Elyes Ahmed, Jérôme Jaffré, Caroline Japhet, Michel Kern, Jean Roberts INRIA Paris-Rocquencourt

More information

Reactive Transport in Porous Media

Reactive Transport in Porous Media Reactive Transport in Porous Media Jean-Baptiste Apoung-Kamga, Pascal Have, Jean Houot, Michel Kern, Adrien Semin To cite this version: Jean-Baptiste Apoung-Kamga, Pascal Have, Jean Houot, Michel Kern,

More information

Indefinite and physics-based preconditioning

Indefinite and physics-based preconditioning Indefinite and physics-based preconditioning Jed Brown VAW, ETH Zürich 2009-01-29 Newton iteration Standard form of a nonlinear system F (u) 0 Iteration Solve: Update: J(ũ)u F (ũ) ũ + ũ + u Example (p-bratu)

More information

Three-dimensional Modelling of Reactive Solutes Transport in Porous Media

Three-dimensional Modelling of Reactive Solutes Transport in Porous Media 151 A publication of CHEMICAL ENGINEERING TRANSACTIONS VOL. 41, 214 Guest Editors: Simonetta Palmas, Michele Mascia, Annalisa Vacca Copyright 214, AIDIC Servizi S.r.l., ISBN 978-88-9568-32-7; ISSN 2283-9216

More information

ANR Project DEDALES Algebraic and Geometric Domain Decomposition for Subsurface Flow

ANR Project DEDALES Algebraic and Geometric Domain Decomposition for Subsurface Flow ANR Project DEDALES Algebraic and Geometric Domain Decomposition for Subsurface Flow Michel Kern Inria Paris Rocquencourt Maison de la Simulation C2S@Exa Days, Inria Paris Centre, Novembre 2016 M. Kern

More information

Lab 1: Iterative Methods for Solving Linear Systems

Lab 1: Iterative Methods for Solving Linear Systems Lab 1: Iterative Methods for Solving Linear Systems January 22, 2017 Introduction Many real world applications require the solution to very large and sparse linear systems where direct methods such as

More information

An Efficient Low Memory Implicit DG Algorithm for Time Dependent Problems

An Efficient Low Memory Implicit DG Algorithm for Time Dependent Problems An Efficient Low Memory Implicit DG Algorithm for Time Dependent Problems P.-O. Persson and J. Peraire Massachusetts Institute of Technology 2006 AIAA Aerospace Sciences Meeting, Reno, Nevada January 9,

More information

Lecture 8: Fast Linear Solvers (Part 7)

Lecture 8: Fast Linear Solvers (Part 7) Lecture 8: Fast Linear Solvers (Part 7) 1 Modified Gram-Schmidt Process with Reorthogonalization Test Reorthogonalization If Av k 2 + δ v k+1 2 = Av k 2 to working precision. δ = 10 3 2 Householder Arnoldi

More information

Lecture 18 Classical Iterative Methods

Lecture 18 Classical Iterative Methods Lecture 18 Classical Iterative Methods MIT 18.335J / 6.337J Introduction to Numerical Methods Per-Olof Persson November 14, 2006 1 Iterative Methods for Linear Systems Direct methods for solving Ax = b,

More information

Advanced numerical methods for transport and reaction in porous media. Peter Frolkovič University of Heidelberg

Advanced numerical methods for transport and reaction in porous media. Peter Frolkovič University of Heidelberg Advanced numerical methods for transport and reaction in porous media Peter Frolkovič University of Heidelberg Content R 3 T a software package for numerical simulation of radioactive contaminant transport

More information

Space-time domain decomposition for a nonlinear parabolic equation with discontinuous capillary pressure

Space-time domain decomposition for a nonlinear parabolic equation with discontinuous capillary pressure Space-time domain decomposition for a nonlinear parabolic equation with discontinuous capillary pressure Elyes Ahmed, Caroline Japhet, Michel Kern INRIA Paris Maison de la Simulation ENPC University Paris

More information

Solving Ax = b, an overview. Program

Solving Ax = b, an overview. Program Numerical Linear Algebra Improving iterative solvers: preconditioning, deflation, numerical software and parallelisation Gerard Sleijpen and Martin van Gijzen November 29, 27 Solving Ax = b, an overview

More information

Solving Large Nonlinear Sparse Systems

Solving Large Nonlinear Sparse Systems Solving Large Nonlinear Sparse Systems Fred W. Wubs and Jonas Thies Computational Mechanics & Numerical Mathematics University of Groningen, the Netherlands f.w.wubs@rug.nl Centre for Interdisciplinary

More information

Comparison of numerical schemes for multiphase reactive transport

Comparison of numerical schemes for multiphase reactive transport Énergies renouvelables Production éco-responsable Transports innovants Procédés éco-efficients Ressources durables Comparison of numerical schemes for multiphase reactive transport T. Faney, A. Michel,

More information

Multigrid solvers for equations arising in implicit MHD simulations

Multigrid solvers for equations arising in implicit MHD simulations Multigrid solvers for equations arising in implicit MHD simulations smoothing Finest Grid Mark F. Adams Department of Applied Physics & Applied Mathematics Columbia University Ravi Samtaney PPPL Achi Brandt

More information

Fast solvers for steady incompressible flow

Fast solvers for steady incompressible flow ICFD 25 p.1/21 Fast solvers for steady incompressible flow Andy Wathen Oxford University wathen@comlab.ox.ac.uk http://web.comlab.ox.ac.uk/~wathen/ Joint work with: Howard Elman (University of Maryland,

More information

Adaptive algebraic multigrid methods in lattice computations

Adaptive algebraic multigrid methods in lattice computations Adaptive algebraic multigrid methods in lattice computations Karsten Kahl Bergische Universität Wuppertal January 8, 2009 Acknowledgements Matthias Bolten, University of Wuppertal Achi Brandt, Weizmann

More information

Coupling SUNDIALS with OpenFOAM 6 th OpenFOAM Workshop. E. David Huckaby June 14, 2011

Coupling SUNDIALS with OpenFOAM 6 th OpenFOAM Workshop. E. David Huckaby June 14, 2011 Coupling SUNDIALS with OpenFOAM 6 th OpenFOAM Worshop E. David Hucaby June 14, 2011 EDH-OFW2011 Outline Motivation Mathematics Basic Design Eamples Food Web Steady & Unsteady Pitz-Daily 2 Motivation Why

More information

An Accelerated Block-Parallel Newton Method via Overlapped Partitioning

An Accelerated Block-Parallel Newton Method via Overlapped Partitioning An Accelerated Block-Parallel Newton Method via Overlapped Partitioning Yurong Chen Lab. of Parallel Computing, Institute of Software, CAS (http://www.rdcps.ac.cn/~ychen/english.htm) Summary. This paper

More information

A Robust Preconditioned Iterative Method for the Navier-Stokes Equations with High Reynolds Numbers

A Robust Preconditioned Iterative Method for the Navier-Stokes Equations with High Reynolds Numbers Applied and Computational Mathematics 2017; 6(4): 202-207 http://www.sciencepublishinggroup.com/j/acm doi: 10.11648/j.acm.20170604.18 ISSN: 2328-5605 (Print); ISSN: 2328-5613 (Online) A Robust Preconditioned

More information

Stabilization and Acceleration of Algebraic Multigrid Method

Stabilization and Acceleration of Algebraic Multigrid Method Stabilization and Acceleration of Algebraic Multigrid Method Recursive Projection Algorithm A. Jemcov J.P. Maruszewski Fluent Inc. October 24, 2006 Outline 1 Need for Algorithm Stabilization and Acceleration

More information

Index. higher order methods, 52 nonlinear, 36 with variable coefficients, 34 Burgers equation, 234 BVP, see boundary value problems

Index. higher order methods, 52 nonlinear, 36 with variable coefficients, 34 Burgers equation, 234 BVP, see boundary value problems Index A-conjugate directions, 83 A-stability, 171 A( )-stability, 171 absolute error, 243 absolute stability, 149 for systems of equations, 154 absorbing boundary conditions, 228 Adams Bashforth methods,

More information

Reactive transport modeling of carbonate diagenesis on unstructured grids

Reactive transport modeling of carbonate diagenesis on unstructured grids Reactive transport modeling of carbonate diagenesis on unstructured grids Alina Yapparova Chair of Reservoir Engineering Montanuniversität Leoben Dolomitization and geochemical modeling Hollywood may never

More information

High Performance Nonlinear Solvers

High Performance Nonlinear Solvers What is a nonlinear system? High Performance Nonlinear Solvers Michael McCourt Division Argonne National Laboratory IIT Meshfree Seminar September 19, 2011 Every nonlinear system of equations can be described

More information

AMS526: Numerical Analysis I (Numerical Linear Algebra for Computational and Data Sciences)

AMS526: Numerical Analysis I (Numerical Linear Algebra for Computational and Data Sciences) AMS526: Numerical Analysis I (Numerical Linear Algebra for Computational and Data Sciences) Lecture 19: Computing the SVD; Sparse Linear Systems Xiangmin Jiao Stony Brook University Xiangmin Jiao Numerical

More information

From Direct to Iterative Substructuring: some Parallel Experiences in 2 and 3D

From Direct to Iterative Substructuring: some Parallel Experiences in 2 and 3D From Direct to Iterative Substructuring: some Parallel Experiences in 2 and 3D Luc Giraud N7-IRIT, Toulouse MUMPS Day October 24, 2006, ENS-INRIA, Lyon, France Outline 1 General Framework 2 The direct

More information

Numerical Methods for Large-Scale Nonlinear Equations

Numerical Methods for Large-Scale Nonlinear Equations Slide 1 Numerical Methods for Large-Scale Nonlinear Equations Homer Walker MA 512 April 28, 2005 Inexact Newton and Newton Krylov Methods a. Newton-iterative and inexact Newton methods. Slide 2 i. Formulation

More information

9.1 Preconditioned Krylov Subspace Methods

9.1 Preconditioned Krylov Subspace Methods Chapter 9 PRECONDITIONING 9.1 Preconditioned Krylov Subspace Methods 9.2 Preconditioned Conjugate Gradient 9.3 Preconditioned Generalized Minimal Residual 9.4 Relaxation Method Preconditioners 9.5 Incomplete

More information

Preconditioning Techniques for Large Linear Systems Part III: General-Purpose Algebraic Preconditioners

Preconditioning Techniques for Large Linear Systems Part III: General-Purpose Algebraic Preconditioners Preconditioning Techniques for Large Linear Systems Part III: General-Purpose Algebraic Preconditioners Michele Benzi Department of Mathematics and Computer Science Emory University Atlanta, Georgia, USA

More information

Background. Background. C. T. Kelley NC State University tim C. T. Kelley Background NCSU, Spring / 58

Background. Background. C. T. Kelley NC State University tim C. T. Kelley Background NCSU, Spring / 58 Background C. T. Kelley NC State University tim kelley@ncsu.edu C. T. Kelley Background NCSU, Spring 2012 1 / 58 Notation vectors, matrices, norms l 1 : max col sum... spectral radius scaled integral norms

More information

TAU Solver Improvement [Implicit methods]

TAU Solver Improvement [Implicit methods] TAU Solver Improvement [Implicit methods] Richard Dwight Megadesign 23-24 May 2007 Folie 1 > Vortrag > Autor Outline Motivation (convergence acceleration to steady state, fast unsteady) Implicit methods

More information

Algebraic Multigrid as Solvers and as Preconditioner

Algebraic Multigrid as Solvers and as Preconditioner Ò Algebraic Multigrid as Solvers and as Preconditioner Domenico Lahaye domenico.lahaye@cs.kuleuven.ac.be http://www.cs.kuleuven.ac.be/ domenico/ Department of Computer Science Katholieke Universiteit Leuven

More information

Motivation: Sparse matrices and numerical PDE's

Motivation: Sparse matrices and numerical PDE's Lecture 20: Numerical Linear Algebra #4 Iterative methods and Eigenproblems Outline 1) Motivation: beyond LU for Ax=b A little PDE's and sparse matrices A) Temperature Equation B) Poisson Equation 2) Splitting

More information

Preconditioning Techniques Analysis for CG Method

Preconditioning Techniques Analysis for CG Method Preconditioning Techniques Analysis for CG Method Huaguang Song Department of Computer Science University of California, Davis hso@ucdavis.edu Abstract Matrix computation issue for solve linear system

More information

C. Vuik 1 S. van Veldhuizen 1 C.R. Kleijn 2

C. Vuik 1 S. van Veldhuizen 1 C.R. Kleijn 2 s: application to chemical vapor deposition C. Vuik 1 S. van Veldhuizen 1 C.R. Kleijn 2 1 Delft University of Technology J.M. Burgerscentrum 2 Delft University of Technology Department of Multi Scale Physics

More information

WHEN studying distributed simulations of power systems,

WHEN studying distributed simulations of power systems, 1096 IEEE TRANSACTIONS ON POWER SYSTEMS, VOL 21, NO 3, AUGUST 2006 A Jacobian-Free Newton-GMRES(m) Method with Adaptive Preconditioner and Its Application for Power Flow Calculations Ying Chen and Chen

More information

An Efficient Graph Sparsification Approach to Scalable Harmonic Balance (HB) Analysis of Strongly Nonlinear RF Circuits

An Efficient Graph Sparsification Approach to Scalable Harmonic Balance (HB) Analysis of Strongly Nonlinear RF Circuits Design Automation Group An Efficient Graph Sparsification Approach to Scalable Harmonic Balance (HB) Analysis of Strongly Nonlinear RF Circuits Authors : Lengfei Han (Speaker) Xueqian Zhao Dr. Zhuo Feng

More information

Lecture 11: CMSC 878R/AMSC698R. Iterative Methods An introduction. Outline. Inverse, LU decomposition, Cholesky, SVD, etc.

Lecture 11: CMSC 878R/AMSC698R. Iterative Methods An introduction. Outline. Inverse, LU decomposition, Cholesky, SVD, etc. Lecture 11: CMSC 878R/AMSC698R Iterative Methods An introduction Outline Direct Solution of Linear Systems Inverse, LU decomposition, Cholesky, SVD, etc. Iterative methods for linear systems Why? Matrix

More information

Advanced numerical methods for nonlinear advectiondiffusion-reaction. Peter Frolkovič, University of Heidelberg

Advanced numerical methods for nonlinear advectiondiffusion-reaction. Peter Frolkovič, University of Heidelberg Advanced numerical methods for nonlinear advectiondiffusion-reaction equations Peter Frolkovič, University of Heidelberg Content Motivation and background R 3 T Numerical modelling advection advection

More information

Preconditioned inverse iteration and shift-invert Arnoldi method

Preconditioned inverse iteration and shift-invert Arnoldi method Preconditioned inverse iteration and shift-invert Arnoldi method Melina Freitag Department of Mathematical Sciences University of Bath CSC Seminar Max-Planck-Institute for Dynamics of Complex Technical

More information

Iterative Methods for Sparse Linear Systems

Iterative Methods for Sparse Linear Systems Iterative Methods for Sparse Linear Systems Luca Bergamaschi e-mail: berga@dmsa.unipd.it - http://www.dmsa.unipd.it/ berga Department of Mathematical Methods and Models for Scientific Applications University

More information

Physic-based Preconditioning and B-Splines finite elements method for Tokamak MHD

Physic-based Preconditioning and B-Splines finite elements method for Tokamak MHD Physic-based Preconditioning and B-Splines finite elements method for Tokamak MHD E. Franck 1, M. Gaja 2, M. Mazza 2, A. Ratnani 2, S. Serra Capizzano 3, E. Sonnendrücker 2 ECCOMAS Congress 2016, 5-10

More information

Parallel Numerics, WT 2016/ Iterative Methods for Sparse Linear Systems of Equations. page 1 of 1

Parallel Numerics, WT 2016/ Iterative Methods for Sparse Linear Systems of Equations. page 1 of 1 Parallel Numerics, WT 2016/2017 5 Iterative Methods for Sparse Linear Systems of Equations page 1 of 1 Contents 1 Introduction 1.1 Computer Science Aspects 1.2 Numerical Problems 1.3 Graphs 1.4 Loop Manipulations

More information

New Streamfunction Approach for Magnetohydrodynamics

New Streamfunction Approach for Magnetohydrodynamics New Streamfunction Approac for Magnetoydrodynamics Kab Seo Kang Brooaven National Laboratory, Computational Science Center, Building 63, Room, Upton NY 973, USA. sang@bnl.gov Summary. We apply te finite

More information

Semi-implicit Krylov Deferred Correction Methods for Ordinary Differential Equations

Semi-implicit Krylov Deferred Correction Methods for Ordinary Differential Equations Semi-implicit Krylov Deferred Correction Methods for Ordinary Differential Equations Sunyoung Bu University of North Carolina Department of Mathematics CB # 325, Chapel Hill USA agatha@email.unc.edu Jingfang

More information

JACOBI S ITERATION METHOD

JACOBI S ITERATION METHOD ITERATION METHODS These are methods which compute a sequence of progressively accurate iterates to approximate the solution of Ax = b. We need such methods for solving many large linear systems. Sometimes

More information

A posteriori error estimates, stopping criteria, and adaptivity for multiphase compositional Darcy flows in porous media

A posteriori error estimates, stopping criteria, and adaptivity for multiphase compositional Darcy flows in porous media A posteriori error estimates, stopping criteria, and adaptivity for multiphase compositional Darcy flows in porous media D. A. Di Pietro, M. Vohraĺık, and S. Yousef Université Montpellier 2 Marseille,

More information

PALADINS: Scalable Time-Adaptive Algebraic Splitting and Preconditioners for the Navier-Stokes Equations

PALADINS: Scalable Time-Adaptive Algebraic Splitting and Preconditioners for the Navier-Stokes Equations 2013 SIAM Conference On Computational Science and Engineering Boston, 27 th February 2013 PALADINS: Scalable Time-Adaptive Algebraic Splitting and Preconditioners for the Navier-Stokes Equations U. Villa,

More information

2 CAI, KEYES AND MARCINKOWSKI proportional to the relative nonlinearity of the function; i.e., as the relative nonlinearity increases the domain of co

2 CAI, KEYES AND MARCINKOWSKI proportional to the relative nonlinearity of the function; i.e., as the relative nonlinearity increases the domain of co INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN FLUIDS Int. J. Numer. Meth. Fluids 2002; 00:1 6 [Version: 2000/07/27 v1.0] Nonlinear Additive Schwarz Preconditioners and Application in Computational Fluid

More information

Department of Computer Science, University of Illinois at Urbana-Champaign

Department of Computer Science, University of Illinois at Urbana-Champaign Department of Computer Science, University of Illinois at Urbana-Champaign Probing for Schur Complements and Preconditioning Generalized Saddle-Point Problems Eric de Sturler, sturler@cs.uiuc.edu, http://www-faculty.cs.uiuc.edu/~sturler

More information

Algorithms for Nonlinear and Transient Problems

Algorithms for Nonlinear and Transient Problems Algorithms for Nonlinear and Transient Problems David E. Keyes Department of Applied Physics & Applied Mathematics Columbia University Institute for Scientific Computing Research Lawrence Livermore National

More information

A STUDY OF MULTIGRID SMOOTHERS USED IN COMPRESSIBLE CFD BASED ON THE CONVECTION DIFFUSION EQUATION

A STUDY OF MULTIGRID SMOOTHERS USED IN COMPRESSIBLE CFD BASED ON THE CONVECTION DIFFUSION EQUATION ECCOMAS Congress 2016 VII European Congress on Computational Methods in Applied Sciences and Engineering M. Papadrakakis, V. Papadopoulos, G. Stefanou, V. Plevris (eds.) Crete Island, Greece, 5 10 June

More information

Preconditioners for the incompressible Navier Stokes equations

Preconditioners for the incompressible Navier Stokes equations Preconditioners for the incompressible Navier Stokes equations C. Vuik M. ur Rehman A. Segal Delft Institute of Applied Mathematics, TU Delft, The Netherlands SIAM Conference on Computational Science and

More information

INL Capabilities and Approach to CO 2 Sequestration. 4 th U.S.-China CO2 Emissions Control Science & Technology Symposium

INL Capabilities and Approach to CO 2 Sequestration. 4 th U.S.-China CO2 Emissions Control Science & Technology Symposium www.inl.gov INL Capabilities and Approach to CO 2 Sequestration 4 th U.S.-China CO2 Emissions Control Science & Technology Symposium Travis McLing, Ph.D. Energy Resources Recovery and Sustainability September

More information

OUTLINE ffl CFD: elliptic pde's! Ax = b ffl Basic iterative methods ffl Krylov subspace methods ffl Preconditioning techniques: Iterative methods ILU

OUTLINE ffl CFD: elliptic pde's! Ax = b ffl Basic iterative methods ffl Krylov subspace methods ffl Preconditioning techniques: Iterative methods ILU Preconditioning Techniques for Solving Large Sparse Linear Systems Arnold Reusken Institut für Geometrie und Praktische Mathematik RWTH-Aachen OUTLINE ffl CFD: elliptic pde's! Ax = b ffl Basic iterative

More information

Multigrid absolute value preconditioning

Multigrid absolute value preconditioning Multigrid absolute value preconditioning Eugene Vecharynski 1 Andrew Knyazev 2 (speaker) 1 Department of Computer Science and Engineering University of Minnesota 2 Department of Mathematical and Statistical

More information

C. Vuik 1 S. van Veldhuizen 1 C.R. Kleijn 2

C. Vuik 1 S. van Veldhuizen 1 C.R. Kleijn 2 On iterative solvers combined with projected Newton methods for reacting flow problems C. Vuik 1 S. van Veldhuizen 1 C.R. Kleijn 2 1 Delft University of Technology J.M. Burgerscentrum 2 Delft University

More information

AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 23: GMRES and Other Krylov Subspace Methods; Preconditioning

AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 23: GMRES and Other Krylov Subspace Methods; Preconditioning AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 23: GMRES and Other Krylov Subspace Methods; Preconditioning Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 18 Outline

More information

Iterative methods for Linear System of Equations. Joint Advanced Student School (JASS-2009)

Iterative methods for Linear System of Equations. Joint Advanced Student School (JASS-2009) Iterative methods for Linear System of Equations Joint Advanced Student School (JASS-2009) Course #2: Numerical Simulation - from Models to Software Introduction In numerical simulation, Partial Differential

More information

Nonlinear Iterative Solution of the Neutron Transport Equation

Nonlinear Iterative Solution of the Neutron Transport Equation Nonlinear Iterative Solution of the Neutron Transport Equation Emiliano Masiello Commissariat à l Energie Atomique de Saclay /DANS//SERMA/LTSD emiliano.masiello@cea.fr 1/37 Outline - motivations and framework

More information

Scientific Computing with Case Studies SIAM Press, Lecture Notes for Unit VII Sparse Matrix

Scientific Computing with Case Studies SIAM Press, Lecture Notes for Unit VII Sparse Matrix Scientific Computing with Case Studies SIAM Press, 2009 http://www.cs.umd.edu/users/oleary/sccswebpage Lecture Notes for Unit VII Sparse Matrix Computations Part 1: Direct Methods Dianne P. O Leary c 2008

More information

Construction of a New Domain Decomposition Method for the Stokes Equations

Construction of a New Domain Decomposition Method for the Stokes Equations Construction of a New Domain Decomposition Method for the Stokes Equations Frédéric Nataf 1 and Gerd Rapin 2 1 CMAP, CNRS; UMR7641, Ecole Polytechnique, 91128 Palaiseau Cedex, France 2 Math. Dep., NAM,

More information

An Angular Multigrid Acceleration Method for S n Equations with Highly Forward-Peaked Scattering

An Angular Multigrid Acceleration Method for S n Equations with Highly Forward-Peaked Scattering An Angular Multigrid Acceleration Method for S n Equations with Highly Forward-Peaked Scattering Bruno Turcksin & Jean C. Ragusa & Jim E. Morel Texas A&M University, Dept. of Nuclear Engineering Bruno

More information

Comparison of Fixed Point Methods and Krylov Subspace Methods Solving Convection-Diffusion Equations

Comparison of Fixed Point Methods and Krylov Subspace Methods Solving Convection-Diffusion Equations American Journal of Computational Mathematics, 5, 5, 3-6 Published Online June 5 in SciRes. http://www.scirp.org/journal/ajcm http://dx.doi.org/.436/ajcm.5.5 Comparison of Fixed Point Methods and Krylov

More information

On solving linear systems arising from Shishkin mesh discretizations

On solving linear systems arising from Shishkin mesh discretizations On solving linear systems arising from Shishkin mesh discretizations Petr Tichý Faculty of Mathematics and Physics, Charles University joint work with Carlos Echeverría, Jörg Liesen, and Daniel Szyld October

More information

FEM and Sparse Linear System Solving

FEM and Sparse Linear System Solving FEM & sparse system solving, Lecture 7, Nov 3, 2017 1/46 Lecture 7, Nov 3, 2015: Introduction to Iterative Solvers: Stationary Methods http://people.inf.ethz.ch/arbenz/fem16 Peter Arbenz Computer Science

More information

Two-level Domain decomposition preconditioning for the high-frequency time-harmonic Maxwell equations

Two-level Domain decomposition preconditioning for the high-frequency time-harmonic Maxwell equations Two-level Domain decomposition preconditioning for the high-frequency time-harmonic Maxwell equations Marcella Bonazzoli 2, Victorita Dolean 1,4, Ivan G. Graham 3, Euan A. Spence 3, Pierre-Henri Tournier

More information

Domain decomposition on different levels of the Jacobi-Davidson method

Domain decomposition on different levels of the Jacobi-Davidson method hapter 5 Domain decomposition on different levels of the Jacobi-Davidson method Abstract Most computational work of Jacobi-Davidson [46], an iterative method suitable for computing solutions of large dimensional

More information

Solving Symmetric Indefinite Systems with Symmetric Positive Definite Preconditioners

Solving Symmetric Indefinite Systems with Symmetric Positive Definite Preconditioners Solving Symmetric Indefinite Systems with Symmetric Positive Definite Preconditioners Eugene Vecharynski 1 Andrew Knyazev 2 1 Department of Computer Science and Engineering University of Minnesota 2 Department

More information

Preface to the Second Edition. Preface to the First Edition

Preface to the Second Edition. Preface to the First Edition n page v Preface to the Second Edition Preface to the First Edition xiii xvii 1 Background in Linear Algebra 1 1.1 Matrices................................. 1 1.2 Square Matrices and Eigenvalues....................

More information

DELFT UNIVERSITY OF TECHNOLOGY

DELFT UNIVERSITY OF TECHNOLOGY DELFT UNIVERSITY OF TECHNOLOGY REPORT 11-14 On the convergence of inexact Newton methods R. Idema, D.J.P. Lahaye, and C. Vuik ISSN 1389-6520 Reports of the Department of Applied Mathematical Analysis Delft

More information

Iterative Methods for Solving A x = b

Iterative Methods for Solving A x = b Iterative Methods for Solving A x = b A good (free) online source for iterative methods for solving A x = b is given in the description of a set of iterative solvers called templates found at netlib: http

More information

Iterative Methods and Multigrid

Iterative Methods and Multigrid Iterative Methods and Multigrid Part 1: Introduction to Multigrid 2000 Eric de Sturler 1 12/02/09 MG01.prz Basic Iterative Methods (1) Nonlinear equation: f(x) = 0 Rewrite as x = F(x), and iterate x i+1

More information

First, Second, and Third Order Finite-Volume Schemes for Diffusion

First, Second, and Third Order Finite-Volume Schemes for Diffusion First, Second, and Third Order Finite-Volume Schemes for Diffusion Hiro Nishikawa 51st AIAA Aerospace Sciences Meeting, January 10, 2013 Supported by ARO (PM: Dr. Frederick Ferguson), NASA, Software Cradle.

More information

A fully implicit, exactly conserving algorithm for multidimensional particle-in-cell kinetic simulations

A fully implicit, exactly conserving algorithm for multidimensional particle-in-cell kinetic simulations A fully implicit, exactly conserving algorithm for multidimensional particle-in-cell kinetic simulations L. Chacón Applied Mathematics and Plasma Physics Group Theoretical Division Los Alamos National

More information

Numerical Methods in Matrix Computations

Numerical Methods in Matrix Computations Ake Bjorck Numerical Methods in Matrix Computations Springer Contents 1 Direct Methods for Linear Systems 1 1.1 Elements of Matrix Theory 1 1.1.1 Matrix Algebra 2 1.1.2 Vector Spaces 6 1.1.3 Submatrices

More information

Fast Iterative Solution of Saddle Point Problems

Fast Iterative Solution of Saddle Point Problems Michele Benzi Department of Mathematics and Computer Science Emory University Atlanta, GA Acknowledgments NSF (Computational Mathematics) Maxim Olshanskii (Mech-Math, Moscow State U.) Zhen Wang (PhD student,

More information

A Review of Preconditioning Techniques for Steady Incompressible Flow

A Review of Preconditioning Techniques for Steady Incompressible Flow Zeist 2009 p. 1/43 A Review of Preconditioning Techniques for Steady Incompressible Flow David Silvester School of Mathematics University of Manchester Zeist 2009 p. 2/43 PDEs Review : 1984 2005 Update

More information

AMS526: Numerical Analysis I (Numerical Linear Algebra)

AMS526: Numerical Analysis I (Numerical Linear Algebra) AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 24: Preconditioning and Multigrid Solver Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 5 Preconditioning Motivation:

More information

Chapter 7 Iterative Techniques in Matrix Algebra

Chapter 7 Iterative Techniques in Matrix Algebra Chapter 7 Iterative Techniques in Matrix Algebra Per-Olof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 128B Numerical Analysis Vector Norms Definition

More information

Optimizing Runge-Kutta smoothers for unsteady flow problems

Optimizing Runge-Kutta smoothers for unsteady flow problems Optimizing Runge-Kutta smoothers for unsteady flow problems Philipp Birken 1 November 24, 2011 1 Institute of Mathematics, University of Kassel, Heinrich-Plett-Str. 40, D-34132 Kassel, Germany. email:

More information

TIME SPACE DOMAIN DECOMPOSITION AND REACTIVE TRANSPORT IN POROUS MEDIA

TIME SPACE DOMAIN DECOMPOSITION AND REACTIVE TRANSPORT IN POROUS MEDIA XVIII International Conference on Water Resources CMWR 2 J. Carrera (Ed) c CIMNE, Barcelona, 2 TIME SPACE DOMAIN DECOMPOSITION AND REACTIVE TRANSPORT IN POROUS MEDIA Florian Haeberlein and Anthony Michel

More information

Termination criteria for inexact fixed point methods

Termination criteria for inexact fixed point methods Termination criteria for inexact fixed point methods Philipp Birken 1 October 1, 2013 1 Institute of Mathematics, University of Kassel, Heinrich-Plett-Str. 40, D-34132 Kassel, Germany Department of Mathematics/Computer

More information

Accelerated Solvers for CFD

Accelerated Solvers for CFD Accelerated Solvers for CFD Co-Design of Hardware/Software for Predicting MAV Aerodynamics Eric de Sturler, Virginia Tech Mathematics Email: sturler@vt.edu Web: http://www.math.vt.edu/people/sturler Co-design

More information

Introduction to Scientific Computing

Introduction to Scientific Computing (Lecture 5: Linear system of equations / Matrix Splitting) Bojana Rosić, Thilo Moshagen Institute of Scientific Computing Motivation Let us resolve the problem scheme by using Kirchhoff s laws: the algebraic

More information

NEWTON-GMRES PRECONDITIONING FOR DISCONTINUOUS GALERKIN DISCRETIZATIONS OF THE NAVIER-STOKES EQUATIONS

NEWTON-GMRES PRECONDITIONING FOR DISCONTINUOUS GALERKIN DISCRETIZATIONS OF THE NAVIER-STOKES EQUATIONS NEWTON-GMRES PRECONDITIONING FOR DISCONTINUOUS GALERKIN DISCRETIZATIONS OF THE NAVIER-STOKES EQUATIONS P.-O. PERSSON AND J. PERAIRE Abstract. We study preconditioners for the iterative solution of the

More information

A posteriori error estimates for space-time domain decomposition method for two-phase flow problem

A posteriori error estimates for space-time domain decomposition method for two-phase flow problem A posteriori error estimates for space-time domain decomposition method for two-phase flow problem Sarah Ali Hassan, Elyes Ahmed, Caroline Japhet, Michel Kern, Martin Vohralík INRIA Paris & ENPC (project-team

More information

The Triangle Algorithm: A Geometric Approach to Systems of Linear Equations

The Triangle Algorithm: A Geometric Approach to Systems of Linear Equations : A Geometric Approach to Systems of Linear Equations Thomas 1 Bahman Kalantari 2 1 Baylor University 2 Rutgers University July 19, 2013 Rough Outline Quick Refresher of Basics Convex Hull Problem Solving

More information

A High Order Conservative Semi-Lagrangian Discontinuous Galerkin Method for Two-Dimensional Transport Simulations

A High Order Conservative Semi-Lagrangian Discontinuous Galerkin Method for Two-Dimensional Transport Simulations Motivation Numerical methods Numerical tests Conclusions A High Order Conservative Semi-Lagrangian Discontinuous Galerkin Method for Two-Dimensional Transport Simulations Xiaofeng Cai Department of Mathematics

More information

ADAPTIVE ACCURACY CONTROL OF NONLINEAR NEWTON-KRYLOV METHODS FOR MULTISCALE INTEGRATED HYDROLOGIC MODELS

ADAPTIVE ACCURACY CONTROL OF NONLINEAR NEWTON-KRYLOV METHODS FOR MULTISCALE INTEGRATED HYDROLOGIC MODELS XIX International Conference on Water Resources CMWR 2012 University of Illinois at Urbana-Champaign June 17-22,2012 ADAPTIVE ACCURACY CONTROL OF NONLINEAR NEWTON-KRYLOV METHODS FOR MULTISCALE INTEGRATED

More information

Partial Differential Equations

Partial Differential Equations Partial Differential Equations Introduction Deng Li Discretization Methods Chunfang Chen, Danny Thorne, Adam Zornes CS521 Feb.,7, 2006 What do You Stand For? A PDE is a Partial Differential Equation This

More information

Adaptive preconditioners for nonlinear systems of equations

Adaptive preconditioners for nonlinear systems of equations Adaptive preconditioners for nonlinear systems of equations L. Loghin D. Ruiz A. Touhami CERFACS Technical Report TR/PA/04/42 Also ENSEEIHT-IRIT Technical Report RT/TLSE/04/02 Abstract The use of preconditioned

More information

1. Introduction. In this work we consider the solution of finite-dimensional constrained optimization problems of the form

1. Introduction. In this work we consider the solution of finite-dimensional constrained optimization problems of the form MULTILEVEL ALGORITHMS FOR LARGE-SCALE INTERIOR POINT METHODS MICHELE BENZI, ELDAD HABER, AND LAUREN TARALLI Abstract. We develop and compare multilevel algorithms for solving constrained nonlinear variational

More information

An efficient multigrid solver based on aggregation

An efficient multigrid solver based on aggregation An efficient multigrid solver based on aggregation Yvan Notay Université Libre de Bruxelles Service de Métrologie Nucléaire Graz, July 4, 2012 Co-worker: Artem Napov Supported by the Belgian FNRS http://homepages.ulb.ac.be/

More information

ITERATIVE METHODS FOR NONLINEAR ELLIPTIC EQUATIONS

ITERATIVE METHODS FOR NONLINEAR ELLIPTIC EQUATIONS ITERATIVE METHODS FOR NONLINEAR ELLIPTIC EQUATIONS LONG CHEN In this chapter we discuss iterative methods for solving the finite element discretization of semi-linear elliptic equations of the form: find

More information