Pages that link to "Item:Q3930541"

The following pages link to Fast solution of toeplitz systems of equations and computation of Padé approximants (Q3930541):

Displaying 50 items.

• A fast, preconditioned conjugate gradient Toeplitz solver (Q1205912) (← links)
• Iterative Toeplitz solvers with local quadratic convergence (Q1207049) (← links)
• Inversion components of block Hankel-like matrices (Q1208260) (← links)
• Formally biorthogonal polynomials and a look-ahead Levinson algorithm for general Toeplitz systems (Q1260790) (← links)
• Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems (Q1260793) (← links)
• A recursive algorithm for matrix Padé approximants --- the divide-and- conquer approach (Q1263247) (← links)
• Factorization of polynomials and some linear-algebra problems over finite fields (Q1311328) (← links)
• Fast iterative methods for least squares estimations (Q1319865) (← links)
• A look-ahead algorithm for the solution of general Hankel systems (Q1326405) (← links)
• The multipoint Padé table and general recurrences for rational interpolation (Q1327434) (← links)
• Complexity of multiplication with vectors for structured matrices (Q1329930) (← links)
• Parallel computation of polynomial GCD and some related parallel computations over abstract fields (Q1365930) (← links)
• Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (Q1581129) (← links)
• An improved early termination sparse interpolation algorithm for multivariate polynomials (Q1621169) (← links)
• Fast operations on linearized polynomials and their applications in coding theory (Q1635282) (← links)
• Sparse FGLM algorithms (Q1711988) (← links)
• On the complexity of the Lickteig-Roy subresultant algorithm (Q1757020) (← links)
• Improved algorithms for computing determinants and resultants (Q1763424) (← links)
• A new approach to fast polynomial interpolation and multipoint evaluation (Q1802447) (← links)
• A fast but unstable orthogonal triangularization technique for Toeplitz matrices (Q1822200) (← links)
• Recursive partial realization from the combined sequence of Markov parameters and moments (Q1823203) (← links)
• Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros (Q1824354) (← links)
• A simple Hankel interpretation of the Berlekamp-Massey algorithm (Q1825176) (← links)
• Numerical experience with a superfast real Toeplitz solver (Q1825588) (← links)
• The singular-value decomposition of an infinite Hankel matrix (Q1837517) (← links)
• Computation of approximate polynomial GCDs and an extension (Q1854432) (← links)
• A superfast method for solving Toeplitz linear least squares problems. (Q1874682) (← links)
• Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases (Q1878479) (← links)
• Inversion of mosaic Hankel matrices via matrix polynomial systems (Q1893120) (← links)
• A fast, preconditioned conjugate gradient Toeplitz and Toeplitz-like solvers (Q1903197) (← links)
• Stability analysis of a general Toeplitz system solver (Q1904145) (← links)
• Recursive self preconditioning method based on Schur complement for Toeplitz matrices (Q1944751) (← links)
• Superfast solution of Toeplitz systems based on syzygy reduction (Q1947118) (← links)
• New techniques for the computation of linear recurrence coefficients (Q1971066) (← links)
• Lifting/descending processes for polynomial zeros. (Q1977147) (← links)
• Efficient solution of block Toeplitz systems with multiple right-hand sides arising from a periodic boundary element formulation (Q2040841) (← links)
• Inverse of the covariance matrix of an MA(2) process (Q2043160) (← links)
• Multi-party threshold private set intersection with sublinear communication (Q2061962) (← links)
• High-resolution at 3\,T for in vivo derivative NMR spectroscopy in medical diagnostics of ovarian tumor: exact quantification by shape estimations (Q2065662) (← links)
• Guessing Gröbner bases of structured ideals of relations of sequences (Q2066951) (← links)
• Computing Puiseux series: a fast divide and conquer algorithm (Q2077183) (← links)
• Preconditioned GMRES method for a class of Toeplitz linear systems in fractional eigenvalue problems (Q2204183) (← links)
• On the arithmetic operational complexity for solving Vandermonde linear equations (Q2258368) (← links)
• Block-Krylov techniques in the context of sparse-FGLM algorithms (Q2284956) (← links)
• High-dimensional autocovariance matrices and optimal linear prediction (Q2340876) (← links)
• Symmetric subresultants and applications (Q2470062) (← links)
• Efficient parallel factorization and solution of structured and unstructured linear systems (Q2486566) (← links)
• Computing minimal interpolation bases (Q2628323) (← links)
• On Computing Factors of Cyclotomic Polynomials (Q3137454) (← links)
• Fast algorithms for computing isogenies between elliptic curves (Q3577024) (← links)