Multilevel Incomplete Factorizations for Non-Linear FE problems in Geomechanics DMMMSA – University of Padova Department of Mathematical Methods and Models.

Slides:



Advertisements
Similar presentations
Christopher Batty and Robert Bridson University of British Columbia
Advertisements

Edge Preserving Image Restoration using L1 norm
A Discrete Adjoint-Based Approach for Optimization Problems on 3D Unstructured Meshes Dimitri J. Mavriplis Department of Mechanical Engineering University.
By Paul Delgado. Motivation Flow-Deformation Equations Discretization Operator Splitting Multiphysics Coupling Fixed State Splitting Other Splitting Conclusions.
03/29/2006, City Univ1 Iterative Methods with Inexact Preconditioners and Applications to Saddle-point Systems & Electromagnetic Maxwell Systems Jun Zou.
1 FEM study of the faults activation Technische Universität München Joint Advanced Student School (JASS) St. Petersburg Polytechnical University Author:
Applied Linear Algebra - in honor of Hans SchneiderMay 25, 2010 A Look-Back Technique of Restart for the GMRES(m) Method Akira IMAKURA † Tomohiro SOGABE.
High performance flow simulation in discrete fracture networks and heterogeneous porous media Jocelyne Erhel INRIA Rennes Jean-Raynald de Dreuzy Geosciences.
Numerical Parallel Algorithms for Large-Scale Nanoelectronics Simulations using NESSIE Eric Polizzi, Ahmed Sameh Department of Computer Sciences, Purdue.
Modern iterative methods For basic iterative methods, converge linearly Modern iterative methods, converge faster –Krylov subspace method Steepest descent.
Chapter 9 Gauss Elimination The Islamic University of Gaza
Nazgol Haghighat Supervisor: Prof. Dr. Ir. Daniel J. Rixen
D Nagesh Kumar, IIScOptimization Methods: M1L1 1 Introduction and Basic Concepts (i) Historical Development and Model Building.
280 SYSTEM IDENTIFICATION The System Identification Problem is to estimate a model of a system based on input-output data. Basic Configuration continuous.
Monica Garika Chandana Guduru. METHODS TO SOLVE LINEAR SYSTEMS Direct methods Gaussian elimination method LU method for factorization Simplex method of.
MCE 561 Computational Methods in Solid Mechanics
1) CG is a numerical method to solve a linear system of equations 2) CG is used when A is Symmetric and Positive definite matrix (SPD) 3) CG of Hestenes.
Direct and iterative sparse linear solvers applied to groundwater flow simulations Matrix Analysis and Applications October 2007.
Interval-based Inverse Problems with Uncertainties Francesco Fedele 1,2 and Rafi L. Muhanna 1 1 School of Civil and Environmental Engineering 2 School.
1 Parallel Simulations of Underground Flow in Porous and Fractured Media H. Mustapha 1,2, A. Beaudoin 1, J. Erhel 1 and J.R. De Dreuzy IRISA – INRIA.
A Factored Sparse Approximate Inverse software package (FSAIPACK) for the parallel preconditioning of linear systems Massimiliano Ferronato, Carlo Janna,
Tutorial 5: Numerical methods - buildings Q1. Identify three principal differences between a response function method and a numerical method when both.
An Effective Dynamic Scheduling Runtime and Tuning System for Heterogeneous Multi and Many-Core Desktop Platforms Authous: Al’ecio P. D. Binotto, Carlos.
1 Hybrid methods for solving large-scale parameter estimation problems Carlos A. Quintero 1 Miguel Argáez 1 Hector Klie 2 Leticia Velázquez 1 Mary Wheeler.
1 A Domain Decomposition Analysis of a Nonlinear Magnetostatic Problem with 100 Million Degrees of Freedom H.KANAYAMA *, M.Ogino *, S.Sugimoto ** and J.Zhao.
Fast Thermal Analysis on GPU for 3D-ICs with Integrated Microchannel Cooling Zhuo Fen and Peng Li Department of Electrical and Computer Engineering, {Michigan.
STE 6239 Simulering Friday, Week 1: 5. Scientific computing: basic solvers.
1 SIMULATION OF VIBROACOUSTIC PROBLEM USING COUPLED FE / FE FORMULATION AND MODAL ANALYSIS Ahlem ALIA presented by Nicolas AQUELET Laboratoire de Mécanique.
Using Partitioning in the Numerical Treatment of ODE Systems with Applications to Atmospheric Modelling Zahari Zlatev National Environmental Research Institute.
Monitoring and modelling 3-D ground movements induced by seasonal gas storage in deep reservoirs P. Teatini, G. Gambolati, N. Castelletto, M. Ferronato,
C GasparAdvances in Numerical Algorithms, Graz, Fast interpolation techniques and meshless methods Csaba Gáspár Széchenyi István University, Department.
Computational Aspects of Multi-scale Modeling Ahmed Sameh, Ananth Grama Computing Research Institute Purdue University.
Parallel Iterative Solvers with the Selective Blocking Preconditioning for Simulations of Fault-Zone Contact Kengo Nakajima GeoFEM/RIST, Japan. 3rd ACES.
Silesian University of Technology in Gliwice Inverse approach for identification of the shrinkage gap thermal resistance in continuous casting of metals.
MECH4450 Introduction to Finite Element Methods Chapter 9 Advanced Topics II - Nonlinear Problems Error and Convergence.
October 2008 Integrated Predictive Simulation System for Earthquake and Tsunami Disaster CREST/Japan Science and Technology Agency (JST)
Cracow Grid Workshop, November 5-6, 2001 Concepts for implementing adaptive finite element codes for grid computing Krzysztof Banaś, Joanna Płażek Cracow.
Chapter 9 Gauss Elimination The Islamic University of Gaza
A Dirichlet-to-Neumann (DtN)Multigrid Algorithm for Locally Conservative Methods Sandia National Laboratories is a multi program laboratory managed and.
Discretization Methods Chapter 2. Training Manual May 15, 2001 Inventory # Discretization Methods Topics Equations and The Goal Brief overview.
MECH593 Introduction to Finite Element Methods
Optimization in Engineering Design 1 Introduction to Non-Linear Optimization.
STATIC ANALYSIS OF UNCERTAIN STRUCTURES USING INTERVAL EIGENVALUE DECOMPOSITION Mehdi Modares Tufts University Robert L. Mullen Case Western Reserve University.
Algebraic Solvers in FASTMath Argonne Training Program on Extreme-Scale Computing August 2015.
F. Fairag, H Tawfiq and M. Al-Shahrani Department of Math & Stat Department of Mathematics and Statistics, KFUPM. Nov 6, 2013 Preconditioning Technique.
A Parallel Hierarchical Solver for the Poisson Equation Seung Lee Deparment of Mechanical Engineering
An Introduction to Computational Fluids Dynamics Prapared by: Chudasama Gulambhai H ( ) Azhar Damani ( ) Dave Aman ( )
Solving linear systems in fluid dynamics P. Aaron Lott Applied Mathematics and Scientific Computation Program University of Maryland.
1 Mary F. Wheeler 1, Sanghyun Lee 1 With Nicholas Hayman 2, Jacqueline Reber 3, Thomas Wick 4 1 Center for Subsurface Modeling, University of Texas at.
Conjugate gradient iteration One matrix-vector multiplication per iteration Two vector dot products per iteration Four n-vectors of working storage x 0.
Sandia National Laboratories is a multi-program laboratory managed and operated by Sandia Corporation, a wholly owned subsidiary of Lockheed Martin Corporation,
1) CG is a numerical method to solve a linear system of equations 2) CG is used when A is Symmetric and Positive definite matrix (SPD) 3) CG of Hestenes.
Hui Liu University of Calgary
EEE 431 Computational Methods in Electrodynamics
Xing Cai University of Oslo
Department of Mathematics
Boundary Element Analysis of Systems Using Interval Methods
A computational loop k k Integration Newton Iteration
Sahar Sargheini, Alberto Paganini, Ralf Hiptmair, Christian Hafner
FEA Introduction.
Deflated Conjugate Gradient Method
Deflated Conjugate Gradient Method
A robust preconditioner for the conjugate gradient method
Estimating Networks With Jumps
GENERAL VIEW OF KRATOS MULTIPHYSICS
Objective Numerical methods Finite volume.
Mathematical Solution of Non-linear equations : Newton Raphson method
Dynamical mean field theory: In practice
Ph.D. Thesis Numerical Solution of PDEs and Their Object-oriented Parallel Implementations Xing Cai October 26, 1998.
A computational loop k k Integration Newton Iteration
Presentation transcript:

Multilevel Incomplete Factorizations for Non-Linear FE problems in Geomechanics DMMMSA – University of Padova Department of Mathematical Methods and Models for Scientific Applications Carlo Janna, Massimiliano Ferronato and Giuseppe Gambolati Due Giorni di Algebra Lineare Numerica Bologna, Marzo 6-7, 2008

Outline Introduction Introduction Level structure of the matrix Level structure of the matrix Multilevel Incomplete Factorization (MIF) Multilevel Incomplete Factorization (MIF) Numerical results Numerical results Drawbacks and possible solutions Drawbacks and possible solutions Conclusions Conclusions

Fluid removal/injection from/to subsurface Pore pressure and effective stress variation Environmental, geomechanical and geotechnical applications Prediction by numerical models } The Geomechanical problem

Classical Biot’s consolidation theory: Classical Biot’s consolidation theory: The Geomechanical problem The problem can be solved by decoupling: The problem can be solved by decoupling: The fluid-dynamic problem is solved first The fluid-dynamic problem is solved first The output of the fluid-dynamic part is used as input for the geomechanical problem The output of the fluid-dynamic part is used as input for the geomechanical problem

The structural part of the problem is solved by FE minimizing the total potential energy The structural part of the problem is solved by FE minimizing the total potential energy The Geomechanical problem The arising system of equations is non-linear because and G are functions of the stress state The arising system of equations is non-linear because and G are functions of the stress state

The presence of faults and fractures in the geological media is another source of non-linearity The presence of faults and fractures in the geological media is another source of non-linearity The Geomechanical problem

Constrained Minimization Problem: = opposite of the distance The Geomechanical problem Faults and fractures act as contact surfaces Faults and fractures act as contact surfaces Interface Elements and Penalty method

The Geomechanical problem Some considerations: Some considerations: Only FE in the reservoir are subject to a relevant stress change Only FE in the reservoir are subject to a relevant stress change Surrounding FE can be considered to behave elastically Surrounding FE can be considered to behave elastically The faults presence involves only few FE The faults presence involves only few FE The non-linear quasi static problem is solved by a Newton-like scheme that results in a sequence of linear systems: The non-linear quasi static problem is solved by a Newton-like scheme that results in a sequence of linear systems:

The Sparse Linear System The linearized system can be reordered in such a way to show its natural 3-level block structure: The linearized system can be reordered in such a way to show its natural 3-level block structure: Dof linked to linear elements Dof linked to non-linear elements Dof linked to interface elements

The Sparse Linear System The system matrix A is Symmetric Positive Definite: use of PCG The system matrix A is Symmetric Positive Definite: use of PCG The K 1, B 11, B 12 blocks do not change during a simulation The K 1, B 11, B 12 blocks do not change during a simulation The K 2, B 22 blocks change whenever a stress perturbation occurs in the reservoir The K 2, B 22 blocks change whenever a stress perturbation occurs in the reservoir The C block change whenever the contact condition varies on the faults The C block change whenever the contact condition varies on the faults The system is very ill-conditioned due to the penalty approach because ||C|| >> || K 1 ||, ||K 2 || The system is very ill-conditioned due to the penalty approach because ||C|| >> || K 1 ||, ||K 2 ||

The Multilevel Incomplete Factorization Define a partial incomplete factorization of a matrix A: Define a partial incomplete factorization of a matrix A: with:

The Multilevel Incomplete Factorization The use of M -1 as a preconditioner requires the solution of: The use of M -1 as a preconditioner requires the solution of: The second step is performed in this way: The second step is performed in this way: y 2 can be found approximately by using again a partial incomplete factorization of S 1 y 2 can be found approximately by using again a partial incomplete factorization of S 1

The Multilevel Incomplete Factorization Advantages of the approach: Advantages of the approach: There is no need to perform the factorization of the whole matrix A at every non-linear iteration There is no need to perform the factorization of the whole matrix A at every non-linear iteration It is possible to independently tune the fill-in degree of each level with 2 parameters ρ i1, ρ i2 It is possible to independently tune the fill-in degree of each level with 2 parameters ρ i1, ρ i2 The unknows linked to the penalty block are kept toghether in a single level The unknows linked to the penalty block are kept toghether in a single level

Numerical Results 3D Geomechanical problem of faulted rocks discretized with FE and IE

Numerical Results # of unknowns Level 1 435,207 Level 2 163,581 Level 3 20,014 Total618,802 Level 1 Level 2 Level 3

Numerical Results

Comparison between ILLT and MIF in terms of: Number of Iterations Number of Iterations CPU Time CPU Time Memory occupation Memory occupation

Numerical Results T. Tot. [s] T. CG [s] Prec. [s] 75 # Iterations ILLT T. Tot. [s] Liv. 1 [s] Liv. 2 [s] Liv. 3 [s] T. CG [s] Prec. [s] 53 # Iterations MIF Performance in the solution of a single system Performance in the solution of a single system

Numerical Results CPU time for Lev. 1 and Lev. 2 (34.46 s) can be made up for in a few non-linear iterations CPU time for Lev. 1 and Lev. 2 (34.46 s) can be made up for in a few non-linear iterations Losing some performance (about 15%) the memory occupation can be further reduced Losing some performance (about 15%) the memory occupation can be further reduced Observations:

ILLT CPU Prec 26h 57m 33s T. CG 3h 45m 42s Overhead 22m 45s Total CPU Time 31h 6m 0s MIF CPU Prec 4h 44m 10s T. CG 3h 41m 6s Overhead 21m 13s Total CPU Time 8h 46m 29s Numerical Results Performance in a real whole simulation Performance in a real whole simulation

Drawbacks The original matrix is SPD, but an SPD multilevel incomplete factorization is not guaranteed to exist : The original matrix is SPD, but an SPD multilevel incomplete factorization is not guaranteed to exist : The factorization of the 11 block of the actual level may be indefinite The factorization of the 11 block of the actual level may be indefinite The Schur complement of the actual level may be indefinite The Schur complement of the actual level may be indefinite

Possible solutions The use of another solver instead of PCG, i.e. CR or SQMR, that does not require positive definiteness The use of another solver instead of PCG, i.e. CR or SQMR, that does not require positive definiteness Allowing for larger fill-in degrees Allowing for larger fill-in degrees The implementation of special techniques to guarantee the positive definiteness of the factors The implementation of special techniques to guarantee the positive definiteness of the factors

Possible solutions Procedure of Ajiz & Jennings for the 11 block factorization Procedure of Ajiz & Jennings for the 11 block factorization Diagonal compensation to enforce

Possible solutions Procedure of Tismenetsky for the Schur complement computation Procedure of Tismenetsky for the Schur complement computation

Conclusions The Multilevel Incomplete Factorization has proven to be a robust and reliable tool for the solution of non linear problems in geomechanics The Multilevel Incomplete Factorization has proven to be a robust and reliable tool for the solution of non linear problems in geomechanics Part of the preconditioner can be computed at the beginning of the simulation thus reducing the set-up phase during the non-linear iterations Part of the preconditioner can be computed at the beginning of the simulation thus reducing the set-up phase during the non-linear iterations Its level structure allows for a fine tuning of the fill-in degree and thus of the preconditioner quality Its level structure allows for a fine tuning of the fill-in degree and thus of the preconditioner quality

…and future work The development of techniques to guarantee the positive definiteness of the preconditioner The development of techniques to guarantee the positive definiteness of the preconditioner Sensitivity analysis of the user-defined parameters Sensitivity analysis of the user-defined parameters Application to other naturally multilevel problems (coupled problems such as coupled consolidation, flow & transport..) Application to other naturally multilevel problems (coupled problems such as coupled consolidation, flow & transport..)

Thank you for your attention DMMMSA – University of Padova Department of Mathematical Methods and Models for Scientific Applications