Publications related to Generalized eigenvector

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

Siam Publications2024

Data-driven fixed-structure frequency-based H2 and H∞ controller design

Alireza Karimi, Philippe Louis Schuchert, Vaibhav Gupta

The frequency response data of a generalized system is used to design fixed-structure controllers for the H2 and H∞ synthesis problem. The minimization of the two and infinity norm of the transfer function between the exogenous inputs and performance outpu ...

Elsevier BV2024

Identifiability and Generalizability from Multiple Experts in Inverse Reinforcement Learning

Volkan Cevher, Paul Thierry Yves Rolland, Luca Viano, Boris Nikolov

While Reinforcement Learning (RL) aims to train an agent from a reward function in a given environment, Inverse Reinforcement Learning (IRL) seeks to recover the reward function from observing an expert’s behavior. It is well known that, in general, variou ...

2022

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

Fabrizio Minganti

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

AMER PHYSICAL SOC2022

Isogeometric Mortar Coupling for Electromagnetic Problems

Annalisa Buffa, Rafael Vazquez Hernandez

This paper discusses and analyzes two domain decomposition approaches for electromagnetic problems that allow the combination of domains discretized by either Nédélec-type polynomial finite elements or spline-based isogeometric analysis. The first approach ...

2020

GEFF: Graph embedding for functional fingerprinting

Enrico Amico

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

2020

Phase retrieval in high dimensions: Statistical and computational phase transitions

Florent Gérard Krzakala, Lenka Zdeborová, Bruno Loureiro, Bruno Loureiro

We consider the phase retrieval problem of reconstructing a n -dimensional real or complex signal X ⋆ from m (possibly noisy) observations Y μ = | ∑ n i = 1 Φ μ i X ⋆ i / √ n | , for a large class of correlated real and complex random sensing matrices Φ , ...

Curran Associates, Inc.2020

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

Robert Gerhard Jérôme Luce

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

TAYLOR & FRANCIS LTD2021

Solving Rank-Structured Sylvester And Lyapunov Equations

Stefano Massei

We consider the problem of efficiently solving Sylvester and Lyapunov equations of medium and large scale, in case of rank-structured data, i.e., when the coefficient matrices and the right-hand side have low-rank off-diagonal blocks. This comprises proble ...

SIAM PUBLICATIONS2018

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

Robust and Efficient Data Clustering with Signal Processing on Graphs

Lionel Jérémie Martin

Data is pervasive in today's world and has actually been for quite some time. With the increasing volume of data to process, there is a need for faster and at least as accurate techniques than what we already have. In particular, the last decade recorded t ...

EPFL2018

A generalized definition of reactivity for ecological systems and the problem of transient species dynamics

Andrea Rinaldo, Lorenzo Mari, Marino Gatto

Perturbations to an ecosystem's steady state can trigger transient responses of great ecological relevance. Asymptotic stability determines whether a generic perturbation will fade out in the long run, but falls short of characterizing the dynamics imme ...

Wiley2017

An online intrinsic stabilization strategy for the reduced basis approximation of parametrized advection-dominated problems

Alfio Quarteroni, Andrea Manzoni, Yvon Maday

We propose a new, black-box online stabilization strategy for reduced basis (RB) approximations of parameter-dependent advection-diffusion problems in the advection-dominated case. Our goal is to stabilize the RB problem irrespectively of the stabilization ...

Elsevier France-Editions Scientifiques Medicales Elsevier2016

Low rank differential equations for Hamiltonian matrix nearness problems

Daniel Kressner

For a Hamiltonian matrix with purely imaginary eigenvalues, we aim to determine the nearest Hamiltonian matrix such that some or all eigenvalues leave the imaginary axis. Conversely, for a Hamiltonian matrix with all eigenvalues lying off the imaginary axi ...

Springer2015

A Parallel QZ Algorithm For Distributed Memory HPC Systems

Daniel Kressner

Appearing frequently in applications, generalized eigenvalue problems represent one of the core problems in numerical linear algebra. The QZ algorithm of Moler and Stewart is the most widely used algorithm for addressing such problems. Despite its importan ...

Siam Publications2014

On A Perturbation Bound For Invariant Subspaces Of Matrices

Daniel Kressner

Given a nonsymmetric matrix A, we investigate the effect of perturbations on an invariant subspace of A. The result derived in this paper differs from Stewart's classical result and sometimes yields tighter bounds. Moreover, we provide norm estimates for t ...

Siam Publications2014

Generalized eigenvalue problems with specified eigenvalues

Daniel Kressner

We consider the distance from a (square or rectangular) matrix pencil to the nearest matrix pencil in 2-norm that has a set of specified eigenvalues. We derive a singular value optimization characterization for this problem and illustrate its usefulness fo ...

Oxford University Press2014

Analyse des réseaux de personnages dans Les Confessions de Jean-Jacques Rousseau

Frédéric Kaplan, Yannick Rochat

Cet article étudie le concept de centralité dans les réseaux de personnages apparaissant dans Les Confessions de Jean-Jacques Rousseau. Notre objectif est ainsi de caractériser certains aspects des rôles des personnages du récit sur la base de leurs cooccu ...

2014

Nonlinear Eigenvalue Problems With Specified Eigenvalues

Daniel Kressner

This work considers eigenvalue problems that are nonlinear in the eigenvalue parameter. Given such a nonlinear eigenvalue problem T, we are concerned with finding the minimal backward error such that T has a set of prescribed eigenvalues with prescribed al ...

Siam Publications2014

Odd linking and bifurcation in gaps: the weakly indefinite case

In this paper, we consider nonlinear Schrodinger equations of the following type: -Delta u(x) + V (x) u(x) -q(x)|u(x)|sigma u(x) =lambda u(x), x is an element of R-N, u is an element of H-1(R-N) \ {0}, where N >= 2 and sigma > 0. We concentrate on situatio ...

Royal Society of Edinburgh Scotland Foundation, Cambridge2013