DIVIDE-AND-CONQUER METHODS FOR FUNCTIONS OF MATRICES WITH BANDED OR HIERARCHICAL LOW-RANK STRUCTURE\ast
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.
The giant unicellular macroalgae exhibit an extraordinary wound repair mechanism. The rapid assimilation of cellular contents into an insoluble wound plug prevents detrimental cytoplasmic loss and limits the intrusion of extracellular components which coul ...
Structured singular values and pseudospectra play an important role in assessing the properties of a linear system under structured perturbations. This paper discusses computational aspects of structured pseudospectra for structures that admit an eigenvalu ...
We compare several languages for specifying Markovian population models such as queuing networks and chemical reaction networks. These languages -matrix descriptions, stochastic Petri nets, stoichiometric equations, stochastic process algebras, and guarded ...
Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009
Let T be a triangulated surface given by the list of vertex-triples of its triangles, called rooms. A room-partitioning of T is a subset R of the rooms such that each vertex of T is in exactly one room in R. We prove that if T has a room-partitioning R, th ...
We revisit the asymptotic formulas originally derived in [D.J. Cedio-Fengya, S. Moskow, M.S. Vogelius, Identification of conductivity imperfections of small diameter by boundary measurements. Continuous dependence and computational reconstruction, Inverse ...
In this paper we present a reconfigurable device which significantly improves the execution time of the most computational intensive functions of three of the most widely used face recognition algorithms; those tasks multiply very large dense matrices. The ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009
We propose a universal and efficient compressive sampling strategy based on the use of a spread spectrum technique. The method essentially consists in a random pre-modulation of the signal of interest followed by projections onto randomly selected vectors ...
Polarization codes were recently introduced by Ar\i kan. They are explicit code constructions which achieve the capacity of arbitrary symmetric binary-input discrete memoryless channels (and even extensions thereof) under a low complexity successive decodi ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009
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 ...
