MCPcopy Create free account
hub / github.com/TheAlgorithms/C-Plus-Plus / eigen_values

Function eigen_values

numerical_methods/qr_eigen_values.cpp:98–165  ·  view source on GitHub ↗

Compute eigen values using iterative shifted QR decomposition algorithm as * follows: * 1. Use last diagonal element of A as eigen value approximation \f$c\f$ * 2. Shift diagonals of matrix \f$A' = A - cI\f$ * 3. Decompose matrix \f$A'=QR\f$ * 4. Compute next approximation \f$A'_1 = RQ \f$ * 5. Shift diagonals back \f$A_1 = A'_1 + cI\f$ * 6. Termination condition check: last element below d

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 3

test1Function · 0.85
test2Function · 0.85
mainFunction · 0.85

Calls 3

qr_decomposeFunction · 0.85
mat_mulFunction · 0.85
sizeMethod · 0.45

Tested by

no test coverage detected