๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An efficient algorithm for determining non-overlapping running averages

โœ Scribed by T.E. Pierce

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
401 KB
Volume
1
Category
Article
ISSN
0266-9838

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Efficient algorithms for finding maximum
Efficient algorithms for finding maximum cliques of an overlap graph
โœ Sumio Masuda; Kazuo Nakajima; Toshinobu Kashiwabara; Toshio Fujisawa ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 728 KB

Let F = { I , , 12,. . . , Z,,} be a finite family of closed intervals on the real line. Two intervals 4 and Ik in F are said to overlap each other if they intersect but neither one of them contains the other. A graph G = (V, E) is called an overlap graph for F if there is a one-to-one correspondenc

The efficiency of different averaging pr
The efficiency of different averaging procedures in an algorithm for the Euler equations
โœ P. Glaister ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 185 KB

Three numerical schemes, all based on numerical characteristic decomposition, are compared in terms of their computational efficiency when applied to the one-dimensional Euler equations. The schemes differ through the use of alternative averaging procedures. KeywordsqNumerical scheme, Euler equation

An efficient algorithm for the determina
An efficient algorithm for the determination of certain bifurcation points
โœ James P. Abbott ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 632 KB

Many practical problems require information about a branch of solutions of a system of nonlinear equations dependent upon a scalar parameter. We discuss some techniques for following such a branch through a turning point and describe an efficient method, with second order convergence, for finding th