A quadrature Galerkin scheme with the Bogner–Fox–Schmit element for a biharmonic problem on a rectangular polygon is analyzed for existence, uniqueness, and convergence of the discrete solution. It is known that a product Gaussian quadrature with at least three-points is required to guarantee optimal order convergence in Sobolev norms. In this article, optimal order error estimates are proved f...

The extended Gaussian quadrature rules are shown to be an efficient tool for numerical integration of wide class of functions with singularities of logarithmic type. The quadratures are exact for the functions pol1n−1(x) + lnx pol2n−1(x) , where pol1n−1(x) and pol2n−1(x) are two arbitrary polynomials of degree n−1 and n is the order of the quadrature formula. We present an implementation of num...

Several numerical approximation strategies for the expectation-propagation algorithm are studied in the context of large-scale learning: the Laplace method, a faster variant of it, Gaussian quadrature, and a deterministic version of variational sampling (i.e., combining quadrature with variational approximation). Experiments in training linear binary classifiers show that the expectation-propag...

Kernel methods have recently attracted resurgent interest, showing performance competitive with deep neural networks in tasks such as speech recognition. The random Fourier features map is a technique commonly used to scale up kernel machines, but employing the randomized feature map means that O(ε-2) samples are required to achieve an approximation error of at most ε. We investigate some alter...

It is shown how recent ideas on rational Gauss-type quadrature rules can be extended to Gauss-Kronrod, Gauss-Turr an, and Cauchy principal value quadrature rules. Numerical examples illustrate the advantages in accuracy thus achievable. 0. Introduction The idea of constructing quadrature rules that are exact for rational functions with prescribed poles, rather than for polynomials, has received...