Fast solution of toeplitz systems of equations and computation of Padé approximants
From MaRDI portal
Publication:3930541
DOI10.1016/0196-6774(80)90013-9zbMath0475.65018OpenAlexW2001224529WikidataQ56939241 ScholiaQ56939241MaRDI QIDQ3930541
Richard P. Brent, Fred G. Gustavson, D. Y. Y. Yun
Publication date: 1980
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(80)90013-9
Analysis of algorithms and problem complexity (68Q25) Padé approximation (41A21) Algorithms for approximation of functions (65D15) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Implementing the Tangent Graeffe Root Finding Method, Padé approximation of stieltjes series associated with some freud weights, Stable factorization for Hankel and Hankel‐like matrices, A continuation method for solving symmetric Toeplitz systems, Growth Functions and Automatic Groups, DCT- and DST-based splitting methods for Toeplitz systems, Sylvester-Habicht sequences and fast Cauchy index computation, Chebyshev-Hankel matrices and the splitting approach for centrosymmetric Toeplitz-plus-Hankel matrices, Subquadratic-time factoring of polynomials over finite fields, Parallel output-sensitive algorithms for combinatorial and linear algebra problems, Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm, Eigenvectors of a Toeplitz Matrix: Discrete Version of the Prolate Spheroidal Wave Functions, PARALLEL ALGORITHMS TO COMPUTE THE EIGENVALUES AND EIGENVECTORS OFSYMMETRIC TOEPLITZ MATRICES∗, Explicit Inversion Formulas for Toeplitz Band Matrices, A look-ahead algorithm for the solution of general Hankel systems, The multipoint Padé table and general recurrences for rational interpolation, Polynomial-division-based algorithms for computing linear recurrence relations, A superfast method for solving Toeplitz linear least squares problems., Complexity of multiplication with vectors for structured matrices, Solving composite sum of powers via Padé approximation and orthogonal polynomials with application to optimal PWM problem, Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases, An improved early termination sparse interpolation algorithm for multivariate polynomials, A new algorithm for solving Toeplitz systems of equations, Computing minimal interpolation bases, Fast operations on linearized polynomials and their applications in coding theory, Polynomial division and its computational complexity, A note on solving nearly triangular Toeplitz systems, Inversion of mosaic Hankel matrices via matrix polynomial systems, A fast, preconditioned conjugate gradient Toeplitz and Toeplitz-like solvers, Stability analysis of a general Toeplitz system solver, The weak and strong stability of algorithms in numerical linear algebra, Automatic parameterization of rational curves and surfaces. III: Algebraic plane curves, Parallel computation of polynomial GCD and some related parallel computations over abstract fields, A new application of the extended Euclidean algorithm for matrix Padé approximants, Computing the determinant and the characteristic polynomial of a matrix via solving linear systems of equations, Toeplitz equations and Kronecker's algorithm, A stabilized superfast solver for indefinite Hankel systems, Complexity of computation in finite fields, Classical foundations of algorithms for solving positive definite Toeplitz equations, Wiener-Hopf and spectral factorization of real polynomials by Newton's method, Recursive self preconditioning method based on Schur complement for Toeplitz matrices, Asymptotically fast solution of Toeplitz and related systems of linear equations, Superfast solution of Toeplitz systems based on syzygy reduction, On CSCS-based iteration methods for Toeplitz system of weakly nonlinear equations, Preconditioned GMRES method for a class of Toeplitz linear systems in fractional eigenvalue problems, Toeplitz matrices commuting with tridiagonal matrices, Sparse FGLM algorithms, Matrix Padé approximation: Definitions and properties, On approximation of band-limited signals, Parallel and superfast algorithms for Hankel systems of equations, A note on a Toeplitz inversion formula, New techniques for the computation of linear recurrence coefficients, Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization, Root-finding by expansion with independent constraints, The computation of orthogonal rational functions and their interpolating properties, Lifting/descending processes for polynomial zeros., A class of iteration methods based on the HSS for Toeplitz systems of weakly nonlinear equations, On Computing Factors of Cyclotomic Polynomials, Fast inversion of Hankel and Toeplitz matrices, On the stability of solution methods for band Toeplitz systems, Parallel solution of Toeplitzlike linear systems, Schur complements of Bézoutians and the inversion of block Hankel and block Toeplitz matrices, A superfast algorithm for multi-dimensional Padé systems, Rational solutions of ordinary difference equations, Symmetric subresultants and applications, Toeplitz preconditioners for Hermitian Toeplitz systems, Computing the inertia of Bézout and Hankel matrices, On the complexity of the Lickteig-Roy subresultant algorithm, Rank of a Hankel matrix over \({\mathbb{Z}{}} [x_ 1,{\cdots{}},x_ r\)], Fast algorithms for computing isogenies between elliptic curves, Parametrization of Newton's iteration for computations with structured matrices and applications, A fast, preconditioned conjugate gradient Toeplitz solver, Optimization techniques for small matrix multiplication, Iterative Toeplitz solvers with local quadratic convergence, Inversion components of block Hankel-like matrices, Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding, Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation, On the arithmetic operational complexity for solving Vandermonde linear equations, Improved algorithms for computing determinants and resultants, Efficient parallel factorization and solution of structured and unstructured linear systems, On HSS and AHSS iteration methods for nonsymmetric positive definite Toeplitz systems, Recursive formulation of the matrix Padé approximation in packed storage, Approximate inverse-free preconditioners for Toeplitz matrices, Symbolic iterative algorithm for generalized inversion of rational polynomial matrices, Modification of Rissanen's method in linear memory, Block-Krylov techniques in the context of sparse-FGLM algorithms, Efficient solution of block Toeplitz systems with multiple right-hand sides arising from a periodic boundary element formulation, Inverse of the covariance matrix of an MA(2) process, A new approach to fast polynomial interpolation and multipoint evaluation, Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Toeplitz systems, Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems, A recursive algorithm for matrix Padé approximants --- the divide-and- conquer approach, Power series remainder sequences and Padé fractions over an integral domain, Multi-party threshold private set intersection with sublinear communication, On Elkies subgroups of \(\ell\)-torsion points in elliptic curves defined over a finite field, High-resolution at 3\,T for in vivo derivative NMR spectroscopy in medical diagnostics of ovarian tumor: exact quantification by shape estimations, A fast but unstable orthogonal triangularization technique for Toeplitz matrices, Guessing Gröbner bases of structured ideals of relations of sequences, Recursive partial realization from the combined sequence of Markov parameters and moments, Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros, A simple Hankel interpretation of the Berlekamp-Massey algorithm, Numerical experience with a superfast real Toeplitz solver, Computing Puiseux series: a fast divide and conquer algorithm, The singular-value decomposition of an infinite Hankel matrix, Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey, High-dimensional autocovariance matrices and optimal linear prediction, Computation of approximate polynomial GCDs and an extension, On the eigenvalue problem for Toeplitz band matrices, Anti-Hadamard matrices, Factorization of polynomials and some linear-algebra problems over finite fields, Displacement structure for Hankel, Vandermonde, and related (derived) matrices, A decomposition of Toeplitz matrices and optimal circulant preconditioning, Fast iterative methods for least squares estimations, Quasi-gcd computations
