基于Kronecker型替换的黑盒多项式稀疏插值

本文基于新的Kronecker型替换,给出两个由黑盒表示的稀疏多项式的新确定性插值算法.令f∈R[x1,……,xn]是一个稀疏黑盒多项式,其次数上界为D.当R是C或者是有限域时,相对于已有算法,新算法具有更好的计算复杂度或者关于D的复杂度更低.特别地,对于一般黑盒模型,D是复杂度中的主要因素,而在所有的确定性算法中,本文的第二个算法的复杂度关于D是最低的.     

Analysis on First-stage Ignition of n-Heptane at Low Temperatures with a Lumped Skeletal Mechanism

Two-stage ignition exists in the low-temperature combustion process of n-heptane and the first-stage ignition also shows a negative temperature coefficient(NTC) phenomenon. To study key reactions and understand chemical principles affecting the first-stage ignition of n-heptane, a lumped skeletal mechanism with 62 species is obtained based on the detailed NUIGMech1.0 mechanism using the directed relation graph method assisted by sensitivity analysis and isomer lumping. The lumped mechanism shows good performance on ignition delay time under wide conditions. The study revealed that the temperature after the first-stage ignition is higher and a larger amount of fuel is consumed at lower initial temperatures. The temperature at the first-stage ignition is relatively insensitive to the initial temperature. Further sensitivity analysis and reaction path analysis carried out based on the lumped mechanism show that the decomposition of RO₂ to produce alkene and HO₂is the most important reaction to inhibit the first-stage ignitions. The chain branching explosion closely related to the first-stage ignition will be terminated when the rate constant for the RO₂ decomposition is larger than that of the isomerization of RO₂ to produce QOOH. The NTC behavior as well as other characteristics of the first-stage ignition can be rationalized from the competition between these two reactions.     

A class of permutation quadrinomials

In this paper, we investigate the permutation behavior of a class of quadrinomials. Each term of these quadrinomials has a Niho-type exponent, and two sets of coefficient triples making the quadrinomials to be permutations are obtained. We use a substitution to transform the permutation problem into the root distribution problem in the unit circle of certain quadratic and cubic equations.     

On a numerical algorithm for the solution of the radial Loewner equation

The Loewner partial differential equation provides a one‐parametric family of conformal maps on the unit disk. The images describe a flow of an expanding simply‐connected domain, called the Loewner flow, on the complex plane. In this paper, we present a numerical algorithm for solving the radial Loewner partial differential equation. The algorithm is applied to visualization of Loewner flows with the performance and precision. From the theoretical point of view, our algorithm is based on a recursive formula for determining coefficients of polynomial approximations. We prove that each coefficient converges to true values with reasonable regularity.     

Graded polynomial identities for matrices with the transpose involution over an infinite field

Let F be an infinite field and let M_n(F) be the algebra of n×n matrices over F endowed with an elementary grading whose neutral component coincides with the main diagonal. In this paper, we find a basis for the graded polynomial identities of M_n(F) with the transpose involution. Our results generalize for infinite fields of arbitrary characteristic previous results in the literature, which were obtained for the field of complex numbers and for a particular class of elementary G-gradings.