quadrature formula

quadrature formula的基本解释

-

[计] 求积公式

与quadrature formula相关的网络例句 [注：此内容来源于网络，仅供参考]

The objective of this study is aimed at the implementation of parallelized numerical quadrature routines. The algorithm we choose for numerical quadrature routines is the so called "Adaptive Romberg Tree integration scheme"(abbr."ARTint") proposed by Lin et. al.[1997]. This numerical quadrature scheme can arrange the function evaluation points adaptively in accordance with characteristic of the trend of variation in integrand function values. When the accuracy of the numerical quadrature value is requested to be increased, a newer and larger set of function evaluation points must be incurred. The main advantage of ARTint method is the inclusion of all function evaluation points used in previous stages. It is this feature of ARTint method that makes it a quadratue scheme with prominent computation efficiency.

本研究在探讨数值积分程式之平行化，所使用的演算法为林聪悟与林佳慧[1997]一书所提出的「Romberg树自动布点数值积分」架构，此一数值积分方法能以适应被积函数值变化情形方式自动安排积分点来进行数值求积计算，在提高阶数以获得更高精度积分值的过程中，此一方法只须再计算新增加积分点的函数值，搭配先前已计算过的函数值的重覆运用即可获得更精确的数值积分估计值，如此将能减少升阶过程中函数求值计算的次数，有效率地完成单重积分的数值计算。

According to a given function, namely, composite trapezoidal formula using composite Simpson formula Romberg quadrature formula and the variable step-size integration quadrature formula results, and compare the accuracy of points.

详细说明：根据给定的函数，分别用复合梯形公式、复合辛普森公式、龙贝格求积公式和变步长的求积公式计算积分结果，并且比较积分的精确度。

At the same time , we discuss the determinism and nondeterminism of formula-clock automata and the closure propertied under Boolean operation of the language which is accepted by formula-clock automata. We also prove the expressive equivalence between the deterministic formula-clock automata and the nondeterministic formula-clock automata. This means that every nondeterministic formula-clock automata can be transformed to a deterministic formula-clock automata which exactly accept the timed language identified by the fomer.We also extend timed words to infiniteness and define the formula-clock Buchi automata and the formula-clock Muller automata. At last, we show its application in formal verification and modeling of real-time system.

然后讨论了公式时钟自动机的确定性和非确定性，公式时钟自动机识别的语言类在并、交、补运算下的封闭性；并证明了确定的公式时钟自动机和非确定的公式时钟自动机表达能力的等价性，这意味这每一个非确定的公式时钟自动机都能转换为一个与之识别相同时间语言的确定的公式时钟自动机；我们将时间字扩展为无穷的，从而定义了公式时钟Buchi自动机与公式时钟Muller自动机；最后给出了用它进行实时系统的形式化验证方面及对实时系统建模的应用。

与quadrature formula相关的网络解释 [注：此内容来源于网络，仅供参考]

quadrature formula：求积公式

quadrature 求积法 | quadrature formula 求积公式 | quadrature of the circle 求圆的面积

quadrature formula：积分公式

正交试验:quadrature experiment | 积分公式:Quadrature formula | 正交调制:quadrature modulation

quadrature formula：求积公式=>求積公式

quadrature field 正交场 | quadrature formula 求积公式=>求積公式 | quadrature formula with central differences 中心差分求积公式

interpolation quadrature formula：插值求积公式

插值问题 interpolation problem | 插值求积公式 interpolation quadrature formula | 四分位数间距 interquartile range

gaussian quadrature formula：高斯求积公式

gaussian process 高斯过程 | gaussian quadrature formula 高斯求积公式 | gaussian sum 高斯和