New Acceleration of Nearly Optimal Univariate Polynomial Root-findERS

Univariate polynomial root-finding has been studied for four millennia and is still the subject of intensive research. Hundreds of efficient algorithms for this task have been proposed. Two of them are nearly optimal. The first one, proposed in 1995, relies on recursive factorization of a polynomial, is quite involved, and has never been implemented. The second one, proposed in 2016, relies on subdivision iterations, was implemented in 2018, and promises to be practically competitive, although user's current choice for univariate polynomial root-finding is the package MPSolve, proposed in 2000, revised in 2014, and based on Ehrlich's functional iterations. By proposing and incorporating some novel techniques we significantly accelerate both subdivision and Ehrlich's iterations. Moreover our acceleration of the known subdivision root-finders is dramatic in the case of sparse input polynomials. Our techniques can be of some independent interest for the design and analysis of polynomial root-finders.Comment: 89 pages, 5 figures, 2 table

Analysis of uniform binary subdivision schemes for curve design

The paper analyses the convergence of sequences of control polygons produced by a binary subdivision scheme of the form .0,1,2,...kz,ikj,ifjbm0j1k12ifjam0j1k2if=∈+Σ==++Σ==+ The convergence of the control polygons to a Cu curve is analysed in terms of the convergence to zero of a derived scheme for the differences - . The analysis of the smoothness of the limit curve is reduced to kif the convergence analysis of "differentiated" schemes which correspond to divided differences of {/i ∈Z} with respect to the diadic parameteriz- kif ation = i/2kitk . The inverse process of "integration" provides schemes with limit curves having additional orders of smoothness

Better estimates from binned income data: Interpolated CDFs and mean-matching

Researchers often estimate income statistics from summaries that report the number of incomes in bins such as \$0-10,000, \$10,001-20,000,...,\$200,000+. Some analysts assign incomes to bin midpoints, but this treats income as discrete. Other analysts fit a continuous parametric distribution, but the distribution may not fit well. We fit nonparametric continuous distributions that reproduce the bin counts perfectly by interpolating the cumulative distribution function (CDF). We also show how both midpoints and interpolated CDFs can be constrained to reproduce the mean of income when it is known. We compare the methods' accuracy in estimating the Gini coefficients of all 3,221 US counties. Fitting parametric distributions is very slow. Fitting interpolated CDFs is much faster and slightly more accurate. Both interpolated CDFs and midpoints give dramatically better estimates if constrained to match a known mean. We have implemented interpolated CDFs in the binsmooth package for R. We have implemented the midpoint method in the rpme command for Stata. Both implementations can be constrained to match a known mean.Comment: 20 pages (including Appendix), 3 tables, 2 figures (+2 in Appendix

Phase-field boundary conditions for the voxel finite cell method: surface-free stress analysis of CT-based bone structures

The voxel finite cell method employs unfitted finite element meshes and voxel quadrature rules to seamlessly transfer CT data into patient-specific bone discretizations. The method, however, still requires the explicit parametrization of boundary surfaces to impose traction and displacement boundary conditions, which constitutes a potential roadblock to automation. We explore a phase-field based formulation for imposing traction and displacement constraints in a diffuse sense. Its essential component is a diffuse geometry model generated from metastable phase-field solutions of the Allen-Cahn problem that assumes the imaging data as initial condition. Phase-field approximations of the boundary and its gradient are then employed to transfer all boundary terms in the variational formulation into volumetric terms. We show that in the context of the voxel finite cell method, diffuse boundary conditions achieve the same accuracy as boundary conditions defined over explicit sharp surfaces, if the inherent length scales, i.e., the interface width of the phase-field, the voxel spacing and the mesh size, are properly related. We demonstrate the flexibility of the new method by analyzing stresses in a human femur and a vertebral body