Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Orthonormal basis

Related publications (30)

Numerical Methods for First and Second Order Fully Nonlinear Partial Differential Equations

Dimitrios Gourzoulidis

This thesis focuses on the numerical analysis of partial differential equations (PDEs) with an emphasis on first and second-order fully nonlinear PDEs. The main goal is the design of numerical methods to solve a variety of equations such as orthogonal maps ...

EPFL2021

Catch Me If You Can Designing a Disobedient Object to Protest Against GSM Surveillance

Félicien Michel Marie Goguey

In this article, I discuss the process of designing an object to protest against a specific surveillance device: the IMSI catcher, a controversial object used to monitor GSM networks. Being widely used in protests, I develop a tactical approach based on ob ...

ASSOC COMPUTING MACHINERY2021

Reduction of the sign problem near T=0 in quantum Monte Carlo simulations

Frédéric Mila, Jonathan D'Emidio

Building on a recent investigation of the Shastry-Sutherland model [S. Wessel et al., Phys. Rev. B 98, 174432 (2018)], we develop a general strategy to eliminate the Monte Carlo sign problem near the zero-temperature limit in frustrated quantum spin models ...

2020

New Results in Integer and Lattice Programming

Christoph Hunkenschröder

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

b \in \Z^m

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020

On compact representations of Voronoi cells of lattices

Matthias Schymura, Christoph Hunkenschröder

In a seminal work, Micciancio and Voulgaris (SIAM J Comput 42(3):1364-1391, 2013) described a deterministic single-exponential time algorithm for the closest vector problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given ...

SPRINGER HEIDELBERG2020

Modern Schools in Angola, 1961-1975: Design with Climate and Heritage

Maria Margarida Gonçalves Quintã

The architectural production of Angola between 1961 and 1975 forms the basis of the current study. Taking into consideration that buildings' environmental performance is, at one time, one of the most central aspects of the Modern Movement legacy and a pres ...

EPFL2019

On the Volume of the John-Lowner Ellipsoid

Grigory Ivanov

We find an optimal upper bound on the volume of the John ellipsoid of a k-dimensional section of the n-dimensional cube, and an optimal lower bound on the volume of the Lowner ellipsoid of a projection of the n-dimensional cross-polytope onto a k-dimension ...

SPRINGER2020

Efficient Treatment of Correlation Energies at the Basis-Set Limit by Monte Carlo Summation of Continuum States

Ursula Röthlisberger, Martin Peter Bircher, Justin Villard

The calculation of electron correlation is vital for the description of atomistic phenomena in physics, chemistry, and biology. However, accurate wavefunction-based methods exhibit steep scaling and often sluggish convergence with respect to the basis set ...

AMER CHEMICAL SOC2020

A p-weighted limiter for the discontinuous Galerkin method on one-dimensional and two-dimensional triangular grids

Qian Wang, Qian Wang

This paper presents an accuracy-preserving p-weighted limiter for discontinuous Galerkin methods on one-dimensional and two-dimensional triangular grids. The p-weighted limiter is the extension of the second-order WENO limiter by Li et al. [W. Li, J. Pan a ...

2020

The ONETEP linear-scaling density functional theory program

Edward Baxter Linscott

We present an overview of the onetep program for linear-scaling density functional theory (DFT) calculations with large basis set (plane-wave) accuracy on parallel computers. The DFT energy is computed from the density matrix, which is constructed from spa ...

AMER INST PHYSICS2020

Related publications (30)

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

b \in \Z^m

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

EPFL2020