N 87 - 26015 Algorithm Development
نویسنده
چکیده
The past decade has seen considerable activity in algorithm development for the Navier-Stokes equations. This has resulted in a wide variety of useful new techniques. It would appear, however, that there is plenty of room for further improvements. That is to say, we are far from exhausting all possible sets of rules for these problems and it is highly probable that some remaining ones will be more effective than those we have now.
منابع مشابه
Fast Multiplication of Polynomials over Arbitrary Rings*
An algorithm is presented that allows to multiply two univariate polynomials of degree no more than n with coefficients from an arbitrary (possibly non-commutative) ring in O(n log(n) log(log n)) additions and subtractions and O(n log(n)) multiplications. The arithmetic depth of the algorithm is O(log(n)). This algorithm is a modification of the Schönhage-Strassen procedure to arbitrary radix f...
متن کاملUsing NSGA II Algorithm for a Three Objectives Redundancy Allocation Problem with k-out-of-n Sub-Systems
in the new production systems, finding a way to improving the product and system reliability in design is a very important. The reliability of the products and systems may improve using different methods. One of this methods is redundancy allocation problem. In this problem by adding redundant component to sub-systems under some constraints, the reliability improved. In this paper we worked on ...
متن کاملA Variant of Heapsort with Almost Optimal Number of Comparisons
An algorithm, which asymptotically halves the number of comparisons made by the common HEAPSORT, is presented and analysed in the worst case. The number of comparisons is shown to be (n+ 1)(log(n+ 1) + log log(n+ 1) + 1.82) + O(log n) in the worst case to sort n elements, without using any extra space. QUICKSORT, which usually is referred to as the fastest in-place sorting method, uses 1.38n lo...
متن کاملFinding Maximum Cliques on Circular-Arc Graphs
An algorithm is presented that, given the intersection model S of a circular-arc graph G with n vertices and m edges. finds a maximum-sized clique of GinO (n21oglogn) time. The previously best time bound for this problem is 0 (n 21ogn + mn). • 1ltis work was supported by Ihe Office of Naval Research under Conr:racr.s NOOOl4-84-K-DS02 and NOOOl4-86-K-0689. and by the National Science Foundation ...
متن کامل