Search

We consider a PDE-constrained optimization problem of tracking type with parabolic state equation. The solution to the problem is characterized by the Karush-Kuhn-Tucker (KKT) system, which we formulate using a strong variational formulation of the state equation and a super weak formulation of the adjoined state equation. This allows us to propose a preconditioner that is robust both in the regularization and the diffusion parameter. In order to discretize the problem, we use Isogeometric Analysis since it allows the construction of sufficiently smooth basis functions effortlessly. To realize the preconditioner, one has to solve a problem over the whole space time cylinder that is elliptic with respect to certain non-standard norms. Using a fast diagonalization approach in time, we reformulate the problem as a collection of elliptic problems in space only. These problems are not only smaller, but our approach also allows to solve them in a time-parallel way. We show the efficiency of the preconditioner by rigorous analysis and illustrate it with numerical experiments., Comment: This work was supported by the Research Council of Norway through the grants 300305 and 301013. This work was supported by the Austrian Science Fund (FWF): 10.55776/P33956

The recently introduced Physics-Informed Neural Networks (PINNs) have popularized least squares formulations of both forward and inverse problems involving partial differential equations (PDEs) in strong form. We employ both Isogeometric Analysis and Physics-Informed Networks.

We consider the linearized elasticity equation, discretized with multi-patch Isogeometric Analysis. A standard discretization error analysis is based on Korn's inequality, which degrades for certain geometries, such as long and thin cantilevers. This phenomenon is known as geometry locking. We observe that high-order methods, like Isogeometric Analysis is beneficial in such a setting. The main focus of this paper is the construction and analysis of a domain decomposition solver, namely an Isogeometric Tearing and Interconnecting (IETI) solver, where we prove that the convergence behavior does not depend on the constant of Korn's inequality for the overall domain, but only on the corresponding constants for the individual patches. Moreover, our analysis is explicit in the choice of the spline degree. Numerical experiments are provided which demonstrates the efficiency of the proposed solver., Comment: arXiv admin note: text overlap with arXiv:2202.13707

We are interested in a fast solver for the Stokes equations, discretized with multi-patch Isogeometric Analysis. In the last years, several inf-sup stable discretizations for the Stokes problem have been proposed, often the analysis was restricted to single-patch domains. We focus on one of the simplest approaches, the isogeometric Taylor--Hood element. We show how stability results for single-patch domains can be carried over to multi-patch domains. While this is possible, the stability strongly depends on the shape of the geometry. We construct a Dual-Primal Isogeometric Tearing and Interconnecting (IETI-DP) solver that does not suffer from that effect. We give a convergence analysis and provide numerical tests.

We develop a multigrid solver for the second biharmonic problem in the context of Isogeometric Analysis (IgA), where we also allow a zero-order term. In a previous paper, the authors have developed an analysis for the first biharmonic problem based on Hackbusch's framework. This analysis can only be extended to the second biharmonic problem if one assumes uniform grids. In this paper, we prove a multigrid convergence estimate using Bramble's framework for multigrid analysis without regularity assumptions. We show that the bound for the convergence rate is independent of the scaling of the zero-order term and the spline degree. It only depends linearly on the number of levels, thus logarithmically on the grid size. Numerical experiments are provided which illustrate the convergence theory and the efficiency of the proposed multigrid approaches.

We are interested in a fast solver for linear systems obtained by discretizing the Stokes problem with multi-patch Isogeometric Analysis. We use Dual-Primal Isogeometric Tearing and Interconnecting (IETI-DP) methods. In resent years, IETI-DPand related methods have been studied extensively, mainly for the Poisson problem. For the Stokes equations, several challenges arise since the corresponding system is not positive definite, but has saddle point structure. Moreover, the Stokes equations with Dirichlet boundary conditions have a null-space, consisting of the constant pressure modes. This poses a challenge when considering the scaled Dirichlet preconditioner. We test out two different scaled Dirichlet preconditioners with different choices of primal degrees of freedom. The tests are performed on rather simple domains (the unit square and a quarter annulus) and a more complicated domain (a Yeti-footprint).

In this paper we analyze an optimization problem with limited observation governed by a convection--diffusion--reaction equation. Motivated by a Schur complement approach, we arrive at continuous norms that enable analysis of well-posedness and subsequent derivation of error analysis and a preconditioner that is robust with respect to the parameters of the problem. We provide conditions for inf-sup stable discretizations and present one such discretization for box domains with constant convection. We also provide a priori error estimates for this discretization. The preconditioner requires a fourth order problem to be solved. For this reason, we use Isogeometric Analysis as a method of discretization. To efficiently realize the preconditioner, we consider geometric multigrid with a standard Gauss-Seidel smoother as well as a new macro Gauss-Seidel smoother. The latter smoother provides good results with respect to both the geometry mapping and the polynomial degree.

In this paper we consider multiple saddle point problems with block tridiagonal Hessian in a Hilbert space setting. Well-posedness and the related issue of preconditioning are discussed. We give a characterization of all block structured norms which ensure well-posedness of multiple saddle point problems as a helpful tool for constructing block diagonal preconditioners. We subsequently apply our findings to a general class of PDE-constrained optimal control problems containing a regularization parameter $\alpha$ and derive $\alpha$-robust preconditioners for the corresponding optimality systems. Finally, we demonstrate the generality of our approach with two optimal control problems related to the heat and the wave equation, respectively. Preliminary numerical experiments support the feasibility of our method.

This paper is concerned with robust preconditioning of wave equations constrained linear inverse problems from boundary observation data. The main result of this paper is a concept for regularization parameter robust preconditioning. Analogous concepts have been developed for control problems based on elliptic partial equations before.

In this paper, we develop multigrid solvers for the biharmonic problem in the framework of isogeometric analysis (IgA). In this framework, one typically sets up B-splines on the unit square or cube and transforms them to the domain of interest by a global smooth geometry function. With this approach, it is feasible to set up $H^2$-conforming discretizations. We propose two multigrid methods for such a discretization, one based on Gauss Seidel smoothing and one based on mass smoothing. We prove that both are robust in the grid size, the latter is also robust in the spline degree. Numerical experiments illustrate the convergence theory and indicate the efficiency of the proposed multigrid approaches, particularly of a hybrid approach combining both smoothers.

The importance of Schur complement based preconditioners are well-established for classical saddle point problems in $\mathbb{R}^N \times \mathbb{R}^M$. In this paper we extend these results to multiple saddle point problems in Hilbert spaces $X_1\times X_2 \times \cdots \times X_n$. For such problems with a block tridiagonal Hessian and a well-defined sequence of associated Schur complements, sharp bounds for the condition number of the problem are derived which do not depend on the involved operators. These bounds can be expressed in terms of the roots of the difference of two Chebyshev polynomials of the second kind. If applied to specific classes of optimal control problems the abstract analysis leads to new existence results as well as to the construction of efficient preconditioners for the associated discretized optimality systems.