The following pages link to (Q4314299):
Displaying 50 items.
- A fast block Hankel solver based on an inversion formula for block Loewner matrices (Q1127943) (← links)
- Techniques for exploiting structure in matrix formulae of the sparse resultant (Q1127958) (← links)
- Multidimensional structured matrices and polynomial systems (Q1127960) (← links)
- New fast algorithms for polynomial interpolation and evaluation on the Chebyshev node set (Q1129510) (← links)
- Fast rectangular matrix multiplication and applications (Q1271174) (← links)
- Sign determination in residue number systems (Q1274813) (← links)
- A new efficient algorithm for computing Gröbner bases \((F_4)\) (Q1295781) (← links)
- Finding the radical of matrix algebras using Fitting decompositions (Q1295786) (← links)
- Representations of Toeplitz-plus-Hankel martrices using trigonometric transformations with application to fast matrix-vector multiplication (Q1307205) (← links)
- Improved parallel solution of a triangular linear system (Q1328830) (← links)
- Computations with infinite Toeplitz matrices and polynomials (Q1348083) (← links)
- Fast direct solution methods for symmetric banded Toeplitz systems, based on the sine transform (Q1348093) (← links)
- Structured matrices and Newton's iteration: unified approach (Q1348095) (← links)
- Newton's iteration for inversion of Cauchy-like and other structured matrices (Q1361881) (← links)
- Displacement-structure approach to polynomial Vandermonde and related matrices (Q1362652) (← links)
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields (Q1365930) (← links)
- Algebraic and numerical techniques for the computation of matrix determinants (Q1368466) (← links)
- New PCG based algorithms for the solution of Hermitian Toeplitz systems (Q1373474) (← links)
- Matrix displacement decompositions and applications to Toeplitz linear systems (Q1375094) (← links)
- Factorizations of Cauchy matrices (Q1378995) (← links)
- Inverting block Toeplitz matrices in block Hessenberg form by means of displacement operators: Application to queueing problems (Q1379101) (← links)
- Parallel algorithms for certain matrix computations (Q1390874) (← links)
- Computing the sign or the value of the determinant of an integer matrix, a complexity survey. (Q1421221) (← links)
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding (Q1433125) (← links)
- Non-skip-free M/G/1-type Markov chains and Laurent matrix power series (Q1434422) (← links)
- Condition number bounds for problems with integer coefficients (Q1594828) (← links)
- Predicting zero coefficients in formal power series computations. (Q1599549) (← links)
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices (Q1600039) (← links)
- New transformations of Cauchy matrices and Trummer's problem (Q1608424) (← links)
- Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits (Q1630382) (← links)
- The complexity of computing all subfields of an algebraic number field (Q1733310) (← links)
- \(h\)-adic polynomials and partial fraction decomposition of proper rational functions over \(\mathbb{R}\) or \(\mathbb{C}\) (Q1751328) (← links)
- Various new expressions for subresultants and their applications (Q1762553) (← links)
- On solving univariate sparse polynomials in logarithmic time (Q1763426) (← links)
- Computing Moore-Penrose inverses of Toeplitz matrices by Newton's iteration (Q1764965) (← links)
- An efficient solution for Cauchy-like systems of linear equations (Q1767958) (← links)
- Newton-like iteration based on a cubic polynomial for structured matrices (Q1768394) (← links)
- A family of modified regularizing circulant preconditioners for two-levels Toeplitz systems (Q1770650) (← links)
- The Sylvester and Bézout resultant matrices for blind image deconvolution (Q1799667) (← links)
- Matrices in elimination theory (Q1808659) (← links)
- Solving degenerate sparse polynomial systems faster (Q1808666) (← links)
- A fast Hankel solver based on an inversion formula for Loewner matrices (Q1809103) (← links)
- Load-balanced parallel banded-system solvers. (Q1853531) (← links)
- Computation of approximate polynomial GCDs and an extension (Q1854432) (← links)
- Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices (Q1864875) (← links)
- A superfast solver for Sylvester's resultant linear systems generated by a stable and an anti-stable polynomial (Q1874670) (← links)
- Fast computation of discrete invariants associated to a differential rational mapping (Q1878484) (← links)
- Split algorithms for Hermitian Toeplitz matrices with arbitrary rank profile (Q1887505) (← links)
- An algebraic approach to approximate evaluation of a polynomial on a set of real points (Q1899278) (← links)
- Parallel computation of a Krylov matrix for a sparse and structured input (Q1900259) (← links)
