AbstractWe present a computational procedure for generating formally orthogonal polynomials associated with a given bilinear Hankel form with rectangular matrix-valued moments. Our approach covers the most general case of moments of any size and is not restricted to square moments. Moreover, our algorithm has a built-in deflation procedure to handle linearly dependent or almost linearly dependent columns and rows of the block Hankel matrix associated with the bilinear form. Possible singular or close-to-singular leading principal submatrices of the deflated block Hankel matrix are avoided by means of look-ahead techniques. Applications of the computational procedure to eigenvalue computations, reduced-order modeling, the solution of multipl...
Abstract. Many Hankel determinants computations arising in combinatorial analysis, can be done by re...
AbstractIt is shown that certain sequences of Hankel matrices of finite rank obtained from a given s...
AbstractWe propose a new O(n2) algorithm for solving complex n × n linear systems that have Hankel s...
AbstractWe present a computational procedure for generating formally orthogonal polynomials associat...
Consider a $n \times n$ lower triangular matrix $L$ whose $(i+1)$-st row is defined by the coeffici...
AbstractIt is shown how to construct matrix orthogonal polynomials on the real line provided we have...
AbstractConsider an n × n lower triangular matrix L whose (i + 1)st row is defined by the coefficien...
Classically, formal orthogonal polynomials are studied with respect to a linear functional, which gi...
For classical polynomials orthogonal with respect to a positive measure supported on the real line, ...
AbstractAfter proving that any Hankel matrix generated by moments of positive functions is condition...
We give a framework for formal orthogonal polynomials with respect to an arbitrary moment matrix. Wh...
We use moment representations of orthogonal polynomials to evaluate the corresponding Hankel determi...
We use moment representations of orthogonal polynomials to evaluate the corresponding Hankel determi...
In this paper we consider bilinear forms of matrix polynomials and show that these polynomials can b...
International audienceNew algorithms are presented for computing annihilating polynomials of Toeplit...
Abstract. Many Hankel determinants computations arising in combinatorial analysis, can be done by re...
AbstractIt is shown that certain sequences of Hankel matrices of finite rank obtained from a given s...
AbstractWe propose a new O(n2) algorithm for solving complex n × n linear systems that have Hankel s...
AbstractWe present a computational procedure for generating formally orthogonal polynomials associat...
Consider a $n \times n$ lower triangular matrix $L$ whose $(i+1)$-st row is defined by the coeffici...
AbstractIt is shown how to construct matrix orthogonal polynomials on the real line provided we have...
AbstractConsider an n × n lower triangular matrix L whose (i + 1)st row is defined by the coefficien...
Classically, formal orthogonal polynomials are studied with respect to a linear functional, which gi...
For classical polynomials orthogonal with respect to a positive measure supported on the real line, ...
AbstractAfter proving that any Hankel matrix generated by moments of positive functions is condition...
We give a framework for formal orthogonal polynomials with respect to an arbitrary moment matrix. Wh...
We use moment representations of orthogonal polynomials to evaluate the corresponding Hankel determi...
We use moment representations of orthogonal polynomials to evaluate the corresponding Hankel determi...
In this paper we consider bilinear forms of matrix polynomials and show that these polynomials can b...
International audienceNew algorithms are presented for computing annihilating polynomials of Toeplit...
Abstract. Many Hankel determinants computations arising in combinatorial analysis, can be done by re...
AbstractIt is shown that certain sequences of Hankel matrices of finite rank obtained from a given s...
AbstractWe propose a new O(n2) algorithm for solving complex n × n linear systems that have Hankel s...