3,372 research outputs found
Certified Roundoff Error Bounds using Bernstein Expansions and Sparse Krivine-Stengle Representations
Floating point error is an inevitable drawback of embedded systems
implementation. Computing rigorous upper bounds of roundoff errors is
absolutely necessary to the validation of critical software. This problem is
even more challenging when addressing non-linear programs. In this paper, we
propose and compare two new methods based on Bernstein expansions and sparse
Krivine-Stengle representations, adapted from the field of the global
optimization to compute upper bounds of roundoff errors for programs
implementing polynomial functions. We release two related software package
FPBern and FPKiSten, and compare them with state of the art tools. We show that
these two methods achieve competitive performance, while computing accurate
upper bounds by comparison with other tools.Comment: 20 pages, 2 table
A computer algebra user interface manifesto
Many computer algebra systems have more than 1000 built-in functions, making
expertise difficult. Using mock dialog boxes, this article describes a proposed
interactive general-purpose wizard for organizing optional transformations and
allowing easy fine grain control over the form of the result even by amateurs.
This wizard integrates ideas including:
* flexible subexpression selection;
* complete control over the ordering of variables and commutative operands,
with well-chosen defaults;
* interleaving the choice of successively less main variables with applicable
function choices to provide detailed control without incurring a combinatorial
number of applicable alternatives at any one level;
* quick applicability tests to reduce the listing of inapplicable
transformations;
* using an organizing principle to order the alternatives in a helpful
manner;
* labeling quickly-computed alternatives in dialog boxes with a preview of
their results,
* using ellipsis elisions if necessary or helpful;
* allowing the user to retreat from a sequence of choices to explore other
branches of the tree of alternatives or to return quickly to branches already
visited;
* allowing the user to accumulate more than one of the alternative forms;
* integrating direct manipulation into the wizard; and
* supporting not only the usual input-result pair mode, but also the useful
alternative derivational and in situ replacement modes in a unified window.Comment: 38 pages, 12 figures, to be published in Communications in Computer
Algebr
Residues and Resultants
Resultants, Jacobians and residues are basic invariants of multivariate
polynomial systems. We examine their interrelations in the context of toric
geometry. The global residue in the torus, studied by Khovanskii, is the sum
over local Grothendieck residues at the zeros of Laurent polynomials in
variables. Cox introduced the related notion of the toric residue relative to
divisors on an -dimensional toric variety. We establish denominator
formulas in terms of sparse resultants for both the toric residue and the
global residue in the torus. A byproduct is a determinantal formula for
resultants based on Jacobians.Comment: Plain TeX, 22 page
ShearLab: A Rational Design of a Digital Parabolic Scaling Algorithm
Multivariate problems are typically governed by anisotropic features such as
edges in images. A common bracket of most of the various directional
representation systems which have been proposed to deliver sparse
approximations of such features is the utilization of parabolic scaling. One
prominent example is the shearlet system. Our objective in this paper is
three-fold: We firstly develop a digital shearlet theory which is rationally
designed in the sense that it is the digitization of the existing shearlet
theory for continuous data. This implicates that shearlet theory provides a
unified treatment of both the continuum and digital realm. Secondly, we analyze
the utilization of pseudo-polar grids and the pseudo-polar Fourier transform
for digital implementations of parabolic scaling algorithms. We derive an
isometric pseudo-polar Fourier transform by careful weighting of the
pseudo-polar grid, allowing exploitation of its adjoint for the inverse
transform. This leads to a digital implementation of the shearlet transform; an
accompanying Matlab toolbox called ShearLab is provided. And, thirdly, we
introduce various quantitative measures for digital parabolic scaling
algorithms in general, allowing one to tune parameters and objectively improve
the implementation as well as compare different directional transform
implementations. The usefulness of such measures is exemplarily demonstrated
for the digital shearlet transform.Comment: submitted to SIAM J. Multiscale Model. Simu
On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection
Given a zero-dimensional polynomial system consisting of n integer
polynomials in n variables, we propose a certified and complete method to
compute all complex solutions of the system as well as a corresponding
separating linear form l with coefficients of small bit size. For computing l,
we need to project the solutions into one dimension along O(n) distinct
directions but no further algebraic manipulations. The solutions are then
directly reconstructed from the considered projections. The first step is
deterministic, whereas the second step uses randomization, thus being
Las-Vegas.
The theoretical analysis of our approach shows that the overall cost for the
two problems considered above is dominated by the cost of carrying out the
projections. We also give bounds on the bit complexity of our algorithms that
are exclusively stated in terms of the number of variables, the total degree
and the bitsize of the input polynomials
- …