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

Concept

Divide-and-conquer eigenvalue algorithm

Publications associées (31)

RANDOMIZED JOINT DIAGONALIZATION OF SYMMETRIC

Daniel Kressner, Haoze He

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

Singular quadratic eigenvalue problems: linearization and weak condition numbers

Daniel Kressner, Ivana Sain Glibic

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

SPRINGER2023

The first Grushin eigenvalue on cartesian product domains

Joachim Stubbe, Luigi Provenzano

In this paper, we consider the first eigenvalue.1(O) of the Grushin operator.G :=.x1 + |x1|2s.x2 with Dirichlet boundary conditions on a bounded domain O of Rd = R d1+ d2. We prove that.1(O) admits a unique minimizer in the class of domains with prescribed ...

WALTER DE GRUYTER GMBH2023

Outlier-free spline spaces for isogeometric discretizations of biharmonic and polyharmonic eigenvalue problems

Espen Sande

We present outlier-free isogeometric Galerkin discretizations of eigenvalue problems related to the biharmonic and the polyharmonic operator in the univariate setting. These are Galerkin discretizations in certain spline subspaces that provide accurate app ...

Elsevier Science Sa2023

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

Andrea Zanoni

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

OXFORD UNIV PRESS2023

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

Alice Cortinovis

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

EPFL2022

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

Complementary Asymptotically Sharp Estimates for Eigenvalue Means of Laplacians

Joachim Stubbe, Luigi Provenzano

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

OXFORD UNIV PRESS2021

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

Edouard Boujo

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

Cambridge University Press2021

Robust Differentiable SVD

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

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

2021

hm-toolbox: MATLAB SOFTWARE FOR HODLR AND HSS MATRICES

Daniel Kressner, Stefano Massei

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

SIAM PUBLICATIONS2020

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

Daniel Kressner, Stefano Massei, Kathryn Dianne Lund

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

2020

hm-toolbox: Matlab software for HODLR and HSS matrices

Daniel Kressner, Stefano Massei

2019

On The Behavior Of Clamped Plates Under Large Compression

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

2019

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

Bifurcation points of a singular boundary-value problem on (0,1)

Charles Stuart

Following earlier work on some special cases [17,11] and on the analogous problem in higher dimensions [10,20], we make a more thorough investigation of the bifurcation points for a nonlinear boundary value problem of the form -{A(x)u' (x)}'.= f (lambda, x ...

Academic Press Inc Elsevier Science2016

On low-rank approximability of solutions to high-dimensional operator equations and eigenvalue problems

Daniel Kressner, André Uschmajew

Low-rank tensor approximation techniques attempt to mitigate the overwhelming complexity of linear algebra tasks arising from high-dimensional applications. In this work, we study the low-rank approximability of solutions to linear systems and eigenvalue p ...

Elsevier Science Inc2016

Accurate, Stable and Efficient Modal Calculations of Photoelectrically Useful Absorption in Lamellar Metallic and Semiconductor Diffraction Gratings

David Isaak Gablinger

Solar energy has seen tremendous advances in the past years. For thin film photovoltaics, which use less of the expensive semiconductor materials, insufficient light absorption can be a limiting factor. It is hoped that by using diffractive optics to impro ...

EPFL2016

Bifurcation at isolated singular points for a degenerate elliptic eigenvalue problem

Charles Stuart

We consider bifurcation from the line of trivial solutions for a nonlinear eigenvalue problem on a bounded open subset, Omega, of R-N with N >= 3, containing 0. The leading term is a degenerate elliptic operator of the form L(u) = del . A del u where A is ...

Pergamon-Elsevier Science Ltd2015