Sciweavers

780 search results - page 4 / 156
» Stability of fast algorithms for structured linear systems
Sort
View
CORR
2010
Springer
61views Education» more  CORR 2010»
14 years 10 months ago
A weakly stable algorithm for general Toeplitz systems
We show that a fast algorithm for the QR factorization of a Toeplitz or Hankel matrix A is weakly stable in the sense that RT R is close to AT A. Thus, when the algorithm is used ...
Adam W. Bojanczyk, Richard P. Brent, Frank R. de H...
ASPDAC
2010
ACM
119views Hardware» more  ASPDAC 2010»
14 years 8 months ago
VISA: versatile impulse structure approximation for time-domain linear macromodeling
Abstract-- We develop a rational function macromodeling algorithm named VISA (Versatile Impulse Structure Approximation) for macromodeling of system responses with (discrete) time-...
Chi-Un Lei, Ngai Wong
TSP
2008
98views more  TSP 2008»
14 years 9 months ago
Fast and Stable YAST Algorithm for Principal and Minor Subspace Tracking
This paper presents a new implementation of the YAST algorithm for principal and minor subspace tracking. YAST was initially derived from the Subspace Projection (SP) algorithm by ...
Roland Badeau, Gaël Richard, Bertrand David
DATAMINE
1999
113views more  DATAMINE 1999»
14 years 9 months ago
A Fast Parallel Clustering Algorithm for Large Spatial Databases
The clustering algorithm DBSCAN relies on a density-based notion of clusters and is designed to discover clusters of arbitrary shape as well as to distinguish noise. In this paper,...
Xiaowei Xu, Jochen Jäger, Hans-Peter Kriegel
CDC
2008
IEEE
15 years 4 months ago
On stability in the presence of analog erasure channels
— Consider a discrete-time networked control scheme, in which the controller has direct access to noisy measurements of the plant’s output, but the controller and the actuator ...
Vijay Gupta, Nuno C. Martins