On A Perturbation Bound For Invariant Subspaces Of Matrices

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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

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

The numerical solution of singular eigenvalue problems is complicated by the fact that small perturbations of the coefficients may have an arbitrarily bad effect on eigenvalue accuracy. However, it has been known for a long time that such perturbations are ...

The locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm is a popular approach for computing a few smallest eigenvalues and the corresponding eigenvectors of a large Hermitian positive definite matrix A. In this work, we propose a mix ...

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

We study the homogenization of the Poisson equation with a reaction term and of the eigenvalue problem associated to the generator of multiscale Langevin dynamics. Our analysis extends the theory of two-scale convergence to the case of weighted Sobolev spa ...

The exceptional points (EPs) of non-Hermitian Hamiltonians (NHHs) are spectral degeneracies associated with coalescing eigenvalues and eigenvectors, which are associated with remarkable dynamical properties. These EPs can be generated experimentally in ope ...

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

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

We present asymptotically sharp inequalities, containing a 2nd term, for the Dirichlet and Neumann eigenvalues of the Laplacian on a domain, which are complementary to the familiar Berezin-Li-Yau and Kroger inequalities in the limit as the eigenvalues tend ...

Cakoni and Nguyen recently proposed very general conditions on the coefficients of Maxwell equations for which they established the discreten ess of the set of eigenvalues of the transmission problem and studied their locations. In this paper, we establish ...

Decentralized algorithms for stochastic optimization and learning rely on the diffusion of information through repeated local exchanges of intermediate estimates. Such structures are particularly appealing in situations where agents may be hesitant to shar ...

Based on the spectral divide-and-conquer algorithm by Nakatsukasa and Higham [SIAM J. Sci. Comput., 35(3):A1325-A1349, 2013], we propose a new algorithm for computing all the eigenvalues and eigenvectors of a symmetric banded matrix with small bandwidth, w ...

Matrices with hierarchical low-rank structure, including HODLR and HSS matrices, constitute a versatile tool to develop fast algorithms for addressing large-scale problems. While existing software packages for such matrices often focus on linear systems, t ...

Block Krylov subspace methods (KSMs) comprise building blocks in many state-of-the-art solvers for large-scale matrix equations as they arise, for example, from the discretization of partial differential equations. While extended and rational block Krylov ...

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

It has been well established that Functional Connectomes (FCs), as estimated from functional MRI (fMRI) data, have an individual fingerprint that can be used to identify an individual from a population (subject-identification). Although identification rate ...

We study harmonic mappings of the form , where h is an analytic function. In particular, we are interested in the index (a generalized multiplicity) of the zeros of such functions. Outside the critical set of f, where the Jacobian of f is non-vanishing, it ...

We determine the asymptotic behavior of eigenvalues of clamped plates under large compression by relating this problem to eigenvalues of the Laplacian with Robin boundary conditions. Using the method of fundamental solutions, we then carry out a numerical ...

On A Perturbation Bound For Invariant Subspaces Of Matrices

Chat with Graph Search

RANDOMIZED JOINT DIAGONALIZATION OF SYMMETRIC

Spectral Estimators for High-Dimensional Matrix Inference

Singular quadratic eigenvalue problems: linearization and weak condition numbers

A mixed precision LOBPCG algorithm

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

Homogenization results for the generator of multiscale Langevin dynamics in weighted Sobolev spaces

Creating and controlling exceptional points of non-Hermitian Hamiltonians via homodyne Lindbladian invariance

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

Robust Differentiable SVD

Complementary Asymptotically Sharp Estimates for Eigenvalue Means of Laplacians

The completeness of the generalized eigenfunctions and an upper bound for the counting function of the transmission eigenvalue problem for Maxwell equations

Graph-Homomorphic Perturbations For Private Decentralized Learning

A fast spectral divide-and-conquer method for banded matrices

hm-toolbox: MATLAB SOFTWARE FOR HODLR AND HSS MATRICES

Compress-and-restart block Krylov subspace methods for Sylvester matrix equations

Kinetic Euclidean Distance Matrices

GEFF: Graph embedding for functional fingerprinting

hm-toolbox: Matlab software for HODLR and HSS matrices

The index of singular zeros of harmonic mappings of anti-analytic degree one

On The Behavior Of Clamped Plates Under Large Compression