18 search results - page 1 / 4 » Feasible Proofs of Matrix Properties with Csanky's Algorithm |
CSL
2005
Springer
14 years 3 days ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
LICS
2002
IEEE
13 years 11 months ago
2002
IEEE
We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the subject. We...
CDC
2010
IEEE
13 years 1 months ago
2010
IEEE
In this paper we study statistical properties of the error covariance matrix of a Kalman filter, when it is subject to random measurement losses. We introduce a sequence of tighter...
CP
2006
Springer
13 years 10 months ago
2006
Springer
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
ESOP
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...