Publications related to Computing periodic deflating subspaces associated with a specified set of eigenvalues

RANDOMIZED JOINT DIAGONALIZATION OF SYMMETRIC

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

Spectral Estimators for High-Dimensional Matrix Inference

Farzad Pourkamali

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

Iterative refinement of Schur decompositions

Daniel Kressner, Zvonimir Bujanovic

The Schur decomposition of a square matrix A is an important intermediate step of state-of-the-art numerical algorithms for addressing eigenvalue problems, matrix functions, and matrix equations. This work is concerned with the following task: Compute a (m ...

SPRINGER2022

Optimal denoising of rotationally invariant rectangular matrices

Florent Gérard Krzakala, Lenka Zdeborová, Emanuele Troiani, Vittorio Erba

In this manuscript we consider denoising of large rectangular matrices: given a noisy observation of a signal matrix, what is the best way of recovering the signal matrix itself? For Gaussian noise and rotationally-invariant signal priors, we completely ch ...

2022

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

EPFL2022

Robust Differentiable SVD

Pascal Fua, Mathieu Salzmann, Zheng Dang, Wei Wang, Yinlin Hu

Eigendecomposition of symmetric matrices is at the heart of many computer vision algorithms. However, the derivatives of the eigenvectors tend to be numerically unstable, whether using the SVD to compute them analytically or using the Power Iteration (PI) ...

2021

Kinetic Euclidean Distance Matrices

Martin Vetterli, Ivan Dokmanic, Puoya Tabaghi

Euclidean distance matrices (EDMs) are a major tool for localization from distances, with applications ranging from protein structure determination to global positioning and manifold learning. They are, however, static objects which serve to localize point ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Efficient Distributed Transposition Of Large-Scale Multigraphs And High-Cardinality Sparse Matrices

Felix Schürmann, Bruno Ricardo Da Cunha Magalhães

Graph-based representations underlie a wide range of scientific problems. Graph connectivity is typically represented as a sparse matrix in the Compressed Sparse Row format. Large-scale graphs rely on distributed storage, allocating distinct subsets of row ...

2020

Global eigenvalue distribution of matrices defined by the skew-shift

Marius Christopher Lemm

We consider large Hermitian matrices whose entries are defined by evaluating the exponential function along orbits of the skew-shift

\binom{j}{2} \omega+jy+x \mod 1

for irrational

\omega

. We prove that the eigenvalue distribution of these matrices conv ...

2019

Fast hierarchical solvers for symmetric eigenvalue problems

Ana Susnjara

In this thesis we address the computation of a spectral decomposition for symmetric banded matrices. In light of dealing with large-scale matrices, where classical dense linear algebra routines are not applicable, it is essential to design alternative tech ...

EPFL2018

Computing periodic deflating subspaces associated with a specified set of eigenvalues

Graph Chatbot

Chat with Graph Search

RANDOMIZED JOINT DIAGONALIZATION OF SYMMETRIC

Spectral Estimators for High-Dimensional Matrix Inference

Iterative refinement of Schur decompositions

Optimal denoising of rotationally invariant rectangular matrices

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

Robust Differentiable SVD

Kinetic Euclidean Distance Matrices

Efficient Distributed Transposition Of Large-Scale Multigraphs And High-Cardinality Sparse Matrices

Global eigenvalue distribution of matrices defined by the skew-shift

Fast hierarchical solvers for symmetric eigenvalue problems

Spectral Estimators for High-Dimensional Matrix Inference

RANDOMIZED JOINT DIAGONALIZATION OF SYMMETRIC

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

Optimal denoising of rotationally invariant rectangular matrices

Iterative refinement of Schur decompositions

Kinetic Euclidean Distance Matrices

Efficient Distributed Transposition Of Large-Scale Multigraphs And High-Cardinality Sparse Matrices

Robust Differentiable SVD

Global eigenvalue distribution of matrices defined by the skew-shift

Fast hierarchical solvers for symmetric eigenvalue problems