Related papers: Compressive Isogeometric Analysis
The discovery of Partial Differential Equations (PDEs) is an essential task for applied science and engineering. However, data-driven discovery of PDEs is generally challenging, primarily stemming from the sensitivity of the discovered…
Future e-mobility calls for efficient electrical machines. For different areas of operation, these machines have to satisfy certain desired properties that often depend on their design. Here we investigate the use of multipatch Isogeometric…
In the context of isogeometric analysis, we consider two discretization approaches that make the resulting stiffness matrix nonsymmetric even if the differential operator is self-adjoint. These are the collocation method and the…
Full-potential electronic structure calculations for periodic systems retain the Coulomb singularity at the nuclei, which induces cusp behavior of the orbitals near the nuclei while leaving the interstitial region smooth. This multiscale…
Nishikawa (2007) proposed to reformulate the classical Poisson equation as a steady state problem for a linear hyperbolic system. This results in optimal error estimates for both the solution of the elliptic equation and its gradient.…
We present a unified algorithmic framework for the numerical solution, constrained optimization, and physics-informed learning of PDEs with a variational structure. Our framework is based on a Galerkin discretization of the underlying…
We present a scalable iterative solver for high-order hybridized discontinuous Galerkin (HDG) discretizations of linear partial differential equations. It is an interplay between domain decomposition methods and HDG discretizations, and…
This paper is concerned with developing accurate and efficient numerical methods for one-dimensional fully nonlinear second order elliptic and parabolic partial differential equations (PDEs). In the paper we present a general framework for…
In this paper, we study the multi-patch discontinuous Galerkin isogeometric (DG-IGA) approximations for full-potential electronic structure calculations. We decompose the physical domain into several subdomains, represent each part of the…
Although Galerkin discretizations have been intensively employed in the IgA context, an efficient implementation requires special numerical quadrature rules when constructing the system of equations. To avoid this issue, isogeometric…
One of the important aspects of IsoGeometric Analysis (IGA) is the strong link between Computer Aided Design and analysis. Two of IGA'a major challenge are the assembly of patches (Constructive Solid Geometry geometries made of Boolean…
This paper presents an approach to generalize the concept of isogeometric analysis (IGA) by allowing different spaces for parameterization of the computational domain and for approximation of the solution field. The method inherits the main…
In this work, we study the approximation properties of multi-patch dG-IgA methods, that apply the multipatch Isogeometric Analysis (IgA) discretization concept and the discontinuous Galerkin (dG) technique on the interfaces between the…
We present a robust and efficient multigrid method for single-patch isogeometric discretizations using tensor product B-splines of maximum smoothness. Our method is based on a stable splitting of the spline space into a large subspace of…
Isogeometric analysis uses the same class of basis functions for both, representing the geometry of the computational domain and approximating the solution. In practical applications, geometrical patches are used in order to get flexibility…
To exploit the advantageous properties of isogeometric analysis (IGA) in a scan-based setting, it is important to extract a smooth geometric domain from the scan data (e.g., voxel data). IGA-suitable domains can be constructed by…
This contribution explores the combined capabilities of reduced basis methods and IsoGeometric Analysis (IGA) in the context of parameterized partial differential equations. The introduction of IGA enables a unified simulation framework…
Compressive sensing claims that the sparse signals can be reconstructed exactly from many fewer measurements than traditionally believed necessary. One of issues ensuring the successful compressive sensing is to deal with the…
We present a new implementation of the geometric method of Cullen & Purser (1984) for solving the semi-geostrophic Eady slice equations which model large scale atmospheric flows and frontogenesis. The geometric method is a Lagrangian…
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…