Numerical realization of the conditions of Max Nther's residual intersection theorem

The aim of this paper is to study numerical realization of the conditions of Max Nother＇s residual intersection theorem. The numerical realization relies on obtaining the inter- section of two algebraic curves by homotopy continuation method, computing the approximate places of an algebraic curve, getting the exact orders of a polynomial at the places, and determin- ing the multiplicity and character of a point of an algebraic curve. The numerical experiments show that our method is accurate, effective and robust without using multiprecision arithmetic, even if the coefficients of algebraic curves are inexact. We also conclude that the computational complexity of the numerical realization is polynomial time.

Quadratic nonconforming finite element method for 3D Stokes equations on cuboid meshes

In this paper, the quadratic nonconforming brick element （MSLK element） intro- duced in [10] is used for the 3D Stokes equations. The instability for the mixed element pair MSLK-P1 is analyzed, where the vector-valued MSLK element approximates the velocity and the piecewise P1 element approximates the pressure. As a cure, we adopt the piecewise P1 macroelement to discretize the pressure instead of the standard piecewise P1 element on cuboid meshes. This new pair is stable and the optimal error estimate is achieved. Numerical examples verify our theoretical analysis.

The Maximum Trigonometric Degrees of Quadrature Formulae with Prescribed Nodes

The purpose of this paper is to study the maximum trigonometric degree of the quadrature formula associated with m prescribed nodes and n unknown additional nodes in the interval（-π, π]. We show that for a fixed n, the quadrature formulae with m and m ＋ 1 prescribed nodes share the same maximum degree if m is odd. We also give necessary and sufficient conditions for all the additional nodes to be real, pairwise distinct and in the interval（-π, π] for even m, which can be obtained constructively. Some numerical examples are given by choosing the prescribed nodes to be the zeros of Chebyshev polynomials of the second kind or randomly for m ≥ 3.

An Extension of Chebyshev's Maximum Principle to Several Variables

In this article, we generalize Chebyshev＇s maximum principle to several variables. Some analogous maximum formulae for the special integration functional are given. A sufficient condition of the existence of Chebyshev＇s maximum principle is also obtained.

Computing Numerical Singular Points of Plane Algebraic Curves

Given an irreducible plane algebraic curve of degree d 〉 3, we compute its numerical singular points, determine their multiplicities, and count the number of distinct tangents at each to decide whether the singular points are ordinary. The numerical procedures rely on computing numerical solutions of polynomial systems by homotopy continuation method and a reliable method that calculates multiple roots of the univariate polynomials accurately using standard machine precision. It is completely different from the traditional symbolic computation and provides singular points and their related properties of some plane algebraic curves that the symbolic software Maple cannot work out. Without using multiprecision arithmetic, extensive numerical experiments show that our numerical procedures are accurate, efficient and robust, even if the coefficients of plane algebraic curves are inexact.