Related papers: Gaussian quadrature rules for $C^1$ quintic spline…
How many operations do we need on the average to compute an approximate root of a random Gaussian polynomial system? Beyond Smale's 17th problem that asked whether a polynomial bound is possible, we prove a quasi-optimal bound $\text{(input…
Isogeometric Analysis generalizes classical finite element analysis and intends to integrate it with the field of Computer-Aided Design. A central problem in achieving this objective is the reconstruction of analysis-suitable models from…
In this paper we describe a methodology for the identification of symmetric quadrature rules inside of quadrilaterals, triangles, tetrahedra, prisms, pyramids, and hexahedra. The methodology is free from manual intervention and is capable…
Minimal cubature rules of degree $4n-1$ for the weight functions $$ W_{\a,\b,\pm \frac12}(x,y) = |x+y|^{2\a+1} |x-y|^{2\b+1} ((1-x^2)(1-y^2))^{\pm \frac12} $$ on $[-1,1]^2$ are constructed explicitly and are shown to be closed related to…
Some Gauss-type quadrature rules over [0, 1], which involve values and/or the derivative of the integrand at 0 and/or 1, are investigated
We discuss the problem of finding non-trivial invariants of non-deterministic, symmetric cut-reduction procedures in the classical sequent calculus. We come to the conclusion that (an enriched version of) the propositional fragment of GS4…
We provide a necessary and sufficient condition for existence of Gaussian cubature formulas. It consists of checking whether some overdetermined linear system has a solution and so complements Mysovskikh's theorem which requires computing…
In this work we propose and analyse a numerical method for computing a family of highly oscillatory integrals with logarithmic singularities. For these quadrature rules we derive error estimates in terms of $N$, the number of nodes, $k$ the…
We present a quantum algorithm to evaluate matrix elements of functions of unitary operators. The method is based on calculating quadrature nodes and weights using data collected from a quantum processor. Given a unitary $U$ and quantum…
In this paper, we consider $C^1$ cubic Powell-Sabin splines for the numerical solution of boundary value problems on planar and spatial surface domains. We first review the construction and basic properties of polynomial and rational $C^1$…
Loop Quantum Gravity provides a natural truncation of the infinite degrees of freedom of gravity, obtained by studying the theory on a given finite graph. We review this procedure and we present the construction of the canonical theory on a…
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…
The quadratic unconstrained binary optimization (QUBO) problem arises in diverse optimization applications ranging from Ising spin problems to classical problems in graph theory and binary discrete optimization. The use of preprocessing to…
Using polar convex bodies and the $C_0$-bounds from Guan and Ni \cite{PL}, we obtain a uniform lower bound on the Gauss curvature of the normalized solution of the Gauss curvature flow without using Chow's Harnack inequality \cite{Ch2}.
We present several new quadrature formulas in the triangle for exact integration of polynomials. The points were computed numerically with a cardinal function algorithm which imposes that the number of quadrature points $N$ be equal to the…
In this note we prove that the version of Newton algorithm with line search we used in [2] converges quadratically.
The Gauss-Bonnet gravity is a special case of so-called Quadratic Gravity, which is an extension of Einstein's theory with additional terms in action that are quadratic combinations of the Riemann tensor and its contractions. These…
We present new higher-order quadratures for a family of boundary integral operators re-derived using the approach introduced in [Kublik, Tanushev, and Tsai - J. Comp. Phys. 247: 279-311, 2013]. In this formulation, a boundary integral over…
In this paper we consider genus one equations of degree n, namely a (generalised) binary quartic when n = 2, a ternary cubic when n = 3, and a pair of quaternary quadrics when n = 4. A new definition for the minimality of genus one…
The Quadratic Unconstrained Binary Optimization problem (QUBO) has become a unifying model for representing a wide range of combinatorial optimization problems, and for linking a variety of disciplines that face these problems. A new class…