Continuous Decompositions and Coalescing Eigenvalues for Matrices Depending on Parameters

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.

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

In this thesis we will present and analyze randomized algorithms for numerical linear algebra problems. An important theme in this thesis is randomized low-rank approximation. In particular, we will study randomized low-rank approximation of matrix functio ...

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

The finite element method is a well-established method for the numerical solution of partial differential equations (PDEs), both linear and nonlinear. However, the repeated re -assemblage of finite element matrices for nonlinear PDEs is frequently pointed ...

Sylvester matrix equations are ubiquitous in scientific computing. However, few solution techniques exist for their generalized multiterm version, as they now arise in an increasingly large number of applications. In this work, we consider algebraic parame ...

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

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

The Transfer Matrix formalism is ubiquitous when it comes to study wave propagation in various stratified media, applications ranging from Seismology to Quantum Mechanics. A relation between variables at two points in two different layers can be establishe ...

We consider increasingly complex models of matrix denoising and dictionary learning in the Bayes-optimal setting, in the challenging regime where the matrices to infer have a rank growing linearly with the system size. This is in contrast with most existin ...

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

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 propose a principled method for projecting an arbitrary square matrix to the non- convex set of asymptotically stable matrices. Leveraging ideas from large deviations theory, we show that this projection is optimal in an information-theoretic sense and ...

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

This work develops novel rational Krylov methods for updating a large-scale matrix function f(A) when A is subject to low-rank modifications. It extends our previous work in this context on polynomial Krylov methods, for which we present a simplified conve ...

Randomized trace estimation is a popular and well-studied technique that approximates the trace of a large-scale matrix B by computing the average of x(T) Bx for many samples of a random vector X. Often, B is symmetric positive definite (SPD) but a number ...

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

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

Like conventional material products, waste is the last stage of the life cycle of engineered nanomaterials, which are then incinerated or stabilized before disposal. However, because of their special physical characteristics, the fate of the thermally trea ...

This paper argues that randomized linear sketching is a natural tool for on-the-fly compression of data matrices that arise from large-scale scientific simulations and data collection. The technical contribution consists in a new algorithm for constructing ...

The present invention concerns a method of displaying an image on a see-through display. The method comprises: obtaining (101) a first electromagnetic radiation matrix of an object, the first matrix comprising first matrix elements representing radiation i ...

Continuous Decompositions and Coalescing Eigenvalues for Matrices Depending on Parameters

Chat with Graph Search

Spectral Estimators for High-Dimensional Matrix Inference

Randomized low-rank approximation and its applications

Duality and bicrystals on infinite binary matrices

On the fast assemblage of finite element matrices with application to nonlinear heat transfer problems

Preconditioning techniques for generalized Sylvester matrix equations

Optimal denoising of rotationally invariant rectangular matrices

Iterative refinement of Schur decompositions

Harmonic decomposition of the trace of 1D transfer matrices in layered media

Statistical limits of dictionary learning: Random matrix theory and the spectral replica method

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

Robust Differentiable SVD

Efficient Learning of a Linear Dynamical System with Stability Guarantees

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

Low-Rank Updates Of Matrix Functions Ii: Rational Krylov Methods

On Randomized Trace Estimates for Indefinite Matrices with an Application to Determinants

Kinetic Euclidean Distance Matrices

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

Evaporation of Metals during the Thermal Treatment of Oxide Nanomaterials in Cellulose-Based Matrices

Streaming Low-Rank Matrix Approximation With An Application To Scientific Simulation

Method of displaying an image on a see-through display