Gaussian elimination: a case study in efficient genericity with MetaOCaml

DOI10.1016/j.scico.2005.10.012zbMath1100.68130OpenAlexW2124504744WikidataQ60712746 ScholiaQ60712746MaRDI QIDQ2507767

Jacques Carette

Publication date: 5 October 2006

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.scico.2005.10.012

zbMATH Keywords

linear algebragenericityMetaOCamlstaginggenerative

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

Shifting the stage ⋮ \texttt{CleGo}: A package for automated computation of Clebsch-Gordan coefficients in tensor product representations for Lie algebras \(A\)-\(G\) ⋮ Rank-profile revealing Gaussian elimination and the CUP matrix decomposition ⋮ Multi-stage programming with functors and monads: eliminating abstraction overhead from generic code ⋮ Partial evaluation of Maple ⋮ High-Level Theories

Uses Software

• ATLAS
• AXIOM
• FFTW
• Blitz++ library