The following pages link to Pan, Victor Y. (Q163211):
Displaying 50 items.
- (Q196660) (redirect page) (← links)
- (Q418324) (redirect page) (← links)
- Efficient polynomial root-refiners: a survey and new record efficiency estimates (Q418325) (← links)
- A note on the paper ``Multiplication of polynomials modulo \(x^n\)'' by Murat Cenk and Ferruh Özbudak (Q418751) (← links)
- Solving linear systems of equations with randomization, augmentation and aggregation (Q454828) (← links)
- Transformations of matrix structures work again (Q471925) (← links)
- New progress in real and complex polynomial root-finding (Q552308) (← links)
- The projective power method for the algebraic eigenvalue problem (Q585649) (← links)
- Matrix structure and loss-resilient encoding/decoding (Q597244) (← links)
- Iterative inversion of structured matrices (Q598225) (← links)
- Matrix computations and polynomial root-finding with preprocessing (Q624343) (← links)
- Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization (Q660795) (← links)
- Root-finding by expansion with independent constraints (Q662237) (← links)
- Computing \(x^ m\mod p(x)\) and an application to splitting a polynomial into factors over a fixed disc (Q674751) (← links)
- Efficient parallel algorithms for computing all pair shortest paths in directed graphs (Q676269) (← links)
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding (Q697493) (← links)
- (Q753417) (redirect page) (← links)
- Estimating the extremal eigenvalues of a symmetric matrix (Q753418) (← links)
- (Q799336) (redirect page) (← links)
- How to multiply matrices faster (Q799337) (← links)
- The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations (Q800727) (← links)
- Coefficient-free adaptations of polynomial root-finders (Q814095) (← links)
- Root radii and subdivision for polynomial root-finding (Q831975) (← links)
- Additive preconditioning for matrix computations (Q846341) (← links)
- Nearly optimal refinement of real roots of a univariate polynomial (Q898253) (← links)
- Fast evaluation and interpolation at the Chebyshev sets of points (Q918113) (← links)
- The modified barrier function method for linear programming and its extensions (Q918138) (← links)
- The bit-complexity of discrete solutions of partial differential equations: Compact multigrid (Q922664) (← links)
- Fast rectangular matrix multiplication and some applications (Q931517) (← links)
- Degeneration of structured integer matrices modulo an integer (Q947675) (← links)
- Eigen-solving via reduction to DPR1 matrices (Q950043) (← links)
- Additive preconditioning, eigenspaces, and the inverse iteration (Q958010) (← links)
- Randomized preprocessing of homogeneous linear systems of equations (Q968998) (← links)
- New homotopic/factorization and symmetrization techniques for Newton's and Newton/structured iteration (Q1005809) (← links)
- A new error-free floating-point summation algorithm (Q1029843) (← links)
- On the complexity of a pivot step of the revised simplex algorithm (Q1068713) (← links)
- The trade-off between the additive complexity and the asynchronicity of linear and bilinear algorithms (Q1069699) (← links)
- Fast parallel polynomial division via reduction to triangular Toeplitz matrix inversion and to polynomial inversion modulo a power (Q1085949) (← links)
- On application of some recent techniques of the design of algebraic algorithms to the sequential and parallel evaluation of the roots of a polynomial and to some other numerical problems (Q1091081) (← links)
- Polynomial division and its computational complexity (Q1094135) (← links)
- Algebraic complexity of computing polynomial zeros (Q1095599) (← links)
- Parallel nested dissection for path algebra computations (Q1095781) (← links)
- Sequential and parallel complexity of approximate evaluation of polynomial zeros (Q1097004) (← links)
- Complexity of parallel matrix computations (Q1100892) (← links)
- (Q1107985) (redirect page) (← links)
- A logarithmic Boolean time algorithm for parallel polynomial division (Q1107986) (← links)
- Computing the determinant and the characteristic polynomial of a matrix via solving linear systems of equations (Q1114335) (← links)
- Parallel evaluation of the determinant and of the inverse of a matrix (Q1115596) (← links)
- The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented \(\lambda\) algorithms (Q1121670) (← links)
- Techniques for exploiting structure in matrix formulae of the sparse resultant (Q1127958) (← links)
