Numerical methods for partial differential equationsNumerical methods for partial differential equations is the branch of numerical analysis that studies the numerical solution of partial differential equations (PDEs). In principle, specialized methods for hyperbolic, parabolic or elliptic partial differential equations exist. Finite difference method In this method, functions are represented by their values at certain grid points and derivatives are approximated through differences in these values.
Algèbre linéairevignette|R3 est un espace vectoriel de dimension 3. Droites et plans qui passent par l'origine sont des sous-espaces vectoriels. L’algèbre linéaire est la branche des mathématiques qui s'intéresse aux espaces vectoriels et aux transformations linéaires, formalisation générale des théories des systèmes d'équations linéaires. L'algèbre linéaire est initiée dans son principe par le mathématicien perse Al-Khwârizmî qui s'est inspiré des textes de mathématiques indiens et qui a complété les travaux de l'école grecque, laquelle continuera de se développer des siècles durant.
Relaxation (iterative method)In numerical mathematics, relaxation methods are iterative methods for solving systems of equations, including nonlinear systems. Relaxation methods were developed for solving large sparse linear systems, which arose as finite-difference discretizations of differential equations. They are also used for the solution of linear equations for linear least-squares problems and also for systems of linear inequalities, such as those arising in linear programming. They have also been developed for solving nonlinear systems of equations.
Jordan matrixIn the mathematical discipline of matrix theory, a Jordan matrix, named after Camille Jordan, is a block diagonal matrix over a ring R (whose identities are the zero 0 and one 1), where each block along the diagonal, called a Jordan block, has the following form: Every Jordan block is specified by its dimension n and its eigenvalue , and is denoted as Jλ,n. It is an matrix of zeroes everywhere except for the diagonal, which is filled with and for the superdiagonal, which is composed of ones.
PréconditionUne précondition est une condition appliquée au début d'un calcul ou d'une fonction informatique, et permettant d'en valider le résultat. Si P est un prédicat et S une substitution, P | S, qui se lit : le prédicat P préconditionne la substitution S, est défini par : [P | S] I ⟺ P & [S] I qui se lit : La substitution conditionnée [P | S] établit I si et seulement si P et ("et" logique) la substitution S établit que I est vrai. Du fait du &, si la précondition P est fausse, P & [S] I est faux. P | S a une fo
PeriodogramIn signal processing, a periodogram is an estimate of the spectral density of a signal. The term was coined by Arthur Schuster in 1898. Today, the periodogram is a component of more sophisticated methods (see spectral estimation). It is the most common tool for examining the amplitude vs frequency characteristics of FIR filters and window functions. FFT spectrum analyzers are also implemented as a time-sequence of periodograms. There are at least two different definitions in use today.
Linear system of divisorsIn algebraic geometry, a linear system of divisors is an algebraic generalization of the geometric notion of a family of curves; the dimension of the linear system corresponds to the number of parameters of the family. These arose first in the form of a linear system of algebraic curves in the projective plane. It assumed a more general form, through gradual generalisation, so that one could speak of linear equivalence of divisors D on a general scheme or even a ringed space (X, OX).
Iterative deepening depth-first searchIn computer science, iterative deepening search or more specifically iterative deepening depth-first search (IDS or IDDFS) is a state space/graph search strategy in which a depth-limited version of depth-first search is run repeatedly with increasing depth limits until the goal is found. IDDFS is optimal like breadth-first search, but uses much less memory; at each iteration, it visits the nodes in the search tree in the same order as depth-first search, but the cumulative order in which nodes are first visited is effectively breadth-first.
Décomposition primaireLa décomposition primaire est une généralisation de la décomposition d'un nombre entier en facteurs premiers. Cette dernière décomposition, connue depuis Gauss (1832) sous le nom de théorème fondamental de l'arithmétiqueGauss 1832., s'étend naturellement au cas d'un élément d'un anneau principal. Une décomposition plus générale est celle d'un idéal d'un anneau de Dedekind en produit d'idéaux premiers; elle a été obtenue en 1847 par Kummer (dans le formalisme encore peu maniable des « nombres idéaux ») à l'occasion de ses recherches sur le dernier théorème de FermatKummer 1847.
Coordinate conditionsIn general relativity, the laws of physics can be expressed in a generally covariant form. In other words, the description of the world as given by the laws of physics does not depend on our choice of coordinate systems. However, it is often useful to fix upon a particular coordinate system, in order to solve actual problems or make actual predictions. A coordinate condition selects such coordinate system(s). The Einstein field equations do not determine the metric uniquely, even if one knows what the metric tensor equals everywhere at an initial time.
