Sciweavers

342 search results - page 2 / 69
» Matrix algebra and applicative programming
Sort
View
TOMS
2008
80views more  TOMS 2008»
13 years 7 months ago
Updating an LU Factorization with Pivoting
We show how to compute an LU factorization of a matrix when the factors of a leading principle submatrix are already known. The approach incorporates pivoting akin to partial pivo...
Enrique S. Quintana-Ortí, Robert A. van de ...
ICS
2007
Tsinghua U.
14 years 1 months ago
Representation-transparent matrix algorithms with scalable performance
Positive results from new object-oriented tools for scientific programming are reported. Using template classes, abstractions of matrix representations are available that subsume...
Peter Gottschling, David S. Wise, Michael D. Adams
STOC
2012
ACM
242views Algorithms» more  STOC 2012»
11 years 10 months ago
Separating multilinear branching programs and formulas
This work deals with the power of linear algebra in the context of multilinear computation. By linear algebra we mean algebraic branching programs (ABPs) which are known to be com...
Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir ...
ICS
1997
Tsinghua U.
13 years 11 months ago
Sparse Code Generation for Imperfectly Nested Loops with Dependences
Standard restructuring compiler tools are based on polyhedral algebra and cannot be used to analyze or restructure sparse matrix codes. We have recently shown that tools based on ...
Vladimir Kotlyar, Keshav Pingali
ECCV
2000
Springer
14 years 9 months ago
Estimating the Jacobian of the Singular Value Decomposition: Theory and Applications
The Singular Value Decomposition (SVD) of a matrix is a linear algebra tool that has been successfully applied to a wide variety of domains. The present paper is concerned with the...
Manolis I. A. Lourakis, Théodore Papadopoul...