TimeEvolver: A program for time evolution with improved error bound
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 parareal algorithm seeks to extract parallelism in the time-integration direction of time-dependent differential equations. While it has been applied with success to a wide range of problems, it suffers from some stability issues when applied to non-di ...
We analyse the existence of multiple critical points for an even functional J : H -> R in the following context: the Hilbert space H can be split into an orthogonal sum H = Y circle plus Z in such a way that inf{J(u) : u is an element of Z and parallel to ...
This paper proposes an approach for high-order time integration within a multi-domain setting for time- fractional differential equations. Since the kernel is singular or nearly singular, two main difficulties arise after the domain decomposition: how to p ...
In this work we build on the classical adaptive sparse grid algorithm (T. Gerstner and M. Griebel, Dimension-adaptive tensor-product quadrature), obtaining an enhanced version capable of using non-nested collocation points, and supporting quadrature and in ...
For a Hamiltonian matrix with purely imaginary eigenvalues, we aim to determine the nearest Hamiltonian matrix such that some or all eigenvalues leave the imaginary axis. Conversely, for a Hamiltonian matrix with all eigenvalues lying off the imaginary axi ...
A fully discrete analysis of the finite element heterogeneous multiscale method (FE-HMM) for elliptic problems with N+1 well-separated scales is discussed. The FE-HMM is a numerical homogenization method that relies on a macroscopic scheme (macro FEM) for ...
This work is concerned with the numerical solution of large-scale linear matrix equations A1XB1T++AKXBKT=C. The most straightforward approach computes XRmxn from the solution of an mn x mn linear system, typically limiting the feasible values of m,n to a f ...
We develop rigorous alternating direction optimization methods for a prototype constrained convex optimization template, which has broad applications in computational sciences. We build upon our earlier work on the model-based gap reduction (MGR) technique ...
We develop a numerical procedure to efficiently model the nonequilibrium steady state of one-dimensional arrays of open quantum systems based on a matrix-product operator ansatz for the density matrix. The procedure searches for the null eigenvalue of the ...
This paper presents a solution method for parametric linear complementarity problems (PLCP) that relies on an enumeration technique to discover all feasible bases. The enumeration procedure is based on evaluating all possible combinations of active constra ...
