Sciweavers

171 search results - page 20 / 35
» On Chebyshev Polynomials of Matrices
Sort
View
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 7 months ago
Polynomial Filtering for Fast Convergence in Distributed Consensus
Abstract--In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods propose...
Effrosini Kokiopoulou, Pascal Frossard
ISSAC
2007
Springer
130views Mathematics» more  ISSAC 2007»
14 years 1 months ago
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
Erich Kaltofen, Zhengfeng Yang, Lihong Zhi
FPLE
1995
13 years 11 months ago
Explaining Algebraic Theory with Functional Programs
Abstract. A hierarchy of six important structures from abstract algebra (groups, rings, fields etc.) is introduced as Gofer class definitions and laws about them. Many instance d...
Jeroen Fokker
NA
2007
147views more  NA 2007»
13 years 6 months ago
An adaptive spectral least-squares scheme for the Burgers equation
A least-squares spectral collocation method for the one-dimensional inviscid Burgers equation is proposed. This model problem shows the stability and high accuracy of these scheme...
Wilhelm Heinrichs
STOC
2010
ACM
204views Algorithms» more  STOC 2010»
14 years 4 months ago
On the Hardness of the Noncommutative Determinant
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...
Vikraman Arvind and Srikanth Srinivasan