2016
DOI: 10.1007/s10817-016-9379-z
|View full text |Cite
|
Sign up to set email alerts
|

A Formalisation in HOL of the Fundamental Theorem of Linear Algebra and Its Application to the Solution of the Least Squares Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 35 publications
0
2
0
Order By: Relevance
“…Despite this limitation, the HA library has been shown to be very useful for formalizing linear algebra algorithms. Indeed, based on the HA library, we successfully complete several linear algebra developments [ 2 4 , 20 ].…”
Section: Preliminariesmentioning
confidence: 99%
See 1 more Smart Citation
“…Despite this limitation, the HA library has been shown to be very useful for formalizing linear algebra algorithms. Indeed, based on the HA library, we successfully complete several linear algebra developments [ 2 4 , 20 ].…”
Section: Preliminariesmentioning
confidence: 99%
“…In our previous works using the HA library [ 2 4 , 20 ], we do not only impose finite types to model the rows and columns of matrices, but we also require more conditions (an explicit enumeration of its universe and some basic arithmetical properties) which were encoded by means of a type class named . The class is designed to facilitate the proofs and to be later instantiated by executable types.…”
Section: Preliminariesmentioning
confidence: 99%