The following pages link to Victor Y. Pan (Q163211):
Displaying 50 items.
- Inversion of Displacement Operators (Q4443765) (← links)
- Parallel Complexity of Computations with General and Toeplitz-Like Matrices Filled with Integers and Extensions (Q4507386) (← links)
- (Q4526980) (← links)
- Asymptotic acceleration of solving multivariate polynomial systems of equations (Q4542568) (← links)
- (Q4552349) (← links)
- Parallel matrix multiplication on a linear array with a reconfigurable pipelined bus system (Q4571333) (← links)
- Simple and Nearly Optimal Polynomial Root-Finding by Means of Root Radii Approximation (Q4610020) (← links)
- Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
- On Rational Number Reconstruction and Approximation (Q4651477) (← links)
- Acceleration of Euclidean algorithm and extensions (Q4660706) (← links)
- Accelerated Solution of Multivariate Polynomial Systems of Equations (Q4706200) (← links)
- Acceleration of Euclidean Algorithm and Rational Number Reconstruction (Q4706218) (← links)
- (Q4717956) (← links)
- Fast parallel algorithms for polynomial division over an arbitrary field of constants (Q4723298) (← links)
- (Q4736841) (← links)
- The additive and logical complexities of linear and bilinear arithmetic algorithms (Q4747514) (← links)
- (Q4763399) (← links)
- (Q4789200) (← links)
- (Q4789203) (← links)
- Work-Preserving Speed-Up of Parallel Matrix Computations (Q4852625) (← links)
- (Q4875226) (← links)
- (Q4938647) (← links)
- (Q4952723) (← links)
- Fast Approximate Computations with Cauchy Matrices, Polynomials and Rational Functions (Q4981167) (← links)
- CUR LRA at Sublinear Cost Based on Volume Maximization (Q5014668) (← links)
- New Practical Advances in Polynomial Root Clustering (Q5014669) (← links)
- New progress in univariate polynomial root finding (Q5145980) (← links)
- Polynomial Evaluation and Interpolation and Transformations of Matrix Structures (Q5168481) (← links)
- (Q5185922) (← links)
- Randomized preconditioning of the MBA algorithm (Q5254184) (← links)
- Fast approximate computations with Cauchy matrices and polynomials (Q5270834) (← links)
- Computational complexity of computing polynomials over the fields of real and complex numbers (Q5402553) (← links)
- (Q5460924) (← links)
- (Q5510305) (← links)
- (Q5512301) (← links)
- On simultaneous evaluation of several polynomials of low degree (two to five) (Q5523241) (← links)
- (Q5538004) (← links)
- On simultaneous evaluation of several polynomials of low degree (two to five) (Q5542524) (← links)
- (Q5560620) (← links)
- (Q5676984) (← links)
- Homotopic residual correction processes (Q5713233) (← links)
- Schemes using preliminary treatment of coefficients for polynomial calculation. A program for automatic determination of parameters (Q5722563) (← links)
- (Q5724925) (← links)
- Nearly optimal computations with structured matrices (Q5890872) (← links)
- Nearly optimal computations with structured matrices (Q5919809) (← links)
- Computation of a specified root of a polynomial system of equations using eigenvectors (Q5926400) (← links)
- Certification of numerical computation of the sign of the determinant of a matrix (Q5940606) (← links)
- A new proximity test for polynomial zeros (Q5948808) (← links)
- Estimating the Norms of Random Circulant and Toeplitz Matrices and Their Inverses (Q6246490) (← links)
- New practical advances in polynomial root clustering (Q6329249) (← links)
