A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
From MaRDI portal
Publication:4305394
DOI10.1137/S0895479892230031zbMath0805.65008OpenAlexW2018818965MaRDI QIDQ4305394
Bernhard Beckermann, George Labahn
Publication date: 22 January 1995
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895479892230031
Related Items (46)
The multipoint Padé table and general recurrences for rational interpolation ⋮ Polynomial-division-based algorithms for computing linear recurrence relations ⋮ Polynomial-exponential decomposition from moments ⋮ Computing minimal interpolation bases ⋮ Inversion of mosaic Hankel matrices via matrix polynomial systems ⋮ Polynomial evaluation and interpolation on special sets of points ⋮ Algebraic aspects of matrix orthogonality for vector polynomials ⋮ Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix ⋮ Duality in vector Padé-Hermite approximation problems ⋮ A connection of series approximations and the basis of the Krylov space in block algorithms of Coppersmith and Montgomery ⋮ Padé approximant approach to singular properties of quantum gases: the ideal cases ⋮ Transcendence Certificates for D-finite Functions ⋮ Elimination ideal and bivariate resultant over finite fields ⋮ Computing syzygies in finite dimension using fast linear algebra ⋮ Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x\)] ⋮ Trading order for degree in creative telescoping ⋮ Symbolic computations of first integrals for polynomial vector fields ⋮ High-order lifting for polynomial Sylvester matrices ⋮ Efficient algorithms for order basis computation ⋮ Algorithms for simultaneous Hermite-Padé approximations ⋮ Guessing singular dependencies ⋮ Improved power decoding of interleaved one-point Hermitian codes ⋮ Normal forms for general polynomial matrices ⋮ Recursiveness in matrix rational interpolation problems ⋮ Deterministic computation of the characteristic polynomial in the time of matrix multiplication ⋮ A generalized minimal partial realization problem ⋮ Row reduction applied to decoding of rank-metric and subspace codes ⋮ Solving structured linear systems with large displacement rank ⋮ Verification protocols with sub-linear communication for polynomial matrix operations ⋮ A uniform approach for Hermite Padé and simultaneous Padé approximants and their matrix-type generalizations ⋮ Optimization techniques for small matrix multiplication ⋮ Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm ⋮ A Kilobit Hidden SNFS Discrete Logarithm Computation ⋮ Essentially optimal computation of the inverse of generic polynomial matrices ⋮ Asymptotically fast polynomial matrix algorithms for multivariable systems ⋮ Extended rate, more GFUN ⋮ The complete generating function for Gessel walks is algebraic ⋮ Power decoding Reed-Solomon codes up to the Johnson radius ⋮ Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields ⋮ Block-Krylov techniques in the context of sparse-FGLM algorithms ⋮ Fast computation of approximant bases in canonical form ⋮ On asymptotic extrapolation ⋮ Guessing Gröbner bases of structured ideals of relations of sequences ⋮ Unnamed Item ⋮ Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment ⋮ Generalized inverse matrix Padé approximation on the basis of scalar products
This page was built for publication: A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
