What is the integration by parts?

The anti-derivative or indefinite integral of a function f(x)is a function F(x)whose derivative is f(x).Then,each differentiation rule should have a corresponding integration rule.Last time we worked with the substitution rule for integration corresponds to the chain rule in differentiation.What is     

How to use the method of the improvising differentiation？

We know the Substitution Rule, which is based on the following identity in differentiation.∫f（g（x））g＇（x）dx=∫（u）du（where u= g（x）） . Now, we＇ll talk about how to use the method of the improvising differentiation, and give some examples by using basic integration formulas, such as,∫（1/x）dx=1n｜x｜＋C called the Log Rule for integration,∫e^x dx=e^x＋C called the Exponential Rule.     

A FAST SIMPLEX ALGORITHM FOR LINEAR PROGRAMMING

Recently, computational results demonstrated remarkable superiority of a so-called ＂largest-distance＂ rule and ＂nested pricing＂ rule to other major rules commonly used in practice, such as Dantzig＇s original rule, the steepest-edge rule and Devex rule. Our computational experiments show that the simplex algorithm using a combination of these rules turned out to be even more efficient.     

模糊逻辑系统中的演绎定理和HS规则

Cancelled the first axiom L1) or the third axiom L3) of the classical formal logic system we established two kinds of quasi-formal deductive system, LG-Rand LG, respectively. In LG-R we proved that neither the deduction theorem nor the hypothetical syllogism (HS) rule held but a deduction theorem and an HS rule are obtained in a weak sense. We also proved that both the deduction theorem and the hypothetical syllogism(HS) rule hold in LG.     

Empirical Bayes Test for the Parameter of Rayleigh Distribution with Error of Measurement

For the data with error of measurement in historical samples, the empirical Bayes test rule for the parameter of Rayleigh distribution is constructed, and the asymptotically optimal property is obtained. It is shown that the convergence rate of the proposed EB test rule can be arbitrarily close to O（n-1/2） under suitable conditions.     

Hamiltonians with two degrees of freedom admitting a singlevalued general solution

Following the basic principles stated by Painleve, we first revisit the process of selecting the admissible time-independent Hamiltonians H=(p12 + p22)/2 + V(q1,q2) whose some integer power qjnj (t) of the general solution is a singlevalued function of the complex time t. In addition to the well known rational potentials V of Henon-Heiles, this selects possible cases with a trigonometric dependence of V on qj. Then, by establishing the relevant confluences, we restrict the question of the explicit integration of the seven (three "cubic" plus four "quartic") rational Henon-Heiles cases to the quartic cases. Finally, we perform the explicit integration of the quartic cases, thus proving that the seven rational cases have a meromorphic general solution explicitly given by a genus two hyperelliptic function.     

Confident estimation for density of a biological population based on line transect sampling

Line transect sampling is a very useful method in survey of wildlife population. Confident interval estimation for density D of a biological population is proposed based on a sequential design. The survey area is occupied by the population whose size is unknown. A stopping rule is proposed by a kernel-based estimator of density function of the perpendicular data at a distance. With this stopping rule, we construct several confidence intervals for D by difference procedures. Some bias reduction techniques are used to modify the confidence intervals. These intervals provide the desired coverage probability as the bandwidth in the stopping rule approaches zero. A simulation study is also given to illustrate the performance of this proposed sequential kernel procedure.     

数值积分的可选择误差界(英文)

Similar to having done for the mid-point and trapezoid quadrature rules,we obtain alternative estimations of error bounds for the Simpson＇s quadrature rule involving n-time（1 ≤ n ≤ 4） differentiable mappings and then to the estimations of error bounds for the adaptive Simpson＇s quadrature rule.     

A GENERALIZATION OF SIMPSON''''S RULE

Let TA(f)=integral form n= to 1/2(P_~n(x) + P_b~n(x))dx and let TM(f)=integral form n= to P_((+b)/2)~(n+1)(x)dx, where P_c~n denotes theTaylor polynomial to f at c of order n, where n is even. TA and TM are reach generalizations of theTrapezoidal rule and the midpoint rule, respectively. and are each exact for all polynomial of degree ≤n+1.We let L(f) = αTM(f) + (1-α)TA(f), where α =(2~(n+1)(n+1))/(2~(n+1)(n+1)+1), to obtain a numerical integrationrule L which is exact for all polynomials of degree≤n+3 (see Theorem l). The case n = 0 is just the classicolSimpson's rule. We analyze in some detail the case n=2, where our formulae appear to be new. By replacingP_(+b)/2)~(n+1)(x) by the Hermite cabic interpolant at a and b. we obtain some known formulae by a different ap-proach (see [1] and [2]). Finally we discuss some nonlinear numerical integration rules obtained by takingpiecewise polynomials of odd degree, each piece being the Taylor polynomial off at a and b. respectively. Ofcourse all of our formulae can be compounded over subintervals of [a, b].     

What does Part 2 of the Fundamental Theorem of Calculus mean?

We defined the indefinite integral as an anti-derivative,and defined the definite integral as the limit of Riemann sums.Both of them are very different and seem to be little in common.Part 1of the Fundamental Theorem of Calculus shows how indefinite integration and definite integration are related.In the other words,it shows how anti-derivative and the area are related.Today,we’ll learn Part 2 of the Fundamental Theorem of Calculus.     

INTERPOLATORY QUADRATURE RULE FOR EVALUATION OF CERTAIN SINGULAR INTEGRALS

In this paper, we introduce a quadrature rule for the numerical evaluation of certain hyper singular integrals. The rule is obtained by using Hermite interpolation polynomial. Error bound is also made.     

146号初等元胞自动机的演化语言的复杂性

Symbolic dynamics of cellular automata is introduced by coarse-graining the temporal evolution orbits. Evolution languages are defined. By using the theory of formal languages and automata, the complexity of evolution languages of the elementary cellular automaton of rule 146 is studied and it is proved that its width 1-evolution language is regular, but for every n ≥ 2 its width n-evolution language is not context-free but context-sensitive. Also, the same results hold for the equivalent （under conjugation） elementary cellular automaton of rule 182.     

非线性抛物型方程有限元法数值积分的有效性

Abstract. The effect of numerical integration in finite element methods applied to a class of nonlinear parabolic equations is considered and some sufficient conditions on the quadrature scheme to ensure that the order of convergence is unaltered in the presence of numerical integration are given. Optimal Lz and H1 estimates for the error and its time derivative are established.     

GLOBAL FINITE ELEMENT NONLINEAR GALERKIN METHOD FOR THE PENALIZED NAVIER-STOKES EQUATIONS GLOBAL FINITE ELEMENT NONLINEAR GALERKIN METHOD FOR THE PENALIZED NAVIER-STOKES EQUATIONS

1. IntroductionIn the numerical simulation of the Navier-Stokes equations one encounters three seriousdifficulties in the case of large Reynolds numbers f the treatment of the incomPressibility con-dition divu = 0, the treatment of the noIilinear terms and the large time integration. For thetreatment of the incoInPressibility condition, one use the penalty method in the case of finiteelemellts [1--2l and for the treatmen of the noulinar terms and the large tfor integration, oneuse the nonlin…     

SYMPLECTIC COMPUTATION OF HAMILTONIAN SYSTEMS (I)

AbstractWe get τ6-terms of the formal energy of the mid-point rule, and use the mathematical pendulum to test the convergence of the formal energy.     

NONDESCENT SUBGRADIENT METHOD FOR NONSMOOTH CONSTRAINED MINIMIZATION

A kind of nondecreasing subgradient algorithm with appropriate stopping rule has been proposed for nonsmooth constrained minimization problem. The dual theory is invoked in dealing with the stopping rule and general global minimiizing algorithm is employed as a subroutine of the algorithm. The method is expected to tackle a large class of nonsmooth constrained minimization problem.     

THE OPTIMAL STOPPING PROBLEM OF A CONTINUOUS PARAMETER PROCESS

Suppose X = (Xr, Fr, t ∈ R+) be an optional reward process with ( Fr) satisfying usual conditions. In this paper, we correct the proof of existence about Snell envelope in [4] and the proof of an important lemma (Lemma 4. 6) in [5], and give a proof of existence about Snell envelope under certain conditions, i. e. EZx- < ∞ and Z is upper-semi-continuous on the right (USCR) or there is a stopping rule (SR)τ ≤σ such that EZx-∞ for any stopping rule σ . At the same time, we prove a four-repeated limit theorem when Z is continuous on the right. The character and the uniqueness of the optimal stopping time (OST) or optimal stopping rule (OSR) are discussed.     

On Support τ-tilting Modules over Endomorphism Algebras of Rigid Ob jects

We consider a Krull–Schmidt, Hom-finite, 2-Calabi–Yau triangulated category with a basic rigid object T, and show a bijection between the set of isomorphism classes of basic rigid objects in the finite presented category pr T of T and the set of isomorphism classes of basic τ-rigid pairs in the module category of the endomorphism algebra End C(T)op. As a consequence, basic maximal objects in pr T are one-to-one correspondence to basic support τ-tilting modules over End C(T)op. This is a generalization of correspondences established by Adachi–Iyama–Reiten.     

I.I.D. STATISTICAL CONTRACTION OPERATORS AND STATISTICALLY SELF－SIMILAR SETS

I.i.d. random sequence is the simplest but very basic one in stochastic processes, and statistically self-similar set is the simplest but very basic one in random recursive sets in the theory of random fractal. Is there any relation between i.i.d. random sequence and statistically self-similar set? This paper gives a basic theorem which tells us that the random recursive set generated by a collection of i.i.d. statistical contraction operators is always a statistically self-similar set.     

线性规划的对偶基线算法

In this paper,we studied the dual form of the basic line algorthm for linear programs.It can be easily implemented in tableau that similar to the primal/dual simplex method.Different from primal simplex method or dual simplex method,the dual basic line algorithm can keep primal feasibility and dual feasibility at the same time in a tableau,which makes it more efficient than the former ones.Principles and convergence of dual basic line algorthm were discussed.Some examplex and computational experience were given to illustrate the efficiency of our method.