15 research outputs found
Recommended from our members
Numerical and Symbolical Methods for the GCD of Several Polynomials
The computation of the Greatest Common Divisor (GCD) of a set of polynomials is an important issue in computational mathematics and it is linked to Control Theory very strong. In this paper we present different matrix-based methods, which are developed for the efficient computation of the GCD of several polynomials. Some of these methods are naturally developed for dealing with numerical inaccuracies in the input data and produce meaningful approximate results. Therefore, we describe and compare numerically and symbolically methods such as the ERES, the Matrix Pencil and other resultant type methods, with respect to their complexity and effectiveness. The combination of numerical and symbolic operations suggests a new approach in software mathematical computations denoted as hybrid computations. This combination offers great advantages, especially when we are interested in finding approximate solutions. Finally the notion of approximate GCD is discussed and a useful criterion estimating the strength of a given approximate GCD is also developed
Computing the common zeros of two bivariate functions via BĂ©zout resultants
The common zeros of two bivariate functions can be computed by finding the common zeros of their polynomial interpolants expressed in a tensor Chebyshev basis. From here we develop a bivariate rootfinding algorithm based on the hidden variable resultant method and BĂ©zout matrices with polynomial entries. Using techniques including domain subdivision, BĂ©zoutian regularization, and local refinement we are able to reliably and accurately compute the simple common zeros of two smooth functions with polynomial interpolants of very high degree (â„ 1000). We analyze the resultant method and its conditioning by noting that the BĂ©zout matrices are matrix polynomials. Two implementations are available: one on the Matlab Central File Exchange and another in the roots command in Chebfun2 that is adapted to suit Chebfunâs methodology
âClaimingâ equality and âdoingâ inequality : Individual action plans for applicants of social assistance
This study investigates how formal equality is âdoneâ in 48 individual action plans for social assistance. We use a street-level perspective to understand how policy is âdoneâ to enhance equality for social assistance applicants. The analysis is based on the theory of street-level bureaucracy as well as on the concept of equality. Formal equality was inhibited by weak legal security, vague rights and duties, the inability to advocate for oneâs own case, and difficulties with ambiguous and incomprehensible language in individual action plans. Establishing formal equality is made even more difficult because of the individual means testing used to determine social assistance. We argue that applicants of social assistance might experience inequality that is greater than the inequality they experienced before the implementation of their individual action plans, despite the intent of these plans to decrease inequality
Voronoi diagram of orthogonal polyhedra in two and three dimensions
International audienceVoronoi diagrams are a fundamental geometric data structure for obtaining proximity relations. We consider collections of axis-aligned orthogonal polyhedra in two and three-dimensional space under the max-norm, which is a particularly useful scenario in certain application domains. We construct the exact Voronoi diagram inside an orthogonal polyhedron with holes defined by such polyhedra. Our approach avoids creating full-dimensional elements on the Voronoi diagram and yields a skeletal representation of the input object. We introduce a complete algorithm in 2D and 3D that follows the subdivision paradigm relying on a bounding-volume hierarchy; this is an original approach to the problem. The complexity is adaptive and comparable to that of previous methods. Under a mild assumption it is O(n/â) in 2D or O(n.α^2 /â^2) in 3D, where n is the number of sites, namely edges or facets resp., â is the maximum cell size for the subdivision to stop, and α bounds vertex cardinality per facet. We also provide a numerically stable, open-source implementation in Julia, illustrating the practical nature of our algorithm