Sciweavers

775 search results - page 60 / 155
» Cone-restricted subspace methods
Sort
View
DATE
2002
IEEE
87views Hardware» more  DATE 2002»
15 years 2 months ago
Model Reduction in the Time-Domain Using Laguerre Polynomials and Krylov Methods
We present a new passive model reduction algorithm based on the Laguerre expansion of the time response of interconnect networks. We derive expressions for the Laguerre coefficie...
Yiran Chen, Venkataramanan Balakrishnan, Cheng-Kok...
IPPS
1999
IEEE
15 years 2 months ago
A Graph Based Method for Generating the Fiedler Vector of Irregular Problems
In this paper we present new algorithms for spectral graph partitioning. Previously, the best partitioning methods were based on a combination of Combinatorial algorithms and appli...
Michael Holzrichter, Suely Oliveira
NA
2006
123views more  NA 2006»
14 years 9 months ago
Restarted block Lanczos bidiagonalization methods
Abstract. The problem of computing a few of the largest or smallest singular values and associated singular vectors of a large matrix arises in many applications. This paper descri...
James Baglama, Lothar Reichel
CDC
2009
IEEE
138views Control Systems» more  CDC 2009»
15 years 1 months ago
Semidefinite programming methods for system realization and identification
We describe semidefinite programming methods for system realization and identification. For each of these two applications, a variant of a simple subspace algorithm is presented, i...
Zhang Liu, Lieven Vandenberghe
ICMCS
2005
IEEE
120views Multimedia» more  ICMCS 2005»
15 years 3 months ago
KPYR: An Efficient Indexing Method
Motivated by the needs for efficient indexing structures adapted to real applications in video database, we present a new indexing structure named Kpyr. In Kpyr, we use a clusteri...
Thierry Urruty, Fatima Belkouch, Chabane Djeraba