Publication

A Householder-Based Algorithm For Hessenberg-Triangular Reduction

Publications associées (48)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

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

Block-Floating-Point Enhanced MMSE Filter Matrix Computation for MIMO-OFDM Communication Systems

Andreas Peter Burg, Carl Christian Sten Dominic Senning

n this paper we present an architecture for an MMSE ﬁlter matrix computation unit for signal detection in MIMO-OFDM communication systems. We propose to compute the required matrix inverse based on a Cholesky decomposition, followed by a Gauss-Jordan matri ...

2013

, ,

Binary descriptors allow faster similarity computation than real-valued ones while requiring much less storage. As a result, many algorithms have recently been proposed to binarize ﬂoating-point descriptors so that they can be searched for quickly. Unfortu ...

Elsevier2012

Chebyshev interpolation for nonlinear eigenvalue problems

Daniel Kressner, Peter Cedric Effenberger

This work is concerned with numerical methods for matrix eigenvalue problems that are nonlinear in the eigenvalue parameter. In particular, we focus on eigenvalue problems for which the evaluation of the matrix-valued function is computationally expensive. ...

Springer Netherlands2012

Linearization techniques for band structure calculations in absorbing photonic crystals

Daniel Kressner, Peter Cedric Effenberger

Band structure calculations for photonic crystals require the numerical solution of eigenvalue problems. In this paper, we consider crystals composed of lossy materials with frequency-dependent permittivities. Often, these frequency dependencies are modele ...

2011

Invariant pairs have been proposed as a numerically robust means to represent and compute several eigenvalues along with the corresponding (generalized) eigenvectors for matrix eigenvalue problems that are nonlinear in the eigenvalue parameter. In this wor ...

Springer-Verlag2011

Computing Codimensions And Generic Canonical Forms For Generalized Matrix Products

Daniel Kressner, Bo Kågström

A generalized matrix product can be formally written as Lambda(sp)(p) Lambda(sp-1)(p-1) ... Lambda(s2)(2) Lambda(s1)(1) where s(i) is an element of {- 1,+ 1} and ( A(1), ..., A(p)) is a tuple of ( possibly rectangular) matrices of suitable dimensions. The ...

International Linear Algebra Society2011

We investigate the performance of the routines in LAPACK and the Successive Band Reduction (SBR) toolbox for the reduction of a dense matrix to tridiagonal form, a crucial preprocessing stage in the solution of the symmetric eigenvalue problem, on general- ...

Springer, New York2010

On the computation of structured singular values and pseudospectra

Daniel Kressner, Effrosyni Kokiopoulou

Structured singular values and pseudospectra play an important role in assessing the properties of a linear system under structured perturbations. This paper discusses computational aspects of structured pseudospectra for structures that admit an eigenvalu ...

2010

Implicit QR algorithms for palindromic and even eigenvalue problems

Daniel Kressner

In the spirit of the Hamiltonian QR algorithm and other bidirectional chasing algorithms, a structure-preserving variant of the implicit QR algorithm for palindromic eigenvalue problems is proposed. This new palindromic QR algorithm is strongly backward st ...

Springer Verlag2009