𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast algorithms for the characteristics polynomial

✍ Scribed by Walter Keller-Gehrig

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
397 KB
Volume
36
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Fast conversion algorithms for orthogona
Fast conversion algorithms for orthogonal polynomials
✍ Alin Bostan; Bruno Salvy; Γ‰ric Schost πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 419 KB

We discuss efficient conversion algorithms for orthogonal polynomials. We describe a known conversion algorithm from an arbitrary orthogonal basis to the monomial basis, and deduce a new algorithm of the same complexity for the converse operation.

A fast segmentation algorithm for piecew
A fast segmentation algorithm for piecewise polynomial numeric function generators
✍ Jon T. Butler; C.L. Frenzen; Njuguna Macaria; Tsutomu Sasao πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 262 KB

## a b s t r a c t We give an efficient algorithm for partitioning the domain of a numeric function f into segments. The function f is realized as a polynomial in each segment, and a lookup table stores the coefficients of the polynomial. Such an algorithm is an essential part of the design of look

Parallel algorithm for the computation o
Parallel algorithm for the computation of characteristic polynomials of chemical graphs
✍ P. Venuvanalingam; P. Thangavel πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 413 KB

A parallel algorithm is developed for the f i t time based on Frame's method to compute the characteristic polynomials of chemical graphs. This algorithm can handle all types of graphs: ordinary, weighted, directed, and signed. Our algorithm takes only linear time in the CRCW PRAM model with O(n9) p