Concept

Matrice de Dirac

Publications associées (108)

Spectral Estimators for High-Dimensional Matrix Inference

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

EPFL2024

Tool Developments in the OpenMC Code: Correlated Sampling and Transient Fission Matrix Approach Coupled to OpenFOAM

Axel Guy Marie Laureau, Elsa Merle

This article outlines the advancements made in broadening the application scope of the OpenMC neutron transport code to include thermohydraulic coupling and nuclear data uncertainty propagation. These developments primarily involve the incorporation of the ...

Taylor & Francis Inc2024

RANDOMIZED JOINT DIAGONALIZATION OF SYMMETRIC

Daniel Kressner, Haoze He

Given a family of nearly commuting symmetric matrices, we consider the task of computing an orthogonal matrix that nearly diagonalizes every matrix in the family. In this paper, we propose and analyze randomized joint diagonalization (RJD) for performing t ...

Philadelphia2024

High order geometric methods with splines: fast solution with explicit time-stepping for Maxwell equations

Bernard Kapidani, Rafael Vazquez Hernandez

We introduce a high-order spline geometric approach for the initial boundary value problem for Maxwell's equations. The method is geometric in the sense that it discretizes in structure preserving fashion the two de Rham sequences of differential forms inv ...

2023

Duality and bicrystals on infinite binary matrices

Thomas Gerber

The set of finite binary matrices of a given size is known to carry a finite type AA bicrystal structure. We first review this classical construction, explain how it yields a short proof of the equality between Kostka polynomials and one-dimensional sums t ...

2023

STREAMING TENSOR TRAIN APPROXIMATION

Daniel Kressner

Tensor trains are a versatile tool to compress and work with high-dimensional data and functions. In this work we introduce the streaming tensor train approximation (STTA), a new class of algorithms for approximating a given tensor ' in the tensor train fo ...

Philadelphia2023

Bootstrapping traceless symmetric O(N) scalars

Alessandro Vichi, Maria Refinetti, Marten Jan Reehorst

We use numerical bootstrap techniques to study correlation functions of traceless sym-metric tensors of O(N) with two indices ti j. We obtain upper bounds on operator dimen-sions for all the relevant representations and several values of N. We discover sev ...

SCIPOST FOUNDATION2023

Bias Cancellation of MixColumns

Francesco Regazzoni, Andrea Felice Caforio, Subhadeep Banik

At COSADE'2020, Carre et al. established a novel biascancelling property of the AES MixColumns matrix that effectively corrects any skewed output distribution of a state byte due to a faulty substitution box. Consequently, any effected byte is rendered uni ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

The double exponential runtime is tight for 2-stage stochastic ILPs

Kim-Manuel Klein, Klaus Jansen, Alexandra Anna Lassota

We consider fundamental algorithmic number theoretic problems and their relation to a class of block structured Integer Linear Programs (ILPs) called 2-stage stochastic. A 2-stage stochastic ILP is an integer program of the form min{c(T)x vertical bar Ax = ...

SPRINGER HEIDELBERG2022

Nonlinear Finite Elements in Dynamics

This report focuses on the implementation of the finite element method for nonlinear dynamical problems arising in solid mechanics. The theory of continuum mechanics is extensively covered in the literature and it is assumed the reader is already familiar ...

2020

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.

Connectez-vous pour utiliser Chat avec Graph Search