Look-ahead methods for block Hankel systems (Q1379009): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A multi-step algorithm for Hankel matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Padé-type approximation and general orthogonal polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laurent series and their Padé approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal orthogonal polynomials and Hankel/Toeplitz duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear algebra, rational approximation and orthogonal polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of Numerical Padé–Hermite and Simultaneous Padé Systems I: Near Inversion of Generalized Sylvester Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of Numerical Padé–Hermite and Simultaneous Padé Systems II: A Weakly Stable Algorithm / 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: A look-ahead Levinson algorithm for general Toeplitz systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Look-Ahead Levinson Algorithm for Indefinite Toeplitz Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stabilizing the Generalized Schur Algorithm / 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: A look-ahead Bareiss algorithm for general Toeplitz 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: A look-ahead algorithm for the solution of general Hankel systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4327531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: High performance algorithms for Toeplitz and block Toeplitz matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient solution of linear systems of equations with recursive structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear complexity parallel algorithms for linear systems of equations with recursive structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4764036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable and Efficient Algorithms for Structured Systems of Linear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Look-ahead Levinson- and Schur-type recurrences in the Padé table / rank
 
Normal rank
Property / cites work
 
Property / cites work: Look-ahead Levinson and Schur algorithms for non-Hermitian Toeplitz systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stability of inversion formulas for Toeplitz matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimized look-ahead recurrences for adjacent rows in the Padé table / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4312678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230004 / 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: Q4327532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast projection methods for minimal design problems in linear system theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Displacement Structure: Theory and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast Hankel solver based on an inversion formula for Loewner matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Padé Fractions and Their Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Inverses of Block Hankel and Block Toeplitz Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthonormal polynomial vectors and least squares approximation for a discrete inner product / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-0427(97)00164-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2171586573 / rank
 
Normal rank

Latest revision as of 11:10, 30 July 2024

scientific article
Language Label Description Also known as
English
Look-ahead methods for block Hankel systems
scientific article

    Statements

    Look-ahead methods for block Hankel systems (English)
    0 references
    0 references
    0 references
    24 August 1998
    0 references
    The updating formulas for three look-ahead methods for solving Hankel systems [1. \textit{R. W. Freund} and \textit{H. Zha}, Numer. Math. 64, No. 3, 295-321 (1993; Zbl 0796.65028), 2. \textit{S. Cabay} and \textit{R. Meleshko}, SIAM J. Matrix Anal. Appl. 14, No. 3, 735-765 (1993; Zbl 0779.65009) and 3. \textit{A. W. Bojanczyk} and \textit{G. Heinig}, J. Complexity 10, No. 1, 142-164 (1994; Zbl 0801.65023)] are generalized to the square block case. The authors also show the connections between the above three look-ahead methods for Hankel systems.
    0 references
    block Hankel systems
    0 references
    updating formulas
    0 references
    look-ahead methods
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers