Recherche
Voici les résultats de votre recherche.
Pages trouvées :
Résultats plein texte:
- methcalchim
- : factorization in triangular matrices * [[root-finding_algorithm|Root findings : equations f(x) = 0]] * Polynomial equations * Dichotomy * S... onal matrix algorithm (Thomas algorithm) * Root findings * Bisection method (dichotomy) : simple ... * Types de traitements numériques * Différences finies et problèmes de diffusion * Schémas classiqu
- partial_differential_equation
- ed and implemented in specialized softwares : * Finite element method * Finite volume method * Boundary element method * Spectral method * Multigr... rtial differential equations]] However, the [[wp>Finite_difference_method|finite difference method]] can be more easliy applied to a lot of classical PDE.
- root-finding_algorithm
- ====== Root findings : equations f(x) = 0 ====== <note tip> Algorithm used to find roots of an equation use iterations, and a numer... Bairstow's method]] is an efficient algorithm for finding the roots of a real polynomial of arbitrary d... Chapter 9 in the book "Numerical Recipes" : Root finding an nonlinear sets of equations * 9.0 Intr
- numerical_integration
- al integration ====== <note tip> Calculation of definite integrals implies to replace the function by a... ation]] depends on parameters of the method and refinement of spatial grid discretization. It is intere
- eigenvalues_and_eigenvectors
- ow.com/questions/6684238/whats-the-fastest-way-to-find-eigenvalues-vectors-in-python]] * [[https://me
- system_of_linear_equations
- ed "exactly" using linear algebra algorithms in a finite and known number of arithmetic operations. *