Sciweavers

171 search results - page 13 / 35
» On Chebyshev Polynomials of Matrices
Sort
View
FOCS
2008
IEEE
14 years 1 months ago
Sketching and Streaming Entropy via Approximation Theory
We give near-optimal sketching and streaming algorithms for estimating Shannon entropy in the most general streaming model, with arbitrary insertions and deletions. This improves ...
Nicholas J. A. Harvey, Jelani Nelson, Krzysztof On...
GLVLSI
2002
IEEE
118views VLSI» more  GLVLSI 2002»
14 years 10 days ago
Novel interconnect modeling by using high-order compact finite difference methods
— The high-order compact finite difference (HCFD) method is adapted for interconnect modeling. Based on the compact finite difference method, the HCFD method employs the Chebys...
Qinwei Xu, Pinaki Mazumder
CPHYSICS
2007
103views more  CPHYSICS 2007»
13 years 7 months ago
Algorithms for the evolution of electronic properties in nanocrystals
We illustrate recent progress in developing algorithms for solving the Kohn-Sham problem. Key ingredients of our algorithm include pseudopotentials implemented on a real space gri...
James R. Chelikowsky, Murilo L. Tiago, Yousef Saad...
ISSAC
2005
Springer
105views Mathematics» more  ISSAC 2005»
14 years 26 days ago
Computing the rank and a small nullspace basis of a polynomial matrix
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
Arne Storjohann, Gilles Villard
GISCIENCE
2004
Springer
130views GIS» more  GISCIENCE 2004»
14 years 23 days ago
Comparing Exact and Approximate Spatial Auto-regression Model Solutions for Spatial Data Analysis
The spatial auto-regression (SAR) model is a popular spatial data analysis technique, which has been used in many applications with geo-spatial datasets. However, exact solutions f...
Baris M. Kazar, Shashi Shekhar, David J. Lilja, Ra...