๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A VLSI multiprecision matrix multiplier and polynomial evaluator

โœ Scribed by Darrell Makarenko; Jonathan Schaeffer

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
556 KB
Volume
4
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Matching polynomials: A matrix approach
Matching polynomials: A matrix approach and its applications
โœ E.J. Farrell; S.A. Wahid ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 426 KB

A new approach is formuiatedfor the matching polynomial m(G) of a graph G. A matrix A(G) is associated with G. A certain function de$ned on A(G) yields the matching polynomial of G. This approach leads to a simple characterization of m(G). It also facilitates a technique for constructing graphs with

The bit-operation complexity of approxim
The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic
โœ V. Pan ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 330 KB

The approximate evaluation with a given precision of matrix and polynomial products is performed using modular arithmetic. The resulting algorithms are numerically stable. At the same time they are as fast as or faster than the algorithms with arithmetic operations over real or complex numbers.