6,257 research outputs found
Computation of maximal local (un)stable manifold patches by the parameterization method
In this work we develop some automatic procedures for computing high order
polynomial expansions of local (un)stable manifolds for equilibria of
differential equations. Our method incorporates validated truncation error
bounds, and maximizes the size of the image of the polynomial approximation
relative to some specified constraints. More precisely we use that the manifold
computations depend heavily on the scalings of the eigenvectors: indeed we
study the precise effects of these scalings on the estimates which determine
the validated error bounds. This relationship between the eigenvector scalings
and the error estimates plays a central role in our automatic procedures. In
order to illustrate the utility of these methods we present several
applications, including visualization of invariant manifolds in the Lorenz and
FitzHugh-Nagumo systems and an automatic continuation scheme for (un)stable
manifolds in a suspension bridge problem. In the present work we treat
explicitly the case where the eigenvalues satisfy a certain non-resonance
condition.Comment: Revised version, typos corrected, references adde
Formal Proofs for Nonlinear Optimization
We present a formally verified global optimization framework. Given a
semialgebraic or transcendental function and a compact semialgebraic domain
, we use the nonlinear maxplus template approximation algorithm to provide a
certified lower bound of over . This method allows to bound in a modular
way some of the constituents of by suprema of quadratic forms with a well
chosen curvature. Thus, we reduce the initial goal to a hierarchy of
semialgebraic optimization problems, solved by sums of squares relaxations. Our
implementation tool interleaves semialgebraic approximations with sums of
squares witnesses to form certificates. It is interfaced with Coq and thus
benefits from the trusted arithmetic available inside the proof assistant. This
feature is used to produce, from the certificates, both valid underestimators
and lower bounds for each approximated constituent. The application range for
such a tool is widespread; for instance Hales' proof of Kepler's conjecture
yields thousands of multivariate transcendental inequalities. We illustrate the
performance of our formal framework on some of these inequalities as well as on
examples from the global optimization literature.Comment: 24 pages, 2 figures, 3 table
Hyperdeterminants as integrable discrete systems
We give the basic definitions and some theoretical results about
hyperdeterminants, introduced by A. Cayley in 1845. We prove integrability
(understood as 4d-consistency) of a nonlinear difference equation defined by
the 2x2x2-hyperdeterminant. This result gives rise to the following hypothesis:
the difference equations defined by hyperdeterminants of any size are
integrable.
We show that this hypothesis already fails in the case of the
2x2x2x2-hyperdeterminant.Comment: Standard LaTeX, 11 pages. v2: corrected a small misprint in the
abstrac
Generalized companion matrix for approximate GCD
We study a variant of the univariate approximate GCD problem, where the
coefficients of one polynomial f(x)are known exactly, whereas the coefficients
of the second polynomial g(x)may be perturbed. Our approach relies on the
properties of the matrix which describes the operator of multiplication by gin
the quotient ring C[x]=(f). In particular, the structure of the null space of
the multiplication matrix contains all the essential information about GCD(f;
g). Moreover, the multiplication matrix exhibits a displacement structure that
allows us to design a fast algorithm for approximate GCD computation with
quadratic complexity w.r.t. polynomial degrees.Comment: Submitted to MEGA 201
- …