Continuous Decompositions and Coalescing Eigenvalues for Matrices Depending on Parameters

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (29)

Page 2 sur 2

The S-matrix bootstrap. Part III: higher dimensional amplitudes

João Miguel Augusto Penedones Fernandes, Jonathan Campbell Toledo

We consider constraints on the S-matrix of any gapped, Lorentz invariant quantum field theory in 3+1 dimensions due to crossing symmetry, analyticity and unitarity. We extremize cubic couplings, quartic couplings and scattering lengths relevant for the ela ...

Springer Nature2019

Backpropagation-Friendly Eigendecomposition

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

Eigendecomposition (ED) is widely used in deep networks. However, the backpropagation of its results tends to be numerically unstable, whether using ED directly or approximating it with the Power Iteration method, particularly when dealing with large matri ...

NEURAL INFORMATION PROCESSING SYSTEMS (NIPS)2019

Evaluating and Interpreting Deep Convolutional Neural Networks via Non-negative Matrix Factorization

Edo Collins

With ever greater computational resources and more accessible software, deep neural networks have become ubiquitous across industry and academia. Their remarkable ability to generalize to new samples defies the conventional view, which holds that complex, ...

EPFL2019

Non-filamentary non-volatile memory elements as synapses in neuromorphic systems

Yusuf Leblebici, Severin Sidler, Alessandro Fumarola

Crossbar arrays of non-volatile memory (NVM) devices represent one possible path for implementing highly energy-efficient neuromorphic computing systems. For Deep Neural Networks (DNN), where information can be encoded as analog voltage and current levels, ...

IEEE2019

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

A Householder-Based Algorithm For Hessenberg-Triangular Reduction

Daniel Kressner, Zvonimir Bujanovic

The QZ algorithm for computing eigenvalues and eigenvectors of a matrix pencil A - lambda B requires that the matrices first be reduced to Hessenberg-triangular (HT) form. The current method of choice for HT reduction relies entirely on Givens rotations re ...

SIAM PUBLICATIONS2018

Faster Algorithms for Integer Programs with Block Structure

Friedrich Eisenbrand, Kim-Manuel Klein, Christoph Hunkenschröder

We consider integer programming problems max {c^Tx : A x = b, l

Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik2018

Multilinear Low-Rank Tensors on Graphs & Applications

Pierre Vandergheynst, Nauman Shahid, Francesco Grassi

We propose a new framework for the analysis of low- rank tensors which lies at the intersection of spectral graph theory and signal processing. As a first step, we present a new graph based low-rank decomposition which approximates the classical low-rank S ...

2016

A preconditioned low-rank CG method for parameter-dependent Lyapunov matrix equations

Daniel Kressner, Christine Tobler

This paper is concerned with the numerical solution of symmetric large-scale Lyapunov equations with low-rank right-hand sides and coefficient matrices depending on a parameter. Specifically, we consider the situation when the parameter dependence is suffi ...

Wiley-Blackwell2013