8 problems

The IDA algorithm is a parallel algorithm for solving flow-routing and drainage-area linear systems, while the high-to-low method solves the corresponding system on a single core.…

Balancing-algorithm conjecture. Algorithm always converges. Moreover, the number of iterations required to reach a given tolerance is $O(\log(n))$ for fixed $\epsilon$, and…

Algorithmic avoidance conjecture. Apart from the initialization, the algorithm automatically avoids approaching such degenerate situations, should they occur.

Fast self-correcting $pi$ algorithm conjecture. Algorithm runs in $O(M(n)\log n)$ bit operations.

For $n$ a positive integer, let the alternating normalization procedure be the row and column normalization algorithm in Algorithm, initialized by a random complex Gaussian tensor…

Quality-sorted locality conjecture. If the nodes and their neighboring nodes are sorted according to their quality values, then temporal locality will be improved.

Initial-quality control conjecture. The access patterns for Laplacian mesh smoothing can be controlled by the initial qualities of each node in the mesh.

Let $f$ be a polynomial system, let $\kappa(f)$ denote its condition number, and let the zero counting problem for $f$ be the problem of computing the number of its real zeros. Com…