Five kinds of cones are introduced, which are used to establish the constraints qualifications, under which the generalized Kuhn-Tucker necessary conditions are developed for a class of generalized (h,φ)-differentiab...Five kinds of cones are introduced, which are used to establish the constraints qualifications, under which the generalized Kuhn-Tucker necessary conditions are developed for a class of generalized (h,φ)-differentiable single-objective and multiobjective programming problems by using Motzkin's alternative theorem and Ben-Tal generalized algebraic operations.展开更多
Numerous authors studied polarities in incidence structures or algebrization of projective geometry <a href="#1">[1]</a> <a href="#2">[2]</a>. The purpose of the present wor...Numerous authors studied polarities in incidence structures or algebrization of projective geometry <a href="#1">[1]</a> <a href="#2">[2]</a>. The purpose of the present work is to establish an algebraic system based on elementary concepts of spherical geometry, extended to hyperbolic and plane geometry. The guiding principle is: “<em>The point and the straight line are one and the same</em>”. Points and straight lines are not treated as dual elements in two separate sets, but identical elements within a single set endowed with a binary operation and appropriate axioms. It consists of three sections. In Section 1 I build an algebraic system based on spherical constructions with two axioms: <em>ab</em> = <em>ba</em> and (<em>ab</em>)(<em>ac</em>) = <em>a</em>, providing finite and infinite models and proving classical theorems that are adapted to the new system. In Section Two I arrange hyperbolic points and straight lines into a model of a projective sphere, show the connection between the spherical Napier pentagram and the hyperbolic Napier pentagon, and describe new synthetic and trigonometric findings between spherical and hyperbolic geometry. In Section Three I create another model of a projective sphere in the Cartesian coordinate system of the plane, and give methods and techniques for using the model in the theory of functions.展开更多
We discuss the twistor quantization problem for the classical system (V d ,A d ), represented by the phase space V d , identified with the Sobolev space H 0 1/2 (S 1,? d ) of half-differentiable vector functions on th...We discuss the twistor quantization problem for the classical system (V d ,A d ), represented by the phase space V d , identified with the Sobolev space H 0 1/2 (S 1,? d ) of half-differentiable vector functions on the circle, and the algebra of observables A d , identified with the semi-direct product of the Heisenberg algebra of V d and the algebra Vect(S 1) of tangent vector fields on the circle.展开更多
The best quadrature formula has been found in the following sense: for a function whose norm of the second derivative is bounded by a given constant and the best quadrature formula for the approximate evaluation of in...The best quadrature formula has been found in the following sense: for a function whose norm of the second derivative is bounded by a given constant and the best quadrature formula for the approximate evaluation of integration of that function can minimize the worst possible error if the values of the function and its derivative at certain nodes are known.The best interpolation formula used to get the quadrature formula above is also found.Moreover,we compare the best quadrature formula with the open compound corrected trapezoidal formula by theoretical analysis and stochastic experiments.展开更多
Continuously differentiable radial basis functions (C<sup>∞</sup>-RBFs), while being theoretically exponentially convergent are considered impractical computationally because the coefficient matrices are ...Continuously differentiable radial basis functions (C<sup>∞</sup>-RBFs), while being theoretically exponentially convergent are considered impractical computationally because the coefficient matrices are full and can become very ill- conditioned. Similarly, the Hilbert and Vandermonde have full matrices and become ill-conditioned. The difference between a coefficient matrix generated by C<sup>∞</sup>-RBFs for partial differential or integral equations and Hilbert and Vandermonde systems is that C<sup>∞</sup>-RBFs are very sensitive to small changes in the adjustable parameters. These parameters affect the condition number and solution accuracy. The error terrain has many local and global maxima and minima. To find stable and accurate numerical solutions for full linear equation systems, this study proposes a hybrid combination of block Gaussian elimination (BGE) combined with arbitrary precision arithmetic (APA) to minimize the accumulation of rounding errors. In the future, this algorithm can execute faster using preconditioners and implemented on massively parallel computers.展开更多
基金This research is supported by the National Natural Science Foundation of China Grant 10261006, the Foundation of Education Section of Excellent Doctorial Theses Grant 200217 and the Basic Theory Foundation of Nanchang University.
文摘Five kinds of cones are introduced, which are used to establish the constraints qualifications, under which the generalized Kuhn-Tucker necessary conditions are developed for a class of generalized (h,φ)-differentiable single-objective and multiobjective programming problems by using Motzkin's alternative theorem and Ben-Tal generalized algebraic operations.
文摘Numerous authors studied polarities in incidence structures or algebrization of projective geometry <a href="#1">[1]</a> <a href="#2">[2]</a>. The purpose of the present work is to establish an algebraic system based on elementary concepts of spherical geometry, extended to hyperbolic and plane geometry. The guiding principle is: “<em>The point and the straight line are one and the same</em>”. Points and straight lines are not treated as dual elements in two separate sets, but identical elements within a single set endowed with a binary operation and appropriate axioms. It consists of three sections. In Section 1 I build an algebraic system based on spherical constructions with two axioms: <em>ab</em> = <em>ba</em> and (<em>ab</em>)(<em>ac</em>) = <em>a</em>, providing finite and infinite models and proving classical theorems that are adapted to the new system. In Section Two I arrange hyperbolic points and straight lines into a model of a projective sphere, show the connection between the spherical Napier pentagram and the hyperbolic Napier pentagon, and describe new synthetic and trigonometric findings between spherical and hyperbolic geometry. In Section Three I create another model of a projective sphere in the Cartesian coordinate system of the plane, and give methods and techniques for using the model in the theory of functions.
基金supported by the RFBR(Grant Nos.06-02-04012,08-01-00014)the program of Support of Scientific Schools(Grant No.NSH-3224.2008.1)Scientific Program of RAS"Nonlinear Dynamics"
文摘We discuss the twistor quantization problem for the classical system (V d ,A d ), represented by the phase space V d , identified with the Sobolev space H 0 1/2 (S 1,? d ) of half-differentiable vector functions on the circle, and the algebra of observables A d , identified with the semi-direct product of the Heisenberg algebra of V d and the algebra Vect(S 1) of tangent vector fields on the circle.
基金supported by the Special Funds for Major State Basic Research Projects(Grant No.G19990328)the National and Zhejiang Provincial Natural Science Foundation of China(Grant No.10471128 and Grant No.101027).
文摘The best quadrature formula has been found in the following sense: for a function whose norm of the second derivative is bounded by a given constant and the best quadrature formula for the approximate evaluation of integration of that function can minimize the worst possible error if the values of the function and its derivative at certain nodes are known.The best interpolation formula used to get the quadrature formula above is also found.Moreover,we compare the best quadrature formula with the open compound corrected trapezoidal formula by theoretical analysis and stochastic experiments.
文摘Continuously differentiable radial basis functions (C<sup>∞</sup>-RBFs), while being theoretically exponentially convergent are considered impractical computationally because the coefficient matrices are full and can become very ill- conditioned. Similarly, the Hilbert and Vandermonde have full matrices and become ill-conditioned. The difference between a coefficient matrix generated by C<sup>∞</sup>-RBFs for partial differential or integral equations and Hilbert and Vandermonde systems is that C<sup>∞</sup>-RBFs are very sensitive to small changes in the adjustable parameters. These parameters affect the condition number and solution accuracy. The error terrain has many local and global maxima and minima. To find stable and accurate numerical solutions for full linear equation systems, this study proposes a hybrid combination of block Gaussian elimination (BGE) combined with arbitrary precision arithmetic (APA) to minimize the accumulation of rounding errors. In the future, this algorithm can execute faster using preconditioners and implemented on massively parallel computers.
