Power series remainder sequences and Padé fractions over an integral domain

DOI10.1016/S0747-7171(08)80038-7zbMath0712.68056MaRDI QIDQ749215

D. Kharzeev

Publication date: 1990

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

Hankel and Toeplitz matricesPade approximants

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (4)

A superfast solver for Sylvester's resultant linear systems generated by a stable and an anti-stable polynomial ⋮ A hybrid approach to the computation of the inertia of a parametric family of Bézoutians with application to some stability problems for bivariate polynomials ⋮ Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation ⋮ Computing high precision matrix Padé approximants

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new algorithm for solving Toeplitz systems of equations
• Asymptotically fast solution of Toeplitz and related systems of linear equations
• Solution of linear equations with Hankel and Toeplitz matrices
• Numerical solution of linear equations with Toeplitz and vector Toeplitz matrices
• The Inverses of Block Hankel and Block Toeplitz Matrices
• Stability of Methods for Solving Toeplitz Systems of Equations
• A fast algorithm for solving a Toeplitz system of equations
• A Proposal for Toeplitz Matrix Calculations
• Algebraic Computations of Scaled Padé Fractions
• An Optimal Circulant Preconditioner for Toeplitz Systems
• Superfast Solution of Real Positive Definite Toeplitz Systems
• The Numerical Stability of the Levinson-Durbin Algorithm for Toeplitz Systems of Equations
• Fast solution of toeplitz systems of equations and computation of Padé approximants
• The symbolic finite element analysis system
• A Property of Euclid’s Algorithm and an Application to Padé Approximation
• The Subresultant PRS Algorithm
• Symbolic Computation of Padé Approximants
• An Algorithm for the Inversion of Finite Toeplitz Matrices
• Subresultants and Reduced Polynomial Remainder Sequences
• Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• On Euclid's Algorithm and the Theory of Subresultants
• The Padé Table and Its Relation to Certain Algorithms of Numerical Analysis

This page was built for publication: Power series remainder sequences and Padé fractions over an integral domain