Comparison of exact and approximate time developing functions in the statistical theory of nuclear reactions05.4024.60In this paper we study the time developing function in compound nucleus reactions. This function can be evaluated exactly using recent results for the average of two S -matrix elements...
Transverse vibrations of a string moving with time-dependent velocity v (t) have been investigated. Analytical solutions of the problem are found using the... E ?Zkaya,M. PAKDEMRL - 《Journal of Sound & Vibration》 被引量: 84发表: 2000年 Exact and approximate analytical solutions for unste...
We compare these results with the moments of the stationary phase approximation, which are accurate only for large time.doi:10.1080/09500340802428280Cohen, LeonLoughlin, PatrickOkopal, GregTaylor & Francis GroupJournal of Modern OpticsL. Cohen, P. Loughlin, and G. Okopal. Exact and approximate ...
The influence of the neutron-proton pairing interaction terms on the quadrupole sum rule and on the ground-state magnetic moments of the odd nuclei with ... YV Palchikov,J Dobeš,RV Jolos - 《Physical Review C》 被引量: 8发表: 2001年 Comparison of exact and approximate time developing ...
This problem was known to have an exact polynomial time solution when δ is below a specific small constant, and hard to approximate within a factor of δ1 -- ε, when δ is polynomially large. Let D be the largest adjacent pair distance, a value potentially much smaller than Δ. Then ...
Exact and Approximate Modeling of Linear Systems: A Behavioral Approach elegantly introduces the behavioral approach to mathematical modeling, an approach that requires models to be viewed as sets of possible outcomes rather than to be a priori bound to particular representations. The authors discuss e...
for estimating the parameters of complex low integer-valued time series models where previous approximate Bayesian approaches have been used in more limited settings (we discuss such methods and limitations later in this section). To greatly increase the set ...
On the exact and approximate analysis of hierarchical discrete time queueing networks - Buchholz - 1995 () Citation Context ...sition of components and distinguish between asynchronous and synchronous composition. We present composition here for continuous time models, but it could as well be applied...
The time complexity of this algorithm is a function of the size of the largest bi-connected component of the graph, of the shortest path distance distribution in this component and of the value of the hyperbolicity. In the worst case, the time complexity remains in O(n^4), but it is ...
Summary: In this paper we gather several improvements in the field of exact and approximate exponential-time algorithms for the Bandwidth problem. For graphs with treewidth $t$ we present a $O(n ^{O(t)} 2^{n })$ exact algorithm. Moreover for the same class of graphs we introduce a ...