Fast solution of toeplitz systems of equations and computation of Padé approximants
From MaRDI portal
Publication:3930541
Cited in
(only showing first 100 items - show all)- On Elkies subgroups of \(\ell\)-torsion points in elliptic curves defined over a finite field
- On the eigenvalue problem for Toeplitz band matrices
- Quasi-gcd computations
- A new algorithm for solving Toeplitz systems of equations
- Polynomial division and its computational complexity
- A note on solving nearly triangular Toeplitz systems
- The weak and strong stability of algorithms in numerical linear algebra
- Automatic parameterization of rational curves and surfaces. III: Algebraic plane curves
- 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
- A stabilized superfast solver for indefinite Hankel systems
- Classical foundations of algorithms for solving positive definite Toeplitz equations
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- Toeplitz matrices commuting with tridiagonal matrices
- The computation of orthogonal rational functions and their interpolating properties
- Fast inversion of Hankel and Toeplitz matrices
- On the stability of solution methods for band Toeplitz systems
- Parallel solution of Toeplitzlike linear systems
- A superfast algorithm for multi-dimensional Padé systems
- Computing the inertia of Bézout and Hankel matrices
- Rank of a Hankel matrix over \({\mathbb{Z}{}} [x_ 1,{\cdots{}},x_ r]\)
- Parametrization of Newton's iteration for computations with structured matrices and applications
- A fast, preconditioned conjugate gradient Toeplitz solver
- Iterative Toeplitz solvers with local quadratic convergence
- Inversion components of block Hankel-like matrices
- 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
- Factorization of polynomials and some linear-algebra problems over finite fields
- Fast iterative methods for least squares estimations
- A look-ahead algorithm for the solution of general Hankel systems
- The multipoint Padé table and general recurrences for rational interpolation
- Complexity of multiplication with vectors for structured matrices
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
- An improved early termination sparse interpolation algorithm for multivariate polynomials
- Fast operations on linearized polynomials and their applications in coding theory
- Sparse FGLM algorithms
- On the complexity of the Lickteig-Roy subresultant algorithm
- Improved algorithms for computing determinants and resultants
- A new approach to fast polynomial interpolation and multipoint evaluation
- A fast but unstable orthogonal triangularization technique for Toeplitz matrices
- 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
- The singular-value decomposition of an infinite Hankel matrix
- Computation of approximate polynomial GCDs and an extension
- A superfast method for solving Toeplitz linear least squares problems.
- Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases
- 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
- Recursive self preconditioning method based on Schur complement for Toeplitz matrices
- Superfast solution of Toeplitz systems based on syzygy reduction
- New techniques for the computation of linear recurrence coefficients
- Lifting/descending processes for polynomial zeros.
- 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
- Multi-party threshold private set intersection with sublinear communication
- High-resolution at 3\,T for in vivo derivative NMR spectroscopy in medical diagnostics of ovarian tumor: exact quantification by shape estimations
- Guessing Gröbner bases of structured ideals of relations of sequences
- Computing Puiseux series: a fast divide and conquer algorithm
- Preconditioned GMRES method for a class of Toeplitz linear systems in fractional eigenvalue problems
- On the arithmetic operational complexity for solving Vandermonde linear equations
- Block-Krylov techniques in the context of sparse-FGLM algorithms
- High-dimensional autocovariance matrices and optimal linear prediction
- Symmetric subresultants and applications
- Efficient parallel factorization and solution of structured and unstructured linear systems
- Computing minimal interpolation bases
- Solving composite sum of powers via Padé approximation and orthogonal polynomials with application to optimal PWM problem
- On Computing Factors of Cyclotomic Polynomials
- Fast algorithms for computing isogenies between elliptic curves
- Eigenvectors of a Toeplitz Matrix: Discrete Version of the Prolate Spheroidal Wave Functions
- Explicit Inversion Formulas for Toeplitz Band Matrices
- Complexity of computation in finite fields
- Wiener-Hopf and spectral factorization of real polynomials by Newton's method
- PARALLEL ALGORITHMS TO COMPUTE THE EIGENVALUES AND EIGENVECTORS OFSYMMETRIC TOEPLITZ MATRICES∗
- Padé approximation of stieltjes series associated with some freud weights
- Growth Functions and Automatic Groups
- Subquadratic-time factoring of polynomials over finite fields
- Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm
- Stable factorization for Hankel and Hankel‐like matrices
- DCT- and DST-based splitting methods for Toeplitz systems
- A class of iteration methods based on the HSS for Toeplitz systems of weakly nonlinear equations
- Implementing the tangent Graeffe root finding method
- Optimization techniques for small matrix multiplication
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
- Symbolic iterative algorithm for generalized inversion of rational polynomial matrices
- Sylvester-Habicht sequences and fast Cauchy index computation
- Chebyshev-Hankel matrices and the splitting approach for centrosymmetric Toeplitz-plus-Hankel matrices
- Parallel output-sensitive algorithms for combinatorial and linear algebra problems
- Toeplitz equations and Kronecker's algorithm
- A continuation method for solving symmetric Toeplitz systems
- On CSCS-based iteration methods for Toeplitz system of weakly nonlinear equations
- Taylor polynomials of rational functions
- Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization
- Root-finding by expansion with independent constraints
- Analytical solutions fractional order partial differential equations arising in fluid dynamics
- msolve. A library for solving polynomial systems
This page was built for publication: Fast solution of toeplitz systems of equations and computation of Padé approximants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3930541)
