Sciweavers

55 search results - page 9 / 11
» Equational properties of iterative monads
Sort
View
SIAMSC
2010
136views more  SIAMSC 2010»
13 years 2 months ago
A Krylov Method for the Delay Eigenvalue Problem
Abstract. The Arnoldi method is currently a very popular algorithm to solve large-scale eigenvalue problems. The main goal of this paper is to generalize the Arnoldi method to the ...
Elias Jarlebring, Karl Meerbergen, Wim Michiels
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 7 months ago
Phase Transitions for Greedy Sparse Approximation Algorithms
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner...
ISBI
2006
IEEE
14 years 8 months ago
Fast marching method to correct for refraction in ultrasound computed tomography
A significant obstacle in the advancement of Ultrasound Computed Tomography has been the lack of efficient and precise methods for the tracing of the bent rays that result from th...
Shengying Li, Klaus Mueller, Marcel Jackowski, Don...
ICCAD
1999
IEEE
101views Hardware» more  ICCAD 1999»
13 years 11 months ago
Efficient model reduction of interconnect via approximate system gramians
Krylov-subspace based methods for generating low-order models of complicated interconnect are extremely effective, but there is no optimality theory for the resulting models. Alte...
Jing-Rebecca Li, Jacob White
SIAMJO
2008
92views more  SIAMJO 2008»
13 years 7 months ago
An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints
For a mathematical program with complementarity constraints (MPCC), we propose an active-set Newton method, which has the property of local quadratic convergence under the MPCC lin...
Alexey F. Izmailov, Mikhail V. Solodov