Sciweavers

9 search results - page 1 / 2
» Deflated Restarting for Matrix Functions
Sort
View
SIAMMAX
2011
157views more  SIAMMAX 2011»
12 years 7 months ago
Deflated Restarting for Matrix Functions
We investigate an acceleration technique for restarted Krylov subspace methods for computing the action of a function of a large sparse matrix on a vector. Its effect is to ultima...
Michael Eiermann, Oliver G. Ernst, Stefan Güt...
SIAMSC
2010
143views more  SIAMSC 2010»
13 years 3 months ago
Computing and Deflating Eigenvalues While Solving Multiple Right-Hand Side Linear Systems with an Application to Quantum Chromod
Abstract. We present a new algorithm that computes eigenvalues and eigenvectors of a Hermitian positive definite matrix while solving a linear system of equations with Conjugate G...
Andreas Stathopoulos, Konstantinos Orginos
GECCO
2010
Springer
195views Optimization» more  GECCO 2010»
13 years 2 months ago
Black-box optimization benchmarking the IPOP-CMA-ES on the noiseless testbed: comparison to the BIPOP-CMA-ES
We benchmark the Covariance Matrix Adaptation-Evolution Strategy (CMA-ES) algorithm with an Increasing POPulation size (IPOP) restart policy on the BBOB noiseless testbed. The IPO...
Raymond Ros
MCS
2008
Springer
13 years 4 months ago
Approximation of matrix operators applied to multiple vectors
In this paper we propose a numerical method for approximating the product of a matrix function with multiple vectors by Krylov subspace methods combined with a QR decomposition of...
Marlis Hochbruck, Jörg Niehoff
GECCO
2010
Springer
222views Optimization» more  GECCO 2010»
13 years 3 months ago
Black-box optimization benchmarking of NEWUOA compared to BIPOP-CMA-ES: on the BBOB noiseless testbed
In this paper, the performances of the NEW Unconstrained Optimization Algorithm (NEWUOA) on some noiseless functions are compared to those of the BI-POPulation Covariance Matrix A...
Nikolaus Hansen, Raymond Ros