Dynamic capillarity in porous media : mathematical analysis

In this thesis we investigate pseudo-parabolic equations modelling the two-phase flow in porous media, where dynamic effects in the difference of the phase pressures are included. Specifically, the time derivative of saturation is taken into account. The first chapter investigates the travelling wave (TW) solutions, the existence anduniqueness of smooth TW solutions are proved by ordinary differential equation techniques. The existence depends on the parameters involved. There is a threshold value for one of the parameters, the damping coefficient. When the damping coefficient is beyond the threshold value, smooth TW solutions do not exist any more. Instead, non-smooth (sharp) TW solutions are introduced and their existence is shown. The theoretical results for both smooth and non-smooth TW solutions are confirmed by numerical computations. In the next chapter, the analysis is extended to weak solutions. In a simplified case where the mixed (time and space) order-three derivative term is linear, the existence and uniqueness of a weak solution are obtained. Next, the complex model involving nonlinear and possibly degenerate capillary induced diffusion function is considered. Then the existence is obtained by employing regularization techniques, compensated compactness and equi-integrability arguments. Finally, inspired by the nature of the capillary pressure, different formulations of the equation are introduced and their equivalence is proved. The corresponding numerical scheme is implemented and numerical results are given, which agree well with the theoretical results

A linear domain decomposition method for partially saturated flow in porous media

The Richards equation is a nonlinear parabolic equation that is commonly used for modelling saturated/unsaturated flow in porous media. We assume that the medium occupies a bounded Lipschitz domain partitioned into two disjoint subdomains separated by a fixed interface $\Gamma$. This leads to two problems defined on the subdomains which are coupled through conditions expressing flux and pressure continuity at $\Gamma$. After an Euler implicit discretisation of the resulting nonlinear subproblems a linear iterative ($L$-type) domain decomposition scheme is proposed. The convergence of the scheme is proved rigorously. In the last part we present numerical results that are in line with the theoretical finding, in particular the unconditional convergence of the scheme. We further compare the scheme to other approaches not making use of a domain decomposition. Namely, we compare to a Newton and a Picard scheme. We show that the proposed scheme is more stable than the Newton scheme while remaining comparable in computational time, even if no parallelisation is being adopted. Finally we present a parametric study that can be used to optimize the proposed scheme.Comment: 34 pages, 13 figures, 7 table

Analysis of higher order difference method for a pseudo-parabolic equation with delay

WOS: 000504461100008In this paper, the author considers the one dimensional initial-boundary problem for a pseudo-parabolic equation with time delay in second spatial derivative. To solve this problem numerically, the author constructs higher order difference method and obtain the error estimate for its solution. Based on the method of energy estimates the fully discrete scheme is shown to be convergent of order four in space and of order two in time. Some numerical examples illustrate the convergence and effectiveness of the numerical method.Scientific and Technological Research Council of Turkey (TUBITAK)Turkiye Bilimsel ve Teknolojik Arastirma Kurumu (TUBITAK) [1059B191700821]This research was fully supported by Scientific and Technological Research Council of Turkey (TUBITAK) [grant number 1059B191700821]. The author would like to thank the Department of Mathematics of the University of Oklahoma for the hospitality during her work on the project, Nikola Petrov and Murad Ozaydin who were instrumental in arranging her stay in Oklahoma. Ilhame Amirali thanks Nikola Petrov for stimulating discussions

Numerical Relativity: A review

Computer simulations are enabling researchers to investigate systems which are extremely difficult to handle analytically. In the particular case of General Relativity, numerical models have proved extremely valuable for investigations of strong field scenarios and been crucial to reveal unexpected phenomena. Considerable efforts are being spent to simulate astrophysically relevant simulations, understand different aspects of the theory and even provide insights in the search for a quantum theory of gravity. In the present article I review the present status of the field of Numerical Relativity, describe the techniques most commonly used and discuss open problems and (some) future prospects.Comment: 2 References added; 1 corrected. 67 pages. To appear in Classical and Quantum Gravity. (uses iopart.cls

Finite element solution techniques for large-scale problems in computational fluid dynamics

Element-by-element approximate factorization, implicit-explicit and adaptive implicit-explicit approximation procedures are presented for the finite-element formulations of large-scale fluid dynamics problems. The element-by-element approximation scheme totally eliminates the need for formation, storage and inversion of large global matrices. Implicit-explicit schemes, which are approximations to implicit schemes, substantially reduce the computational burden associated with large global matrices. In the adaptive implicit-explicit scheme, the implicit elements are selected dynamically based on element level stability and accuracy considerations. This scheme provides implicit refinement where it is needed. The methods are applied to various problems governed by the convection-diffusion and incompressible Navier-Stokes equations. In all cases studied, the results obtained are indistinguishable from those obtained by the implicit formulations

Explicit-in-Time Variational Formulations for Goal-Oriented Adaptivity

Goal-Oriented Adaptivity (GOA) is a powerful tool to accurately approximate physically relevant features of the solution of Partial Differential Equations (PDEs). It delivers optimal grids to solve challenging engineering problems. In time dependent problems, GOA requires to represent the error in the Quantity of Interest (QoI) as an integral over the whole space-time domain in order to reduce it via adaptive refinements. A full space-time variational formulation of the problem allows the aforementioned error representation. Thus, variational spacetime formulations for PDEs have been of great interest in the last decades, among other things, because they allow to develop mesh-adaptive algorithms. Since it is known that implicit time marching schemes have variational structure, they are often employed for GOA in time-domain problems. When coming to explicit-intime methods, these were introduced for Ordinary In this dissertation, we prove that the explicit Runge-Kutta (RK) methods can be expressed as discontinuous-in-time Petrov-Galerkin (dPG) methods for the linear advection-diffusion equation. We systematically build trial and test functions that, after exact integration in time, lead to one, two, and general stage explicit RK methods. This approach enables us to reproduce the existing time domain goal-oriented adaptive algorithms using explicit methods in time. Here, we employ the lowest order dPG formulation that we propose to recover the Forward Euler method and we derive an appropriate error representation. Then, we propose an explicit-in-time goal-oriented adaptive algorithm that performs local refinements in space. In terms of time domain adaptivity, we impose the Courant-Friedrichs-Lewy (CFL) condition to ensure the stability of the method. We provide some numerical results in one-dimensional (1D)+time for the diffusion and advection-diffusion equations to show the performance of the proposed algorithm. On the other hand, time-domain adaptive algorithms involve solving a dual problem that runs backwards in time. This process is, in general, computationally expensive in terms of memory storage. In this work, we dene a pseudo-dual problem that runs forwards in time. We also describe a forward-in-time adaptive algorithm that works for some specific problems. Although it is not possible to dene a general dual problem running forwards in time that provides information about future states, we provide numerical evidence via one-dimensional problems in space to illustrate the efficiency of our algorithm as well as its limitations. As a complementary method, we propose a hybrid algorithm that employs the classical backward-in-time dual problem once and then performs the adaptive process forwards in time. We also generalize a novel error representation for goal-oriented adaptivity using (unconventional) pseudo-dual problems in the context of frequency-domain wave-propagation problems to the time-dependent wave equation. We show via 1D+time numerical results that the upper bounds for the new error representation are sharper than the classical ones. Therefore, this new error representation can be used to design more efficient goal-oriented adaptive methodologies. Finally, as classical Galerkin methods may lead to instabilities in advection-dominated-diffusion problems and therefore, inappropriate refinements, we propose a novel stabilized discretization method, which we call Isogeometric Residual Minimization (iGRM) with direction splitting. This method combines the benefits resulting from Isogeometric Analysis (IGA), residual minimization, and Alternating Direction Implicit (ADI) methods. We employ second order ADI time integrator schemes, B-spline basis functions in space and, at each time step, we solve a stabilized mixed method based on residual minimization. We show that the resulting system of linear equations has a Kronecker product structure, which results in a linear computational cost of the direct solver, even using implicit time integration schemes together with the stabilized mixed formulation. We test our method in 2D and 3D+time advection-diffusion problems. The derivation of a time-domain goal-oriented strategy based on iGRM will be considered in future works

Constraint violation in free evolution schemes: comparing BSSNOK with a conformal decomposition of Z4

We compare numerical evolutions performed with the BSSNOK formulation and a conformal decomposition of a Z4-like formulation of General Relativity. The important difference between the two formulations is that the Z4 formulation has a propagating Hamiltonian constraint, whereas BSSNOK has a zero-speed characteristic variable in the constraint subsystem. In spherical symmetry we evolve both puncture and neutron star initial data. We demonstrate that the propagating nature of the Z4 constraints leads to results that compare favorably with BSSNOK evolutions, especially when matter is present in the spacetime. From the point of view of implementation the new system is a simple modification of BSSNOK.Comment: Published in PR