Raf Vandebril

Julien Langou

Numer. Linear Algebra Appl., January, 2024

Parallel Two-Stage Reduction to Hessenberg-Triangular Form.

[BibT_eX]

[DOI]

Thijs Steel

SIAM J. Sci. Comput., 2024

An Arnoldi-based approach to polynomial and rational least squares problems.

[BibT_eX]

[DOI]

CoRR, 2024

Approximating maps into manifolds with lower curvature bounds.

[BibT_eX]

[DOI]

CoRR, 2024

2023

The seriation problem in the presence of a double Fiedler value.

[BibT_eX]

[DOI]

Numer. Algorithms, January, 2023

Algorithms for Modifying Recurrence Relations of Orthogonal Polynomial and Rational Functions when Changing the Discrete Inner Product.

[BibT_eX]

[DOI]

Niel Van Buggenhout

CoRR, 2023

2022

Generation of orthogonal rational functions by procedures for structured matrices.

[BibT_eX]

[DOI]

Niel Van Buggenhout

Numer. Algorithms, 2022

2021

A Multishift, Multipole Rational QZ Method with Aggressive Early Deflation.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2021

2020

Swapping 2 × 2 blocks in the Schur and generalized Schur form.

[BibT_eX]

[DOI]

J. Comput. Appl. Math., 2020

2019

A Rational QZ Method.

[BibT_eX]

[DOI]

Daan Camps

Karl Meerbergen

SIAM J. Matrix Anal. Appl., 2019

When is a matrix unitary or Hermitian plus low rank?

[BibT_eX]

[DOI]

Numer. Linear Algebra Appl., 2019

Fast and backward stable computation of eigenvalues and eigenvectors of matrix polynomials.

[BibT_eX]

[DOI]

Math. Comput., 2019

Structured backward errors in linearizations.

[BibT_eX]

[DOI]

Vanni Noferini

Leonardo Robol

CoRR, 2019

Pole-swapping algorithms for alternating and palindromic eigenvalue problems.

[BibT_eX]

[DOI]

Thomas Mach

David S. Watkins

CoRR, 2019

On pole-swapping algorithms for the eigenvalue problem.

[BibT_eX]

[DOI]

CoRR, 2019

2018

On an Economic Arnoldi Method for BML-Matrices.

[BibT_eX]

[DOI]

Bernhard Beckermann

Clara Mertens

SIAM J. Matrix Anal. Appl., 2018

Fast and Backward Stable Computation of Roots of Polynomials, Part II: Backward Error Analysis; Companion Matrix and Companion Pencil.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2018

2017

A Framework for Structured Linearizations of Matrix Polynomials in Various Bases.

[BibT_eX]

[DOI]

Leonardo Robol

Paul Van Dooren

SIAM J. Matrix Anal. Appl., 2017

2016

The Kähler Mean of Block-Toeplitz Matrices with Toeplitz Structured Blocks.

[BibT_eX]

[DOI]

Ben Jeuris

SIAM J. Matrix Anal. Appl., 2016

Adaptive cross approximation for ill-posed problems.

[BibT_eX]

[DOI]

J. Comput. Appl. Math., 2016

2015

Computing the Gradient in Optimization Algorithms for the CP Decomposition in Constant Memory through Tensor Blocking.

[BibT_eX]

[DOI]

Nick Vannieuwenhoven

Karl Meerbergen

SIAM J. Sci. Comput., 2015

Fast and Backward Stable Computation of Roots of Polynomials.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2015

Short recurrences for computing extended Krylov bases for Hermitian and unitary matrices.

[BibT_eX]

[DOI]

Clara Mertens

Numerische Mathematik, 2015

2014

Multiple Recurrences and the Associated Matrix Structures Stemming From Normal Matrices.

[BibT_eX]

[DOI]

Clara Mertens

SIAM J. Numer. Anal., 2014

On Generic Nonexistence of the Schmidt-Eckart-Young Decomposition for Complex Tensors.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2014

On Deflations in Extended QR Algorithms.

[BibT_eX]

[DOI]

Thomas Mach

SIAM J. Matrix Anal. Appl., 2014

A comparison between the complex symmetric based and classical computation of the singular value decomposition of normal matrices.

[BibT_eX]

[DOI]

Micol Ferranti

Thanh Hieu Le

Numer. Algorithms, 2014

Inverse eigenvalue problems for extended Hessenberg and extended tridiagonal matrices.

[BibT_eX]

[DOI]

Thomas Mach

J. Comput. Appl. Math., 2014

Computing eigenvalues of normal matrices via complex symmetric matrices.

[BibT_eX]

[DOI]

Micol Ferranti

J. Comput. Appl. Math., 2014

Introduction to the special issue.

[BibT_eX]

[DOI]

J. Comput. Appl. Math., 2014

Protein fold recognition using geometric kernel data fusion.

[BibT_eX]

[DOI]

Bioinform., 2014

2013

Fast Computation of the Zeros of a Polynomial via Factorization of the Companion Matrix.

[BibT_eX]

[DOI]

Jared Lee Aurentz

David S. Watkins

SIAM J. Sci. Comput., 2013

Geometric Mean Algorithms Based on Harmonic and Arithmetic Iterations.

[BibT_eX]

[DOI]

Ben Jeuris

Proceedings of the Geometric Science of Information - First International Conference, 2013

2012

A New Truncation Strategy for the Higher-Order Singular Value Decomposition.

[BibT_eX]

[DOI]

Nick Vannieuwenhoven

Karl Meerbergen

SIAM J. Sci. Comput., 2012

A Generalization of the Multishift QR Algorithm.

[BibT_eX]

[DOI]

David S. Watkins

SIAM J. Matrix Anal. Appl., 2012

2011

Chasing Bulges or Rotations? A Metamorphosis of the QR-Algorithm.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2011

A unification of unitary similarity transforms to compressed representations.

[BibT_eX]

[DOI]

Gianna M. Del Corso

Numerische Mathematik, 2011

A unitary similarity transform of a normal matrix to complex symmetric form.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2011

2010

An Implicit Multishift QR-Algorithm for Hermitian Plus Low Rank Matrices.

[BibT_eX]

[DOI]

Gianna M. Del Corso

SIAM J. Sci. Comput., 2010

On the Convergence of Rational Ritz Values.

[BibT_eX]

[DOI]

Bernhard Beckermann

Stefan Güttel

SIAM J. Matrix Anal. Appl., 2010

Implicit double shift QR-algorithm for companion matrices.

[BibT_eX]

[DOI]

Numerische Mathematik, 2010

A multiple shift QR-step for structured rank matrices.

[BibT_eX]

[DOI]

J. Comput. Appl. Math., 2010

2009

A Quasi-Separable Approach to Solve the Symmetric Definite Tridiagonal Generalized Eigenvalue Problem.

[BibT_eX]

[DOI]

Gene H. Golub

SIAM J. Matrix Anal. Appl., 2009

2008

Rational QR-iteration without inversion.

[BibT_eX]

[DOI]

Numerische Mathematik, 2008

A fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix.

[BibT_eX]

[DOI]

Numer. Linear Algebra Appl., 2008

2006

On the convergence properties of the orthogonal similarity transformations to tridiagonal and semiseparable (plus diagonal) form.

[BibT_eX]

[DOI]

Numerische Mathematik, 2006

Orthogonal similarity transformation of a symmetric matrix into a diagonal-plus-semiseparable one with free choice of the diagonal.

[BibT_eX]

[DOI]

Numerische Mathematik, 2006

A small note on the scaling of symmetric positive definite semiseparable matrices.

[BibT_eX]

[DOI]

Gene H. Golub

Numer. Algorithms, 2006

Inverse eigenvalue probems: Theory, algorithms, and applications.

[BibT_eX]

[DOI]

Math. Comput., 2006

2005

An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2005

A note on the representation and definition of semiseparable matrices.

[BibT_eX]

[DOI]

Numer. Linear Algebra Appl., 2005

An implicit QR algorithm for symmetric semiseparable matrices.

[BibT_eX]

[DOI]

Numer. Linear Algebra Appl., 2005

A note on the recursive calculation of dominant singular subspaces.

[BibT_eX]

[DOI]

Numer. Algorithms, 2005

2004

A QR-method for computing the singular values via semiseparable matrices.

[BibT_eX]

[DOI]