A look-ahead algorithm for the solution of general Hankel systems (Q1326405): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2762882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast solution of toeplitz systems of equations and computation of Padé approximants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laurent series and their Padé approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Weakly Stable Algorithm for Padé Approximants and the Inversion of Hankel Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4170993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynômes orthogonaux formels - applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4016503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Toeplitz systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Padé Table and Its Relation to Certain Algorithms of Numerical Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix interpretations and applications of the continued fraction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fast computation of superdiagonal Padé fractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the partial realization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms, Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods for Toeplitz-like matrices and operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple Hankel interpretation of the Berlekamp-Massey algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3902876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5638871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3723149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shift-register synthesis and BCH decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Triangular Decomposition of Hankel Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of linear equations with Hankel and Toeplitz matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Inversion of Finite Hankel Matrices / rank
 
Normal rank

Latest revision as of 14:57, 22 May 2024

scientific article
Language Label Description Also known as
English
A look-ahead algorithm for the solution of general Hankel systems
scientific article

    Statements

    A look-ahead algorithm for the solution of general Hankel systems (English)
    0 references
    0 references
    0 references
    10 October 1994
    0 references
    The authors present a stable method for solving general nonsingular Hankel systems, using a look-ahead technique to skipover singular or ill- conditioned submatrices. The proposed approach is based on a look-ahead variant of the nonsymmetric Lanczos algorithm in terms of formally orthogonal polynomials, which then yields the look-ahead Hankel solver as a special case. Some general properties of the resulting look-ahead algorithm for formally orthogonal polynomials are proved. These results are then utilized in the implementation of the Hankel solver. Some numerical experiments for Hankel systems with ill-conditioned submatrices are reported.
    0 references
    Hankel systems
    0 references
    ill-conditioned submatrices
    0 references
    nonsymmetric Lanczos algorithm
    0 references
    look-ahead algorithm
    0 references
    numerical experiment
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers