Sciweavers

107 search results - page 5 / 22
» Polynomially Bounded Matrix Interpretations
Sort
View
SIAMMAX
2011
180views more  SIAMMAX 2011»
13 years 2 months ago
Computing Characteristic Polynomials from Eigenvalues
Abstract. This paper concerns the computation of the coefficients ck of the characteristic polynomial of a real or complex matrix A. We analyze the forward error in the coefficient...
Rizwana Rehman, Ilse C. F. Ipsen
COCO
2011
Springer
221views Algorithms» more  COCO 2011»
12 years 7 months ago
Non-uniform ACC Circuit Lower Bounds
The class ACC consists of circuit families with constant depth over unbounded fan-in AND, OR, NOT, and MODm gates, where m > 1 is an arbitrary constant. We prove: • NTIME[2n ...
Ryan Williams
SIAMSC
2011
177views more  SIAMSC 2011»
13 years 2 months ago
Computing f(A)b via Least Squares Polynomial Approximations
Given a certain function f, various methods have been proposed in the past for addressing the important problem of computing the matrix-vector product f(A)b without explicitly comp...
Jie Chen, Mihai Anitescu, Yousef Saad
SAS
2005
Springer
132views Formal Methods» more  SAS 2005»
14 years 24 days ago
Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra
A technique for generating invariant polynomial inequalities of bounded degree is presented using the abstract interpretation framework. It is based on overapproximating basic semi...
Roberto Bagnara, Enric Rodríguez-Carbonell,...
DASFAA
2010
IEEE
166views Database» more  DASFAA 2010»
14 years 2 months ago
The Objects Interaction Matrix for Modeling Cardinal Directions in Spatial Databases
Abstract. Besides topological relations and approximate relations, cardinal directions have turned out to be an important class of qualitative spatial relations. In spatial databas...
Tao Chen, Markus Schneider, Ganesh Viswanathan, We...