For a given finite set of matrices with nonnegative integer entries we study the growth with t of We show how to determine in polynomial time whether this growth is bounded, polynomial, or exponential, and we characterize all possible behaviors.
Efficient integer algorithms for the generation of conic sections
β Scribed by A. Agathos; T. Theoharis; A. Boehm
- Book ID
- 114109824
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 552 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0097-8493
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
One of the most challenging aspects of the surface-surface intersection problem is the proper disposition of degenerate configurations. Even in the domain of quadric surfaces, this problem has proven to be quite difficult. The topology of the intersection as well as the basic geometric representatio
Computationally efficient serial and parallel algorithms for estimating the general linear model are proposed. The sequential block-recursive algorithm is an adaptation of a known Givens strategy that has as a main component the Generalized QR decomposition. The proposed algorithm is based on orthog