Suchergebnisse - "compact multigrid algorithm"

Complexity of Computations with Matrices and Polynomials: Complexity of computations with matrices and polynomials

Autoren: Pan, Victor

Quelle: SIAM Review. 34:225-262

Schlagwörter: Analysis of algorithms and problem complexity, Other matrix algorithms, residue arithmetic, 0102 computer and information sciences, Symbolic computation and algebraic computation, Matrices--Computer programs, Computer science, 01 natural sciences, binary segmentations, Computation of special functions and constants, construction of tables, Complexity and performance of numerical algorithms, Polynomials--Computer programs, arithmetic complexity, compact multigrid algorithm, Computational aspects of field theory and polynomials, fixed and variable precision computations, polynomial computations, complexity estimates, 0101 mathematics, matrix computations, polynomial division, Algorithms

Dateibeschreibung: application/xml

Zugangs-URL: https://academiccommons.columbia.edu/doi/10.7916/D80Z7BDV/download