Zobrazeno 1 - 10
of 269
pro vyhledávání: '"Vandebril Raf"'
Pole-swapping algorithms, generalizations of bulge-chasing algorithms, have been shown to be a viable alternative to the bulge-chasing QZ algorithm for solving the generalized eigenvalue problem for a matrix pencil A - {\lambda}B. It is natural to tr
Externí odkaz:
http://arxiv.org/abs/2411.17671
Publikováno v:
Special Matrices, Vol 8, Iss 1, Pp 144-159 (2020)
An important decomposition for unitary matrices, the CMV-decomposition, is extended to general non-unitary matrices. This relates to short recurrence relations constructing biorthogonal bases for a particular pair of extended Krylov subspaces.
Externí odkaz:
https://doaj.org/article/6e9735b6fa774b28a96ab488c5c31f58
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 data better in attacking least squares problems, the ill-conditio
Externí odkaz:
http://arxiv.org/abs/2407.05945
Many interesting functions arising in applications map into Riemannian manifolds. We present an algorithm, using the manifold exponential and logarithm, for approximating such functions. Our approach extends approximation techniques for functions int
Externí odkaz:
http://arxiv.org/abs/2403.16785
Often, polynomials or rational functions, orthogonal for a particular inner product are desired. In practical numerical algorithms these polynomials are not constructed, but instead the associated recurrence relations are computed. Moreover, also typ
Externí odkaz:
http://arxiv.org/abs/2302.00355
Autor:
Steel, Thijs, Vandebril, Raf
We present a two-stage algorithm for the parallel reduction of a pencil to Hessenberg-triangular form. Traditionally, two-stage Hessenberg-triangular reduction algorithms achieve high performance in the first stage, but struggle to achieve high perfo
Externí odkaz:
http://arxiv.org/abs/2301.07964
Publikováno v:
Numer Linear Algebra Appl. 2023;e2524
The QZ algorithm computes the Schur form of a matrix pencil. It is an iterative algorithm and at some point, it must decide that an eigenvalue has converged and move on with another one. Choosing a criterion that makes this decision is nontrivial. If
Externí odkaz:
http://arxiv.org/abs/2208.02057
Seriation is a problem consisting of seeking the best enumeration order of a set of units whose interrelationship is described by a bipartite graph, that is, a graph whose nodes are partitioned in two sets and arcs only connect nodes in different gro
Externí odkaz:
http://arxiv.org/abs/2204.03362