The following pages link to Victor Y. Pan (Q163211):
Displaying 50 items.
- 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)
- A fast, preconditioned conjugate gradient Toeplitz and Toeplitz-like solvers (Q1903197) (← links)
- Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant (Q1903781) (← links)
- Weyl's quadtree algorithm for the unsymmetric eigenvalue problem (Q1904521) (← links)
- Optimal and nearly optimal algorithms for approximating polynomial zeros (Q1921261) (← links)
- Randomized preprocessing versus pivoting (Q1940337) (← links)
- Bisection acceleration for the symmetric tridiagonal eigenvalue problem (Q1964055) (← links)
- New techniques for the computation of linear recurrence coefficients (Q1971066) (← links)
- Multivariate polynomials, duality, and structured matrices (Q1977144) (← links)
- Approximating complex polynomial zeros: modified Weyl's quadtree construction and improved Newton's iteration. (Q1977146) (← links)
- Lifting/descending processes for polynomial zeros. (Q1977147) (← links)
- Superfast algorithms for Cauchy-like matrix computations and extensions (Q1978119) (← links)
- Accelerated subdivision for clustering roots of polynomials given by evaluation oracles (Q2109981) (← links)
- Faster numerical univariate polynomial root-finding by means of subdivision iterations (Q2110240) (← links)
- Acceleration of subdivision root-finding for sparse polynomials (Q2110242) (← links)
- Root-finding with implicit deflation (Q2175580) (← links)
- Old and new nearly optimal polynomial root-finders (Q2175594) (← links)
- Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation (Q2350005) (← links)
- Accelerated approximation of the complex roots and factors of a univariate polynomial (Q2357367) (← links)
- Graeffe's, Chebyshev-like, and Cardinal's processes for splitting a polynomial into factors (Q2365420) (← links)
- On isolation of real and nearly real zeros of a univariate polynomial and its splitting into factors (Q2365425) (← links)
- Binary segmentation for matrix and vector operations (Q2365929) (← links)
- Schur aggregation for linear systems and determinants (Q2378504) (← links)
- The amended DSeSC power method for polynomial root-finding (Q2387379) (← links)
- Additive preconditioning and aggregation in matrix computations (Q2425466) (← links)
- Root-squaring with DPR1 matrices (Q2452939) (← links)
- (Q2724557) (← links)
- (Q2760974) (← links)
- How bad are Vandermonde matrices? (Q2813332) (← links)
- The complexity of the matrix eigenproblem (Q2819583) (← links)
- Univariate polynomial root-finding by arming with constraints (Q2819625) (← links)
- Accelerated approximation of the complex roots of a univariate polynomial (Q2819725) (← links)
- A Note on Global Newton Iteration Over Archimedean and Non-Archimedean Fields (Q2879325) (← links)
- Real Polynomial Root-Finding by Means of Matrix and Polynomial Iterations (Q2879337) (← links)
- Real and Complex Polynomial Root-Finding by Means of Eigen-Solving (Q2915005) (← links)
- Root-Refining for a Polynomial Equation (Q2915006) (← links)
- Can the TPRI structure help us to solve the algebraic eigenproblem? (Q2921779) (← links)
- Real and complex polynomial root-finding with eigen-solving and preprocessing (Q2946541) (← links)
- Univariate polynomials (Q2958942) (← links)
- Nearly optimal symbolic-numerical algorithms for structured integer matrices and polynomials (Q2959023) (← links)
- On the boolean complexity of real root refinement (Q2963249) (← links)
- Fast and efficient linear programming and linear least-squares computations (Q3028716) (← links)
- (Q3086667) (← links)
- (Q3128885) (← links)
- (Q3128928) (← links)
- (Q3138975) (← links)
- (Q3156423) (← links)
- (Q3162305) (← links)
- (Q3280358) (← links)
