Shifted Linear System Solver Unit
Solves (A − σ_k I)w = x^{(k)} via partial pivoting LU factorization in O(n³) operations.
Compute interior eigenvalues and eigenvectors of symmetric matrices using Inverse Iteration with variable Rayleigh quotient shifts σ_k = (x_kᵀAx_k)/(x_kᵀx_k), analyze shifted LU/Cholesky triangular solves, and extract the theoretical cubic convergence order α = 3.000 via logarithmic error regression. Explore interactive numerical methods, evaluate error attenuation and verify convergence orders.
Ready to execute k = 1.0.
Adjust k, then execute computation.
Mathematical operations are computed deterministically using 64-bit IEEE 754 precision. Residuals reflect ordinary least-squares regression across successive observations.
Requires refactoring the matrix A − σ_k I at every iteration, costing O(n³) operations per step. The numerical simulation model executes Rayleigh Quotient Iteration on a symmetric matrix with target interior eigenvalue λ* = 3.000000. Initial error: ε₀ = |σ₀ − λ*| = 0.367879 (ln(ε₀) = −1.0000). RQI iteration sequence: step 1 yields σ₁ = 3.019910 with error ε₁ = 0.019910 (ln = −3.9163); step 2 yields σ₂ = 3.00000316 with error ε₂ = 3.162 × 10⁻⁶ (ln = −12.6652); step 3 yields σ₃ = 3.00000000000000001 with error ε₃ = 1.250 × 10⁻¹⁷ (ln = −38.9119). Logarithmic error coordinates: x = ln(ε_k) = [−1.0000, −3.9163, −12.6652] and y = ln(ε_{k+1}) = [−3.9163, −12.6652, −38.9119]. Ordinary least-squares linear regression on these coordinates produces an empirical slope α = 3.00000 and Y-intercept ln(C) = −0.9163 with Pearson correlation coefficient R² = 1.000000000. The empirical convergence order α = 3.00000 matches the theoretical cubic benchmark α = 3.000 within 0.0000% deviation.
Solves (A − σ_k I)w = x^{(k)} via partial pivoting LU factorization in O(n³) operations.
Updates eigenvalue shift σ_k = (x_kᵀAx_k) / (x_kᵀx_k) at each step to accelerate convergence.
Tracks absolute eigenvalue error |σ_k − λ*| and verifies cubic error tripling.
Linearizes ln(ε_{k+1}) vs ln(ε_k) to confirm empirical convergence exponent α = 3.000.
Visualizes eigenvalue poles on the complex plane and demonstrates how shift σ isolates the target root.
Supplies exact interior eigenvalue λ* = 3.000 to quantify convergence rates.
Compute interior eigenvalues and eigenvectors of symmetric matrices using Inverse Iteration with variable Rayleigh quotient shifts σ_k = (x_kᵀAx_k)/(x_kᵀx_k), analyze shifted LU/Cholesky triangular solves, and extract the theoretical cubic convergence order α = 3.000 via logarithmic error regression. Standardized input settings: 1.0, 2.0, 3.0, 4.0, 5.0, 6.0 steps.
Select symmetric matrix A with target interior eigenvalue λ* = 3.000000. Choose initial vector x^{(0)} and initial shift σ₀ = 3.367879 (initial error ε₀ = 0.367879, ln(ε₀) = −1.000).
Factor shifted matrix A − σ₀I. Solve (A − σ₀I)w^{(1)} = x^{(0)}. Normalize: x^{(1)} = w^{(1)} / ‖w^{(1)}‖₂. Compute new Rayleigh shift: σ₁ = (x^{(1)})ᵀAx^{(1)} = 3.019910. Error drops to ε₁ = 0.019910 (ln = −3.9163).
Update shift σ₁ = 3.019910. Solve (A − σ₁I)w^{(2)} = x^{(1)}. Normalize: x^{(2)} = w^{(2)} / ‖w^{(2)}‖₂. Compute σ₂: error drops to ε₂ = 3.16 × 10⁻⁶ (ln = −12.6652).
Execute third step: error ε₃ drops to 1.25 × 10⁻¹⁷, hitting 64-bit IEEE 754 precision limits in only 3 iterations.
Compute natural logarithms of consecutive shift errors: x = ln(ε_k) and y = ln(ε_{k+1}).
Perform ordinary least-squares regression: y = α·x + ln(C). Extract empirical slope α = 3.00000, confirming cubic convergence.
Points are your recorded observations. The solid regression line validates Inverse Iteration & Shift mathematical scaling.
| # | Iteration Step k (steps) | Eigenvalue Shift Error |σ_k − λ*| () | Natural Log of Current Shift Error ln(ε_k) | Natural Log of Next Shift Error ln(ε_{k+1}) | Remove |
|---|
No readings yet. Execute a computation and record it.