Publication

Memory-efficient Arnoldi algorithms for linearizations of matrix polynomials in Chebyshev basis

Publications associées (28)

A semi-supervised algorithm for improving the consistency of crowdsourced datasets: The COVID-19 case study on respiratory disorder classification

David Atienza Alonso, Lara Orlandic, Tomas Teijeiro Campo

Background and Objective: Cough audio signal classification is a potentially useful tool in screening for respiratory disorders, such as COVID-19. Since it is dangerous to collect data from patients with contagious diseases, many research teams have turned ...

2023

THE WEYL LAW OF TRANSMISSION EIGENVALUES AND THE COMPLETENESS OF GENERALIZED TRANSMISSION EIGENFUNCTIONS WITHOUT COMPLEMENTING CONDITIONS

Hoài-Minh Nguyên, Jean Louis-Alexandre Fornerod

The transmission eigenvalue problem is a system of two second-order elliptic equations of two unknowns equipped with the Cauchy data on the boundary. In this work, we establish the Weyl law for the eigenvalues and the completeness of the generalized eigenf ...

Siam Publications2023

Data-driven approaches for non-invasive cuffless blood pressure monitoring

Clémentine Léa Aguet

Blood pressure (BP) is a crucial indicator of cardiovascular health. Hypertension is a common life-threatening condition and a key factor of cardiovascular diseases (CVDs). Identifying abnormal BP fluctuations can allow for early detection and management o ...

EPFL2023

The first Grushin eigenvalue on cartesian product domains

Joachim Stubbe, Luigi Provenzano, Paolo Luzzini

In this paper, we consider the first eigenvalue.1(O) of the Grushin operator.G :=.x1 + |x1|2s.x2 with Dirichlet boundary conditions on a bounded domain O of Rd = R d1+ d2. We prove that.1(O) admits a unique minimizer in the class of domains with prescribed ...

WALTER DE GRUYTER GMBH2023

TimeEvolver: A program for time evolution with improved error bound

Sebastian Zell

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

ELSEVIER2022

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

Daniel Kressner, Stefano Massei, Alice Cortinovis

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

SIAM PUBLICATIONS2022

A smooth basis for atomistic machine learning

Michele Ceriotti, Kevin Kazuki Huguenin-Dumittan, Filippo Bigi

Machine learning frameworks based on correlations of interatomic positions begin with a discretized description of the density of other atoms in the neighborhood of each atom in the system. Symmetry considerations support the use of spherical harmonics to ...

AIP Publishing2022

Finite free convolutions of polynomials

Adam Wade Marcus

We study three convolutions of polynomials in the context of free probability theory. We prove that these convolutions can be written as the expected characteristic polynomials of sums and products of unitarily invariant random matrices. The symmetric addi ...

SPRINGER HEIDELBERG2022