Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Transformation matrix

Related publications (26)

Local excitations in amorphous solids

Wencheng Ji

Amorphous solids are structurally disordered. They are very common and include glasses, colloids, and granular materials, but are far less understood than crystalline solids. Key aspects of these materials are controlled by the presence of excitations in w ...

EPFL2021

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

Daniel Kressner, Alice Cortinovis, Marcel Schweitzer

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

SIAM PUBLICATIONS2021

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

Daniel Kressner, Ana Susnjara

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

WILEY2021

Sublinear Algorithms for Spectral Graph Clustering

Aidasadat Mousavifar

This thesis focuses on designing spectral tools for graph clustering in sublinear time. With the emergence of big data, many traditional polynomial time, and even linear time algorithms have become prohibitively expensive. Processing modern datasets requir ...

EPFL2021

Product of experts for robot learning from demonstration

Emmanuel Pignat

Adaptability and ease of programming are key features necessary for a wider spread of robotics in factories and everyday assistance. Learning from demonstration (LfD) is an approach to address this problem. It aims to develop algorithms and interfaces such ...

EPFL2021

Eigendecomposition-Free Training of Deep Networks for Linear Least-Square Problems

Pascal Fua, Mathieu Salzmann, Kwang Moo Yi, Yinlin Hu, Zheng Dang

Many classical Computer Vision problems, such as essential matrix computation and pose estimation from 3D to 2D correspondences, can be tackled by solving a linear least-square problem, which can be done by finding the eigenvector corresponding to the smal ...

IEEE COMPUTER SOC2021

Related publications (26)