𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Acceleration of Computation of Determinants and Characteristic Polynomials without Divisions

✍ Scribed by T. R. Seifullin

Book ID
111576001
Publisher
Springer US
Year
2003
Tongue
English
Weight
88 KB
Volume
39
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Determinants of integral ideal lattices
Determinants of integral ideal lattices and automorphisms of given characteristic polynomial
✍ Eva Bayer-Fluckiger πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 84 KB

The aim of this paper is to give a characterisation of the determinants and signatures of integral ideal lattices over a given algebraic number field. This is then used to obtain an existence criterion for automorphisms of given characteristic polynomial. In particular, we give a different proof of

Computer generation of characteristic po
Computer generation of characteristic polynomials of edge-weighted graphs, heterographs, and directed graphs
✍ K. Balasubramanian πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 624 KB

The computer code developed previously (K. Balasubramanian, J . Computational Chern., 5,387 (1984)) for the characteristic polynomials of ordinary (nonweighted) graphs is extended in this investigation to edge-weighted graphs, heterographs (vertex-weighted), graphs with loops, directed graphs, and s