BECOOL: Ballooning eigensolver with COOL finite elements
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.
Novel memory-efficient Arnoldi algorithms for solving matrix polynomial eigenvalue problems are presented. More specifically, we consider the case of matrix polynomials expressed in the Chebyshev basis, which is often numerically more appropriate than the ...
The QZ algorithm for computing eigenvalues and eigenvectors of a matrix pencil A - lambda B requires that the matrices first be reduced to Hessenberg-triangular (HT) form. The current method of choice for HT reduction relies entirely on Givens rotations re ...
In this project we numerically simulate electrophysiological models for cardiac applications by means of Isogeometric Analysis. Specifically, we aim at understanding the advantages of using high order continuous NURBS (Non-UniformRational B-Splines) basis ...
We study differential equations that lead to extremal points in symplectic pseudospectra. In a two-level approach, where on the inner level we compute extremizers of the symplectic epsilon-pseudospectrum for a given epsilon and on the outer level we optimi ...
The focus of this thesis is on developing efficient algorithms for two important problems arising in model reduction, estimation of the smallest eigenvalue for a parameter-dependent Hermitian matrix and solving large-scale linear matrix equations, by extra ...
Linear matrix equations, such as the Sylvester and Lyapunov equations, play an important role in various applications, including the stability analysis and dimensionality reduction of linear dynamical control systems and the solution of partial differentia ...
We consider the numerical solution of second order Partial Differential Equations (PDEs) on lower dimensional manifolds, specifically on surfaces in three dimensional spaces. For the spatial approximation, we consider Isogeometric Analysis which facilitate ...
The numerical solution of partial differential equations (PDEs) depending on para- metrized or random input data is computationally intensive. Reduced order modeling techniques, such as the reduced basis methods, have been developed to alleviate this compu ...
We consider the numerical approximation of high order Partial Differential Equations (PDEs) defined on surfaces in the three dimensional space, with particular emphasis on closed surfaces. We consider computational domains that can be represented by B-spli ...
We solve two stochastic control problems in which a player tries to minimize or maximize the exit time from an interval of a Brownian particle, by controlling its drift. The player can change from one drift to another but is subject to a switching cost. In ...
