Related papers: Estimation of quadrature errors in layer potential…
This work addresses a novel version of the kernel-free boundary integral (KFBI) method for solving elliptic PDEs with implicitly defined irregular boundaries and interfaces. We focus on boundary value problems and interface problems, which…
Layer-wise capacity in large language models is highly non-uniform: some layers contribute disproportionately to loss reduction while others are near-redundant. Existing methods for exploiting this non-uniformity, such as…
A straightforward 3-point quadrature formula of closed type is derived that improves on Simpson's rule. Just using the additional information of the integrand's derivative at the two endpoints we show the error is sixth order in grid…
The perimeter and area generating functions of exactly solvable polygon models satisfy q-functional equations, where q is the area variable. The behaviour in the vicinity of the point where the perimeter generating function diverges can…
We study the integration problem over the $s$-dimensional unit cube on four types of Banach spaces of integrands. First we consider Haar wavelet spaces, consisting of functions whose Haar wavelet coefficients exhibit a certain decay…
This paper studies a generalization of hyperinterpolation over the high-dimensional unit cube. Hyperinterpolation of degree \( m \) serves as a discrete approximation of the \( L_2 \)-orthogonal projection of the same degree, using Fourier…
Keeping single-qubit quantum coherence above some threshold value not far below unity is a prerequisite for fault-tolerant quantum error correction (QEC). We study the initial dephasing of solid-state qubits in the independent-boson model,…
We provide a modification to the quantum phase estimation algorithm (QPEA) inspired on classical windowing methods for spectral density estimation. From this modification we obtain an upper bound in the cost that implies a cubic improvement…
This paper proposes a novel matrix quantization method, Binary Quadratic Quantization (BQQ). In contrast to conventional first-order quantization approaches, such as uniform quantization and binary coding quantization, that approximate…
Analytic approximants for the eigenvalues of the one-dimensional Schr\"odinger equation with potentials of the form $V(x)= Ax^a + Bx^b$ are found using a multi-point quasi-rational approximation technique. This technique is based on the use…
In finance, assessing the creditworthiness of loan applicants requires lenders to cluster borrowers using rating scales. Financial institutions must define the scales in compliance with strict institutional constraints, resulting in solving…
The Golub-Welsch algorithm [ Math. Comp., 23: 221-230 (1969)] has long been assumed symmetric for estimating quadratic forms. Recent research indicates that asymmetric quadrature nodes may be more often and the existence of a practical…
Quasi-Monte Carlo cubature methods often sample the integrand using Sobol' (or other digital) sequences to obtain higher accuracy than IID sampling. An important question is how to conservatively estimate the error of a digital sequence…
A bound on the error introduced by truncating a quantum addition is given. This bound shows that only a few controlled rotation gates will be necessary to get a reliable computation.
An important step in building a quantum computer is calibrating experimentally implemented quantum gates to produce operations that are close to ideal unitaries. The calibration step involves estimating the systematic errors in gates and…
A new algorithm for the efficient numerical approximation of weakly singular integrals over convex polytopes is introduced. Such integrals appear in the Galerkin discretizations of integral equations and nonlocal partial differential…
We derive global estimates for the error in solutions of linear hyperbolic systems due to inaccurate boundary geometry. We show that the error is bounded by data and bounded in time when the solutions in the true and approximate domains are…
Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) that becomes infeasible for shapes with high sampling density. A promising research direction is to tackle such quadratic optimization problems…
This paper considers the problem of single image depth estimation. The employment of convolutional neural networks (CNNs) has recently brought about significant advancements in the research of this problem. However, most existing methods…
A complete numerical implementation, in both singlet and non-singlet sectors, of a very elegant method to solve the QCD Evolution equations, due to Furmanski and Petronzio, is presented. The algorithm is directly implemented in x-space by a…