Sciweavers

281 search results - page 19 / 57
» The Proof Complexity of Linear Algebra
Sort
View
ENTCS
2008
121views more  ENTCS 2008»
13 years 8 months ago
Building Certified Static Analysers by Modular Construction of Well-founded Lattices
This paper presents fixpoint calculations on lattice structures as example of highly modular programming in a dependently typed functional language. We propose a library of Coq mo...
David Pichardie
ISSAC
1995
Springer
125views Mathematics» more  ISSAC 1995»
13 years 11 months ago
Numeric-Symbolic Algorithms for Evaluating One-Dimensional Algebraic Sets
: We present e cient algorithms based on a combination of numeric and symbolic techniques for evaluating one-dimensional algebraic sets in a subset of the real domain. Given a desc...
Shankar Krishnan, Dinesh Manocha
LPAR
2007
Springer
14 years 2 months ago
Permutative Additives and Exponentials
Abstract. Permutative logic (PL) is a noncommutative variant of multiplicative linear logic (MLL) arising from recent investigations concerning the topology of linear proofs. Permu...
Gabriele Pulcini

Source Code
2846views
15 years 6 months ago
Armadillo C++ matrix library
Armadillo is a streamlined C++ linear algebra library (matrix maths) aiming towards a good balance between speed and ease of use. It is based on recursive templates. Integer, float...
Conrad Sanderson
SIAMMAX
2011
74views more  SIAMMAX 2011»
13 years 2 months ago
Goal-Oriented and Modular Stability Analysis
We introduce a methodology for obtaining inventories of error results for families of numerical dense linear algebra algorithms. The approach for deriving the analyses is goal-orie...
Paolo Bientinesi, Robert A. van de Geijn