Compress-and-restart block Krylov subspace methods for Sylvester matrix equations
Publications associées (84)
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
An incompressible variational ideal ballooning mode equation is discretized with the COOL finite element discretization scheme using basis functions composed of variable order Legendre polynomials. This reduces the second order ordinary differential equati ...
The sensitivity of a multiple eigenvalue of a matrix under perturbations can be measured by its Hölder condition number. Various extensions of this concept are considered. A meaningful notion of structured Hölder condition numbers is introduced, and it is ...
Society for Industrial and Applied Mathematics2009
This paper considers the solution of large-scale Lyapunov matrix equations of the form AX + XA(T) = -bb(T). The Arnoldi method is a simple but sometimes ineffective approach to deal with such equations. One of its major drawbacks is excessive memory consum ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008
In this work, we propose a Robin-Robin preconditioner combined with Krylov iterations for the solution of the interface system arising in fluid-structure interaction (FSI) problems. It can be seen as a partitioned FSI procedure and in this respect it gener ...
Aggressive early deflation has proven to significantly enhance the convergence of the QR algorithm for computing the eigenvalues of a nonsymmetric matrix. One purpose of this paper is to point out that this deflation strategy is equivalent to extracting co ...
Society for Industrial and Applied Mathematics2008
This article treats the problem of learning a dictionary providing sparse representations for a given signal class, via ℓ1 minimisation. The problem is to identify a dictionary \dico from a set of training samples \Y knowing that \Y=\dico\X ...
In this article we address the numerical simulation of fluid-structure interaction (FSI) problems featuring large added-mass effect. We analyze different preconditioners for the coupled system matrix obtained after space- time discretization and linearizat ...
In the spirit of the Hamiltonian QR algorithm and other bidirectional chasing algorithms, a structure-preserving variant of the implicit QR algorithm for palindromic eigenvalue problems is proposed. This new palindromic QR algorithm is strongly backward st ...
Fixed-order controller design for LTI-SISO polytopic systems is investigated using rank deficiency constraint on the controller Sylvester resultant matrix. It is shown that the non-convexity of fixed-order controller design problem can be gathered in a ran ...
This article treats the problem of learning a dictionary providing sparse representations for a given signal class, via ell1 minimisation, or more precisely the problem of identifying a dictionary dico from a set of training samples Y knowing that $ ...