The following pages link to Victor Y. Pan (Q163211):
Displaying 50 items.
- 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)
- The bit-operation complexity of matrix multiplication and of all pair shortest path problem (Q1152952) (← links)
- New combinations of methods for the acceleration of matrix multiplication (Q1154805) (← links)
- The lower bounds on the additive complexity of bilinear problems in terms of some algebraic quantities (Q1157165) (← links)
- Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication (Q1158927) (← links)
- The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic (Q1165575) (← links)
- Fast matrix multiplication without APA-algorithms (Q1168050) (← links)
- Methods of aggregation (Q1170003) (← links)
- On practical algorithms for accelerated matrix multiplication (Q1183208) (← links)
- The parallel computation of minimum cost paths in graphs by stream contraction (Q1183440) (← links)
- On the evaluation of the eigenvalues of a banded Toeplitz block matrix (Q1186509) (← links)
- Extended concept of significant digits and lower precision computations (Q1186953) (← links)
- Parallel solution of Toeplitzlike linear systems (Q1190529) (← links)
- Practical improvement of the divide-and-conquer eigenvalue algorithms (Q1192014) (← links)
- Polynomial division with a remainder by means of evaluation and interpolation (Q1205721) (← links)
- Parametrization of Newton's iteration for computations with structured matrices and applications (Q1205895) (← links)
- A fast, preconditioned conjugate gradient Toeplitz solver (Q1205912) (← links)
- Improving the solution of the symmetric eigenvalue problem and an extension (Q1206210) (← links)
- Improved parallel computations with Toeplitz-like and Hankel-like matrices (Q1260780) (← links)
- Improved processor bounds for combinatorial problems in RNC (Q1262128) (← links)
- Modular arithmetic for linear algebra computations in the real field (Q1264434) (← links)
- Fast rectangular matrix multiplication and applications (Q1271174) (← links)
- Sign determination in residue number systems (Q1274813) (← links)
- A new algorithm for the symmetric tridiagonal eigenvalue problem (Q1311389) (← links)
- Improved parallel solution of a triangular linear system (Q1328830) (← links)
- Algebraic improvements of numerical algorithms: Interpolation and economization of Taylor series (Q1334738) (← links)
- Simple multivariate polynomial multiplication (Q1346473) (← 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)
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields (Q1365930) (← links)
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding (Q1433125) (← links)
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices (Q1600039) (← links)
- Implementation of a near-optimal complex root clustering algorithm (Q1662242) (← links)
- Improved algorithms for computing determinants and resultants (Q1763424) (← 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)
- Improved initialization of the accelerated and robust QR-like polynomial root-finding (Q1772043) (← links)
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations (Q1780608) (← links)
- Generalized compact multi-grid (Q1802442) (← links)
- A new approach to fast polynomial interpolation and multipoint evaluation (Q1802447) (← links)
- Single precision computation of the sign of algebraic predicates (Q1808577) (← links)
- Fast finite methods for a system of linear inequalities (Q1819897) (← links)
- Efficient parallel linear programming (Q1821686) (← links)
- Fast and efficient parallel evaluation of the zeros of a polynomial having only real zeros (Q1824354) (← links)
- Fast and efficient solution of path algebra problems (Q1824392) (← links)
- Fast and efficient parallel solution of dense linear systems (Q1825589) (← links)
- Computation of approximate polynomial GCDs and an extension (Q1854432) (← links)
- On parallel computations with banded matrices (Q1898464) (← links)
