Related papers: Backward Error Measures for Roots of Polynomials

We consider a 1D periodic atomistic model, for which we formulate and analyze an adaptive variant of a quasicontinuum method. We establish a posteriori error estimates for the energy norm and for the energy, based on a posteriori residual…

In this contribution, quasi-orthogonality of polynomials generated by Geronimus and Uvarov transformations is analyzed. An attempt is made to discuss the recovery of the source orthogonal polynomial from the quasi-Geronimus and quasi-Uvarov…

We look at two classical examples in the theory of numerical analysis, namely the Runge example for interpolation and Wilkinson's example (actually two examples) for rootfinding. We use the modern theory of backward error analysis and…

Some known results for locating the roots of polynomials are extended to the case of matrix polynomials. In particular, a theorem by A.E. Pellet [Bulletin des Sciences Math\'ematiques, (2), vol 5 (1881), pp.393-395], some results of D.A.…

In this paper we develop a new a posteriori error analysis for the Monge-Amp\`ere equation approximated by conforming finite element method on isotropic meshes in 2D. The approach utilizes a slight variant of the mixed discretization…

In this work, we consider the systematic error of quantum metrology by weak measurements under decoherence. We derive the systematic error of maximum likelihood estimation in general to the first-order approximation of a small deviation in…

For each square matrix polynomial $P(\lambda)$ of odd degree, a block-symmetric block-tridiagonal pencil $\mathcal{T}_{P}(\lambda)$ was introduced by Antoniou and Vologiannidis in 2004, and a variation $\mathcal{R}_P(\lambda)$ was…

The reduced basis method is a model reduction technique yielding substantial savings of computational time when a solution to a parametrized equation has to be computed for many values of the parameter. Certification of the approximation is…

The spectral deferred correction method is a variant of the deferred correction method for solving ordinary differential equations. A benefit of this method is that is uses low order schemes iteratively to produce a high order…

The usual methods for root finding of polynomials are based on the iteration of a numerical formula for improvement of successive estimations. The unpredictable nature of the iterations prevents to search roots inside a pre-specified region…

In this work, we consider a multivariate regression model with one-sided errors. We assume for the regression function to lie in a general H\"{o}lder class and estimate it via a nonparametric local polynomial approach that consists of…

We propose a general error analysis related to the low-rank approximation of a given real matrix in both the spectral and Frobenius norms. First, we derive deterministic error bounds that hold with some minimal assumptions. Second, we…

We propose a novel a posteriori error estimator for the N\'ed\'elec finite element discretization of time-harmonic Maxwell's equations. After the approximation of the electric field is computed, we propose a fully localized algorithm to…

To compare different forecasting methods on demand series we require an error measure. Many error measures have been proposed, but when demand is intermittent some become inapplicable, some give counter-intuitive results, and there is no…

In this note, we concentrate on the backward error of the equality constrained indefinite least squares problem. For the normwise backward error of the equality constrained indefinite least square problem, we adopt the linearization method…

Eigenvalue and eigenpair backward errors are computed for matrix pencils arising in optimal control. In particular, formulas for backward errors are developed that are obtained under block-structure-preserving and…

We give two determinantal representations for a bivariate polynomial. They may be used to compute the zeros of a system of two of these polynomials via the eigenvalues of a two-parameter eigenvalue problem. The first determinantal…

The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…

Theorem 1 is a formula expressing the mean number of real roots of a random multihomogeneous system of polynomial equations as a multiple of the mean absolute value of the determinant of a random matrix. Theorem 2 derives closed form…

We prove that certain sequences of Laurent polynomials, obtained from a fixed Laurent polynomial P by monomial substitutions, give rise to sequences of Mahler measures which converge to the Mahler measure of P. This generalizes previous…