相关论文: Good interlaced polynomial lattice rules for numer…
The Linear Smoothing (LS) scheme \cite{francisa.ortiz-bernardin2017} ameliorates linear and quadratic approximations over convex polytopes by employing a three-point integration scheme. In this work, we propose a linearly consistent one…
Many separable nonlinear optimization problems can be approximated by their nonlinear objective functions with piecewise linear functions. A natural question arising from applying this approach is how to break the interval of interest into…
The quadrature of cut elements is crucial for all Finite Element Methods that do not apply boundary-fitted meshes. It should be efficient, accurate, and robust. Various approaches balancing these requirements have been published, with some…
Neural networks are usually not the tool of choice for nonparametric high-dimensional problems where the number of input features is much larger than the number of observations. Though neural networks can approximate complex multivariate…
We introduce a new paradigm for immersed finite element and isogeometric methods based on interpolating function spaces from an unfitted background mesh into Lagrange finite element spaces defined on a foreground mesh that captures the…
Quadratic form reduction and lattice reduction are fundamental tools in computational number theory and in computer science, especially in cryptography. The celebrated Lenstra-Lenstra-Lov\'asz reduction algorithm (so-called LLL) has been…
We prove the existence of quadrature formulas exact for integrating high degree polynomials with respect to Jacobi weights based on scattered data on the unit interval. We also obtain a characterization of local Besov spaces using the…
The (fast) component-by-component (CBC) algorithm is an efficient tool for the construction of generating vectors for quasi-Monte Carlo rank-1 lattice rules in weighted reproducing kernel Hilbert spaces. We consider product weights, which…
This paper constructs adaptive sparse grid collocation method onto arbitrary order piecewise polynomial space. The sparse grid method is a popular technique for high dimensional problems, and the associated collocation method has been well…
Choosing the optimization algorithm that performs best on a given machine learning problem is often delicate, and there is no guarantee that current state-of-the-art algorithms will perform well across all tasks. Consequently, the more…
The use of machine learning techniques to improve the performance of branch-and-bound optimization algorithms is a very active area in the context of mixed integer linear problems, but little has been done for non-linear optimization. To…
Phonons are fundamentally important for many materials properties, including thermal and electronic transport, superconductivity, and structural stability. Here, we describe a method to compute phonons in correlated materials using…
Designs and methods for nested lattice codes using Construction D' lattices for coding and convolutional code lattices for shaping are described. Two encoding methods and a decoding algorithm for Construction D' coding lattices that can be…
Multidimensional diagonal-norm summation-by-parts (SBP) operators with collocated volume and facet nodes, known as diagonal-$ \mathsf{E} $ operators, are attractive for entropy-stable discretizations from an efficiency standpoint. However,…
Rough sets are efficient for data pre-processing in data mining. Matroids are based on linear algebra and graph theory, and have a variety of applications in many fields. Both rough sets and matroids are closely related to lattices. For a…
In this paper we propose and analyse composite Filon-Clenshaw-Curtis quadrature rules for integrals of the form $I_{k}^{[a,b]}(f,g) := \int_a^b f(x) \exp(\mathrm{i}kg(x)) \rd x $, where $k \geq 0$, $f$ may have integrable singularities and…
A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…
The paper addresses parametric inequality systems described by polynomial functions in finite dimensions, where state-dependent infinite parameter sets are given by finitely many polynomial inequalities and equalities. Such systems can be…
The implementation of the finite element method for linear elliptic equations requires to assemble the stiffness matrix and the load vector. In general, the entries of this matrix-vector system are not known explicitly but need to be…
Analysis of molecular scale interactions and chemical structure offers an enormous opportunity to tune material properties for targeted applications. However, designing materials from molecular scale is a grand challenge owing to the…