Related papers: Matrix-Free Ghost Penalty Evaluation via Tensor Pr…
We develop a constructive approach for $\ell_0$-penalized estimation in the sparse accelerated failure time (AFT) model with high-dimensional covariates. Our proposed method is based on Stute's weighted least squares criterion combined with…
Combining sum factorization, weighted quadrature, and row-based assembly enables efficient higher-order computations for tensor product splines. We aim to transfer these concepts to immersed boundary methods, which perform simulations on a…
In mathematical finance, many derivatives from markets with frictions can be formulated as optimal control problems in the HJB framework. Analytical optimal control can result in highly nonlinear PDEs, which might yield unstable numerical…
We present direct logarithmically optimal in theory and fast in practice algorithms to implement the tensor product high order finite element method on multi-dimensional rectangular parallelepipeds for solving PDEs of the Poisson kind. They…
This work presents a matrix-free finite element solver for finite-strain elasticity adopting an $hp$-multigrid preconditioner. Compared to classical algorithms relying on a global sparse matrix, matrix-free solution strategies significantly…
We present an approach for penalized tensor decomposition (PTD) that estimates smoothly varying latent factors in multi-way data. This generalizes existing work on sparse tensor decomposition and penalized matrix decompositions, in a manner…
In this paper, we discuss a novel higher-order stabilization-free virtual element method for general second-order elliptic eigenvalue problems. Optimal a priori error estimates are derived for both the approximate eigenspace and…
A self-learning optimal control algorithm for episodic fixed-horizon manufacturing processes with time-discrete control actions is proposed and evaluated on a simulated deep drawing process. The control model is built during consecutive…
We propose a factorization-free method for orthogonal projection onto the positive semidefinite (PSD) cone, leveraging composite polynomial filtering. Inspired by recent advances in homomorphic encryption, our approach approximates the PSD…
In this work, we explore the application of Stabilization-Free Virtual Element Methods for Neumann boundary Optimal Control Problems in saddle point formulation. The method is proposed for arbitrary polynomial order of accuracy and general…
In this paper, we present a novel penalty model called ExPen for optimization over the Stiefel manifold. Different from existing penalty functions for orthogonality constraints, ExPen adopts a smooth penalty function without using any…
Motivated by many applications in complex domains with boundaries exposed to large topological changes or deformations, fictitious domain methods regard the actual domain of interest as being embedded in a fixed Cartesian background. This…
Kernel matrix-vector multiplication (KMVM) is a foundational operation in machine learning and scientific computing. However, as KMVM tends to scale quadratically in both memory and time, applications are often limited by these…
As we all known, the nonnegative matrix factorization (NMF) is a dimension reduction method that has been widely used in image processing, text compressing and signal processing etc. In this paper, an algorithm for nonnegative matrix…
Unfitted boundary methods are widely used to numerically solve partial differential equations (PDEs) on irregular domains, avoiding the computational burden of generating boundary-conforming grids. In the finite-difference framework,…
The paper motivates high dimensional smoothing with penalized splines and its numerical calculation in an efficient way. If smoothing is carried out over three or more covariates the classical tensor product spline bases explode in their…
We propose a generalized multiscale finite element method (GMsFEM) based on clustering algorithm to study the elliptic PDEs with random coefficients in the multi-query setting. Our method consists of offline and online stages. In the…
We extend the GenTen tensor decomposition package by introducing an accelerated dense matricized tensor times Khatri-Rao product (MTTKRP), the workhorse kernel for canonical polyadic (CP) tensor decompositions, that is portable and…
In this work, we analyze a penalized variant of the {\phi}-FEM scheme for the Poisson equation with Dirichlet boundary conditions. The {\phi}-FEM is a recently introduced unfitted finite element method based on a level-set description of…
Matrix and tensor completion are frameworks for a wide range of problems, including collaborative filtering, missing data, and image reconstruction. Missing entries are estimated by leveraging an assumption that the matrix or tensor is…