Low order discontinuous Galerkin methods for second order elliptic problems

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

A key challenge across many disciplines is to extract meaningful information from data which is often obscured by noise. These datasets are typically represented as large matrices. Given the current trend of ever-increasing data volumes, with datasets grow ...

In recent years, there has been a surge of interest in predicting computed activation barriers, to enable the acceleration of the automated exploration of reaction networks. Consequently, various predictive approaches have emerged, ranging from graph-based ...

This work is concerned with the computation of the action of a matrix function f(A), such as the matrix exponential or the matrix square root, on a vector b. For a general matrix A, this can be done by computing the compression of A onto a suitable Krylov ...

Phase transitions in non-Hermitian systems are at the focus of cutting edge theoretical and experimental research. On the one hand, parity-time- (PT-) and anti-PT-symmetric physics have gained ever-growing interest, due to the existence of non-Hermitian sp ...

The finite element method is a well-established method for the numerical solution of partial differential equations (PDEs), both linear and nonlinear. However, the repeated re -assemblage of finite element matrices for nonlinear PDEs is frequently pointed ...

We present a nonperturbative recipe for directly computing the S-matrix in strongly-coupled QFTs. The method makes use of spectral data obtained in a Hamiltonian framework and can be applied to a wide range of theories, including potentially QCD. We demons ...

Daily manipulation tasks are characterized by regular features associated with the task structure, which can be described by multiple geometric primitives related to actions and object shapes. Only using Cartesian coordinate systems cannot fully represent ...

Modern data management systems aim to provide both cutting-edge functionality and hardware efficiency. With the advent of AI-driven data processing and the post-Moore Law era, traditional memory-bound scale-up data management operations face scalability ch ...

Removing geometrical details from a complex domain is a classical operation in computer aided design for simulation and manufacturing. This procedure simplifies the meshing process, and it enables faster simulations with less memory requirements. However, ...

In this manuscript we consider denoising of large rectangular matrices: given a noisy observation of a signal matrix, what is the best way of recovering the signal matrix itself? For Gaussian noise and rotationally-invariant signal priors, we completely ch ...

In this thesis we propose and analyze algorithms for some numerical linear algebra tasks: finding low-rank approximations of matrices, computing matrix functions, and estimating the trace of matrices. In the first part, we consider algorithms for building ...

The conjugate heat transfer in mixtures of a fluid and single granular clusters is studied in this paper using a novel lattice Boltzmann method (LBM) programmed for parallel computation on the graphics processing unit (GPU). The LBM is validated for heat c ...

We present TimeEvolver, a program for computing time evolution in a generic quantum system. It relies on well-known Krylov subspace techniques to tackle the problem of multiplying the exponential of a large sparse matrix iH, where His the Hamiltonian, with ...

The lattice Green's function method (LGFM) is the discrete counterpart of the continuum boundary element method and is a natural approach for solving intrinsically discrete solid mechanics problems that arise in atomistic-continuum coupling methods. Here, ...

The use of model-based numerical simulations of wave propagation in rooms for engineering applications requires that acoustic conditions for multiple parameters are evaluated iteratively, which is computationally expensive. We present a reduced basis metho ...

This work is concerned with approximating matrix functions for banded matrices, hierarchically semiseparable matrices, and related structures. We develop a new divide-and-conquer method based on (rational) Krylov subspace methods for performing low-rank up ...

We prove an identity relating the permanent of a rank 2 matrix and the determinants of its Hadamard powers. When viewed in the right way, the resulting formula looks strikingly similar to an identity of Carlitz and Levine, suggesting the possibility that t ...

Particle dampers have received considerable attention in recent years as a novel damping technique. However, due to its high degree of nonlinearity, no mature damping model has been constructed. This article proposes an equivalent raft model that takes int ...

Today, automatic control is integrated into a wide spectrum of real-world systems such as electrical grids and transportation networks. Many of these systems comprise numerous interconnected agents, perform safety-critical operations, or generate large amo ...

The Schur decomposition of a square matrix A is an important intermediate step of state-of-the-art numerical algorithms for addressing eigenvalue problems, matrix functions, and matrix equations. This work is concerned with the following task: Compute a (m ...

Low order discontinuous Galerkin methods for second order elliptic problems

Chat with Graph Search

Spectral Estimators for High-Dimensional Matrix Inference

Benchmarking machine-readable vectors of chemical reactions on computed activation barriers

SPEEDING UP KRYLOV SUBSPACE METHODS FOR COMPUTING f(A)b VIA RANDOMIZATION

Emergent non-Hermitian localization phenomena in the synthetic space of zero-dimensional bosonic systems

On the fast assemblage of finite element matrices with application to nonlinear heat transfer problems

Towards a nonperturbative construction of the S-matrix

A geometric optimal control approach for imitation and generalization of manipulation skills

Post-Moore's Law Fusion: High-Bandwidth Memory, Accelerators, and Native Half-Precision Processing for CPU-Local Analytics

Adaptive analysis-aware defeaturing

Optimal denoising of rotationally invariant rectangular matrices

Fast deterministic and randomized algorithms for low-rank approximation, matrix functions, and trace estimation

Conjugate heat transfer in isolated granular clusters with interstitial fluid using lattice Boltzmann method

TimeEvolver: A program for time evolution with improved error bound

Efficient lattice Green's function method for bounded domain problems

Reduced basis methods for numerical room acoustic simulations with parametrized boundaries

DIVIDE-AND-CONQUER METHODS FOR FUNCTIONS OF MATRICES WITH BANDED OR HIERARCHICAL LOW-RANK STRUCTURE\ast

A Determinantal Identity for the Permanent of a Rank 2 Matrix

A simplified modeling method for multi-particle damper: Validation and application in energy dissipation analysis

Data-driven and Safe Networked Control with Applications to Microgrids

Iterative refinement of Schur decompositions