Publications associées à Matrice de Vandermonde

CEO networks and the labor market for directors?

Directors at firms with well-connected CEOs are more likely to obtain directorships at firms that are connected to the CEOs. Recommended directors do not become beholden to the CEO. Reciprocity is an important determinant of recommendations because CEOs ar ...

ELSEVIER2023

Fourier interpolation on the real line

Maryna Viazovska

In this paper we construct an explicit interpolation formula for Schwartz functions on the real line. The formula expresses the value of a function at any given point in terms of the values of the function and its Fourier transform on the set {0,+/- 1,+/- ...

2019

On quadratic matrix equations with infinite size coefficients encountered in QBD stochastic processes

Stefano Massei

Matrix equations of the kind A(1)X(2)+A(0)X+A(-1)=X, where both the matrix coefficients and the unknown are semi-infinite matrices belonging to a Banach algebra, are considered. These equations, where coefficients are quasi-Toeplitz matrices, are encounter ...

WILEY2018

A Non-Euclidean Gradient Descent Framework for Non-Convex Matrix Factorization

Volkan Cevher, Anastasios Kyrillidis, Ya-Ping Hsieh, Rabeeh Karimi Mahabadi, Yu-Chun Kao

We study convex optimization problems that feature low-rank matrix solutions. In such scenarios, non-convex methods offer significant advantages over convex methods due to their lower space complexity as well as faster convergence speed. Moreover, many of ...

2018

Ultrafast ultrasound imaging as an inverse problem: Matrix-free sparse image reconstruction

Jean-Philippe Thiran, Yves Wiaux, Dimitris Perdios, Adrien Georges Jean Besson, Rafael Eduardo Carrillo Rangel, Florian Martinez, Marcel Arditi

Conventional ultrasound (US) image reconstruction methods rely on delay-and-sum (DAS) beamforming, which is a relatively poor solution of the image reconstruction problem. An alternative to DAS consists in using iterative techniques which require both an a ...

2017

Recompression Of Hadamard Products Of Tensors In Tucker Format

Daniel Kressner, Lana Perisa

The Hadamard product features prominently in tensor-based algorithms in scientific computing and data analysis. Due to its tendency to significantly increase ranks, the Hadamard product can represent a major computational obstacle in algorithms based on lo ...

Siam Publications2017

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

Daniel Kressner

Novel memory-efficient Arnoldi algorithms for solving matrix polynomial eigenvalue problems are presented. More specifically, we consider the case of matrix polynomials expressed in the Chebyshev basis, which is often numerically more appropriate than the ...

Wiley-Blackwell2014

Bit Precision Analysis for Compressed Sensing

Mohammad Amin Shokrollahi, Mahdi Cheraghchi Bashi Astaneh

This paper studies the stability of some reconstruction algorithms for compressed sensing in terms of the bit precision. Considering the fact that practical digital systems deal with discretized signals, we motivate the importance of the total number of ac ...

2009

A path integral formalism of DNA looping probability

Ludovica Cotta-Ramusino

In this thesis we describe a path integral formalism to evaluate approximations to the probability density function for the location and orientation of one end of a continuum polymer chain at thermodynamic equilibrium with a heat bath. We concentrate on th ...

EPFL2008

Efficient multiplication using type $2$ optimal normal bases

Mohammad Amin Shokrollahi

In this paper we propose a new structure for multiplication using optimal normal bases of type

2

. The multiplier uses an efficient linear transformation to convert the normal basis representations of elements of

F_{q^{n}}

to suitable polynomials of deg ...

2007