RESEARCHER PROFILE

Rhys Eric Rosholt

← Back to Lehman College

R

Lehman College

Matrix Theory and AlgorithmsNumerical Methods and AlgorithmsPolynomial and algebraic computationMathematical and Computational MethodsCryptography and Residue Arithmetic

Rhys Eric Rosholt works in Matrix Theory and Algorithms, Numerical Methods and Algorithms, Polynomial and algebraic computation, Mathematical and Computational Methods, Cryptography and Residue Arithmetic. Recorded institutional associations include Lehman College, City University of New York.

35Publications
265Citations
10H-index

Inclusion identifies researchers whose recorded research contributions may inform their university’s understanding of its research community. It does not rank individual research quality or establish current employment.

Selected research works

Up to 100 highly cited works; DOI links open the original research. Counts reflect the collected record, not real-time citation totals.

  1. Schur aggregation for linear systems and determinants

    2008 · 40 citations
  2. Additive preconditioning for matrix computations

    2009 · 33 citations
  3. Homotopic residual correction processes

    2005 · 29 citations
  4. Additive preconditioning and aggregation in matrix computations

    2007 · 27 citations
  5. Root-Finding with Eigen-Solving

    2007 · 25 citations
  6. Additive Preconditioning for Matrix Computations

    2008 · 20 citations
  7. A new error-free floating-point summation algorithm

    2009 · 17 citations
  8. The schur aggregation for solving linear systems of equations

    2007 · 14 citations
  9. Real root-finding

    2007 · 13 citations
  10. 7. Newton's Iteration for Structured Matrices

    1999 · 12 citations
  11. Unified Nearly Optimal Algorithms for Structured Integer Matrices

    2010 · 6 citations
  12. Eigen-solving via reduction to DPR1 matrices

    2008 · 6 citations
  13. Additive preconditioning in matrix computations

    2007 · 5 citations
  14. TR-2004013: Toeplitz and Hankel Meet Hensel and Newton: Nearly Optimal Algorithms and Their Practical Acceleration with Saturated Initialization

    2004 · 4 citations
  15. Nearly optimal symbolic-numerical algorithms for structured integer matrices and polynomials

    2009 · 4 citations
  16. TR-2002015: Residual Correction Algorithms for General and Structured Matrices

    2002 · 4 citations
  17. Linking the TPR1, DPR1 and Arrow-Head Matrix Structures

    2006 · 3 citations
  18. A Novel Buffer Cache Scheme Using Java Card Object with High Locality for Efficient Java Card Applications

    2007 · 2 citations
  19. TR-2006007: Root-Finding with Eigen-Solving

    2006 · 1 citations
  20. TR-2007010: Error-Free Computations via Floating-Point Operations

    2007 · 0 citations
  21. TR-2008003: Unified Nearly Optimal Algorithms for Structured Integer Matrices and Polynomials

    2008 · 0 citations
  22. TR-2005008: Toeplitz and Hankel Meet Hensel and Newton Modulo a Power of Two

    2005 · 0 citations
  23. TR-2006006: Additive Preconditioning and Aggregation in Matrix Computations

    2006 · 0 citations
  24. TR-2007022: The Schur Aggregation for Linear Systems and Determinants

    2007 · 0 citations
  25. TR-2005009: Additive Preconditioning in Matrix Computations

    2005 · 0 citations

← Return to the university profile