arXiv subjects

Igor Voulis

Publications and source records attributed to Igor Voulis.

13 recordsLinked to original sources

arXiv2026

Comparing domain decomposition preconditioners for non-conforming Helmholtz discretizations

We compare additive and multiplicative domain decomposition preconditioners, without coarse correction, for three non-conforming polynomial discretizations of Helmholtz problems: discontinuous Galerkin, embedded Trefftz discontinuous Galerkin, and hybrid discontinuous Galerkin methods. The preconditioners are studied within stationary and Krylov iterative solvers. All three discretizations lead to complex-symmetric systems and local subproblems with inherited impedance-type boundary conditions. These properties enable the use of conjugate gradients and allow the local matrices to be obtained directly by restriction of the global matrix. Numerical experiments in two and three dimensions demonstrate promising performance for large-scale Helmholtz problems.

math.NA↗

arXiv2026

Embedded Trefftz DG method for steady Navier-Stokes flow. Part II: Nonlinear problem

We develop and analyze an embedded Trefftz-DG method for the steady incompressible Navier-Stokes equations, based on the reduced Oseen discretization from Part I. The main difficulty is that the reduced Trefftz space depends on the convection field, so successive Picard iterates live in different discrete spaces. We address this by constructing projections between convection-dependent Trefftz spaces and using them to control the reduced Oseen solution map. Under suitable resolution and small-data assumptions, we prove existence of discrete solutions, uniqueness, and convergence of the Picard iteration. We also derive an a priori error analysis by relating the method to the underlying DG discretization, thereby inheriting convergence properties from compatible DG Navier-Stokes analyses. Numerical experiments on standard incompressible-flow benchmarks illustrate the theory.

math.NA↗

arXiv2026

Embedded Trefftz DG method for steady Navier-Stokes flow. Part I: Oseen linearization

We develop an embedded Trefftz-DG method for the Oseen problem and prove a complete stability and quasi-optimality theory in standard DG norms. The key ingredient is a construction of a suitable local complement space to the Trefftz space, on which the Oseen operator is stably invertible. We also derive a reduced formulation of the method, the resulting system is posed in terms of the velocity unknown only, a crucial step in the analysis especially for the nonlinear Navier-Stokes problem in Part II.

math.NA↗

arXiv2026

Embedded Trefftz DG method for reaction-diffusion problems on anisotropic meshes

We present and analyze an embedded Trefftz discontinuous Galerkin method for reaction-diffusion problems on anisotropic meshes. The method is constructed by imposing a relaxed local Trefftz condition via an embedding into a tensor-product DG space, yielding a reduced global system while preserving the approximation properties of the underlying high-order discretization. We prove stability and quasi-optimality on anisotropic, possibly curved, quadrilateral elements, and derive anisotropic a priori error estimates. Numerical experiments for $h$- and $hp$-refinement, including curved-domain examples, validate the theoretical results.

math.NA↗

arXiv2026

Embedded Trefftz DG method for the Helmholtz equation

We study an embedded Trefftz discontinuous Galerkin method for the Helmholtz equation. The method starts from a polynomial DG space and enforces the Trefftz property through local constraints, avoiding an explicit construction of Trefftz basis functions. For the global coupling we use a simple symmetric interior penalty DG bilinear form. Since the resulting formulation is not coercive, stability is proved by a $T$-coercivity argument combined with a Schatz-type duality technique. This yields wavenumber-explicit stability, quasi-optimality, and convergence estimates in standard DG norms under an explicit mesh resolution condition.

math.NA↗

arXiv2025

Adaptive stochastic Galerkin finite element methods: Optimality and non-affine coefficients

Near-optimal computational complexity of an adaptive stochastic Galerkin method with independently refined spatial meshes for elliptic partial differential equations is shown. The method takes advantage of multilevel structure in expansions of random diffusion coefficients and combines operator compression in the stochastic variables with error estimation using finite element frames in space. A new operator compression strategy is introduced for nonlinear coefficient expansions, such as diffusion coefficients with log-affine structure.

math.NA↗

arXiv2024

Embedded Trefftz DG framework for the analysis of discretizations with local-global decompositions

This paper presents a framework for the analysis of discretization methods based on the decomposition into local and global problems. We apply the framework to provide a comprehensive error analysis for the embedded Trefftz discontinuous Galerkin method, for a wide range of second-order scalar elliptic partial differential equations and a scalar reaction-advection problem. We also analyze quasi-Trefftz methods with our framework, presenting the first optimal error bounds in weaker norms.

math.NA↗

arXiv2024

A convergent adaptive finite element stochastic Galerkin method based on multilevel expansions of random fields

The subject of this work is an adaptive stochastic Galerkin finite element method for parametric or random elliptic partial differential equations, which generates sparse product polynomial expansions with respect to the parametric variables of solutions. For the corresponding spatial approximations, an independently refined finite element mesh is used for each polynomial coefficient. The method relies on multilevel expansions of input random fields and achieves error reduction with uniform rate. In particular, the saturation property for the refinement process is ensured by the algorithm. The results are illustrated by numerical experiments, including cases with random fields of low regularity.

math.NA↗

arXiv2023

Analysis of divergence-preserving unfitted finite element methods for the mixed Poisson problem

In this paper we present a new H(div)-conforming unfitted finite element method for the mixed Poisson problem which is robust in the cut configuration and preserves conservation properties of body-fitted finite element methods. The key is to formulate the divergence-constraint on the active mesh, instead of the physical domain, in order to obtain robustness with respect to cut configurations without the need for a stabilization that pollutes the mass balance. This change in the formulation results in a slight inconsistency, but does not affect the accuracy of the flux variable. By applying post-processings for the scalar variable, in virtue of classical local post-processings in body-fitted methods, we retain optimal convergence rates for both variables and even the superconvergence after post-processing of the scalar variable. We present the method and perform a rigorous a-priori error analysis of the method and discuss several variants and extensions. Numerical experiments confirm the theoretical results.

math.NA↗

arXiv2022

Time-Continuous and Time-Discontinuous Space-Time Finite Elements for Advection-Diffusion Problems

We construct four variants of space-time finite element discretizations based on linear tensor-product and simplex-type finite elements. The resulting discretizations are continuous in space, and continuous or discontinuous in time. In a first test run, all four methods are applied to a linear scalar advection-diffusion model problem. Then, the convergence properties of the time-discontinuous space-time finite element discretizations are studied in numerical experiments. Advection velocity and diffusion coefficient are varied, such that the parabolic case of pure diffusion (heat equation), as well as, the hyperbolic case of pure advection (transport equation) are included in the study. For each model parameter set, the L2 error at the final time is computed for spatial and temporal element lengths ranging over several orders of magnitude to allow for an individual evaluation of the methods' spatial, temporal, and spacetime accuracy. In the parabolic case, particular attention is paid to the influence of time-dependent boundary conditions. Key findings include a spatial accuracy of second order and a temporal accuracy between second and third order. The temporal accuracy tends towards third order depending on how advection-dominated the test case is, on the choice of the specific discretization method, and on the time-(in)dependence and treatment of the boundary conditions. Additionally, the potential of time-continuous simplex space-time finite elements for heat flux computations is demonstrated with a piston ring pack test case.

math.NA↗

arXiv2022

An adaptive stochastic Galerkin method based on multilevel expansions of random fields: Convergence and optimality

The subject of this work is a new stochastic Galerkin method for second-order elliptic partial differential equations with random diffusion coefficients. It combines operator compression in the stochastic variables with tree-based spline wavelet approximation in the spatial variables. Relying on a multilevel expansion of the given random diffusion coefficient, the method is shown to achieve optimal computational complexity up to a logarithmic factor. In contrast to existing results, this holds in particular when the achievable convergence rate is limited by the regularity of the random field, rather than by the spatial approximation order. The convergence and complexity estimates are illustrated by numerical experiments.

math.NA↗

arXiv2018

A time dependent Stokes interface problem: well-posedness and space-time finite element discretization

In this paper a time dependent Stokes problem that is motivated by a standard sharp interface model for the fluid dynamics of two-phase flows is studied. This Stokes interface problem has discontinuous density and viscosity coefficients and a pressure solution that is discontinuous across an evolving interface. This strongly simplified two-phase Stokes equation is considered to be a good model problem for the development and analysis of finite element discretization methods for two-phase flow problems. In view of the unfitted finite element methods that are often used for two-phase flow simulations, we are particularly interested in a well-posed variational formulation of this Stokes interface problem in a Euclidean setting. Such well-posed weak formulations, which are not known in the literature, are the main results of this paper. Different variants are considered, namely one with suitable spaces of divergence free functions, a discrete-in-time version of it, and variants in which the divergence free constraint in the solution space is treated by a pressure Lagrange multiplier. The discrete-in-time variational formulation involving the pressure variable for the divergence free constraint is a natural starting point for a space-time finite element discretization. Such a method is introduced and results of numerical experiments with this method are presented.

math.NA↗

arXiv2018

Discontinuous Galerkin Time Discretization Methods for Parabolic Problems with Linear Constraints

We consider time discretization methods for abstract parabolic problems with inhomogeneous linear constraints. Prototype examples that fit into the general framework are the heat equation with inhomogeneous (time dependent) Dirichlet boundary conditions and the time dependent Stokes equation with an inhomogeneous divergence constraint. Two common ways of treating such linear constraints, namely explicit or implicit (via Lagrange multipliers) are studied. These different treatments lead to different variational formulations of the parabolic problem. For these formulations we introduce a modification of the standard discontinuous Galerkin (DG) time discretization method in which an appropriate projection is used in the discretization of the constraint. For these discretizations (optimal) error bounds, including superconvergence results, are derived. Discretization error bounds for the Lagrange multiplier are presented. Results of experiments confirm the theoretically predicted optimal convergence rates and show that without the modification the (standard) DG method has sub-optimal convergence behavior.

math.NA↗