Related papers: Estimation of quadrature errors in layer potential…
We present quadrature schemes to calculate matrices, where the so-called modified Hilbert transformation is involved. These matrices occur as temporal parts of Galerkin finite element discretizations of parabolic or hyperbolic problems when…
This paper studies the theoretical construction and analytic error estimation of complex Bessel function-based conformal mappings in regions with randomly perturbed boundaries. First, we construct a conformal mapping applicable to such…
A method is presented for obtaining rigorous error estimates for approximate solutions of the Riccati equation, with real or complex potentials. Our main tool is to derive invariant region estimates for complex solutions of the Riccati…
In this paper, we study error bounds for {\em Bayesian quadrature} (BQ), with an emphasis on noisy settings, randomized algorithms, and average-case performance measures. We seek to approximate the integral of functions in a {\em…
This paper introduces the scaled boundary cubature (SBC) scheme for accurate and efficient integration of functions over polygons and two-dimensional regions bounded by parametric curves. Over two-dimensional domains, the SBC method reduces…
Polygonal finite elements generally do not pass the patch test as a result of quadrature error in the evaluation of weak form integrals. In this work, we examine the consequences of lack of polynomial consistency and show that it can lead…
A non-singular formulation of the boundary integral method (BIM) is presented for the Laplace equation whereby the well-known singularities that arise from the fundamental solution are eliminated analytically. A key advantage of this…
Quadrature formulas for $\int_a^b f(x) dx$ where derivative terms need only be evaluated at $a$ and $b$ in the composite rule are identified. Error bounds are given when $f:[a,b]\to\mathbb{R}$ satisfies $f^{(n-1)}$ is absolutely continuous…
Chebyshev expansion coefficients can be computed efficiently by using the FFT, and for smooth functions the resulting approximation is close to optimal, with computations that are numerically stable. Given sufficiently accurate function…
In this paper, we present several new linearizations of a quadratic binary optimization problem (QBOP), primarily using the method of aggregations. Although aggregations were studied in the past in the context of solving system of…
Convolution quadrature (CQ) methods have enjoyed tremendous interest in recent years as an efficient tool for solving time-domain wave problems in unbounded domains via boundary integral equation techniques. In this paper we consider CQ…
Debugging quantum states transformations is an important task of modern quantum computing. The use of quantum tomography for these purposes significantly expands the range of possibilities. However, the presence of preparation and…
Quantum Annealing (QA) can efficiently solve combinatorial optimization problems whose objective functions are represented by Quadratic Unconstrained Binary Optimization (QUBO) formulations. For broader applicability of QA, quadratization…
Bayesian cubature (BC) is a popular inferential perspective on the cubature of expensive integrands, wherein the integrand is emulated using a stochastic process model. Several approaches have been put forward to encode sequential…
Quantum error correction in general is experimentally challenging as it requires significant expansion of the size of quantum circuits and accurate performance of quantum gates to fulfill the error threshold requirement. Here we propose a…
This article is concerned with a new method for the approximate evaluation of Fourier sine and cosine transforms. We develop and analyse a new quadrature rule for Fourier sine and cosine transforms involving transforming the integral to one…
We investigate the method of conjugate gradients, exploiting inaccurate matrix-vector products, for the solution of convex quadratic optimization problems. Theoretical performance bounds are derived, and the necessary quantities occurring…
The problem of the optimal approximation of circular arcs by parametric polynomial curves is considered. The optimality relates to the curvature error. Parametric polynomial curves of low degree are used and a geometric continuity is…
The manuscript describes a quadrature rule that is designed for the high order discretization of boundary integral equations (BIEs) using the Nystr\"{o}m method. The technique is designed for surfaces that can naturally be parameterized…
This paper proposes QPALM, a proximal augmented Lagrangian method based on quadratic approximations, for solving nonlinear programming problems with weakly convex objective and constraint functions. The algorithm is constructed by…