Sciweavers

6 search results - page 1 / 2
» When is the numerical range of a nilpotent matrix circular
Sort
View
AMC
2010
92views more  AMC 2010»
13 years 5 months ago
When is the numerical range of a nilpotent matrix circular?
The problem formulated in the title is investigated. The case of nilpotent matrices of size at most 4 allows a unitary treatment. The numerical range of a nilpotent matrix M of siz...
Valentin Matache, Mihaela T. Matache
CCA
2000
Springer
13 years 9 months ago
A Computable Spectral Theorem
Computing the spectral decomposition of a normal matrix is among the most frequent tasks to numerical mathematics. A vast range of methods are employed to do so, but all of them su...
Martin Ziegler, Vasco Brattka
IGARSS
2009
13 years 2 months ago
A Novel STAP Algorithm using Sparse Recovery Technique
A novel STAP algorithm based on sparse recovery technique, called CS-STAP, were presented. Instead of using conventional maximum likelihood estimation of covariance matrix, our met...
Ke Sun, Hao Zhang, Gang Li, Huadong Meng, Xiqin Wa...
ARC
2012
Springer
317views Hardware» more  ARC 2012»
12 years 22 days ago
A High Throughput FPGA-Based Implementation of the Lanczos Method for the Symmetric Extremal Eigenvalue Problem
Iterative numerical algorithms with high memory bandwidth requirements but medium-size data sets (matrix size ∼ a few 100s) are highly appropriate for FPGA acceleration. This pap...
Abid Rafique, Nachiket Kapre, George A. Constantin...
COMPUTING
2006
112views more  COMPUTING 2006»
13 years 5 months ago
Fast Summation of Radial Functions on the Sphere
Radial functions are a powerful tool in many areas of multidimensional approximation, especially when dealing with scattered data. We present a fast approximate algorithm for the ...
Jens Keiner, Stefan Kunis, Daniel Potts