The polynomial representation of the type An−1 rational Cherednik algebra in characteristic p | n

We study the polynomial representation of the rational Cherednik algebra of type A_n?1 with generic parameter in characteristic p for p | n. We give explicit formulas for generators for the maximal proper graded submodule, show that they cut out a complete intersection, and thus compute the Hilbert series of the irreducible quotient. Our methods are motivated by taking characteristic p analogues of existing characteristic 0 results.     

On the Unitary Binary Group

One consider the variety of the unitary binary group in n variables and it is shown that this algebraic variety is rational and it has n² parameters. Then it is given a parametrical rational representation of this variety.AMS Subject Classification (1991) 20G20     

矩形网格上二元有理插值的存在性问题

In this paper, making use of bivariate polynomial Lagrange iterpolation formula on rectangular grids, we set up the existence criterion of bivariate rational interpolants problem and its representation formula. Numerical examples are given.     

有理曲线和曲面的分片多项式逼近

本文利用摄动的思想,以摄动有理曲线（曲面）的系数的无穷模作为优化目标,给出了用多项式曲线（曲面）逼近有理曲线（曲面）的一种新方法．同以前的各种方法相比,该方法不仅收敛而且具有更快的收敛速度,并且可以与细分技术相结合,得到有理曲线与曲面的整体光滑、分片多项式的逼近．     

Volterra series approximation for rational nonlinear system

Rational nonlinear systems are widely used to model the phenomena in mechanics, biology, physics and engineering. However, there are no exact analytical solutions for rational nonlinear system. Hence, the approximate analytical solutions are good choices as they can give the estimation of the states for system analysis, controller design and reduction. In this paper, an approximate analytical solution for rational nonlinear system is derived in terms of the solution of a polynomial system by Volterra series theory. The rational nonlinear system is transformed to a singular polynomial system with finite terms by adding some algebraic constraints related to the rational terms. The analytical solution of singular polynomial system is approximated by the summation of the solutions of Volterra singular subsystems. Their analytical solutions are derived by a novel regularization algorithm. The first fourth Volterra subsystems are enough to approximate the analytical solution to guarantee the accuracy. Results of numerical experiments are reported to show the effectiveness of the proposed method.     

A Gröbner Free Alternative for Polynomial System Solving

Given a system of polynomial equations and inequations with coefficients in the field of rational numbers, we show how to compute a geometric resolution of the set of common roots of the system over the field of complex numbers. A geometric resolution consists of a primitive element of the algebraic extension defined by the set of roots, its minimal polynomial, and the parametrizations of the coordinates. Such a representation of the solutions has a long history which goes back to Leopold Kronecker and has been revisited many times in computer algebra. We introduce a new generation of probabilistic algorithms where all the computations use only univariate or bivariate polynomials. We give a new codification of the set of solutions of a positive dimensional algebraic variety relying on a new global version of Newton's iterator. Roughly speaking the complexity of our algorithm is polynomial in some kind of degree of the system, in its height, and linear in the complexity of evaluation of the system. We present our implementation in the Magma system which is called Kronecker in homage to his method for solving systems of polynomial equations. We show that the theoretical complexity of our algorithm is well reflected in practice and we exhibit some cases for which our program is more efficient than the other available software.     

Bundle bispectrality for matrix differential equations

We consider the fundamental solutions of a wide class of first order systems with polynomial dependence on the spectral parameter and rational matrix potentials. Such matrix potentials are rational solutions of a large class of integrable nonlinear equations, which play an important role in different mathematical physics problems. The concept of bispectrality, which was originally introduced by Grünbaum, is extended in a natural way for the systems under consideration and their bispectrality is derived via the representation of the fundamental solutions. This bispectrality is preserved under the flows of the corresponding integrable nonlinear equations. For the case of Dirac type (canonical) systems the complete characterization of the bispectral potentials under consideration is obtained in terms of the system's spectral function.     

样条型矩阵有理插值

The matrix valued rational interpolation is very useful in the partial realization problem and model reduction for all the linear system theory. Lagrange basic functions have been used in matrix valued rational interpolation. In this paper, according to the property of cardinal spline interpolation, we constructed a kind of spline type matrix valued rational interpolation, which based on cardinal spline. This spline type interpolation can avoid instability of high order polynomial interpolation and we obtained a useful formula.     

The Linear Rational Pseudospectral Method with Preassigned Poles

We present a linear rational pseudospectral (collocation) method with preassigned poles for solving boundary value problems. It consists in attaching poles to the trial polynomial so as to make it a rational interpolant. Its convergence is proved by transforming the problem into an associated boundary value problem. Numerical examples demonstrate that the rational pseudospectral method is often more efficient than the polynomial method.     

一种四次有理插值样条及其逼近性质

1引言有理样条函数是多项式样条函数的一种自然推广,但由于有理样条空间的复杂性,所以有关它的研究成果不象多项式样条那样完美,许多问题还值得进一步的研究．近几十年来,有理插值样条,特别是有理三次有理插值样条,由于它们在曲线曲面设计中的应用,已有许多学者进行了深入研究,取得了一系列的成果(见[1]-[7])．但四次有理插值样条由于其构造所花费的计算量太大以及在使用上很不方便而让人们忽视了其重要的应用价值,因此很少有人研究他们．实际上,在某些情况下四次有理插值样条有其独特的应用效果,如文[8]建立的一种具有局部插值性质的分母为二次的四次有理样条,即一个剖分     

On symmetries of roots of rational functions and the classification of rational function solutions of functional equations arising from multiplication of quantum integers with prime semigroup supports

The study of quantum integers and their operations is closely related to the studies of symmetries of roots of polynomials and of fundamental questions of decompositions in Additive Number Theory. In his papers on quantum arithmetics, Melvyn Nathanson raises the question of classifying solutions of functional equations arising from the multiplication of quantum integers, starting with polynomial solutions and then generalizing to rational function solutions. The classification of polynomial solutions with fields of coefficients of characteristic zero and support base P has been completed. In a paper concerning the Grothendieck group associated to the collection of polynomial solutions, Nathanson poses a problem which asks whether the set of rational function solutions strictly contains the set of ratios of polynomial solutions. It is now known that there are infinitely many rational function solutions \(\Gamma \) with fields of coefficients of characteristic zero not constructible as ratios of polynomial solutions, even in the purely cyclotomic case, which is the case most similar to the polynomial solution case. The classification of polynomial solutions is thus not sufficient, in essential ways, to resolve the classification problem of all rational function solutions with fields of coefficients of characteristic zero. In this paper we study symmetries of roots of rational functions and the classification of the important class-the last and main obstruction to the classification problem-of rational function solutions, the purely cyclotomic, purely nonrational primitive solutions with fields of coefficients of characteristic zero and support base P, which allows us to complete the classification problem raised by Nathanson.     

两条连续的有理Bézier曲线的逼近合并

目前多项式 Bézier曲线的逼近合并问题已研究得比较深入 ,而有理 Bézier情形主要还是通过两类多项式 h和 H来降阶逼近 ,但是在工业制造中有重要意义的有理 Bézier曲线的合并问题一直缺乏研究 .本文通过控制点的优化扰动将两连续的满足权约束条件的有理 Bézier曲线转化成新的两有理Bézier曲线 ,使它们符合精确合并条件 ;并将合并得到的同阶有理 Bézier曲线看成是原两曲线的有理逼近     

Rational cubic/quartic Said-Ball conics

In CAGD, the Said-Ball representation for a polynomial curve has two advantages over the Bézier representation, since the degrees of Said-Ball basis are distributed in a step type. One advantage is that the recursive algorithm of Said-Ball curve for evaluating a polynomial curve runs twice as fast as the de Casteljau algorithm of Bézier curve. Another is that the operations of degree elevation and reduction for a polynomial curve in Said-Ball form are simpler and faster than in Bézier form. However, Said-Ball curve can not exactly represent conics which are usually used in aircraft and machine element design. To further extend the utilization of Said-Ball curve, this paper deduces the representation theory of rational cubic and quartic Said-Ball conics, according to the necessary and sufficient conditions for conic representation in rational low degree Bézier form and the transformation formula from Bernstein basis to Said-Ball basis. The results include the judging method for whether a rational quartic Said-Ball curve is a conic section and design method for presenting a given conic section in rational quartic Said-Ball form. Many experimental curves are given for confirming that our approaches are correct and effective.     

Nonlinear inversion of a band-limited Fourier transform

We consider the problem of reconstructing a compactly supported function with singularities either from values of its Fourier transform available only in a bounded interval or from a limited number of its Fourier coefficients. Our results are based on several observations and algorithms in [G. Beylkin, L. Monzón, On approximation of functions by exponential sums, Appl. Comput. Harmon. Anal. 19 (1) (2005) 17–48]. We avoid both the Gibbs phenomenon and the use of windows or filtering by constructing approximations to the available Fourier data via a short sum of decaying exponentials. Using these exponentials, we extrapolate the Fourier data to the whole real line and, on taking the inverse Fourier transform, obtain an efficient rational representation in the spatial domain. An important feature of this rational representation is that the positions of its poles indicate location of singularities of the function. We consider these representations in the absence of noise and discuss the impact of adding white noise to the Fourier data. We also compare our results with those obtained by other techniques. As an example of application, we consider our approach in the context of the kernel polynomial method for estimating density of states (eigenvalues) of Hermitian operators. We briefly consider the related problem of approximation by rational functions and provide numerical examples using our approach.     

三元重心Thiele型混合有理插值

有理插值比多项式插值有更好的近似,但有理插值一般很难控制极点的产生.基于Thiele型连分式插值与重心有理插值,构造三元重心Thiele型混合有理插值,当选取适当的权后能避免部分极点的产生.文章最后通过数值例子验证了这种方法的正确性和有效性.     

Differentiation of generalized inverses for rational and polynomial matrices

Our basic motivation is a direct method for computing the gradient of the pseudo-inverse of well-conditioned system with respect to a scalar, proposed in [13] by Layton. In the present paper we combine the Layton’s method together with the representation of the Moore-Penrose inverse of one-variable polynomial matrix from [24] and developed an algorithm for computing the gradient of the Moore-Penrose inverse for one-variable polynomial matrix. Moreover, using the representation of various types of pseudo-inverses from [26], based on the Grevile’s partitioning method, we derive more general algorithms for computing {1}, {1, 3} and {1, 4} inverses of one-variable rational and polynomial matrices. Introduced algorithms are implemented in the programming language MATHEMATICA. Illustrative examples on analytical matrices are presented.     

计算多项式函数的全局下确界和全局最小值的有效算法

通过捕获所谓的严格临界点, 本文提出了一个计算实多项式函数的全局下确界和全局最小值的有效方法. 对于实数域R 上一个n 元多项式f, 该方法可用来判定f 在Rⁿ 上是否具有有限的全局下确界. 在f 具有有限的全局下确界的情况下, f 的下确界可严格地表示为码(h; a, b), 其中h 是一个实单元多项式, a 和b 是使得a < b 的两个有理数, 而(h; a, b) 代表h(z) 在开区间]a, b[ 中仅有的实根.此外, 当f 具有有限下确界时, 本文的方法可进一步判定f 的下确界能否达到. 在我们的算法设计中,著名的吴方法起着重要作用.     

Technical Note: Reduction of rational integrals related to linear and convex quadrilateral finite elements

We reduce a rational function of bivariate nth degree polynomial numerator with a linear denominator to a simple bivariate polynomial of degree (n ? 1) and a rational function of a single variate nth degree polynomial numerator with the same bivariate linear denominator. This has very greatly contributed to the evaluation of (n + 1)(n + 2)/2 rational integrals in bivariates to mere (n + 1) rational integral of a single variate and an integration of simple polynomial in bivariates. Thus the effort of integration is reduced several times and leads to simple analytical expressions in terms of the nodal coordinates. In order to illustrate the numerical process two examples are considered. © 2002 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 18: 759–770, 2002; Published online in Wiley InterScience (www.interscience.wiley.com); DOI 10.1002/num.10026.     

Patterns of boundedness of a rational system in the plane

We investigate the boundedness character of non-negative solutions of a rational system in the plane. The system contains 10 parameters with non-negative real values and consists of 343 special cases, each with positive parameters. In 342 out of the 343 special cases, we establish easily verifiable necessary and sufficient conditions, explicitly stated in terms of 10 parameters, which determine the boundedness character of solutions of the system. In the remaining special case, we conjecture the boundedness character of solutions. It is interesting to note that this special case can be transformed to the well-known May's Host-Parasitoid model.     

关于有理插值函数存在性的研究

在本文中 ,我们利用 Newton插值多项式 ,改进了 [1 ]中的方法 ,使其能更简便 ,快速 ,严谨地判别有理插值函数的存在性 ,并在其存在时给出相应的插值有理函数的具体表达式 .