九、直线与圆

知识要点］基本公式：两点间距离公式．线段的定比分点公式．两点间斜率公式．直线方程：点斜式、斜截式、两点式、截距式、一般式．两直线位置关系：两条直线平行与垂直的条件．两条直线所成的角．两条直线的交点，点到直线的距离．圆的方程：标准方程和一般方程，直线与...     

怎样掌握异面直线上两点间的距离公式

异面直线上两点间的距离公式是立体几何中的重要公式之一，它有广泛的应用．我门要学会名，学好它．怎样掌握这一公式？这里提出几点意见，仅供参考．1深入理解这是一个比较复杂的公式，字母较多，结构复杂，而且含有正负符号．因而，我们必须清楚每个字田的意义，并且把握往在什么条件下，使用正号，在什么条件下，使用负号．同时，应当熟练地证出这个2式．要把握这个公式的特征．这个公式与余弦定理极为相似，因为它在证明中使用了日股定理和宗弦定理．2＋6准记李Rfi记老，才能巨用；Rfi记牢，了会持久．然而，从现实情况蕾，大多数学生…     

一阶非齐次拟线性双曲组的柯西问题整体经典解的存在性

本文考察了弱线性退化的一阶非齐次拟线性严格双曲组具有小初值的柯西问题．在非齐次项满足匹配条件的假设下,给出了精细的波的分解公式,利用这些公式,证明了整体C1解的存在唯一性和稳定性．     

求解非线性算子方程的梯形牛顿法

在Banach空间中研究非线性算子方程F（x）=0的近似求解问题．首先,把实函数数值积分的梯形公式推广到非线性泛函的Bochner积分中来,得到Bochner积分的梯形公式;然后,利用这一公式来构造牛顿迭代法的变形格式,从而得到梯形牛顿法,并在弱条件的α-判据下借助于优函数技巧证明了它的收敛性．     

三角求值(角)应注意隐蔽条件的挖掘

三角求值（角）应注意隐蔽条件的挖掘颛孙长宗（安徽省肖县中学２３５２００）已知某些条件求三角函数的值或对应的角是三角习题的重要类型．这类习题难度不大，对于熟练掌握三角公式，灵活运用三角公式以及提高学生运算能力是比较理想的一类习题．然而，我们在教学中发现...     

分数阶扩散方程半无界混合问题的解

研究了一维半无界分数阶扩散方程具有第三类非齐次边条件的混合问题．分别给出具有第三类齐次边条件的混合问题基本解以及具有零初始条件的混合问题基本解．最后得到分数阶扩散方程半无界混合问题的求解公式．     

三角恒等变换

1．本单元知识点 本单元主要包括利用已有的十一个公式进行简单的恒等变换,以及三角恒等变换在数学中的应用．本单元内容都是用例题来展现的,通过例题的解答,引导学生对变换对象和变换目标进行对比、分析,促使学生形成对解题过程中女盯何选择公式,如何根据问题的条件进行公式变形,以及变换过程中体现的换元思想、逆向使用公式等数学思想方法的认识,从而加深理解变换思想,     

特殊类型二阶变系数非齐次线性微分方程通解公式

本给出了二阶变系数非齐次线性微分方程的系数满足某些特殊条件时的通解公式．     

1996年高考数学试题说明（续）

１９９６年高考数学试题说明（续）晨旭理科第（２１）题，文科第（２２）题．１．编题目的希望试题考查三角有关基本公式的运用，即利用基本公式作恒等变形或计算．难度属中等，面貌常规．２．编题思路从三个特定角ａ．β，ｙ及它们的三角函数值出发，构造出三个条件．试...     

高等代数中有关问题的降价算法

1 行列式值的计算求行列式值常用的计算方法[1]多种多样,但对高阶行列式计算很少有通用的公式．在计算机普及的条件下,公式法显得尤为重要,下面给出一种简单易行的公式法--降阶算法,它充分利用了二阶行列式计算简单、可以心算的特点,逐次降阶而又不增子行列式计算的个数,减少了计算量又易于上机,从而提高了计算速度．     

A finiteness theorem for Markov bases of hierarchical models

We show that the complexity of the Markov bases of multidimensional tables stabilizes eventually if a single table dimension is allowed to vary. In particular, if this table dimension is greater than a computable bound, the Markov bases consist of elements from Markov bases of smaller tables. We give an explicit formula for this bound in terms of Graver bases. We also compute these Markov and Graver complexities for all K×2×2×2 tables.     

The Principal Eigenvalue for Jump Processes

A variational formula for the lower bound of the principal eigenvalue of general Markov jump processes is presented. The result is complete in the sense that the condition is fulfilled and the resulting bound is sharp for Markov chains under some mild assumptions. Received November 15, 1999, Accepted March 9, 2000     

Continuity of the Value of Competitive Markov Decision Processes

We provide a bound for the variation of the function that assigns to every competitive Markov decision process and every discount factor its discounted value. This bound implies that the undiscounted value of a competitive Markov decision process is continuous in the relative interior of the space of transition rules.     

Spectral gap for open Jackson networks

We generalize the decomposition method of the finite Markov chains for Poincaré inequality in Jerrum et al. (Ann. Appl. Probab., 14, 1741-1765 (2004)) to the reversible continuous-time Markov chains. And inductively, we give the lower bound of spectral gap for the ergodic open Jackson network by the decomposition method and the symmetrization procedure. The upper bound of the spectral gap is also presented.     

Ultracontractivity for Brownian motion with Markov switching

Consider the transition density functions for Brownian motion with two-state Markov switching. The characteristic functions for transition density functions are presented. Then, we show that the semigroup-associated Brownian motion with Markov switching is ultracontractive. And an explicit time-dependent upper bound for heat kernels are presented. Moreover, we prove that the Dirichlet form associated Brownian motion with Markov switching satisfies the Nash inequality.     

Relaxation of Product Markov Chains on Product Spaces

We study the relaxation time of product-type Markov chains approaching a product distribution. We bound the approach to stationarity for such Markov chains in terms of the mixing times of the component Markov chains. In cases where the component mixing times differ considerably we propose an optimized visiting scheme which makes such product-type Markov chains comparable to Gibbs-type samplers. We conclude the paper by discussing the relaxation of Metropolis-type samplers for separable energy functions.     

Truncated taylor series approximation to the state transition matrix of a continuous parameter finite Markov chain

A readily computable bound is established for the error in approximating the transition matrix for a continuous parameter Markov chain.     

Exponential Convergence Rates of Markov Chains under a Weaken Minorization Condition

In this paper, we obtain the quantitative bound of the exponential convergence rates of Markov chains under a weaken minorization condition, using the coupling method and the analytic approach. And also, we obtain the convergence rates for continuous time Markov processes.     

Upper bound for the non-maximal eigenvalues of irreducible nonnegative matrices

We present a lower and an upper bound for the second smallest eigenvalue of Laplacian matrices in terms of the averaged minimal cut of weighted graphs. This is used to obtain an upper bound for the real parts of the non-maximal eigenvalues of irreducible nonnegative matrices. The result can be applied to Markov chains.