Related papers: Compressive Isogeometric Analysis
Thermal modeling of Laser Powder Bed Fusion (LPBF) is challenging due to steep, rapidly moving thermal gradients induced by the laser, which are difficult to resolve accurately with conventional Finite Element Methods. Highly refined,…
Isogeometric Analysis (IGA) bridges Computer-Aided Design (CAD) and Finite Element Analysis (FEA) by employing splines as a common basis for geometry and analysis. One of the advantages of IGA is in the realm of thin shell analysis: due to…
In structural optimization, both parameters and shape are relevant for the model performance. Yet, conventional optimization techniques usually consider either parameters or the shape separately. This work addresses this problem by…
This paper is concerned with developing accurate and efficient numerical methods for fully nonlinear second order elliptic and parabolic partial differential equations (PDEs) in multiple spatial dimensions. It presents a general framework…
We present an isogeometric framework based on collocation to construct a $C^2$-smooth approximation of the solution of the Poisson's equation over planar bilinearly parameterized multi-patch domains. The construction of the used globally…
In recent years, there has been widespread adoption of machine learning-based approaches to automate the solving of partial differential equations (PDEs). Among these approaches, Gaussian processes (GPs) and kernel methods have garnered…
We propose a novel approach to the analysis of programmable geometrically exact shear deformable beam systems made of shape memory polymers. The proposed method combines the viscoelastic Generalized Maxwell model with the Williams, Landel…
We consider learning Ising tree models when the observations from the nodes are corrupted by independent but non-identically distributed noise with unknown statistics. Katiyar et al. (2020) showed that although the exact tree structure…
We propose a new discontinuous Galerkin (dG) method for a geometrically nonlinear Kirchhoff plate model for large isometric bending deformations. The minimization problem is nonconvex due to the isometry constraint. We present a practical…
This study develops a unified Point Cloud Geometry (PCG) compression method through the processing of multiscale sparse tensor-based voxelized PCG. We call this compression method SparsePCGC. The proposed SparsePCGC is a low complexity…
We generalize the interpolative separable density fitting (ISDF) method, used for compressing the four-index electron repulsion integral (ERI) tensor, to incorporate adaptive real space grids for potentially highly localized single-particle…
In this work, an exponential Discontinuous Galerkin (DG) method is proposed to solve numerically Vlasov type equations. The DG method is used for space discretization which is combined exponential Lawson Runge-Kutta method for time…
In this paper, we present a data-driven reduced order model of viscous Moore-Greitzer (MG) partial differential equation (PDE) by threading together ideas from principal component analysis (PCA) and autoencoder neural networks to sparse…
A novel and efficient approach which is based on the framework of isogeometric analysis for elliptic homogenization problems is proposed. These problems possess highly oscillating coefficients leading to extremely high computational…
Numerical simulation of the spherically symmetric Einstein--Euler (EE) system faces severe challenges due to the stringent physical admissibility constraints of relativistic fluids and the geometric singularities inherent in metric…
We present a novel formulation for the dynamics of geometrically exact Timoshenko beams and beam structures made of viscoelastic material featuring complex, arbitrarily curved initial geometries. An $\textrm{SO}(3)$-consistent and…
The identification of Partial Differential Equations (PDEs) has emerged as a prominent data-driven approach for mathematical modeling and has attracted considerable attention in recent years. The stability and precision in identifying PDE…
We present an approximately $C^1$-smooth multi-patch spline construction which can be used in isogeometric analysis (IGA). A key property of IGA is that it is simple to achieve high order smoothness within a single patch. To represent more…
Gaussian processes (GPs) are typically criticised for their unfavourable scaling in both computational and memory requirements. For large datasets, sparse GPs reduce these demands by conditioning on a small set of inducing variables…
Sparse principal component analysis with global support (SPCAgs), is the problem of finding the top-$r$ leading principal components such that all these principal components are linear combinations of a common subset of at most $k$…