The Stack Overflow podcast is back! Listen to an interview with our new CEO.


A tag is a keyword or label that categorizes your question with other, similar questions. Using the right tags makes it easier for others to find and answer your question.

× 138
The process of representing a continuum space with a finite set of points/elements
× 132
a Python-based ecosystem of open-source software for mathematics, science, and engineering.
× 123
Questions relating to graphing and displaying numerical data
× 122
Questions about the theory and numerical algorithms for optimizing (minimizing or maximizing) nonlinear functions, possibly subject to equality and/or inequality constraints.
× 119
High Performance Computing generally uses large arrays of computers connected in clusters or grids.
× 115
Referring to optimization problems that consist only of linear constraints and a linear objective function.
× 115
Also called numerical integration, quadrature refers to the approximation of an integral made by evaluating the integrand at a finite number of points.
× 111
a general purpose programming language. Originally intended for implementing system software, C and its close relatives are the principle languages used in most modern operating systems. Due to i…
× 107
a set of numerical methods for ordinary differential equations for the approximation of their solutions.
× 105
Method for finding successively better approximations to the roots (or zeroes) of a real-valued function
× 105
A method of representing numbers by a fixed number of significant digits, and the exponent of some base number. They are characterized in the form ${(significant digits)}*base^{exponent}$. Typi…
× 103
a commonly used library of subroutines for numerical linear algebra tasks, including solutions of linear sets of equations, linear least squares, eigenvalue problems…
× 103
Questions about solution methods of the Navier-Stokes equations, related physical constants and non-dimensional number. Also special methods to solve the equations including the assumptions and their …
× 101
the fundamental package for scientific computing with Python.
× 101
Hyperbolic partial differential equations describe wave behavior.
× 99
The generation of a set of interconnected geometric objects that approximate a desired domain or region in euclidean space.
× 97
Questions on Monte Carlo methods, methods that require the repeated generation of (pseudo-, quasi-)random numbers for computing their results.
× 96
A collection of related programming functions implementing a set of abstract data types, mathematical functions, or other higher level analysis algorithms so that they may be used, and reused, by othe…
× 95
Questions on the computational aspects of Fourier analysis, including the various applications of the fast Fourier transform (FFT).
× 92
Referring to a time independent partial differential equation of the form $\nabla^2u=f$
× 89
Machine learning, a branch of artificial intelligence, is the science of getting computer systems to meaningfully act without being explicitly programmed by human.
× 89
Numerical methods and problems involving the solution of the Schrodinger equation and related subatomic models.
× 89
The study of collection, organization, analysis, and interpretation of data.
× 88
Message Passing Interface - a standard and highly portable parallel programming interface for distributed memory systems.
× 86
Molecular dynamics simulations aim at solving the equations of motion of the atoms belonging to a molecular system using explicit time propagation and taking into account the effect of temperature on …
× 86
Questions about the finite element method software FEniCS and its subpackages (Dolfin, UFL, FFC).
× 85
Questions about analysis, implementation or application of Galerkin methods for partial differential equations using piecewise functions that are not globally continuous (and hence require surface ter…
× 85
For questions regarding design and implementation of preconditioners for solving linear systems.
× 81
Relating to the level of difficulty of a calculation or the asymptotic running time of an algorithm.