搜索结果: 1-15 共查到“理学 recursive”相关记录26条 . 查询时间(0.109 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Large deviations principle for weighted means of a recursive numerical method for ergodic SDEs
遍历 SDE递归 数值方法 加权均值 大偏差原理
2023/4/24
For ergodic SDEs, their ergodic limits are usually approximated by the suitable means of numerical methods. To reveal the numerical asymptotic behavior, we study the large deviations principle (LDP) f...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：On the Derrida-Retaux recursive model
Derrida-Retaux 递归模型 递归论
2023/5/16
In order to study the depinning transition in presence of strong disorder, Derrida and Retaux (J. Stat. Phys. (2014)) introduced a discrete-time max-type recursive model. It is believed that for a lar...
SPEECH NOISE ESTIMATION USING ENHANCED MINIMA CONTROLLED RECURSIVE AVERAGING
noise power spectrum estimation noise control speech enhancement noise cancellation filter
2015/9/29
Accurate noise power spectrum estimation in a noisy speech signal is a key challenge problem in speech enhancement.One state-of-the-art approach is the minima controlledrecursive averaging (MCRA). Thi...
Recursive Sweeping Preconditioner for the 3D Helmholtz Equation
Helmholtz equation perfectly matched layers preconditioners high frequency waves
2015/7/14
This paper introduces the recursive sweeping preconditioner for the numerical solution of the Helmholtz equation in 3D. This is based on the earlier work of the sweeping preconditioner with the moving...
arrsive algorithms where random observations enter are studied in a fairly general framework. An important feature is that the observations may depend on previous “outputs” of the algorithm. The consi...
Rearrsive algorithms where random observations enter are studied in a fairly general framework. An important feature is that the observations may depend on previous “outputs” of the algorithm. The con...
FORTRAN source program calculating the Goldbach-Xu’s numbers with recursive method
Goldbach’s conjecture Goldbach-Xu’s number prime distribution of primes
2011/9/19
In this paper we have presented two source programs with FORTRAN 90 language to calculate the distribution of prime numbers in the sequence of odd numbers and the Goldbach-Xu’s numbers for every even ...
C++ source program calculating the Goldbach-Xu’s numbers with recursive method
Goldbach’s conjecture Goldbach-Xu’s number prime distribution of primes source program
2011/9/19
In this paper we have presented two source programs with C++ to calculate the distribution of prime numbers in the sequence of odd numbers and the Goldbach-Xu’s numbers for every even number respectiv...
A FORTRAN source program for calculating the Polignac-Xu’s numbers with the recursive method
Problem of Goldbach’s conjecture type Polignac-Xu’s number prime distribution of primes
2011/9/19
In the field of number theory, in addition to Goldbach’s conjecture, there is another similar problem: Is there an even number >2 which is not the difference of two primes? An American mathematics T. ...
A method for determining the mod-$2^k$ behaviour of recursive sequences, with applications to subgroup counting
Polynomial recurrences symbolic summation subgroup numbers free subgroup numbers Catalan numbers
2011/9/1
Abstract: We present a method to obtain congruences modulo powers of 2 for sequences given by recurrences of finite depth with polynomial coefficients. We apply this method to Catalan numbers, Fu\ss-C...
A recursive approach to the O(n) model on random maps via nested loops
recursive O(n) model random maps via nested loops
2011/7/25
Abstract: We consider the O(n) loop model on tetravalent maps and show how to rephrase it into a model of bipartite maps without loops. This follows from a combinatorial decomposition that consists in...
A recursive approach to the O(n) model on random maps via nested loops
recursive O(n) model random maps via nested loops
2011/7/25
Abstract: We consider the O(n) loop model on tetravalent maps and show how to rephrase it into a model of bipartite maps without loops. This follows from a combinatorial decomposition that consists in...
Factorizations and Reductions of Order in Quadratic and other Non-recursive Higher Order Difference Equations
non-recursive form symmetry factorization semi-invertible map criterion
2010/12/28
A higher order difference equation may be generally defined in an arbitrary nonempty set S as:
fn(xn, xn−1, . . . , xn−k) = gn(xn, xn−1, . . . , xn−k)where fn, gn: Sk+1→ S are...
Factorizations and Reductions of Order in Quadratic and other Non-recursive Higher Order Difference Equations
non-recursive form symmetry factorization semi-invertible map criterion
2011/3/4
A higher order difference equation may be generally defined in an arbitrary nonempty set S as:
fn(xn, xn−1, . . . , xn−k) = gn(xn, xn−1, . . . , xn−k)where fn, gn: Sk+1→ S are...
On the basic properties of a rational recursive sequence
basic properties rational recursive sequence
2010/9/20
On the basic properties of a rational recursive sequence.