Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOptimal monomial quadratization for ODE systems
48
0
0.0
(
0
)
Added by
Andrey Bychkov
Publication date
2021
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Quadratization problem is, given a system of ODEs with polynomial right-hand side, transform the system to a system with quadratic right-hand side by introducing new variables. Such transformations have been used, for example, as a preprocessing step by model order reduction methods and for transforming chemical reaction networks. We present an algorithm that, given a system of polynomial ODEs, finds a transformation into a quadratic ODE system by introducing new variables which are monomials in the original variables. The algorithm is guaranteed to produce an optimal transformation of this form (that is, the number of new variables is as small as possible), and it is the first algorithm with such a guarantee we are aware of. Its performance compares favorably with the existing software, and it is capable to tackle problems that were out of reach before.
rate research
Read More
We propose a functional implementation of emph{Multivariate Tower Automatic Differentiation}. Our implementation is intended to be used in implementing $C^infty$-structure computation of an arbitrary Weil algebra, which we discussed in the previous work.
In a recent series of communications we have shown that the reordering problem of bosons leads to certain combinatorial structures. These structures may be associated with a certain graphical description. In this paper, we show that there is a Hopf Algebra structure associated with this problem which is, in a certain sense, unique.
In the sparse polynomial multiplication problem, one is asked to multiply two sparse polynomials f and g in time that is proportional to the size of the input plus the size of the output. The polynomials are given via lists of their coefficients F and G, respectively. Cole and Hariharan (STOC 02) have given a nearly optimal algorithm when the coefficients are positive, and Arnold and Roche (ISSAC 15) devised an algorithm running in time proportional to the structural sparsity of the product, i.e. the set supp(F)+supp(G). The latter algorithm is particularly efficient when there not too many cancellations of coefficients in the product. In this work we give a clean, nearly optimal algorithm for the sparse polynomial multiplication problem.
We present a probabilistic algorithm to compute the product of two univariate sparse polynomials over a field with a number of bit operations that is quasi-linear in the size of the input and the output. Our algorithm works for any field of characteristic zero or larger than the degree. We mainly rely on sparse interpolation and on a new algorithm for verifying a sparse product that has also a quasi-linear time complexity. Using Kronecker substitution techniques we extend our result to the multivariate case.
Motivated by engineering applications of subsea installation by deepwater construction vessels in oil drilling, and of aid delivery by unmanned aerial vehicles in disaster relief, we develop output-feedback boundary control of heterodirectional coupled hyperbolic PDEs sandwiched between two ODEs, where the measurement is the output state of one ODE and suffers a time delay. After rewriting the time-delay dynamics as a transport PDE of which the left boundary connects with the sandwiched system, a state observer is built to estimate the states of the overall system of ODE-heterodirectional coupled hyperbolic PDEs-ODE-transport PDE using the right boundary state of the last transport PDE. An observer-based output-feedback controller acting at the first ODE is designed to stabilize the overall system using backstepping transformations and frequency-domain designs. The exponential stability results of the closed-loop system, boundedness and exponential convergence of the control input are proved. The obtained theoretical result is applied to control of a deepwater oil drilling construction vessel as a simulation case, where the simulation results show the proposed control design reduces cable oscillations and places the oil drilling equipment to be installed in the target area on the sea floor. Performance deterioration under extreme and unmodeled disturbances is also illustrated.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
