Recherche
Voici les résultats de votre recherche.
Pages trouvées :
Résultats plein texte:
- methcalchim
- w.numpy.org/|NumPy]] (array manipulations, linear algebra, Fourier transforms, random numbers,... * ... ization in triangular matrices * [[root-finding_algorithm|Root findings : equations f(x) = 0]] ... riangularisation and diagonalisation principles : algorithm and complexity * "divide by zero" erro... dant vectors * special matrix require special algorithms : tridiagonal matrix algorithm (Thomas al
- system_of_linear_equations
- tip>Numerical methods used to solve such problem allow to introduce and experiment on [[wp>Time_compl... ty]], considering cubic time behavior of standard algorithms and //i.e.// quadratic time solutions usi... g/doc/numpy/reference/routines.linalg.html|Linear algebra (numpy.linalg)]] : [[https://docs.scipy.org/... des i+1 and i-1 * Using [[wp>Tridiagonal_matrix_algorithm|tridiagonal Thomas algorithm]] allows to s
- eigenvalues_and_eigenvectors
- Hermitian, orthogonality,... * [[wp>Eigenvalue_algorithm|Eigenvalue algorithm]] * [[wp>Power_iteration|Power iteration]], a simple numerical algorithm producing a number $\lambda$, the greatest... genvector $v$, such that $Av=\lambda v$. * LR algorithm, developed by Heinz Rutishauser (1958 ?)
- numerical_integration
- s interesting to check these errors using various algorithm and mesh resolution. </note> * Equally ... for Equally Spaced Abscissas * 4.2 Elementary Algorithms * 4.5 Gaussian Quadratures and Orthog
- root-finding_algorithm
- findings : equations f(x) = 0 ====== <note tip> Algorithm used to find roots of an equation use iter... stow's_method|Bairstow's method]] is an efficient algorithm for finding the roots of a real polynomial... inuity of the function, and obtain one roots. The algorithm is based on a [[wp>Loop_invariant|loop inv
- partial_differential_equation
- a5|Modeling a Wave on a String With the Finite Difference Method in Python]] Allain Rhett, 16/03/2022