谷歌浏览器插件
订阅小程序
在清言上使用

A Formal Proof of the Computation of Hermite Normal Form in a General Setting.

Artificial Intelligence and Symbolic Computation Lecture Notes in Computer Science(2018)

引用 1|浏览11
暂无评分
摘要
In this work, we present a formal proof of an algorithm to compute the Hermite normal form of a matrix based on our existing framework for the formalisation, execution, and refinement of linear algebra algorithms in Isabelle/HOL. The Hermite normal form is a well-known canonical matrix analogue of reduced echelon form of matrices over fields, but involving matrices over more general rings, such as Bézout domains. We prove the correctness of this algorithm and formalise the uniqueness of the Hermite normal form of a matrix. The succinctness and clarity of the formalisation validate the usability of the framework.
更多
查看译文
关键词
Hermite normal form,Bézout domains,Parametrised algorithms,Linear algebra,HOL
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要