Victor Pan | Academic Influence

Victor Pan's AcademicInfluence.com Rankings

Victor Pan

Mathematics

#2128

World Rank

#3332

Historical Rank

#850

USA Rank

Measure Theory

#405

World Rank

#591

Historical Rank

#173

USA Rank

mathematics Degrees

Download Badge

Mathematics

Victor Pan's Degrees

Masters Mathematics Stanford University
Bachelors Mathematics Princeton University

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Victor Pan Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Victor Yakovlevich Pan is a Soviet and American mathematician and computer scientist, known for his research on algorithms for polynomials and matrix multiplication. Education and career Pan earned his Ph.D. at Moscow University in 1964, under the supervision of Anatoli Georgievich Vitushkin, and continued his work at the Soviet Academy of Sciences. During that time, he published a number of significant papers and became known informally as "polynomial Pan" for his pioneering work in the area of polynomial computations. In late 1970s, he immigrated to the United States and held positions at several institutions including IBM Research. Since 1988, he has taught at Lehman College of the City University of New York.

(See a Problem?)

Victor Pan's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Polynomial and Matrix Computations (1994) (496)
Structured Matrices and Polynomials: Unified Superfast Algorithms (2001) (375)
Solving a Polynomial Equation: Some History and Recent Progress (1997) (370)
Fast Rectangular Matrix Multiplication and Applications (1998) (242)
The complexity of the matrix eigenproblem (1999) (240)
Numerical methods for roots of polynomials (2007) (228)
An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications (1991) (195)
Structured Matrices and Polynomials (2001) (183)
Univariate Polynomials: Nearly Optimal Algorithms for Numerical Factorization and Root-finding (2002) (179)
Polynomial and matrix computations (vol. 1): fundamental algorithms (1994) (179)
Efficient parallel solution of linear systems (1985) (173)
On computations with dense structured matrices (1990) (168)
How to Multiply Matrices Faster (1984) (158)
How can we speed up matrix multiplication (1984) (146)
Optimal and nearly optimal algorithms for approximating polynomial zeros (1996) (145)
Multivariate Polynomials, Duality, and Structured Matrices (2000) (137)
Strassen's algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations (1978) (128)
METHODS OF COMPUTING VALUES OF POLYNOMIALS (1966) (111)
How Bad Are Vandermonde Matrices? (2015) (110)
Processor efficient parallel solution of linear systems over an abstract field (1991) (109)
Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations (2005) (103)
Complexity of Parallel Matrix Computations (1987) (103)
Complexity of Computations with Matrices and Polynomials (1992) (99)
On practical algorithms for accelerated matrix multiplication (1992) (95)
Univariate polynomials: nearly optimal algorithms for factorization and rootfinding (2001) (86)
Computation of Approximate Polynomial GCDs and an Extension (2001) (82)
Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros (1995) (82)
New Fast Algorithms for Matrix Operations (1980) (78)
Efficient parallel algorithms for computing all pair shortest paths in directed graphs (1992) (75)
Computing exact geometric predicates using modular arithmetic with single precision (1997) (74)
PARAMETRIZATION OF NEWTON'S ITERATION FOR COMPUTATIONS WITH STRUCTURED MATRICES AND APPLICATIONS (1992) (74)
Polynomial division and its computational complexity (1986) (71)
Methods of aggregation (1980) (71)
Sequential and parallel complexity of approximate evaluation of polynomial zeros (1987) (69)
Sign Determination in Residue Number Systems (1999) (69)
Additive preconditioning in matrix computations (2007) (68)
Numerical Computation of a Polynomial GCD and Extensions (1996) (67)
Structured matrices and newton's iteration: unified approach (2000) (65)
Inverse power and Durand-Kerner iterations for univariate polynomial root-finding (2002) (62)
Nearly optimal computations with structured matrices (2000) (61)
Improved algorithms for computing determinants and resultants (2005) (61)
Fast and Efficient Parallel Solution of Sparse Linear Systems (1993) (60)
Symbolic and Numeric Methods for Exploiting Structure in Constructing Resultant Matrices (2002) (59)
Schur aggregation for linear systems and determinants (2008) (59)
Processor-efficient parallel solution of linear systems. II. The positive characteristic and singular cases (1992) (55)
Acceleration of Euclidean Algorithm and Rational Number Reconstruction (2003) (55)
New combinations of methods for the acceleration of matrix multiplications (1981) (54)
Approximating Complex Polynomial Zeros: Modified Weyl's Quadtree Construction and Improved Newton's Iteration (2000) (53)
New progress in real and complex polynomial root-finding (2011) (52)
Randomized Preprocessing of Homogeneous Linear Systems of Equations (2010) (51)
Decreasing the displacement rank of a matrix (1993) (50)
Computing the Determinant and the Characteristic Polynomial of a Matrix via Solving Linear Systems of Equations (1988) (50)
Transformations of Matrix Structures Work Again (2013) (49)
Field extension and trilinear aggregating, uniting and canceling for the acceleration of matrix multiplications (1979) (48)
On Approximating Complex Polynomial Zeros: Modified Quadtree (Weyl's) Construction and Improved Newton's Iteration (1996) (48)
Matrix computations and polynomial root-finding with preprocessing☆ (2011) (47)
Improved initialization of the accelerated and robust QR-like polynomial root-finding. (2004) (47)
Parallel matrix multiplication on a linear array with a reconfigurable pipelined bus system (1999) (46)
A unified superfast algorithm for boundary rational tangential interpolation problems and for inversion and factorization of dense structured matrices (1998) (46)
A new approach to fast polynomial interpolation and multipoint evaluation (1993) (45)
Fast and Efficient Solution of Path Algebra Problems (1989) (44)
Inversion of Displacement Operators (2002) (44)
Parallel complexity of tridiagonal symmetric Eigenvalue problem (1991) (43)
Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real (1998) (43)
Concurrent Iterative Algorithm for Toeplitz-like Linear Systems (1993) (42)
Solving special polynomial systems by using structured matrices and algebraic residues (1997) (42)
On the boolean complexity of real root refinement (2013) (42)
Parallel Evaluation of the Determinant and of the Inverse of a Matrix (1989) (41)
Simple Multivariate Polynomial Multiplication (1994) (41)
The structure of sparse resultant matrices (1997) (41)
Newton's Iteration for Matrix Inversion, Advances and Extensions (2010) (40)
Fast and Efficient Parallel Algorithms for the Exact Inversion of Integer Matrices (1985) (39)
Homotopic residual correction processes (2005) (39)
Additive preconditioning, eigenspaces, and the inverse iteration☆ (2009) (38)
Certification of Numerical Computation of the Sign of the Determinant of a Matrix (2001) (38)
Parallel Computation of Polynomial GCD and Some Related Parallel Computations over Abstract Fields (1996) (37)
Acceleration of Euclidean algorithm and extensions (2002) (36)
Improved processor bounds for combinatorial problems in RNC (1988) (35)
Asymptotic acceleration of solving multivariate polynomial systems of equations (1998) (34)
Algebraic complexity of computing polynomial zeros (1987) (34)
Fast and efficient parallel solution of dense linear systems (1989) (33)
Graeffe's, Chebyshev-like, and Cardinal's Processes for Splitting a Polynomial into Factors (1996) (33)
Additive preconditioning and aggregation in matrix computations (2008) (32)
Superfast algorithms for Cauchy-like matrix computations and extensions (2000) (31)
Newton's iteration for structured matrices (1999) (30)
Univariate polynomial division with a remainder by means of evaluation and interpolation (1991) (30)
Random multipliers numerically stabilize Gaussian and block Gaussian elimination: Proofs and an extension to low-rank approximation ☆ (2014) (30)
Iterative inversion of structured matrices (2004) (30)
Solving Polynomials with Computers (1998) (29)
The Parallel Computation of Minimum Cost Paths in Graphs by Stream Contraction (1991) (28)
Newton-Like Iteration Based on a Cubic Polynomial for Structured Matrices (2004) (28)
Numerically Safe Gaussian Elimination with No Pivoting (2015) (28)
Implementation of a Near-Optimal Complex Root Clustering Algorithm (2018) (27)
Improved parallel computations with Toeplitz-like and Hankel-like matrices☆☆☆ (1993) (27)
Modular Arithmetic for Linear Algebra Computations in the Real Field (1998) (27)
Efficient algorithms for the evaluation of the eigenvalues of (block) banded Toeplitz matrices (1988) (27)
Efficient polynomial root-refiners: A survey and new record efficiency estimates (2012) (27)
Root-Finding with Eigen-Solving (2007) (27)
Randomized preprocessing versus pivoting (2013) (26)
Improved processor bounds for algebraic and combinatorial problems in RNC (1985) (26)
Solving linear systems of equations with randomization, augmentation and aggregation (2012) (26)
An efficient computation of generalized inverse of a matrix (2018) (26)
Fundamental Computations with Polynomials (1994) (25)
Computation of a specified root of a polynomial system of equations using eigenvectors (2000) (25)
Parallel solution of toeplitzlike linear systems (1992) (25)
Nearly optimal refinement of real roots of a univariate polynomial (2016) (24)
On Rational Number Reconstruction and Approximation (2004) (24)
Accelerated Solution of Multivariate Polynomial Systems of Equations (2003) (24)
Work-Preserving Speed-Up of Parallel Matrix Computations (1995) (24)
Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication (1982) (23)
The power of combining the techniques of algebraic and numerical computing: improved approximate multipoint polynomial evaluation and improved multipole algorithms (1992) (23)
Fast and E cient Parallel Evaluation of the Zeros of a Polynomial Having Only Real Zeros (1989) (23)
Controlled iterative methods for solving polynomial systems (1998) (22)
Faster solution of the key equation for decoding BCH error-correcting codes (1997) (22)
The amended DSeSC power method for polynomial root-finding (2005) (21)
Fast approximate computations with Cauchy matrices and polynomials (2015) (21)
An algebraic approach to approximate evaluation of a polynomial on a set of real points (1995) (21)
TR-2003013: QR-Like Algorithms for Generalized Semiseparable Matrices (2003) (21)
Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization (2011) (20)
Fast rectangular matrix multiplication and some applications (2008) (20)
New Techniques for the Computation of Linear Recurrence Coefficients (2000) (19)
Algebraic Algorithms (1997) (19)
Approximate polynomial Gcds, Padé approximation, polynomial zeros and bipartite graphs (1998) (19)
Fast rectangular matrix multiplications and improving parallel matrix computations (1997) (19)
New fast algorithms for polynomial interpolation and evaluation on the Chebyshev node set (1998) (18)
Polynomial and Rational Evaluation and Interpolation (with Structured Matrices) (1999) (18)
New techniques for approximating complex polynomial zeros (1994) (18)
Improved Parallel Polynomial Division (1993) (17)
On some computations with dense structured matrices (1989) (17)
The schur aggregation for solving linear systems of equations (2007) (17)
Real root-finding (2007) (17)
On theoretical and practical acceleration of randomized computation of the determinant of an integer matrix (2006) (17)
Extension of the Parallel Nested Dissection Algorithm to Path Algebra Problems (1986) (17)
Parallel least-squares solution of general and Toeplitz systems (1990) (17)
Fast Matrix Multiplication and Symbolic Computation (2016) (16)
New Studies of Randomized Augmentation and Additive Preprocessing (2014) (16)
TR-2007010: Error-Free Computations via Floating-Point Operations (2007) (16)
Complexity of Algorithms for Linear Systems of Equations (1991) (15)
Parallel Complexity of Computations with General and Toeplitz-Like Matrices Filled with Integers and Extensions (2000) (15)
Algebraic and numerical techniques for the computation of matrix determinants (1997) (15)
Null space and eigenspace computations with additive preprocessing (2007) (15)
Fast evaluation and interpolation at the Chebyshev sets of points (1989) (15)
Low-Rank Approximation of a Matrix: Novel Insights, New Progress, and Extensions (2015) (15)
Some polynomial and Toeplitz matrix computations (1987) (15)
A new error-free floating-point summation algorithm (2009) (15)
Degeneration of Structured Integer Matrices Modulo an Integer (2008) (14)
The Trade-Off Between the Additive Complexity and the Asynchronicity of Linear and Bilinear Algorithms (1986) (14)
Compact Multigrid (1992) (14)
Fast and Efficient Parallel Inversion of Toeplitz and Block Toeplitz Matrices (1989) (14)
Certified computation of the sign of a matrix determinant (1999) (14)
Deterministic improvement of complex polynomial factorization based on the properties of the associated resultant (1995) (14)
Newton's Iteration for Inversion of Cauchy-Like and Other Structured Matrices (1997) (14)
Randomized Matrix Computations (2012) (13)
Fast Feasible and Unfeasible Matrix Multiplication (2018) (13)
Randomized Acceleration of Fundamental Matrix Computations (2002) (13)
Fast and efficient algorithms for sequential and parallel evaluation of polynomial zeros and of matrix polynomials (1985) (13)
Newton's iteration for the inversion of structured matrices (2001) (13)
Root-finding by expansion with independent constraints (2011) (13)
Special Issue on Algebraic and Numerical Algorithms (2004) (12)
Practical improvement of the divide-and-conquer eigenvalue algorithms (1992) (12)
Multidimensional structured matrices and polynomial systems (1996) (12)
Primitive and Cynical Low Rank Approximation, Preprocessing and Extensions (2016) (11)
Randomized preconditioning of the MBA algorithm (2011) (11)
Supereffective slow-down of parallel computations (1992) (11)
Parallel Solution of Toeplitz and Toeplitz-Like Linear Systems Over Fields of Small Positive Characteristic (1994) (11)
Some Recent Algebraic/numerical Algorithms (1998) (11)
Real and complex polynomial root-finding with eigen-solving and preprocessing (2010) (11)
Estimating the Norms of Random Circulant and Toeplitz Matrices and Their Inverses (2013) (11)
Can We Optimize Toeplitz/Hankel Computations? (2002) (11)
On the complexity of a pivot step of the revised simplex algorithm (1985) (10)
The Additive and Logical Complexities of Linear and Bilinear Arithmetic Algorithms (1983) (10)
Accelerated approximation of the complex roots and factors of a univariate polynomial (2015) (10)
Unified Nearly Optimal Algorithms for Structured Integer Matrices (2010) (10)
Accelerated approximation of the complex roots of a univariate polynomial (2014) (9)
The Bit-Complexity of Arithmetic Algorithms (1981) (9)
Parallel nested dissection for path algebra computations (1986) (9)
The Schur Aggregation and Extended Iterative Refinement ∗ (9)
TR-2004013: Toeplitz and Hankel Meet Hensel and Newton: Nearly Optimal Algorithms and Their Practical Acceleration with Saturated Initialization (2004) (9)
Fast and Efficient Algorithms for Linear Programming and for the Linear Least Squares Problem. (1985) (9)
Fast matrix multiplication and its algebraic neighbourhood (2017) (9)
Superfast Accurate Low Rank Approximation (2016) (9)
Parallel computation of a Krylov matrix for a sparse and structured input (1995) (9)
Fast Approximate Computations with Cauchy Matrices, Polynomials and Rational Functions (2014) (9)
Root-Refining for a Polynomial Equation (2012) (9)
The bit-complexity of discrete solutions of partial differential equations: Compact multigrid (1990) (9)
Real polynomial root-finding by means of matrix and polynomial iterations (2014) (8)
Randomized preconditioning versus pivoting ∗ (2009) (8)
Highly Efficient Computation of Generalized Inverse of a Matrix (2016) (8)
Better Late Than Never: Filling a Void in the History of Fast Matrix Multiplication and Tensor Decompositions (2014) (8)
TR-2012013: Condition Numbers of Random Toeplitz and Circulant Matrices (2012) (8)
Superfast Computations with Singular Structured Matrices over Abstract Fields (1999) (8)
Old and New Nearly Optimal Polynomial Root-Finders (2019) (8)
New homotopic/factorization and symmetrization techniques for Newton's and Newton/structured iteration (2007) (8)
A Logarithmic Boolean Time Algorithm for Parallel Polynomial Division (1986) (8)
Transformations of Cauchy Matrices, Trummer's Problem and a Cauchy-Like Linear Solver (1998) (8)
Randomized Preprocessing of Homogeneous Linear Systems ∗ (2009) (7)
On Isolation of Real and Nearly Real Zeros of a Univariate Polynomial and Its Splitting into Factors (1996) (7)
The Complexity of the AlgebraicEigenproblem (1998) (7)
Superfast CUR Matrix Algorithms, Their Pre-Processing and Extensions (2017) (7)
New practical advances in polynomial root clustering (2019) (7)
The Technique of Trilinear Aggregating and the Recent Progress in the Asymptotic Acceleration of Matrix Operations (1984) (7)
Numerical Computation of Determinants with Additive Preconditioning ∗ (7)
Unified Divide-and-Conquer Algorithm (2001) (7)
Eigen-solving via reduction to DPR1 matrices (2008) (7)
Fast Parallel Polynomial Division via Reduction to Triangular Toeplitz Matrix Inversion and to Polynomial Inversion Modulo a Power (1985) (7)
New Progress in Polynomial Root-finding. (2018) (7)
New transformations of Cauchy matrices and Trummer's problem (1998) (7)
Refinement of Low Rank Approximation of a Matrix at Sub-linear Cost. (2019) (6)
Polynomial Real Root Isolation by Means of Root Radii Approximation (2015) (6)
CUR Low Rank Approximation of a Matrix at Sub-linear Cost (2019) (6)
Improved Parallel Computations with Matrices and Polynomials (1991) (6)
CUR LRA at Sublinear Cost Based on Volume Maximization (2019) (6)
Solving Linear Systems with Randomized Augmentation ∗ (2010) (6)
Estimating the extremal eigenvalues of a symmetric matrix (1990) (6)
On parallel complexity of integer linear programming, GCD and the iterated mod function (1992) (6)
Low Rank Approximation at Sublinear Cost by Means of Subspace Sampling (2019) (6)
New Resultant Inequalities and Complex Polynomial Factorization (1992) (6)
On Parallel Computations with Banded Matrices (1995) (6)
Randomized Circulant and Gaussian Pre-processing (2015) (6)
Parallel polynomial computations by recursive processes (1990) (6)
The Bit Operation Complexity of Approximate Evaluation of Matrix and Polynomial Products Using Modular Arithmetic (1982) (5)
Applications of FFT (1999) (5)
A new proximity test for polynomial zeros (2001) (5)
Preface: Algebraic and Numerical Algorithms (2004) (5)
Randomized Preconditioning of Linear Systems of Equations (2010) (5)
Linking the TPR1, DPR1 and Arrow-Head Matrix Structures (2006) (5)
Weyl's Quadtree Algorithm for the Unsymmetric Eigenvalue Problem (1995) (5)
Solution of a Polynomial System of Equations Via the Eigenvector Computation (2001) (5)
Univariate polynomial root-finding by arming with constraints (2012) (5)
Randomized Augmentation and Additive Preprocessing (2014) (5)
Can We Combine the Powers of CG, FMM, and Low-rank Approximation Algorithms? (2015) (5)
TR-2014008: Supporting GENP and Low-Rank Approximation with Random Multipliers (2014) (5)
Techniques for exploiting structure in matrix formulae of the sparse resultant (1996) (5)
New progress in univariate polynomial root finding (2020) (5)
Fast finite methods for a system of linear inequalities (1985) (5)
Advancing Matrix Computations with Randomized Preprocessing (2010) (5)
An efficient solution for Cauchy-likesystems of linear equations (2004) (5)
Matrix Multiplication, Trilinear Decompositions, APA Algorithms, and Summation (2014) (5)
The bit-operation complexity of matrix multiplication and of all pair shortest path problem (1981) (5)
TR-2008009: Solving Homogeneous Linear Systems with Weakly Randomized Additive Preprocessing (2008) (4)
On the Bit-Complexity of Discrete Solutions of PDEs: Compact Multigrid (1990) (4)
Applications of FFT and structured matrices (2010) (4)
Binary segmentation for matrix and vector operations (1993) (4)
Fast matrix multiplication without APA-algorithms☆ (1982) (4)
A fast, preconditioned conjugate gradient Toeplitz and Toeplitz-like solvers (1995) (4)
A fast, preconditioned conjugate gradient toeplitz solver (1992) (4)
A Homotopic Residual Correction Process (2000) (4)
Lifting/Descending Processes for Polynomial Zeros (2000) (4)
Approximate real polynomial division via approximate inversion of real triangular Toeplitz matrices (1999) (4)
Computational complexity of computing polynomials over the fields of real and complex numbers (1978) (4)
Simple and Nearly Optimal Polynomial Root-finding by Means of Root Radii Approximation (2015) (4)
On the evaluation of the Eigenvalues of a banded toeplitz block matrix (1991) (4)
The bit complexity of matrix multiplication and of related computations in linear algebra. The segmented λ algorithms (1985) (4)
Bisection and Interpolation Methods (2013) (4)
Root-Finding with Implicit Deflation (2016) (4)
On iterative refinement/improvement of the solution to an ill conditioned linear system (2008) (4)
TR-2002015: Residual Correction Algorithms for General and Structured Matrices (2002) (4)
Efficient parallel linear programming (1986) (3)
Faster Numerical Univariate Polynomial Root-Finding by Means of Subdivision Iterations (2020) (3)
Convolution of Vectors over the Real Field of Constants by Evaluation - Interpolation Algorithms (1980) (3)
Computing x^m mod p(x) and an Application to Splitting a Polynomial Into Factors Over a Fixed Disc (1996) (3)
The NC equivalence of planar integer linear programming and Euclidean GCD (1993) (3)
Randomized and Derandomized Matrix Computations ∗ (2011) (3)
Acceleration of Subdivision Root-Finding for Sparse Polynomials (2020) (3)
The modified barrier function method for linear programming and its extensions (1990) (3)
Parallel computations with Toeplitz-like and Hankel-like matrices (1993) (3)
A note on the paper by Murat Cenk and Ferruh Ozbudak "Multiplication of polynomials modulo xn", Theoret. Comput. Sci. 412(2011) 3451-3462 (2012) (3)
Nearly optimal symbolic-numerical algorithms for structured integer matrices and polynomials (2009) (3)
Supporting GENP with Random Multipliers (2013) (3)
Low-Degree Polynomials (2013) (3)
New Acceleration of Nearly Optimal Univariate Polynomial Root-findERS. (2018) (3)
Fast and efficient linear programming and linear least-squares computations (1986) (3)
N A ] 2 4 D ec 2 01 2 More on the Power of Randomized Matrix Multiplication ∗ (2012) (3)
Fast parallel algorithms for polynomial division over an arbitrary field of constants (1986) (3)
TR-2002003: Univariate Polynomial Root-Finding with a Lower Computational Precision and Higher Convergence Rates (2002) (3)
Low Rank Approximation Directed by Leverage Scores and Computed at Sub-linear Cost (2019) (3)
Bisection acceleration for the symmetric tridiagonal eigenvalue problem (1999) (3)
Root Radii and Subdivision for Polynomial Root-Finding (2021) (3)
Chapter 11 - Jenkins–Traub, Minimization, and Bairstow Methods (2013) (2)
Fast and Efficient Parallel Linear Programming and Linear Least Squares Computations (1986) (2)
Parallel Polynomial and Matrix Computations (1994) (2)
TR-2012007: Solving Linear Systems of Equations with Randomization, Augmentation and Aggregation II (2012) (2)
Polynomial root clustering and explicit deflation (2019) (2)
Certiied Numerical Computation of the Sign of a Matrix Determinant , (1998) (2)
Some Recent and New Techniques for Superfast (Sublinear Cost) Low Rank Approximation (2018) (2)
TR-2014005: Fast Approximation Algorithms for Computations with Cauchy Matrices and Extensions (2014) (2)
Algebraic and numerical algorithms (2010) (2)
Improved parallel solution of a triangular linear system (1994) (2)
Optimum parallel computations with banded matrices (1994) (2)
Algebraic improvements of numerical algorithms: Interpolation and economization of Taylor series (1994) (2)
Newton-like iteration for general and structured matrices (2003) (2)
A Unified Approach to the Analysis of Bilinear Algorithms (1981) (2)
Matrix structure, polynomial arithmetic, and erasure-resilient encoding/decoding (2000) (2)
Simple and Efficient Real Root-finding for a Univariate Polynomial (2015) (2)
A Uniied Superfast Divide-and-conquer Algorithm for Structured Matrices over Abstract Elds (1999) (2)
A New Algorithm for the Symmetric Tridiagonal Eigenvalue Problem (1993) (2)
Polynomial Root Isolation by Means of Root Radii Approximation (2015) (2)
A Note on Global Newton Iteration Over Archimedean and Non-Archimedean Fields (2014) (2)
Randomized Approximation of Linear Least Squares Regression at Sub-linear Cost (2019) (2)
Computations with Structured Matrices. Introduction (2001) (2)
TR-2005008: Toeplitz and Hankel Meet Hensel and Newton Modulo a Power of Two (2005) (2)
Schemes using preliminary treatment of coefficients for polynomial calculation. A program for automatic determination of parameters (1963) (2)
CO 2 Solubility and Its Implications for Degassing Ascending Magmas (1990) (2)
Polynomial and matrix computations, 1st Edition (1994) (2)
Matrix Structures of Vandermonde and Cauchy Types and Polynomial and Rational Computations (2001) (2)
TR-2013003: Polynomial Evaluation and Interpolation: Fast and Stable Approximate Solution (2013) (2)
Completion of Newton's Iterations Initialized at a Quasi-Universal Set (2016) (2)
Nearly Optimal Polynomial Root-finders: the State of the Art and New Progress (2018) (2)
Extended concept of significant digits and lower precision computations (1992) (2)
Improved parallel polynomial division and its extensions (1992) (2)
TR-2011004: Acceleration of Newton's Polynomial Factorization: Army of Constraints, Convolution, Sylvester Matrices, and Partial Fraction Decomposition (2011) (1)
Sublinear Cost Low Rank Approximation via Subspace Sampling (2019) (1)
TR-2011009: Solving Linear Systems of Equations with Randomized Augmentation and Aggregation (2011) (1)
TR-2012001: Algebraic Algorithms (2012) (1)
TR-2003004: Superfast Algorithms for Singular Toeplitz/Hankel-like Matrices (2003) (1)
Planar Integer Linear Programming is NC Equivalent to Euclidean GCD (1998) (1)
Chapter 10 - Bernoulli, Quotient-Difference, and Integral Methods (2013) (1)
TR-2002019: Improved Algorithms for Computing Determinants and Resultants (2002) (1)
How Much Randomness Do We Need for Supporting Gaussian Elimination, Block Gaussian Elimination, and Low-rank Approximation? (2015) (1)
TR-2006007: Root-Finding with Eigen-Solving (2006) (1)
Preconditioning, randomization, solving linear systems, eigen-solving, and root-finding (2009) (1)
Polynomial Evaluation and Interpolation and Transformations of Matrix Structures (2013) (1)
Root-squaring with DPR1 matrices (2010) (1)
Accelerated Subdivision for Clustering Roots of Polynomials given by Evaluation Oracles (2022) (1)
TR-2010009: Solving Linear Systems with Randomized Augmentation II (2009) (1)
Randomized Matrix Computations II ∗ (2012) (1)
New Structured Matrix Methods for Real and Complex Polynomial Root-finding ∗ (2013) (1)
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 (1985) (1)
Fundamental Computations with General and Dense Structured Matrices (1994) (1)
How Much Randomness Do We Need in Matrix Computations (2015) (1)
Coefficient-free adaptations of polynomial root-finders (2005) (1)
FAST MATRIX MULTIPLICATION WITHOUT APA-ALGORITHMS? (2001) (1)
Fast Derandomized Low-rank Approximation and Extensions (2016) (1)
TR-2004014: A Homotopic/Factorization Process for Toeplitz-like Matrices with Newton's/Conjugate Gradient Stages (2004) (1)
The least squares compression policy for Newton-like iteration of structured matrices (2004) (1)
Superfast Low-Rank Approximation and Least Squares Regression (2016) (1)
TR-2013011: Fast Approximation Algorithms for Cauchy Matrices, Polynomials and Rational Functions (2013) (1)
Generalized compact multi-grid (1993) (1)
Sublinear Cost Low Rank Approximation Directed by Leverage Scores (2019) (1)
Polynomial Factorization Is Simple and Helpful - More So Than It Seems to Be (2018) (1)
TR-2008003: Unified Nearly Optimal Algorithms for Structured Integer Matrices and Polynomials (2008) (1)
TR-2012002: Randomized Matrix Methods for Real and Complex Polynomial Root-Finding (2012) (1)
A new approach to parallel computation of polynomial GCD and to related parallel computations over fields and integer rings (1996) (1)
Randomized Circulant and f-circulant Preprocessing (2015) (1)
TR-2007002: Additive Preconditioning and Aggregation in Matrix Computations (2006) (1)
New Deterministic Parallel Algorithmsfor the Characteristic Polynomial of aMatrix over Abstract Fields (1999) (1)
The computation of polynomials of the fifth and seventh degrees with real coefficients (1965) (1)
Structured Matrices and Displacement Operators (2001) (1)
TR-2007013: Error-free Computations via Floating-Point Operations: The Code (2007) (1)
ASYMPTOTIC ACCELERATION OF THE SOLUTION OF MULTIVARIATE POLYNOMIAL SYSTEMS OF EQUATIONS (2002) (1)
Chapter 10: Algebraic Algorithms (2013) (1)
Preface (2013) (0)
TR-2013010: Transformations of Matrix Structures Work Again II (2013) (0)
Inverse Displacement Operators (2002) (0)
TR-2012005: Randomized Matrix Computations (2012) (0)
Solving special polynomial systems by usingstructured matrices and algebraic (1997) (0)
New algorithms for the symmetric tridiagonal eigenvalue computation (1994) (0)
D S ] 1 1 A pr 2 01 8 Fast Feasible and Unfeasible Matrix Multiplication (2018) (0)
Implicit Deflation for Univariate Polynomial Root-finding (2016) (0)
Solving Linear Systems with Randomized Augmentation II (2010) (0)
TR-2013001: Randomized Augmentation and Additive Preprocessing (2013) (0)
Fast and Efficient Linear Programming and Linear Least-squares Computationst (1986) (0)
Real and Complex Polynomial Root-Finding by Means of Eigen-Solving (2012) (0)
New Results on CGR/CUR Approximation of a Matrix (2016) (0)
New Progress in Classic Area: Polynomial Root-squaring and Root-finding (2022) (0)
TR-2010011: Randomized Preprocessing versus Pivoting II (2010) (0)
Improving the solution of the symmetric eigenvalue problem and an extension (1992) (0)
TR-2008008: Schur Aggregation for Linear Systems and Determinants (2008) (0)
The Lower Bounds on the Additive Complexity of Bilinear Problems in Terms of Some Algebraic Quantities (1981) (0)
.2 My Research Highlights (briefly) (2014) (0)
TR-2012003: Root-Finding and Root-Refining for a Polynomial Equation (2012) (0)
New Transformations of (1998) (0)
Randomized and Derandomized Matrix Computations II ∗ (2011) (0)
Fast CUR Approximation of Average Matrix and Extensions (2016) (0)
Fast Cauchy Sum Algorithms for Polynomial Zeros and Matrix Eigenvalues (2023) (0)
Transformations of Matrix Structures Work Again II (2013) (0)
Single Precision Computation of the Sign of Algebraic Predicates (1998) (0)
Primal and Dual Random Multipliers for Low-Rank Approximation and versus Pivoting (2015) (0)
TR-2002017: Nearly Optimal Toeplitz/Hankel Computations (2002) (0)
Combining algebraic and numerical methods in algorithm design (1998) (0)
TR-2002002: Can We Optimize Toeplitz/Hankel Computations? II. Singular Toeplitz/Hankel-like Case (2016) (0)
Studies in algorithms for fast rectangular matrix multiplications and their applications (1997) (0)
Superfast Refinement of Low Rank Approximation of a Matrix (2019) (0)
Anewerror-freefloating-pointsummationalgorithm I (2009) (0)
Nearly Optimal Algorithms for Univ ariate Polynomial Factorization and Rootfinding II : Computing a Basic Ann ulus for Splitting (2002) (0)
TR-2014011: Real Polynomial Root-Finding: New Advances (2014) (0)
Polynomial root-finding with matrix eigen-solving (2005) (0)
TR-2013016: Supporting GENP with Random Multipliers (2013) (0)
Implications of the Venera 13 Surface Analysis for the CO2 Content of the Interior of Venus (1991) (0)
N A ] 5 J un 2 01 6 Fast Low-rank Approximation of a Matrix : Novel Insights , Novel Multipliers , and Extensions ∗ (2016) (0)
Randomized Structured Preprocessing versus Pivoting (2015) (0)
TR-2007023: The Schur Aggregation for Linear Systems and Determinants (2007) (0)
Row – Column Pivoting in Gaussian Elimination ∗ (2016) (0)
TR-2007014: The Schur Aggregation and Extended Iterative Refinement (2007) (0)
Row – Column Pivoting in Gaussian Elimination ∗ (2016) (0)
Preface (2008) (0)
Studies in algorithms for fast structured matrices computations and their applications (1998) (0)
On the Superfast Multipole Method (2022) (0)
New Techniques for Decoding the Bch Error-correcting Codes 1 (1997) (0)
Methods Involving Second or Higher Derivatives (2013) (0)
TR-2002001: Can We Optimize Toeplitz/Hankel Computations? (2002) (0)
TR-2002003 : Univariate Polynomial Root-Finding with a Lower Computational Precision and Higher Convergence Rates (2016) (0)
Efficient Eigenvalue Computation of Rank-Structured Matrices : the QR Approach and Beyond (0)
Chapter 8 - Graeffe’s Root-Squaring Method (2013) (0)
Algebraic Algorithms 1 (1997) (0)
Chapter 15 - Nearly Optimal Universal Polynomial Factorization and Root-Finding (2013) (0)
TR-2011003: Partial Fraction Decomposition, Sylvester Matrices, Convolution and Newton's Iteration (2011) (0)
The exponent of matrix multiplication (1984) (0)
TR-2010012: Randomized Preconditioning of Linear Systems of Equations (2010) (0)
The projective power method for the algebraic eigenvalue problem (1983) (0)
TR-2013009: Algebraic Algorithms (2013) (0)
Newton-Structured Numerical Iteration (2001) (0)
TR-2011002: Symbolic Lifting for Structured Linear Systems of Equations: Numerical Initialization, Nearly Optimal Boolean Cost, Variations, and Extensions (2011) (0)
TR-2007009: Computations in the Null Spaces with Additive Preprocessing (2007) (0)
TR-2007011: Numerical Computation of Determinants with Additive Preconditioning (2007) (0)
TR-2004015: Superfast Algorithms for Singular Toeplitz-like Matrices (2004) (0)
Lifting toeplitz/hankel computations (2007) (0)
TR-2002002: Can We Optimize Toeplitz/Hankel Computations? II. Singular Toeplitz/Hankel-like Case (2002) (0)
Condition Estimation by Means of the Power Method (2012) (0)
TR-2005009: Additive Preconditioning in Matrix Computations (2005) (0)
TR-2009008: Randomized Preprocessing of Homogeneous Linear Systems of Equations (2009) (0)
Can the TPRI structure help us to solve the algebraic eigenproblem? (2005) (0)
Enhancing the Power of Cardinal's Algorithm (2016) (0)
More on the Power of Randomized Matrix Computations (2012) (0)
Superfast CUR Approximation of Low Rank Matrices ∗ (2017) (0)
The speed-up of the multiplication of matrices of a fixed size (1984) (0)
Correlation between matrix multipilcation and other computational problems. Bit-time, bit-space, stability, and condition (1984) (0)
Real Polynomial Root-finding : New Advances (2016) (0)
Novel Approach to Real Polynomial Root-finding and Matrix Eigen-solving (2014) (0)
Matrix structure and loss-resilient encoding/decoding☆ (2003) (0)
TR-2014009: Estimating the Norms of Random Circulant and Toeplitz Matrices and Their Inverses II (2013) (0)
Superfast Algorithms for Singular Toeplitz-like Matrices ∗ (2004) (0)
On simultaneous evaluation of several polynomials of low degree (two to five) (1966) (0)
VICTOR PAN – MY RESEARCH JOURNEY (2017) (0)
Toeplitz/Hankel Matrix Structure and Polynomial Computations (2001) (0)
New Efficient Hybrid Polynomial Root-finders (2018) (0)
Weakly Random Additive Preconditioning for Matrix Computations ∗ (2016) (0)
TR-2008005: Weakly Random Additive Preconditioning for Matrix Computations (2008) (0)
NEARLY OPTIMAL POLYNOMIAL FACTORIZATION AND ROOTFINDING I: SPLITTING A UNIVARIATE POLYNOMIAL INTO FACTORS OVER AN ANNULUS (2002) (0)
Algorithms for Polynominal Division (1985) (0)
TR-2011011: Randomized and Derandomized Matrix Computations II (2011) (0)
TR-2009010: Randomized Preconditioning versus Pivoting (2009) (0)
2 8 O ct 2 01 2 Randomized Matrix Computations ∗ (2012) (0)
TR-2002002: Can We Optimize Toeplitz/Hankel Computations? II. Singular Toeplitz/Hankel-like Case (2020) (0)
TR-2012008: Randomized Matrix Computations III (2012) (0)
Superfast Least Squares Solution of a Highly Overdetermined Linear System of Equations. (2020) (0)
The Dual JL Transforms and Superfast Matrix Algorithms (2019) (0)
TR-2012012: Condition Estimation by Means of Power Method (2012) (0)
TR-2005007: Null Spaces, Eigensystems, and Small-Rank Modifications (2005) (0)
Chapter 14 - Stability Considerations (2013) (0)
TR-2012016: More on the Power of Randomized Matrix Multiplication I (2012) (0)
TR-2012006: Randomized Matrix Computations II (2012) (0)
TR-2007004: Additive Preconditioning, Eigenspaces, and the Inverse Iteration (2007) (0)
Randomized Preprocessing versus Pivoting II ∗ (2010) (0)
CURRICULUM VITAE WITH RESEARCH ON FOUR PAGES (2021) (0)
On Approximating Complex Polynomial Zeros: Modiied Quadtree (weyl's) Construction and Improved Newton's Iteration on Approximating Complex Polynomial Zeros: Modiied Quadtree (weyl's) Construction and Improved Newton's Iteration (2007) (0)
MY RESEARCH AND SERVICE TO PROFESSION : HIGHLIGHTS (2017) (0)
TR-2004009: A Reduction of the Matrix Eigenproblem to Polynomial Rootfinding via Similarity Transforms into Arrow-Head Matrices (2004) (0)
Linear Systems of Equations (Computer Science) (2003) (0)
Bit-Operation (Boolean) Cost of Arithmetic Computations (1994) (0)
TR-2007021: Row-Column Pivoting in Gaussian Elimination (2007) (0)
Author’s Comments on Don Coppersmith’s Review (1986) (0)
Existence and Solution by Radicals (2013) (0)
TR-2002014: Iterative Inversion of Structured Matrices (2002) (0)
New Algoirthms in the Frobenius Matrix Algebra for Polynomial Root-finding ∗ (2016) (0)
to my research (2021) (0)
TR-2012009: Randomized Matrix Computations IV (2012) (0)
Preface (2011) (0)
Fast Approximation of Polynomial Zeros and Matrix Eigenvalues (2022) (0)
Newton Algebraic Iteration and Newton-Structured Algebraic Iteration (2001) (0)
TR-2014006: New Algorithms in the Frobenius Matrix Algebra for Polynomial Root-Finding (2014) (0)
How Much Randomization Do We Need for Supporting Gaussian Elimination , Block Gaussian Elimination , and Low-rank Approximation ? ∗ (2015) (0)
TR-2009014: Randomized Preprocessing of Homogeneous Linear Systems (2009) (0)
TR-2007003: Additive Preconditioning for Matrix Computations (2007) (0)

This paper list is powered by the following services:

Other Resources About Victor Pan

en.wikipedia.org

What Schools Are Affiliated With Victor Pan?

Victor Pan is affiliated with the following schools: