The following pages link to (Q4314299):
Displaying 50 items.
- A note on computing the inverse of a triangular Toeplitz matrix (Q273349) (← links)
- Solving composite sum of powers via Padé approximation and orthogonal polynomials with application to optimal PWM problem (Q273361) (← links)
- On a class of matrix pencils and \(\ell\)-ifications equivalent to a given matrix polynomial (Q281981) (← links)
- Computing the exponential of large block-triangular block-Toeplitz matrices encountered in fluid queues (Q281989) (← links)
- New studies of randomized augmentation and additive preprocessing (Q332656) (← links)
- Efficient polynomial root-refiners: a survey and new record efficiency estimates (Q418325) (← links)
- A geometric algorithm for winding number computation with complexity analysis (Q423881) (← links)
- Bernstein Bézoutians and application to intersection problems (Q426192) (← links)
- A relaxation scheme for increasing the parallelism in Jacobi-SVD (Q436787) (← links)
- Finding strong bridges and strong articulation points in linear time (Q443716) (← links)
- Solving linear systems of equations with randomization, augmentation and aggregation (Q454828) (← links)
- A heuristic verification of the degree of the approximate GCD of two univariate polynomials (Q466858) (← links)
- Transformations of matrix structures work again (Q471925) (← links)
- New progress in real and complex polynomial root-finding (Q552308) (← links)
- Matrix structure and loss-resilient encoding/decoding (Q597244) (← links)
- Bernstein-Bézoutian matrices (Q598205) (← links)
- Polynomial equation solving by lifting procedures for ramified fibers (Q598210) (← links)
- Split algorithms for skewsymmetric Toeplitz matrices with arbitrary rank profile (Q598217) (← links)
- Matrix algebra preconditioners for multilevel Toeplitz systems do not insure optimal convergence rate (Q598222) (← links)
- Iterative inversion of structured matrices (Q598225) (← links)
- Asymptotically fast solution of two-level banded Toeplitz systems of linear equations (Q611173) (← links)
- Matrix computations and polynomial root-finding with preprocessing (Q624343) (← links)
- Dynamic normal forms and dynamic characteristic polynomial (Q633626) (← links)
- A subdivision method for computing nearest gcd with certification (Q638509) (← links)
- Generalized fraction-free \(LU\) factorization for singular systems with kernel extraction (Q648916) (← links)
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers (Q652454) (← links)
- Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. I: Transformations (Q677911) (← links)
- Diagonal pivoting for partially reconstructible Cauchy-like matrices, with applications to Toeplitz-like linear equations and to boundary rational matrix interpolation problems (Q677917) (← links)
- On the kernel structure of generalized resultant matrices (Q692591) (← links)
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
- On the complexities of multipoint evaluation and interpolation (Q706626) (← links)
- An application of matrix computations to classical second-order optimality conditions (Q732782) (← links)
- An algorithm for implicit interpolation (Q744017) (← links)
- Bezout matrices, subresultant polynomials and parameters (Q833155) (← links)
- Computing curve intersection by means of simultaneous iterations (Q861738) (← links)
- Bernstein-Bezoutian matrices and curve implicitization (Q884463) (← links)
- Nearly optimal refinement of real roots of a univariate polynomial (Q898253) (← links)
- Optimal Karatsuba-like formulae for certain bilinear forms in GF(2) (Q947669) (← links)
- Degeneration of structured integer matrices modulo an integer (Q947675) (← links)
- Solving structured linear systems with large displacement rank (Q954988) (← links)
- Fast computation of determinants of Bézout matrices and application to curve implicitization (Q957991) (← links)
- Computing the block factorization of complex Hankel matrices (Q971932) (← links)
- On sign conditions over real multivariate polynomials (Q977180) (← links)
- Tensor ranks for the inversion of tensor-product binomials (Q989123) (← links)
- Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem (Q990817) (← links)
- A computational study of ruled surfaces (Q1006652) (← links)
- Deformation techniques for sparse systems (Q1029552) (← links)
- Matrix inversion cases with size-independent tensor rank estimates (Q1030721) (← links)
- Fast fraction-free triangularization of Bézoutians with applications to sub-resultant chain computation (Q1124757) (← links)
- A stabilized superfast solver for indefinite Hankel systems (Q1124777) (← links)
