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

Concept

Definite quadratic form

Publications associées (24)

Biobased surfactant

Jeremy Luterbacher, Stefania Bertella, Songlan Sun, Anastasiia Komarova

The present invention relates to a compound of the general formula (I), (II) and (III), more specifically of formula (Ia), (Ib), (Ic)wherein R11 and R12 or R21 and R22 or R31 and R32 are both hydrogen or form together with CHR50 a cyclic moiety or one of R ...

2024

Tangent functional connectomes uncover more unique phenotypic traits

Mingkui Wang, Enrico Amico

Functional connectomes (FCs) containing pairwise estimations of functional couplings between pairs of brain regions are commonly represented by correlation matrices. As symmetric positive definite matrices, FCs can be transformed via tangent space projecti ...

CELL PRESS2023

Biobased surfactants

Jeremy Luterbacher, Stefania Bertella, Songlan Sun, Anastasiia Komarova

Compound of the general formula (Ia), (Ib) and (Ic) R50 and R60 are different form each other and are selected from the group consisting of -R70, -ZR70, -Z-OH, -Z-NH2, -Z-SH, -Z-OC(O)R70, -OC(O)R70, - COOH and its corresponding salts, -C(O)NH2, -C(O)NH-R70 ...

2023

Hierarchy of quasisymmetries and degeneracies in the CoSi family of chiral crystal materials

Philip Johannes Walter Moll, Yi-Chiang Sun, Chunyu Guo

In materials, certain approximated symmetry operations can exist in a lower-order approximation of the effective model but are good enough to influence the physical responses of the system, and these approximated symmetries were recently dubbed "quasisymme ...

AMER PHYSICAL SOC2023

Positive Definite Completions and Continuous Graphical Models

Kartik Waghmare

This thesis concerns the theory of positive-definite completions and its mutually beneficial connections to the statistics of function-valued or continuously-indexed random processes, better known as functional data analysis. In particular, it dwells upon ...

EPFL2023

IMPROVED VARIANTS OF THE HUTCH plus plus ALGORITHM FOR TRACE ESTIMATION

Daniel Kressner, Alice Cortinovis, Ulf David Persson

This paper is concerned with two improved variants of the Hutch++ algorithm for estimating the trace of a square matrix, implicitly given through matrix-vector products. Hutch++ combines randomized low-rank approximation in a first phase with stochastic tr ...

SIAM PUBLICATIONS2022

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

Alice Cortinovis

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 ...

EPFL2022

Space-Efficient Representations of Graphs

Jakab Tardos

With the increasing prevalence of massive datasets, it becomes important to design algorithmic techniques for dealing with scenarios where the input to be processed does not fit in the memory of a single machine. Many highly successful approaches have emer ...

EPFL2022

Exploiting Marginal Stability in Slow-Fast Quasilinear Dynamical Systems

Alessia Ferraro

The accurate investigation of many geophysical phenomena via direct numerical simulations is computationally not possible nowadays due to the huge range of spatial and temporal scales to be resolved. Therefore advances in this field rely on the development ...

EPFL2022

On Randomized Trace Estimates for Indefinite Matrices with an Application to Determinants

Daniel Kressner, Alice Cortinovis

Randomized trace estimation is a popular and well-studied technique that approximates the trace of a large-scale matrix B by computing the average of x(T) Bx for many samples of a random vector X. Often, B is symmetric positive definite (SPD) but a number ...

2022

A unifying framework for form-finding and topology-finding of tensegrity structures

Yafeng Wang

This paper presents a unifying framework for the form-finding and topology-finding of tensegrity structures. The novel computational framework is based on rank-constrained linear matrix inequalities. For form-finding, given the topology (i.e., member conne ...

PERGAMON-ELSEVIER SCIENCE LTD2021

Further results on latent discourse models and word embeddings

Youssef Allouah

We discuss some properties of generative models for word embeddings. Namely, (Arora et al., 2016) proposed a latent discourse model implying the concentration of the partition function of the word vectors. This concentration phenomenon led to an asymptotic ...

Microtome Publishing2021

Second-order adjoint-based sensitivity for hydrodynamic stability and control

Edouard Boujo

Adjoint-based sensitivity analysis is routinely used today to assess efficiently the effect of open-loop control on the linear stability properties of unstable flows. Sensitivity maps identify regions where small-amplitude control is the most effective, i. ...

Cambridge University Press2021

Copper, my precious!

Raffaella Buonsanti

To produce chemicals and fuels from CO2 and water while storing excess energy from renewable resources will play a big role in sustainability. Three decades ago, we learned that copper possesses the unique ability to break the stable CO2 bonds and to form ...

NATURE PORTFOLIO2021

Geodesic Distance on Optimally Regularized Functional Connectomes Uncovers Individual Fingerprints

Enrico Amico

Background: Functional connectomes (FCs) have been shown to provide a reproducible individual fingerprint, which has opened the possibility of personalized medicine for neuro/psychiatric disorders. Thus, developing accurate ways to compare FCs is essential ...

MARY ANN LIEBERT, INC2021

Towards Tight Bounds for Spectral Sparsification of Hypergraphs

Mikhail Kapralov, Jakab Tardos

Cut and spectral sparsification of graphs have numerous applications, including e.g. speeding up algorithms for cuts and Laplacian solvers. These powerful notions have recently been extended to hypergraphs, which are much richer and may offer new applicati ...

ASSOC COMPUTING MACHINERY2021

Bootstrapping massive quantum field theories

João Miguel Augusto Penedones Fernandes, Denis Karateev

We propose a new non-perturbative method for studying UV complete unitary quantum field theories (QFTs) with a mass gap in general number of spacetime dimensions. The method relies on unitarity formulated as positive semi-definiteness of the matrix of inne ...

Springer Nature2020

Certified And Fast Computations With Shallow Covariance Kernels

Daniel Kressner, Stefano Massei

Many techniques for data science and uncertainty quantification demand efficient tools to handle Gaussian random fields, which are defined in terms of their mean functions and covariance operators. Recently, parameterized Gaussian random fields have gained ...

AMER INST MATHEMATICAL SCIENCES-AIMS2020

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

Charge fluctuations from molecular simulations in the constant-potential ensemble

Sara Bonella, Alessandro Coretti

We revisit the statistical mechanics of charge fluctuations in capacitors. In constant-potential classical molecular simulations, the atomic charges of electrode atoms are treated as additional degrees of freedom which evolve in time so as to satisfy the c ...

2020