Related papers: Backward Error Measures for Roots of Polynomials

Complex signed measures of finite total variation are a powerful signal model in many applications. Restricting to the $d$-dimensional torus, finitely supported measures allow for exact recovery if the trigonometric moments up to some order…

We present an a posteriori estimator of the error in the L^2-norm for the numerical approximation of the Maxwell's eigenvalue problem by means of N\'ed\'elec finite elements. Our analysis is based on a Helmholtz decomposition of the error…

We present a combination of two algorithms that accurately calculate multiple roots of general polynomials. Algorithm I transforms the singular root-finding into a regular nonlinear least squares problem on a pejorative manifold, and…

We consider the roots of uniformly chosen complex and real reciprocal polynomials of degree $N$ whose Mahler measure is bounded by a constant. After a change of variables this reduces to a generalization of Ginibre's complex and real…

Variational inference has become an increasingly attractive fast alternative to Markov chain Monte Carlo methods for approximate Bayesian inference. However, a major obstacle to the widespread use of variational methods is the lack of…

We propose a posteriori error estimators for classical low-order inf-sup stable and stabilized finite element approximations of the Stokes problem with singular sources in two and three dimensional Lipschitz, but not necessarily convex,…

We derive functional a posteriori error equalities and constant free two sided estimates for certain types of partial differential equations. The error is measured in a combined norm which takes into account both the primal and dual…

We consider Poisson's equation with a finite number of weighted Dirac masses as a source term, together with its discretization by means of conforming finite elements. For the error in fractional Sobolev spaces, we propose residual-type a…

Let $K$ be a field, complete with respect to a discrete non-archimedian valuation and let $k$ be the residue field. Consider a system $F$ of $n$ polynomial equations in $K\vars$. Our first result is a reformulation of the classical Hensel's…

This paper deals with the use of numerical methods based on random root sampling techniques to solve some theoretical problems arising in the analysis of polynomials. These methods are proved to be practical and give solutions where…

We develop the \textit{a posteriori} error analysis of three mixed finite element formulations for rotation-based equations in elasticity, poroelasticity, and interfacial elasticity-poroelasticity. The discretisations use $H^1$-conforming…

We propose a randomized a posteriori error estimator for reduced order approximations of parametrized (partial) differential equations. The error estimator has several important properties: the effectivity is close to unity with prescribed…

We propose and study a weakly convergent variant of the forward--backward algorithm for solving structured monotone inclusion problems. Our algorithm features a per-iteration deviation vector which provides additional degrees of freedom.…

In this paper we study an a posteriori error indicator introduced in E. Dari, R.G. Duran, C. Padra, Appl. Numer. Math., 2012, for the approximation of the Laplace eigenvalue problem with Crouzeix-Raviart non-conforming finite elements. In…

Given a non-trivial Borel measure $\mu$ on the unit circle $\mathbb T$, the corresponding reproducing (or Christoffel-Darboux) kernels with one of the variables fixed at $z=1$ constitute a family of so-called para-orthogonal polynomials,…

This paper investigates the asymptotics of the number of prime values taken by a polynomial in several variables with integer coefficients. Based on probabilistic heuristics and the multidimensional Bateman Horn conjecture, the expected…

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…

Error-correcting pairs were introduced independently by Pellikaan and K\"otter as a general method of decoding linear codes with respect to the Hamming metric using coordinatewise products of vectors, and are used for many well-known…

In certain applications involving the solution of a Bayesian inverse problem, it may not be possible or desirable to evaluate the full posterior, e.g. due to the high computational cost of doing so. This problem motivates the use of…

Truncated Taylor series representations of invariant manifolds are abundant in numerical computations. We present an aposteriori method to compute the convergence radii and error estimates of analytic parametrisations of non-resonant local…