It has been shown that approximate extended Krylov subspaces can be computed, under certain assumptions, without any explicit inversion or system solves. Instead, the vectors …
R Voorhoeve, R de Rozario… - 2016 American Control …, 2016 - ieeexplore.ieee.org
Frequency domain identification is a common starting point for model based motion control. The aim of this paper is to tailor parametric identification methods to the specific class of …
A fast Fortran implementation of a variant of Gragg's unitary Hessenberg QR algorithm is presented. It is proved, moreover, that all QR-and QZ-like algorithms for the unitary …
A general framework for oblique projections of non-Hermitian matrices onto rational Krylov subspaces is developed. To obtain this framework we revisit the classical rational Krylov …
The problem of computing recurrence coefficients of sequences of rational functions orthogonal with respect to a discrete inner product is formulated as an inverse eigenvalue …
A Faghih, M Van Barel, N Van Buggenhout… - arXiv preprint arXiv …, 2024 - arxiv.org
In this research, we solve polynomial, Sobolev polynomial, rational, and Sobolev rational least squares problems. Although the increase in the approximation degree allows us to fit …
The rational Krylov method is a powerful tool for computing a selected subset of eigenvalues in large-scale eigenvalue problems. In this paper we study a method to implicitly apply a …
Dit proefschrift is goedgekeurd door de promotoren en de samenstelling van de promotiecommissie is als volgt: voorzitter: prof. dr. LPH de Goey promotor: prof. dr. ir. M …
Orthogonal rational functions (ORF) on the unit circle generalize orthogonal polynomials (poles at infinity) and Laurent polynomials (poles at zero and infinity). In this paper we …