探求函数解析式的几种策略

策略一 变式． 例1 已知f（x^2＋1）=x^4-x^2＋1,求f（x）．     

巧用导数的定义式求极限

给出了导数的定义式应用的几个例子,指出了在求一类极限时,如果能巧妙的应用导数的定义式,则可减小计算量     

数学与对联

1 某校一对数学和语文教师的婚联 三角式方程式函数式式式推算新人极为般配； 议论文记叙文说明文文文歌颂鸳鸯美满姻缘．     

波动方程的一类显式辛格式

1．引言和预备知识本文主要考虑如下波动方程初边值问题的数值方法．一般的哈密顿系统可写成那么，系统（1．幻称为可分的哈密顿系统．众所周知，方程（1．la）在引进新变量。t＝v后，它变成一类可分的线性哈密顿系统：它的哈密顿函数为H一三矿（V“＋。乏）咖，并且在离散＊。＝。。。后，（1．4）是一个方程组，u，V是向量．人们早就知道，初边值问题（1．1）在应用隐式中点公式（辛格式）进行数值解时，能保持真解许多重要性质，并且格式是无条件稳定的，但美中不足的是，在每积分步，它要求解一个线性方程组，当考虑大的离散系统时，…     

推拉并行模式的生产优化研究

本文提出一种推拉并行的生产模式 ,并分析了其优点 .该模式规定设备在完成普通订单的空闲时间补充库存但不许超过库房容量 ;如果加急订单到达时的库存量大于 0 ,则直接交货 ,并收取附加费用 ,否则与普通订单一道排队 .文章一方面给出了各种参数下加急订单的利润平衡点 ,另一方面展示出随着库存容量的增加 ,普通订单的交货时间接近于加急订单不存在时的数值 .     

“做中学”指导下“直线的一般式方程”的探索与思考

数学概念引入要坚决摒弃“一个定义、三项注意、疯狂练习”的做法,不能简单地从抽象定义出发,应从具体事例出发,概念引入提倡归纳式,问题驱动建议活动式,设计的问题一要面向全体,二要有明确的目标,三要由浅入深,四要难度适当.以活动驱动探究、以问题引领教学的“做中学”,先做后学,先学后教,少教多学,以学定教,以学论教,可以让学生学会学习,提升学生的数学核心素养.     

二类广义Vandermonde行列式的计算

给出了二类广义Vandermonde行列式计算的显式表示式.     

求二次函数解析式“三注意”

<正>二次函数解析式是函数一章的重点内容,求二次函数的解析式不仅用到二次函数的有关知识,而且还用到一些数学方法例如配方法、待定系数法,必须认真学好,并注意以下三个问题:一、注意掌握解析式的三种基本形式1.一般式:y=ax2+bx+c(a≠0),即二次函数的定义式.2.顶点式:y=a(x+m)2+n(a≠0),其中(-m,n)是抛物线的顶点,x=-m是对称轴.这种形式是由一般式经过配方得来,所以这种形式也叫配方式.3.双根式:y=a(x-x1)(x-x2)(a≠0),x1、x2是抛物线与x轴交点的横坐标或方程     

对流占优扩散方程的一种特征差分算法

A new kind of characteristic-difference scheme for convection-diffusion equations is constructed by characteristic method and bilinear interpolation method. The convergence of the scheme is proved. The advantages of this scheme are to obtain the solutions of the convection diffusion equations with variable coefficient expediently and to reduce the numerical oscillations of the convectiondominanted diffusion equations effectively.     

A combined finite volume–finite element scheme for the discretization of strongly nonlinear convection–diffusion–reaction problems on nonmatching grids

We propose and analyze in this paper a numerical scheme for nonlinear degenerate parabolic convection–diffusion–reaction equations in two or three space dimensions. We discretize the time evolution, convection, reaction, and source terms on a given grid, which can be nonmatching and can contain nonconvex elements, by means of the cell‐centered finite volume method. To discretize the diffusion term, we construct a conforming simplicial mesh with the vertices given by the original grid and use the conforming piecewise linear finite element method. In this way, the scheme is fully consistent and the discrete solution is naturally continuous across the interfaces between the subdomains with nonmatching grids, without introducing any supplementary equations and unknowns or using any interpolation at the interfaces. We allow for general inhomogeneous and anisotropic diffusion–dispersion tensors, propose two variants corresponding respectively to arithmetic and harmonic averaging, and use the local Péclet upstream weighting in order to only add the minimal numerical diffusion necessary to avoid spurious oscillations in the convection‐dominated case. The scheme is robust, efficient since it leads to positive definite matrices and one unknown per element, locally conservative, and satisfies the discrete maximum principle under the conditions on the simplicial mesh and the diffusion tensor usual in the finite element method. We prove its convergence using a priori estimates and the Kolmogorov relative compactness theorem and illustrate its behavior on a numerical experiment. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2010     

Simulation of planar ionization wave front propagation on an unstructured adaptive grid

The paper deals with the numerical solution of a basic 2D model of the propagation of an ionization wave. The system of equations describing this propagation consists of a coupled set of reaction–diffusion-convection equations and a Poissons equation. The transport equations are solved by a finite volume method on an unstructured triangular adaptive grid. The upwind scheme and the diamond scheme are used for the discretization of the convection and diffusion fluxes, respectively. The Poisson equation is also discretized by the diamond scheme. Numerical results are presented. We deal in more detail with numerical tests of the grid adaptation technique and its influence on the numerical results. An original behavior is observed. The grid refinement is not sufficient to obtain accurate results for this particular phenomenon. Using a second order scheme for convection is necessary.     

On numerical methods and error estimates for degenerate fractional convection–diffusion equations

First we introduce and analyze a convergent numerical method for a large class of nonlinear nonlocal possibly degenerate convection diffusion equations. Secondly we develop a new Kuznetsov type theory and obtain general and possibly optimal error estimates for our numerical methods—even when the principal derivatives have any fractional order between 1 and 2! The class of equations we consider includes equations with nonlinear and possibly degenerate fractional or general Levy diffusion. Special cases are conservation laws, fractional conservation laws, certain fractional porous medium equations, and new strongly degenerate equations.     

DISCONTINUOUS GALERKIN METHODS AND THEIR ADAPTIVITY FOR THE TEMPERED FRACTIONAL (CONVECTION) DIFFUSION EQUATIONS

This paper focuses on the adaptive discontinuous Galerkin (DG) methods for the tempered fractional (convection) diffusion equations. The DG schemes with interior penalty for the diffusion term and numerical flux for the convection term are used to solve the equations, and the detailed stability and convergence analyses are provided. Based on the derived posteriori error estimates, the local error indicator is designed. The theoretical results and the effectiveness of the adaptive DG methods are, respectively, verified and displayed by the extensive numerical experiments. The strategy of designing adaptive schemes presented in this paper works for the general PDEs with fractional operators.     

On optimization of the RBF shape parameter in a grid-free local scheme for convection dominated problems over non-uniform centers

Global optimization techniques exist in the literature for finding the optimal shape parameter of the infinitely smooth radial basis functions (RBF) if they are used to solve partial differential equations. However these global collocation methods, applied directly, suffer from severe ill-conditioning when the number of centers is large. To circumvent this, we have used a local optimization algorithm, in the optimization of the RBF shape parameter which is then used to develop a grid-free local (LRBF) scheme for solving convection–diffusion equations. The developed algorithm is based on the re-construction of the forcing term of the governing partial differential equation over the centers in a local support domain. The variable (optimal) shape parameter in this process is obtained by minimizing the local Cost function at each center (node) of the computational domain. It has been observed that for convection dominated problems, the local optimization scheme over uniform centers has produced oscillatory solutions, therefore, in this work the local optimization algorithm has been experimented over Chebyshev and non-uniform distribution of the centers. The numerical experiments presented in this work have shown that the LRBF scheme with the local optimization produced accurate and stable solutions over the non-uniform points even for convection dominant convection–diffusion equations.     

Nonstandard finite difference schemes for a class of generalized convection–diffusion–reaction equations

In this work, a class of nonstandard finite difference (NSFD) schemes are proposed to approximate the solutions of a class of generalized convection–diffusion–reaction equations. First, in the case of no diffusion, two exact finite difference schemes are presented using the method of characteristics. Based on these two exact schemes, a class of exact schemes are presented by introducing a parameter α. Second, since the forms of these exact schemes are so complicated that they are not convenient to use, a class of NSFD schemes are derived from the exact schemes using numerical approximations. It follows that, under certain conditions about denominator function of time‐step sizes, these NSFD schemes are elementary stable and the solutions are positive and bounded. Third, by means of the Mickens' technique of subequations, a new class of implicit NSFD schemes are constructed for the full convection–diffusion–reaction equations. It is shown that, under certain parameters set, these NSFD schemes are capable of preserving the non‐negativity and boundedness of the analytical solutions. Finally, some numerical simulations are provided to verify the validity of our analytical results. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 1288–1309, 2015     

A numerical scheme for solving nonhomogeneous time-dependent problems

A numerical technique for solving time-dependent problems with variable coefficient governed by the heat, convection diffusion, wave, beam and telegraph equations is presented. The Sinc–Galerkin method is applied to construct the numerical solution. The method is tested on three problems and comparisons are made with the exact solutions. The numerical results demonstrate the reliability and efficiency of using the Sinc–Galerkin method to solve such problems.     

UPWIND SPLITTING SCHEME FOR CONVECTION-DIFFUSION EQUATIONS

1　ＩｎｔｒｏｄｕｃｔｉｏｎＣｏｎｖｅｃｔｉｏｎ ｄｉｆｆｕｓｉｏｎｅｑｕａｔｉｏｎｉｓａｆｕｎｄａｍｅｎｔａｌｅｑｕａｔｉｏｎｄｅｓｃｒｉｂｉｎｇｔｈｅｐｒｏｃｅｓｓｏｆｆｌｕｉｄｔｒａｎｓ ｆｅｒ,ｆｏｒｅｘａｍｐｌｅ ,ｕｎｄｅｒｇｒｏｕｎｄｗａｔｅｒｃｏｎｔａｍｉｎａｔｉｏｎ ,ｄｉｓｐｌａｃｅｍｅｎｔｉｎｐｏｒｏｕｓｍｅｄｉａ[1,2 ] ,ａｎｄｓｏｏｎ .Ｆｏｒｏｖｅｒｃｏｍｉｎｇｔｈｅｎｕｍｅｒｉｃａｌｉｎｓｔａｂｉｌｉｔｙｏｆｆｉｎｉｔｅｄｉｆｆｅｒｅｎｃｅｍｅｔｈｏｄｏｒｆｉｎｉｔｅｅｌｅｍｅ…     

A note on flux limiting for diffusion discretizations

In this note, a limiting technique is presented to enforcemonotonicity for higher-order spatial diffusion discretizations.The aim is to avoid spurious oscillations and to improve thequalitative behaviour on coarse grids. The technique is relatedto known ones for convection equations, using limiters to boundthe numerical fluxes. Applications arise in pattern formationproblems for reaction–diffusion equations.