Fast reliable algorithms for matrices with structure
Publications associées (36)
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.
We consider unconstrained minimax problem where the objective function is the maximum of a finite number of smooth convex functions. We present an iterative method to compute the optimal solution for the unconstrained convex finite minimax problem. The alg ...
We present new methods for the determination of periodic orbits of general dynamical systems. Iterative algorithms for finding solutions by these methods, for both the exact continuum case, and for approximate discrete representations suitable for numerica ...
The level set method is a popular technique for tracking moving interfaces in several disciplines including computer vision and fluid dynamics. However, despite its high flexibility, the original level set method is limited by two important numerical issue ...
Institute of Electrical and Electronics Engineers2012
In this thesis, we investigate methods for the practical and accurate localization of Internet performance problems. The methods we propose belong to the field of network loss tomography, that is, they infer the loss characteristics of links from end-to-en ...
Consider a diffusion field induced by a finite number of localized and instantaneous sources. In this paper, we study the problem of estimating these sources (including their intensities, spatial locations, and activation time) from the spatiotemporal samp ...
In recent work, we have shown that in a Gaussian network, nodes can often recover linear combinations of transmitted codewords much more efficiently than the codewords themselves. These nodes, after decoding their linear equations, simply send them towards ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008
The modeling of a system composed by a gas phase and organic aerosol particles, and its numerical resolution are studied. The gas-aerosol system is modeled by ordinary differential equations coupled with a mixed-constrained optimization problem. This coupl ...
The numerical analysis of a dynamic constrained optimization problem is presented. It consists of a global minimization problem that is coupled with a system of ordinary differential equations. The activation and the deactivation of inequality constraints ...
We discuss in this thesis the numerical approximation of fluid-structure interaction (FSI) problems with a particular concern (albeit not exclusive) on hemodynamics applications. Firstly, we model the blood as an incompressible fluid and the artery wall as ...
Parametrized systems of Differential Algebraic Equations (DAEs) stand at the base of several mathematical models in Microelectronics, Computational Fluid Dynamics and other Engineering fields. Since the dimension of these systems can be huge, high computat ...