𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The connection between two multiplication algorithms

✍ Scribed by O.M. Makarov


Publisher
Elsevier Science
Year
1975
Weight
324 KB
Volume
15
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A connection between Schur multiplicatio
✍ N. McCloud; R. McEachin πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 287 KB

## Abstract Given __m__ Γ— __n__ matrices __A__ = [__a~jk~__ ] and __B__ = [__b~jk~__ ], their Schur product is the __m__ Γ— __n__ matrix __A__ β—‹ __B__ = [__a~jk~b~jk~__ ]. For any matrix __T__, define β€–__Tβ€–__ ~__S__~ = max~__X__ β‰ __O__~ β€–__T__ β—‹ __X__ β€–/β€–__X__ β€– (where β€–Β·β€– denotes the usual matrix

Algorithms for the Gauss–Manin Connectio
✍ Mathias Schulze πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 402 KB

We give an introduction to the theory of the Gauss-Manin connection of an isolated hypersurface singularity and describe an algorithm to compute the V-filtration on the Brieskorn lattice. We use an implementation in the computer algebra system Singular to prove C. Hertling's conjecture about the var