Publication

Block algorithms for reordering standard and generalized Schur forms

Daniel Kressner
2006
Journal paper

Abstract

Block algorithms for reordering a selected set of eigenvalues in a standard or generalized Schur form are proposed. Efficiency is achieved by delaying orthogonal transformations and (optionally) making use of level 3 BLAS operations. Numerical experiments demonstrate that existing algorithms, as currently implemented in LAPACK, are outperformed by up to a factor of four.

Official source

https://infoscience.epfl.ch/record/165574?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Block algorithms for reordering standard and generalized Schur forms

Graph Chatbot

Chat with Graph Search

Singular quadratic eigenvalue problems: linearization and weak condition numbers

A mixed precision LOBPCG algorithm

Iterative refinement of Schur decompositions

A mixed precision LOBPCG algorithm

Iterative refinement of Schur decompositions

Singular quadratic eigenvalue problems: linearization and weak condition numbers