7.3 Numerical computing
7.3 Numerical calculations — learning path connecting EDA fundamentals to open practice.
In this section
FFT (fast Fourier transform)
The first line contains two integers. The next line of numbers, from low to high, represe…
02Cantor expansion
Cantor expansion can find the ranking of an arrangement within a complexity of O ( n 2 ) …
03Tensors
In computer learning, I think a scalar can be understood as a sign used for statistics or…
04Lagrange interpolation
Using polynomials as a tool to study interpolation is called algebraic interpolation. The…
05Numerical optimization with SIMD
SIMD stands for Single Instruction Multiple Data, Single Instruction Multiple Data Stream…
06Sequences (1): permutations & combinations
There can be n n n types of methods to complete a project, a i ( 1 ≤ i ≤ n ) a_i(1 \le i …
07Sequences (2): Catalan numbers
H n = ( 2 n n ) n + 1 ( n ≥ 2 , n ∈ N + ) H_n = \frac{\binom{2n}{n}}{n+1}(n \geq 2, n \in…
08Sequences (3): Stirling numbers of the first kind
The first type of Stirling number (Stirling rotation number) [ n k ] \begin{bmatrix}n\\ k…
09Sequences (4): Stirling numbers of the second kind
The second type of Stirling number (Stirling subset number) { n k } \begin{Bmatrix}n\\ k\…
10Convex hull
The essence is in order and maintaining that nature. The first step in online algorithm c…
11Newton iteration
Newton's method provides a numerical solution to the root of any equation, and the optimi…
127.3.13 Characteristic polynomial
We consider an n × n n\times n n × n matrix A A A , where n ≥ 0 ∧ n ∈ Z n\geq 0\land n\in…
13Gaussian elimination
For a system of linear equations, such as: Now we want to solve this system of linear equ…