Talk:List of numerical analysis topics

Mathematics High‑priority

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles
High	This article has been rated as High-priority on the project's priority scale.

Outlines Low‑importance

	This article is an outline, a type of article that presents a list of articles or sub-topics related to its subject in a hierarchical form. For the standardized set of outlines on Wikipedia, see Wikipedia:Contents/Outlines. Outlines are within the scope of WikiProject Outlines, a collaborative effort to improve outlines on Wikipedia. For guidance on building and maintaining outlines, see Wikipedia:Outlines.OutlinesWikipedia:WikiProject OutlinesTemplate:WikiProject OutlinesOutlines articles
Low	This article has been rated as Low-importance on the importance scale.

Numeric Monte[edit]

Is there a Numeric Monte package? :) Charles Matthews 05:44, 6 May 2004 (UTC)[reply]

List updater[edit]

In subsection A below, listed are articles which are missing from the List of numerical analysis topics. They were found by looking in the categories in subsection C. One can add more categories to be searched to subsection C, see some suggestions in subsection D.

All this process can be restarted by clicking on the link at the bottom of subsection E.

Please note that anything around here is editable, but please don't modify the lines of the form

or their order.

A: Articles missing from the List of numerical analysis topics[edit]

Algebraic eigenvalue problem -- All-serial CORDIC -- Branching CORDIC -- Closest point method -- Compensated CORDIC -- Coordinate Rotation Digital Computer -- DCORDIC -- Differential CORDIC -- Factor combining -- Finite Legendre transform -- GetFEM++ -- Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables -- Hybrid CORDIC -- Identifiability Analysis -- Karlsruhe Accurate Arithmetic -- Kulisch arithmetic -- List of operator splitting topics -- Material point method -- Merged CORDIC -- Model order reduction -- Modulus of smoothness -- Multilevel fast multipole method -- ND4J (software) -- ND4S -- NIST Handbook of Mathematical Functions -- Newton–Krylov method -- Order of approximation -- Pipelined CORDIC -- Pocketbook of Mathematical Functions -- Pseudo-multiplication -- Redundant CORDIC -- Rounding Errors in Algebraic Processes -- Scale co-occurrence matrix -- Scarborough criterion -- The Algebraic Eigenvalue Problem -- Unified CORDIC -- Volder's algorithm -- Whitney inequality -- Bernstein's theorem (polynomials) -- Kolmogorov–Arnold representation theorem -- Least-squares function approximation -- Arakelyan's theorem -- Knuth's Simpath algorithm -- The Art of Computer Programming -- Treiber Stack -- Chronology of computation of π -- Zhao Youqin's π algorithm -- Chirp Z-transform -- Beam and Warming scheme -- Central differencing scheme -- Falling and rising factorials -- Proximal gradient methods for learning -- Structured sparsity regularization -- Discrete spline interpolation -- Regression-Kriging -- Sarason interpolation theorem -- Active set method -- Applicable mathematics -- Benders decomposition -- Constructive cooperative coevolution -- Constructive heuristic -- Deterministic global optimization -- Dual norm -- Evolutionary multimodal optimization -- Exact algorithm -- General Mission Analysis Tool -- International Society for Structural and Multidisciplinary Optimization -- Intertemporal budget constraint -- Inventory theory -- Map segmentation -- Max–min inequality -- Minimax theorem -- NP-completeness -- Non-negative least squares -- Online optimization -- Parametric programming -- Pontryagin's maximum principle -- Proximal operator -- S-procedure -- Semidefinite embedding -- Simulation-based optimization -- Sports rating system -- State transition algorithm -- Steiner's calculus problem -- Unit commitment problem in electrical power production -- Weber problem -- Affine scaling -- Fundamental theorem of linear programming -- Network simplex algorithm -- Revised simplex method -- Caratheodory-π solution -- Double-setpoint control -- GPOPS-II -- Microgrid -- Adaptive dimensional search -- BOBYQA -- Berndt–Hall–Hall–Hausman algorithm -- Communication-avoiding algorithms -- DATADVANCE -- Derivative-free optimization -- Divide and conquer algorithms -- Generalized iterative scaling -- Genetic improvement (computer science) -- LINCOA -- NEWUOA -- PSeven -- Quasi-Newton Inverse Least Squares Method -- Quasi-Newton Least Squares Method -- Social cognitive optimization -- TOLMIN (optimization software) -- Truncated Newton method -- UOBYQA -- Held–Karp algorithm -- Line wrap and word wrap -- Most frequent k characters -- Shortest common supersequence problem -- WASP (cricket calculation tool) -- Correlation gap -- Construction of an irreducible Markov chain in the Ising model -- MPMC -- Mean field particle methods -- Metropolis-adjusted Langevin algorithm -- Monte Carlo tree search -- Sampling in order -- TraPPE force field -- Volumetric path tracing -- Time-dependent variational Monte Carlo -- Microscale and macroscale models -- P-FEM -- Principles of grid generation -- Raviart–Thomas basis functions -- Strang splitting -- Volume of fluid method -- Finite element exterior calculus -- Mixed finite element method -- SimScale -- Surface triangulation -- Armadillo (C++ library) -- DADiSP -- Data Analytics Acceleration Library -- Dune (software) -- ILNumerics -- Interpolative decomposition -- OpenBLAS -- Rybicki Press algorithm -- SequenceL -- Wolfram Language -- Least squares adjustment -- Partial least squares path modeling -- Polynomial least squares -- Robust principal component analysis -- Sparse matrix-vector multiplication --

B: Place here articles not wanted either in the List of numerical analysis topics or in subsection A.[edit]

Should not be included in the list[edit]

Abaqus, AIMMS, Algebraic modeling language, ALGOR, AMD Core Math Library, AMPL, Analytica (software), ANSA Pre-processor, ANSYS, APMonitor, APOPT, Automatically Tuned Linear Algebra Software, Basic Linear Algebra Subprograms, Biology Monte Carlo method, BLOPEX, Breve (software), Bridge Software Institute, CASINO, COBYLA, DIDO (software), EISPACK, Electromagnetic Design System, FEDEM, FEFLOW, Femap, FEniCS Project, FFTPACK, FFTW, Flexcom, General Algebraic Modeling System, General Matrix Multiply, GNU Multi-Precision Library, GotoBLAS, Hermes Project, HFSS, Hypre, IPOPT, Jacket (software), Julia (programming language). LAPACK, LINPACK, Lis (linear algebra library), LS-DYNA, LUSAS, MATLAB, Math Kernel Library, MOEA Framework, Momentum (electromagnetic simulator), MPIR (mathematics software), MPS (format), Nastran, NEi Nastran, nl (format), OOFEM, OpenBUGS, Paradiseo, PARI/GP, Portable, Extensible Toolkit for Scientific Computation, PROPT, QUADPACK, Quickfield, Range Software, Safehull, SAMCEF, SAMPL, SLEPc, sol (format), Speakeasy (computational environment), Starmad, STRAND7, Vflo, Virtual Cell, VisualFEA (software)
Alexander Hrennikoff, Athanasios Papoulis, Bruce Irons (engineer), Daniel Gillespie, David B. Hertz, Elliott Ward Cheney, Jr., Enrico Fermi, Ervand Kogbetliantz, Gene H. Golub, John Argyris, John von Neumann, Josiah Willard Gibbs, Kazushige Goto, Max Gunzburger, Nassim Nicholas Taleb, Nicholas Metropolis, Olgierd Zienkiewicz, Phelim Boyle, Philippe G. Ciarlet, Renfrey Potts, Richard Courant, Stanislaw Ulam, Steven Anson Coons, Walter Edwin Arnoldi (people go in list of mathematicians)
Alpha–beta pruning, Ant colony optimization algorithms, Approximate string matching, Assignment problem, Auction algorithm, Bellman–Ford algorithm, Bin packing problem, Bitonic tour, Borůvka's algorithm, Braess' paradox, Branch and bound, Branch and cut, Branch and price, Coffman–Graham algorithm, Cutting-plane method, Damerau–Levenshtein distance, Dead-end elimination, Extremal optimization, Floyd–Warshall algorithm, Forward–backward algorithm, Graver basis, Hirschberg's algorithm, Hungarian algorithm, Hunt–McIlroy algorithm, Integer points in convex polyhedra, Knapsack problem, Kruskal's algorithm, Levenshtein distance, Lin-Kernighan, Longest alternating subsequence, Longest common subsequence problem, Longest common substring problem, Longest increasing subsequence, Matrix chain multiplication, Maximum subarray problem, Minimum spanning tree, Monte-Carlo tree search, MTD-f, Needleman–Wunsch algorithm, Optimal design, Overlapping subproblems, Prim's algorithm, Pruning (algorithm), Pseudo-Boolean function, Shortest common supersequence, Smith–Waterman algorithm, Special ordered set, Subset sum problem, Tree rearrangement, Viterbi algorithm, Word wrap, 2-opt, 3-opt, k-opt (all combinatorial or discrete optimization)
Anti-diagonal matrix, Diagonal matrix, Generalized permutation matrix, Identity matrix, Permutation matrix, Shear matrix, Shift matrix, Single-entry matrix, Zero matrix (sparse matrix types that are typically studied outside numerical analysis)
Artificial development, Effective fitness, Evolutionary art, Evolutionary Acquisition of Neural Topologies, Gene expression programming, Grammatical evolution, Human-based genetic algorithm, HyperNEAT, Interactive evolutionary computation, Interactive genetic algorithm, Learning classifier system, Neuroevolution, Neuroevolution of augmenting topologies (artificial evolution articles without link to optimization or numerical analysis)
Bareiss algorithm, Block Lanczos algorithm for nullspace of a matrix over a finite field, Block Wiedemann algorithm, Double dabble, Fisher–Yates shuffle, Method of Four Russians (discrete algorithms)
Bayesian efficiency, Calculus of variations, Difference polynomials, Faulhaber's formula, Holonomic, Hu Washizu principle, Machin-like formula, Pochhammer symbol, Steiner's problem, Table of Newtonian series, Umbral calculus (analytic, not numerical)
Binding constraint, Exponential random numbers, Illinois algorithm, Non-binding constraint, Poisson random numbers, Reverse Cuthill-McKee algorithm (redirects)
Blind signal separation, Coefficient of determination, Dynamic mode decomposition, Explained sum of squares, Fraction of variance unexplained, Generalized least squares, Lack-of-fit sum of squares, Least squares support vector machine, Mean squared error, Ordinary least squares, Partial least squares regression, Partition of sums of squares, Principal component analysis, Proofs involving ordinary least squares, Residual sum of squares, Total sum of squares (more statistics than numerical analysis)
Buffon's needle, Leibniz formula for pi (not practical within numerical analysis)
Cake number, Jeep problem, Lazy caterer's sequence (optimization problems with no numerical aspects)
Central composite design (experimental design)
Cellular Potts model (stochastic model, but not numerical analysis)
Crew scheduling, Fernandez’s method, Job-shop problem, Job shop scheduling, Multi-armed bandit, Multiprocessor scheduling, Open-shop scheduling, Sequence-dependent setup, Single-machine scheduling (scheduling is discrete optimization)
CYK algorithm, Earley parser, Database tuning, Optimization (computer science) (that is computer science)
Decomposition (computer science), Matheuristics, Metaheuristic, Modular design, Parallel metaheuristic, Swarm intelligence (more general concepts than numerical analysis)
Differential algebraic equation, Eigenvalues and eigenvectors, Kempner series, Kernel (linear algebra), Linear algebra, List of publications in mathematics, Matrix analysis, Matrix multiplication, Partial differential algebraic equation, Polynomial, System of linear equations, Trajectory (fluid mechanics), Trigonometric polynomial (only a small part of these articles is about numerical analysis)
Hawk and dove (game theory), Homicidal chauffeur problem, Killer heuristic, Minimax, Negamax, Pareto efficiency, Walrasian auction (more game theory than optimization)
Institute of Robotics in Scandinavia AB (company with little to do with numerical analysis)
Kernel (matrix) (the list contains a link to a section of this article)
List of numerical analysis topics (no self-references)
Mutation testing
P versus NP problem, NP-complete, Weakly NP-complete (more computer science)
Quality control and genetic algorithms
Quincunx (too hard too spell; also computer graphics)
Quote notation (exact, so not numerical analysis)
Rational root theorem, Ruffini's rule (symbolic, not numerical)
Sculpted prim (specific to Second Life)
Tau-leaping (simulation technique but not numerical analysis)
Ziff–Gulari–Barshad model (too much chemistry and Monte Carlo)

Unsure[edit]

Artificial bee colony algorithm, Artificial development, Artificial immune system, Bees algorithm, Biogeography-based optimization, Biologically inspired algorithms, Cuckoo search, Cultural algorithm, Eagle strategy, Firefly algorithm, Glowworm swarm optimization, Graduated optimization, Hyper-heuristic, Imperialist competitive algorithm, Intelligent Water Drops algorithm, IOSO, Iterated local search, Multi-swarm optimization, Natural evolution strategy, Search-based software engineering, Very large-scale neighborhood search (more frameworks than methods?)
Artificial neural network, Compositional pattern-producing network, Group method of data handling (general computational tools, not really numerics)
Autocorrelation technique
Artificial precision, Automatic basis function construction, Reversible jump (don't understand enough of article to classify it)
Basis function
Carlson's theorem, Delta operator, Indefinite sum, Mean value theorem (divided differences), Nörlund–Rice integral, Reciprocal difference, Thiele's interpolation formula (calculus of finite differences; might be too analytical but might also have applications in NA)
CMA-ES
Combinatorial data analysis
Complex wavelet transform / Discrete wavelet transform
Constraint optimization, Distributed constraint optimization, Goal programming, Ordinal optimization, Zionts–Wallenius method
Divide and conquer algorithm, Prune and search (more a general algorithm paradigms)
Dynamic time warping, Greedy algorithm, Greedy randomized adaptive search procedure, Hill climbing, Local search (optimization), Quantum annealing, Random-restart hill climbing, Reactive search, Stochastic hill climbing (currently more about discrete optimization, but may be expanded to cover continuous optimization)
Flexibility method (more structural physics / engineering?)
Finite element machine, MANIAC II (specific computers)
Generalized singular value decomposition, Orthogonal Procrustes problem, Rank factorization, Schmidt decomposition, Singular value, Pseudospectrum, Spectral theorem, Two-dimensional singular value decomposition (too much linear algebra?)
Geometry of roots of real polynomials, Solving quadratic equations with continued fractions
Kriging, Multiple-indicator kriging, Markov chain geostatistics, Regionalized variable theory, Regression-kriging, Transiogram (could well be a standard mathematical or statistical techniques applied to geology; perhaps not numerical?)
Lloyd's algorithm (unclear what it optimized)
Mathematics of Operations Research, Operations research (what is the relation between OR and optimization?)
Moment problem, Sion's minimax theorem, Viscosity solution (too much analysis?)
Normal mode, Structural analysis (very applied)
Pidgin code
Resampling (statistics), Slice sampling
RTCP hierarchical aggregation
Schild's ladder (computational geometry)
Secular equation / Secular function
Triangulation (topology) (homeomorphism makes it not useful in practice?)
Variation diminishing property (quite a general mathematical concept, perhaps more analysis?)

C: Categories to be searched[edit]

The bot will look for potential additions to the List of numerical analysis topics in this list of categories. You may add any other categories to this list, for example from subsection D below. Use the format [[:Category:XXX]] (the colon (:) shows up twice!).

Category:Numerical analysis