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...
10 pages, no figures.-- MSC2000 code: 65F30.MR#: MR1832494 (2002g:44005)Zbl#: Zbl 0980.65049We propo...
AbstractWe propose a matrix algorithm which is the first step towards considering a given matrix as ...
AbstractThe known fast algorithms for computations with general Toeplitz, Hankel, Toeplitz-like, and...
AbstractWe present a computational procedure for generating formally orthogonal polynomials associat...
AbstractConsider an n × n lower triangular matrix L whose (i + 1)st row is defined by the coefficien...
Consider a $n \times n$ lower triangular matrix $L$ whose $(i+1)$-st row is defined by the coeffici...
AbstractIn this paper, the updating formulas used by three look-ahead methods for solving Hankel sys...
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, ...
AbstractIt is shown how to construct matrix orthogonal polynomials on the real line provided we have...
We give a framework for formal orthogonal polynomials with respect to an arbitrary moment matrix. Wh...
AbstractThe aim of this paper is to present an algorithm for computing orthogonal polynomials. The f...
AbstractAfter proving that any Hankel matrix generated by moments of positive functions is condition...
30 pages, no figures.-- MSC2000 codes: 42C05, 30E05, 47A57.MR#: MR2218946 (2006m:47021)Zbl#: Zbl 113...
AbstractThis article presents a new algorithm for obtaining a block diagonalization of Hankel matric...
10 pages, no figures.-- MSC2000 code: 65F30.MR#: MR1832494 (2002g:44005)Zbl#: Zbl 0980.65049We propo...
AbstractWe propose a matrix algorithm which is the first step towards considering a given matrix as ...
AbstractThe known fast algorithms for computations with general Toeplitz, Hankel, Toeplitz-like, and...
AbstractWe present a computational procedure for generating formally orthogonal polynomials associat...
AbstractConsider an n × n lower triangular matrix L whose (i + 1)st row is defined by the coefficien...
Consider a $n \times n$ lower triangular matrix $L$ whose $(i+1)$-st row is defined by the coeffici...
AbstractIn this paper, the updating formulas used by three look-ahead methods for solving Hankel sys...
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, ...
AbstractIt is shown how to construct matrix orthogonal polynomials on the real line provided we have...
We give a framework for formal orthogonal polynomials with respect to an arbitrary moment matrix. Wh...
AbstractThe aim of this paper is to present an algorithm for computing orthogonal polynomials. The f...
AbstractAfter proving that any Hankel matrix generated by moments of positive functions is condition...
30 pages, no figures.-- MSC2000 codes: 42C05, 30E05, 47A57.MR#: MR2218946 (2006m:47021)Zbl#: Zbl 113...
AbstractThis article presents a new algorithm for obtaining a block diagonalization of Hankel matric...
10 pages, no figures.-- MSC2000 code: 65F30.MR#: MR1832494 (2002g:44005)Zbl#: Zbl 0980.65049We propo...
AbstractWe propose a matrix algorithm which is the first step towards considering a given matrix as ...
AbstractThe known fast algorithms for computations with general Toeplitz, Hankel, Toeplitz-like, and...