IEEE Computer Society - Keywords - Mathematics of Computing
G.0 General
G.1 Numerical Analysis
G.1.0General
G.1.0.aComputer arithmetic
G.1.0.bConditioning and ill-conditioning
G.1.0.cError analysis
G.1.0.dInterval arithmetic
G.1.0.eMultiple precision arithmetic
G.1.0.fNumerical algorithms
G.1.0.gParallel algorithms
G.1.0.hStability and instability
G.1.1Interpolation
G.1.1.aDifference formulas
G.1.1.bExtrapolation
G.1.1.cInterpolation formulas
G.1.1.dSmoothing
G.1.1.eSpline and piecewise polynomial interpolation
G.1.2Approximation
G.1.2.aApproximation of surfaces and contours
G.1.2.bChebyshev approximation and theory
G.1.2.cElementary function approximation
G.1.2.dFast Fourier transforms
G.1.2.eLeast squares approximation
G.1.2.fLinear approximation
G.1.2.gMinimax approximation and algorithms
G.1.2.hNonlinear approximation
G.1.2.iRational approximation
G.1.2.jSpecial function approximations
G.1.2.kSpline and piecewise polynomial approximation
G.1.2.lWavelets and fractals
G.1.3Numerical Linear Algebra
G.1.3.aConditioning
G.1.3.bDeterminants
G.1.3.cEigenvalues and eigenvectors
G.1.3.dError analysis
G.1.3.eLinear systems
G.1.3.fMatrix inversion
G.1.3.gPseudoinverses
G.1.3.hSingular value decomposition
G.1.3.iSparse, structured, and very large systems
G.1.4Quadrature and Numerical Differentiation
G.1.4.aAdaptive and iterative quadrature
G.1.4.bAutomatic differentiation
G.1.4.cEqual interval integration
G.1.4.dError analysis
G.1.4.eFinite difference methods
G.1.4.fGaussian quadrature
G.1.4.gIterative methods
G.1.4.hMultidimensional (multiple) quadrature
G.1.5 Roots of Nonlinear Equations
G.1.5.aContinuation (homotopy) methods
G.1.5.bConvergence
G.1.5.cError analysis
G.1.5.dIterative methods
G.1.5.ePolynomials, methods for
G.1.5.fSystems of equations
G.1.6 Optimization
G.1.6.aConstrained optimization
G.1.6.bConvex programming
G.1.6.cGlobal optimization
G.1.6.dGradient methods
G.1.6.eInter programming
G.1.6.fLeast squares methods
G.1.6.gLinear programming
G.1.6.hNonlinear programming
G.1.6.iQuadratic programming methods
G.1.6.jSimulated annealing
G.1.6.kStochastic programming
G.1.6.lUnconstrained optimization
G.1.7 Ordinary Differential Equations
G.1.7.aBoundary value problems
G.1.7.bChaotic systems
G.1.7.cConvergence and stability
G.1.7.dDifferential-algebraic equations
G.1.7.eError analysis
G.1.7.fFinite difference methods
G.1.7.gInitial value problems
G.1.7.hMultistep and multivalue methods
G.1.7.iOne-step (single step) methods
G.1.7.jStiff equations
G.1.8 Partial Differential Equations
G.1.8.aDomain decomposition methods
G.1.8.bElliptic equations
G.1.8.cFinite difference methods
G.1.8.dFinite element methods
G.1.8.eFinite volume methods
G.1.8.fHyperbolic equations
G.1.8.gInverse problems
G.1.8.hIterative solution techniques
G.1.8.iMethod of lines
G.1.8.jMultigrid and multilevel methods
G.1.8.kParabolic equations
G.1.8.lSpectral methods
G.1.9 Integral Equations
G.1.9.aDelay equations
G.1.9.bFredholm equations
G.1.9.cIntro-differential equations
G.1.9.dVolterra equations
G.1.10 Applications
G.1.m Miscellaneous
back to top
G.2 Discrete Mathematics
G.2.0 General
G.2.1 Combinatorics
G.2.1.a Combinatorial algorithms
G.2.1.b Counting problems
G.2.1.c Generating functions
G.2.1.d Permutations and combinations
G.2.1.e Recurrences and difference equations
G.2.2 Graph Theory
G.2.2.a Graph algorithms
G.2.2.b Graph labeling
G.2.2.c Hypergraphs
G.2.2.d Network problems
G.2.2.e Path and circuit problems
G.2.2.f Trees
G.2.3 Applications
G.2m Miscellaneous
back to top
G.3 Probability and Statistics
G.3.a Contingency table analysis
G.3.b Correlation and regression analysis
G.3.c Distribution functions
G.3.d Experimental design
G.3.e Markov processes
G.3.f Multivariate statistics
G.3.g Nonparametric statistics
G.3.h Probabilistic algorithms
G.3.i Queuing theory
G.3.j Random number generation
G.3.k Reliability and life testing
G.3.l Renewal theory
G.3.m Robust regression
G.3.n Statistical computing
G.3.o Statistical software
G.3.p Stochastic processes
G.3.q Survival analysis
G.3.r Time series analysis
back to top
G.4 Mathematical Software
G.4.a Algorithm design and analysis
G.4.b Certification and testing
G.4.c Documentation
G.4.d Efficiency
G.4.e Parallel and vector implementations
G.4.f Portability
G.4.g Reliability and robustness
G.4.h User interfaces
G.4.i Verification
back to top
G.m Miscellaneous
G.m.a Queuing theory
back to top
This is an extended version of the ACM Computing Classification System
Copyright (c) 2002 ACM, used with permission
