On the Numerics of 3D Kohn-Sham System

Size: px
Start display at page:

Download "On the Numerics of 3D Kohn-Sham System"

Transcription

1 On the of 3D Kohn-Sham System Weierstrass Institute for Applied Analysis and Stochastics Workshop: Mathematical Models for Transport in Macroscopic and Mesoscopic Systems, Feb On the of 3D Kohn-Sham System

2 Outline 1 The Kohn-Sham System 2 Existence and Uniqueness of Solutions 3 On the of 3D Kohn-Sham System

3 Outline The Kohn-Sham System 1 The Kohn-Sham System 2 Existence and Uniqueness of Solutions 3 On the of 3D Kohn-Sham System

4 The System The Kohn-Sham System Poisson equation: (ɛ ϕ) = q (N A N D + ) e ξ u ξ on Ω + mixed b.c. Schrödinger equation: [ 2 2 (m 1 ξ ) + V ξ ] ψ l,ξ = E l,ξ ψ l,ξ on Ω + hom. Dirichl. b.c. with carrier density u = (u 1,..., u σ ), σ N u ξ (x) = N l,ξ (V ξ ) ψ l,ξ (V ξ )(x) 2 and effective potential l=1 V ξ (u) = e ξ E ξ + V xc,ξ (u) + e ξ qϕ(u) On the of 3D Kohn-Sham System

5 The System The Kohn-Sham System Poisson equation: (ɛ ϕ) = q (N A N D + ) e ξ u ξ on Ω + mixed b.c. Schrödinger equation: [ 2 2 (m 1 ξ ) + V ξ ] ψ l,ξ = E l,ξ ψ l,ξ on Ω + hom. Dirichl. b.c. with carrier density u = (u 1,..., u σ ), σ N u ξ (x) = N l,ξ (V ξ ) ψ l,ξ (V ξ )(x) 2 and effective potential l=1 V ξ (u) = e ξ E ξ + V xc,ξ (u) + e ξ qϕ(u) On the of 3D Kohn-Sham System

6 The System The Kohn-Sham System Poisson equation: (ɛ ϕ) = q (N A N D + ) e ξ u ξ on Ω + mixed b.c. Schrödinger equation: [ 2 2 (m 1 ξ ) + V ξ ] ψ l,ξ = E l,ξ ψ l,ξ on Ω + hom. Dirichl. b.c. with carrier density u = (u 1,..., u σ ), σ N u ξ (x) = N l,ξ (V ξ ) ψ l,ξ (V ξ )(x) 2 and effective potential l=1 V ξ (u) = e ξ E ξ + V xc,ξ (u) + e ξ qϕ(u) On the of 3D Kohn-Sham System

7 The System The Kohn-Sham System Poisson equation: (ɛ ϕ) = q (N A N D + ) e ξ u ξ on Ω + mixed b.c. Schrödinger equation: [ 2 2 (m 1 ξ ) + V ξ ] ψ l,ξ = E l,ξ ψ l,ξ on Ω + hom. Dirichl. b.c. with carrier density u = (u 1,..., u σ ), σ N u ξ (x) = N l,ξ (V ξ ) ψ l,ξ (V ξ )(x) 2 and effective potential l=1 V ξ (u) = e ξ E ξ + V xc,ξ (u) + e ξ qϕ(u) On the of 3D Kohn-Sham System

8 The Kohn-Sham System quasi Fermi-Level and Fermi-Function occupation factor N l,ξ (V ξ ) given by N l,ξ (V ξ ) = f ξ (E l,ξ (V ξ ) E F,ξ (V ξ )) f ξ a distribution function, i.e. Fermi s function (3D) f (s) = e s/k BT and quasi Fermi-level E F,ξ (V eff,ξ ) defined Ω u ξ (V eff,ξ (x))dx = N l,ξ (V eff,ξ ) = N ξ l=1 N ξ being the fixed total number of ξ-type carriers. On the of 3D Kohn-Sham System

9 The Kohn-Sham System quasi Fermi-Level and Fermi-Function occupation factor N l,ξ (V ξ ) given by N l,ξ (V ξ ) = f ξ (E l,ξ (V ξ ) E F,ξ (V ξ )) f ξ a distribution function, i.e. Fermi s function (3D) f (s) = e s/k BT and quasi Fermi-level E F,ξ (V eff,ξ ) defined Ω u ξ (V eff,ξ (x))dx = N l,ξ (V eff,ξ ) = N ξ l=1 N ξ being the fixed total number of ξ-type carriers. On the of 3D Kohn-Sham System

10 Outline Existence and Uniqueness of Solutions 1 The Kohn-Sham System 2 Existence and Uniqueness of Solutions 3 On the of 3D Kohn-Sham System

11 The Particle Density Operator Existence and Uniqueness of Solutions Definition Define the carrier density operator corresponding to f and m by N (V )(x) = f (E l (V ) E F (V )) ψ l (V )(x) 2, V L 2 (Ω) x Ω. l=1 E l (V ) and ψ l (V ) are EV and L 2 -normalized EF of H V E F (V ) defined by N (V)dx = f (E l (V ) E F (V )) = N. eigenvlue asymptotics of H V and properties of f ensure well-definedness of E F right-hand side series absolutely converges On the of 3D Kohn-Sham System

12 The Particle Density Operator Existence and Uniqueness of Solutions Definition Define the carrier density operator corresponding to f and m by N (V )(x) = f (E l (V ) E F (V )) ψ l (V )(x) 2, V L 2 (Ω) x Ω. l=1 E l (V ) and ψ l (V ) are EV and L 2 -normalized EF of H V E F (V ) defined by N (V)dx = f (E l (V ) E F (V )) = N. eigenvlue asymptotics of H V and properties of f ensure well-definedness of E F right-hand side series absolutely converges On the of 3D Kohn-Sham System

13 The Particle Density Operator Existence and Uniqueness of Solutions Definition Define the carrier density operator corresponding to f and m by N (V )(x) = f (E l (V ) E F (V )) ψ l (V )(x) 2, V L 2 (Ω) x Ω. l=1 E l (V ) and ψ l (V ) are EV and L 2 -normalized EF of H V E F (V ) defined by N (V)dx = f (E l (V ) E F (V )) = N. eigenvlue asymptotics of H V and properties of f ensure well-definedness of E F right-hand side series absolutely converges On the of 3D Kohn-Sham System

14 Solution of the Kohn-Sham System Existence and Uniqueness of Solutions Definition Suppose N A N D W 1,2 Γ (Ω), E ξ L 2 (Ω), ξ {1,..., σ}. Let ɛ,m 1,..., m σ, f 1,..., f σ be from L (Ω, B(R 3, R 3 )) and ϕ Γ given. Define the external potentials V ξ and the effective doping D by D = q(n A N D ) ϕ Γ, V ξ = e ξ qϕ Γ eξ E ξ, ξ {1,..., σ}. (V, u 1,..., u σ ) W 1,2 Γ (L 2 (Ω) σ ) is a solution of the Kohn-Sham system, if AV = D + q e ξ u ξ, ξ u ξ = N ξ (V ξ + V xc,ξ (u) + e ξ qv ). On the of 3D Kohn-Sham System

15 Existence and Uniqueness of Solutions Existence and Uniqueness of Solution without V xc Monotonicity and Lipschitz continuity of the Operator A yield the result: Theorem The Schrödinger-Poisson system without exchange-correlation potential has the unique solution (V, N 1 (V 1 + V ),..., N σ (V σ + V )). the operator assigning the solution V to V = (V 1,..., V σ ) is L : (L 2 (Ω)) σ W 1,2 Γ (Ω), L(V) = V L is boundedly Lipschitz continuous On the of 3D Kohn-Sham System

16 Existence and Uniqueness of Solutions Existence and Uniqueness of Solution without V xc Monotonicity and Lipschitz continuity of the Operator A yield the result: Theorem The Schrödinger-Poisson system without exchange-correlation potential has the unique solution (V, N 1 (V 1 + V ),..., N σ (V σ + V )). the operator assigning the solution V to V = (V 1,..., V σ ) is L : (L 2 (Ω)) σ W 1,2 Γ (Ω), L(V) = V L is boundedly Lipschitz continuous On the of 3D Kohn-Sham System

17 Existence and Uniqueness of Solutions Existence of Solution to the Kohn-Sham System Definition (Fixed Point Mapping) Let V = (V 1,..., V σ ) (L 2 (Ω)) σ be a given tupel of external potentials and N 1..., N σ the fixed number of carriers. Define L 1 N = {u = (u 1,..., u σ ) : u ξ 0, u ξ (x)dx = N ξ } and Φ : L 1 N L1 N as Φ ξ (u) = N ξ ( Vξ + V xc,ξ (u) + e ξ ql(v 1 + V xc,1 (u),..., V σ + V xc,σ (u)) ) Theorem (Existence of Fixed Point) If V xc,ξ is for any ξ {1,..., σ} a bounded and continuous mapping from (L 1 (Ω)) σ into L 2 (Ω), then the mapping Φ has a fixed point. On the of 3D Kohn-Sham System

18 Existence and Uniqueness of Solutions Existence of Solution to the Kohn-Sham System Definition (Fixed Point Mapping) Let V = (V 1,..., V σ ) (L 2 (Ω)) σ be a given tupel of external potentials and N 1..., N σ the fixed number of carriers. Define L 1 N = {u = (u 1,..., u σ ) : u ξ 0, u ξ (x)dx = N ξ } and Φ : L 1 N L1 N as Φ ξ (u) = N ξ ( Vξ + V xc,ξ (u) + e ξ ql(v 1 + V xc,1 (u),..., V σ + V xc,σ (u)) ) Theorem (Existence of Fixed Point) If V xc,ξ is for any ξ {1,..., σ} a bounded and continuous mapping from (L 1 (Ω)) σ into L 2 (Ω), then the mapping Φ has a fixed point. On the of 3D Kohn-Sham System

19 Existence and Uniqueness of Solutions Existence of Solution to the Kohn-Sham System Theorem (Equivalence of Solutions) u = (u 1,..., u σ ) is a fixed point of Φ if and only if (V, u 1,..., u σ ) = (A ( 1 D + q ) ) e ξ u ξ, u 1,..., u σ is a solution of the Kohn-Sham system. the Kohn-Sham system always admits a solution. On the of 3D Kohn-Sham System

20 Outline 1 The Kohn-Sham System 2 Existence and Uniqueness of Solutions 3 On the of 3D Kohn-Sham System

21 The Mapping T (η) η η = (η 1,..., η σ ) u = e η δ, δ > 0 constant solve Poisson s equation for potential ϕ(u, N A N D ) obtain V ξ (u) = e ξ E ξ + V xc,ξ (u) + e ξ qϕ solve EVP for Schrödinger s equation [ ( 2 /2) (1/m ξ ) + V eff,ξ ]ψ l,ξ = E l,ξ ψ l,ξ compute carrier densities u ξ (x) = l N l,ξ ψ l,ξ (x) 2 η = log(u + δ) On the of 3D Kohn-Sham System

22 The Mapping T (η) η η = (η 1,..., η σ ) u = e η δ, δ > 0 constant solve Poisson s equation for potential ϕ(u, N A N D ) obtain V ξ (u) = e ξ E ξ + V xc,ξ (u) + e ξ qϕ solve EVP for Schrödinger s equation [ ( 2 /2) (1/m ξ ) + V eff,ξ ]ψ l,ξ = E l,ξ ψ l,ξ compute carrier densities u ξ (x) = l N l,ξ ψ l,ξ (x) 2 η = log(u + δ) On the of 3D Kohn-Sham System

23 The Mapping T (η) η η = (η 1,..., η σ ) u = e η δ, δ > 0 constant solve Poisson s equation for potential ϕ(u, N A N D ) obtain V ξ (u) = e ξ E ξ + V xc,ξ (u) + e ξ qϕ solve EVP for Schrödinger s equation [ ( 2 /2) (1/m ξ ) + V eff,ξ ]ψ l,ξ = E l,ξ ψ l,ξ compute carrier densities u ξ (x) = l N l,ξ ψ l,ξ (x) 2 η = log(u + δ) On the of 3D Kohn-Sham System

24 The Mapping T (η) η η = (η 1,..., η σ ) u = e η δ, δ > 0 constant solve Poisson s equation for potential ϕ(u, N A N D ) obtain V ξ (u) = e ξ E ξ + V xc,ξ (u) + e ξ qϕ solve EVP for Schrödinger s equation [ ( 2 /2) (1/m ξ ) + V eff,ξ ]ψ l,ξ = E l,ξ ψ l,ξ compute carrier densities u ξ (x) = l N l,ξ ψ l,ξ (x) 2 η = log(u + δ) On the of 3D Kohn-Sham System

25 Properties of T (η) Solution of Kohn-Sham system is a fixed point of T (η) δ = added to avoid singularity of logarithm at zero additional smoothness of logarithm improves convergence pure iteration scheme may or may not converge stabilization and acceleration needed On the of 3D Kohn-Sham System

26 Properties of T (η) Solution of Kohn-Sham system is a fixed point of T (η) δ = added to avoid singularity of logarithm at zero additional smoothness of logarithm improves convergence pure iteration scheme may or may not converge stabilization and acceleration needed On the of 3D Kohn-Sham System

27 Properties of T (η) Solution of Kohn-Sham system is a fixed point of T (η) δ = added to avoid singularity of logarithm at zero additional smoothness of logarithm improves convergence pure iteration scheme may or may not converge stabilization and acceleration needed On the of 3D Kohn-Sham System

28 Heuristic Motivation via Gummel s Method Gummel s method originally for the drift-diffusion model Kerkhoven analyzed qualitative behavior converges while sufficiently far away from solution slows down when approaching to the solution opposite to Newton s method this behavior is due to the ellipticity of the involved equations true for the quantum-mechanical system as well On the of 3D Kohn-Sham System

29 Heuristic Motivation via Gummel s Method Gummel s method originally for the drift-diffusion model Kerkhoven analyzed qualitative behavior converges while sufficiently far away from solution slows down when approaching to the solution opposite to Newton s method this behavior is due to the ellipticity of the involved equations true for the quantum-mechanical system as well On the of 3D Kohn-Sham System

30 Heuristic Motivation via Gummel s Method Gummel s method originally for the drift-diffusion model Kerkhoven analyzed qualitative behavior converges while sufficiently far away from solution slows down when approaching to the solution opposite to Newton s method this behavior is due to the ellipticity of the involved equations true for the quantum-mechanical system as well On the of 3D Kohn-Sham System

31 Stabilization and Acceleration of T (η) Stabilization: pure appliance of T (η) causes convergence instabilities stabilize through adaptive underrelaxation fixed point iteration T (η) = η until close to the solution Acceleration: accelerate convergence by employing Newton s method root-finding problem T (η) η = 0 Jacobian-free version based on GMRES until convergence On the of 3D Kohn-Sham System

32 Stabilization and Acceleration of T (η) Stabilization: pure appliance of T (η) causes convergence instabilities stabilize through adaptive underrelaxation fixed point iteration T (η) = η until close to the solution Acceleration: accelerate convergence by employing Newton s method root-finding problem T (η) η = 0 Jacobian-free version based on GMRES until convergence On the of 3D Kohn-Sham System

33 Adaptive Underrelaxation initialize: ω = 1, choose η 0, set η 1 = 0 and η 2 = η 0 Iterate on i: if T (η i ) η i T (η i 1 ) η i 1 > T (η i 1) η i 1 T (η i 2 ) η i 2 then ω := ω 0.8, ω := min(ω, T (η i 1) η i 1 ) T (η i ) η i η i+1 = ω T (η i ) + (1 ω )η i until convergence or ω decreases 5 times in a row or ω remains constant 10 times in a row On the of 3D Kohn-Sham System

34 Adaptive Underrelaxation initialize: ω = 1, choose η 0, set η 1 = 0 and η 2 = η 0 Iterate on i: if T (η i ) η i T (η i 1 ) η i 1 > T (η i 1) η i 1 T (η i 2 ) η i 2 then ω := ω 0.8, ω := min(ω, T (η i 1) η i 1 ) T (η i ) η i η i+1 = ω T (η i ) + (1 ω )η i until convergence or ω decreases 5 times in a row or ω remains constant 10 times in a row On the of 3D Kohn-Sham System

35 Adaptive Underrelaxation initialize: ω = 1, choose η 0, set η 1 = 0 and η 2 = η 0 Iterate on i: if T (η i ) η i T (η i 1 ) η i 1 > T (η i 1) η i 1 T (η i 2 ) η i 2 then ω := ω 0.8, ω := min(ω, T (η i 1) η i 1 ) T (η i ) η i η i+1 = ω T (η i ) + (1 ω )η i until convergence or ω decreases 5 times in a row or ω remains constant 10 times in a row On the of 3D Kohn-Sham System

36 Acceleration by Newton s Method Reformulation: η i+1 = T (η i ) η T (η) = 0 Newton: requires solution of linear system [I η T (η i )]dη = [η i T (η i )] η T (η i ) is the Jacobian matrix of T at η i not known explicitly solve system without generating the Jacobian nonlinear version of GMRES (NLGMR) On the of 3D Kohn-Sham System

37 Acceleration by Newton s Method Reformulation: η i+1 = T (η i ) η T (η) = 0 Newton: requires solution of linear system [I η T (η i )]dη = [η i T (η i )] η T (η i ) is the Jacobian matrix of T at η i not known explicitly solve system without generating the Jacobian nonlinear version of GMRES (NLGMR) On the of 3D Kohn-Sham System

38 Acceleration by Newton s Method Reformulation: η i+1 = T (η i ) η T (η) = 0 Newton: requires solution of linear system [I η T (η i )]dη = [η i T (η i )] η T (η i ) is the Jacobian matrix of T at η i not known explicitly solve system without generating the Jacobian nonlinear version of GMRES (NLGMR) On the of 3D Kohn-Sham System

39 Derivative-free GMRES Solution of Newton s equation equivalent to minimization over dη of (I T )(η i ) + [I η T (η i )]dη 2 GMRES: find approximate solution in Krylov subspace K m = span{v 1, [I η T (η i )]v 1,..., [I η T (η i )] m 1 v 1 } ONB of K m easily gained by Arnoldi process, provided v [I η T (η i )]v is available η T (η i ) never needed explicitly only matrix-vector multiplication η T (η i )v approximate by: η T (η i )v T (η i + hv) T (η i ) h On the of 3D Kohn-Sham System

40 Derivative-free GMRES Solution of Newton s equation equivalent to minimization over dη of (I T )(η i ) + [I η T (η i )]dη 2 GMRES: find approximate solution in Krylov subspace K m = span{v 1, [I η T (η i )]v 1,..., [I η T (η i )] m 1 v 1 } ONB of K m easily gained by Arnoldi process, provided v [I η T (η i )]v is available η T (η i ) never needed explicitly only matrix-vector multiplication η T (η i )v approximate by: η T (η i )v T (η i + hv) T (η i ) h On the of 3D Kohn-Sham System

41 Derivative-free GMRES Solution of Newton s equation equivalent to minimization over dη of (I T )(η i ) + [I η T (η i )]dη 2 GMRES: find approximate solution in Krylov subspace K m = span{v 1, [I η T (η i )]v 1,..., [I η T (η i )] m 1 v 1 } ONB of K m easily gained by Arnoldi process, provided v [I η T (η i )]v is available η T (η i ) never needed explicitly only matrix-vector multiplication η T (η i )v approximate by: η T (η i )v T (η i + hv) T (η i ) h On the of 3D Kohn-Sham System

42 Adaption of NLGMR adjust accuracy of solution to Newton s method adaptively vary number m of steps in NLGMR η 0 : current approximate solution to η T (η) = 0 η m : solution after m steps of GMRES nonlinear residual: linear residual: res nl = η m T (η m ) res lin = η 0 T (η 0 ) + [I η T (η 0 )](η m η 0 ) nonlinearity mild res nl res lin res nl res lin linearized model not good accurate solution of Newton s method wasteful On the of 3D Kohn-Sham System

43 Adaption of NLGMR adjust accuracy of solution to Newton s method adaptively vary number m of steps in NLGMR η 0 : current approximate solution to η T (η) = 0 η m : solution after m steps of GMRES nonlinear residual: linear residual: res nl = η m T (η m ) res lin = η 0 T (η 0 ) + [I η T (η 0 )](η m η 0 ) nonlinearity mild res nl res lin res nl res lin linearized model not good accurate solution of Newton s method wasteful On the of 3D Kohn-Sham System

44 Adaption of NLGMR adjust accuracy of solution to Newton s method adaptively vary number m of steps in NLGMR η 0 : current approximate solution to η T (η) = 0 η m : solution after m steps of GMRES nonlinear residual: linear residual: res nl = η m T (η m ) res lin = η 0 T (η 0 ) + [I η T (η 0 )](η m η 0 ) nonlinearity mild res nl res lin res nl res lin linearized model not good accurate solution of Newton s method wasteful On the of 3D Kohn-Sham System

45 Adaption of NLGMR adjust accuracy of solution to Newton s method adaptively vary number m of steps in NLGMR η 0 : current approximate solution to η T (η) = 0 η m : solution after m steps of GMRES nonlinear residual: linear residual: res nl = η m T (η m ) res lin = η 0 T (η 0 ) + [I η T (η 0 )](η m η 0 ) nonlinearity mild res nl res lin res nl res lin linearized model not good accurate solution of Newton s method wasteful On the of 3D Kohn-Sham System

46 Resulting NLGMR Iteration set m = 2 get initial guess η 0 for carrier density employ m steps of GMRES: yields η m adapt m: 2 3 res nl / res lin 3 2 m := min(2m, 25) 3 2 res nl / res lin 5 m := m else m := max(2, m/2) perform linesearch for stepsize τ guarantee decrease of (η 0 + τdη) T (η 0 + τdη) until convergence form of Newton s method quadratic rate of convergence On the of 3D Kohn-Sham System

47 Resulting NLGMR Iteration set m = 2 get initial guess η 0 for carrier density employ m steps of GMRES: yields η m adapt m: 2 3 res nl / res lin 3 2 m := min(2m, 25) 3 2 res nl / res lin 5 m := m else m := max(2, m/2) perform linesearch for stepsize τ guarantee decrease of (η 0 + τdη) T (η 0 + τdη) until convergence form of Newton s method quadratic rate of convergence On the of 3D Kohn-Sham System

48 Resulting NLGMR Iteration set m = 2 get initial guess η 0 for carrier density employ m steps of GMRES: yields η m adapt m: 2 3 res nl / res lin 3 2 m := min(2m, 25) 3 2 res nl / res lin 5 m := m else m := max(2, m/2) perform linesearch for stepsize τ guarantee decrease of (η 0 + τdη) T (η 0 + τdη) until convergence form of Newton s method quadratic rate of convergence On the of 3D Kohn-Sham System

49 Resulting NLGMR Iteration set m = 2 get initial guess η 0 for carrier density employ m steps of GMRES: yields η m adapt m: 2 3 res nl / res lin 3 2 m := min(2m, 25) 3 2 res nl / res lin 5 m := m else m := max(2, m/2) perform linesearch for stepsize τ guarantee decrease of (η 0 + τdη) T (η 0 + τdη) until convergence form of Newton s method quadratic rate of convergence On the of 3D Kohn-Sham System

50 Resulting NLGMR Iteration set m = 2 get initial guess η 0 for carrier density employ m steps of GMRES: yields η m adapt m: 2 3 res nl / res lin 3 2 m := min(2m, 25) 3 2 res nl / res lin 5 m := m else m := max(2, m/2) perform linesearch for stepsize τ guarantee decrease of (η 0 + τdη) T (η 0 + τdη) until convergence form of Newton s method quadratic rate of convergence On the of 3D Kohn-Sham System

51 Summary of the Algorithm take initial guess perform adaptive underrelaxation until close to the solution perform NLGMR method Newton s method; derivative-free GMRES until convergence On the of 3D Kohn-Sham System

52 Summary of the Algorithm take initial guess perform adaptive underrelaxation until close to the solution perform NLGMR method Newton s method; derivative-free GMRES until convergence On the of 3D Kohn-Sham System

53 Summary of the Algorithm take initial guess perform adaptive underrelaxation until close to the solution perform NLGMR method Newton s method; derivative-free GMRES until convergence On the of 3D Kohn-Sham System

54 Outline 1 The Kohn-Sham System 2 Existence and Uniqueness of Solutions 3 On the of 3D Kohn-Sham System

55 General Implementation: in the Framework of WIAS-pdelib2 (C++) Discretization: Finite Volume Method TetGen: Tetrahedral Mesh Generator and 3D Delaunay Triangulator (tetgen.berlios.de) Eigenvalues: ARPACK: Large Scale Eigenvalue Solver On the of 3D Kohn-Sham System

56 Grid 4 regions, cells, 6 bregions 9905 bfaces Input: 320 points, 172 faces, 4 regions, 6 bregions Output: 4 regions, points, cells, 6 bregions, 9905 bfaces On the of 3D Kohn-Sham System

57 Single Electron f f e e-26 cpu seconds steps total underrelaxed Newton On the of 3D Kohn-Sham System

58 Residual Evolution residual iteration steps On the of 3D Kohn-Sham System

59 A.T. Galick, T. Kerkhoven, U. Ravaioli, J.H. Arends, Y. Saad Efficient numerical simulation of electron states in quantum wires. J. Appl. Phys., 68(7): , 1990 On the of 3D Kohn-Sham System

Block Iterative Eigensolvers for Sequences of Dense Correlated Eigenvalue Problems

Block Iterative Eigensolvers for Sequences of Dense Correlated Eigenvalue Problems Mitglied der Helmholtz-Gemeinschaft Block Iterative Eigensolvers for Sequences of Dense Correlated Eigenvalue Problems Birkbeck University, London, June the 29th 2012 Edoardo Di Napoli Motivation and Goals

More information

The Newton-ADI Method for Large-Scale Algebraic Riccati Equations. Peter Benner.

The Newton-ADI Method for Large-Scale Algebraic Riccati Equations. Peter Benner. The Newton-ADI Method for Large-Scale Algebraic Riccati Equations Mathematik in Industrie und Technik Fakultät für Mathematik Peter Benner benner@mathematik.tu-chemnitz.de Sonderforschungsbereich 393 S

More information

Anderson Acceleration

Anderson Acceleration Anderson Acceleration C. T. Kelley, Alex Toth, Austin Ellis NC State University tim kelley@ncsu.edu Supported by NSF, DOE(CASL/ORNL), ARO Wamplerfest, June 2017 C. T. Kelley Anderson Acceleration Wamplerfest,

More information

High Performance Nonlinear Solvers

High Performance Nonlinear Solvers What is a nonlinear system? High Performance Nonlinear Solvers Michael McCourt Division Argonne National Laboratory IIT Meshfree Seminar September 19, 2011 Every nonlinear system of equations can be described

More information

Numerical Methods for Large-Scale Nonlinear Systems

Numerical Methods for Large-Scale Nonlinear Systems Numerical Methods for Large-Scale Nonlinear Systems Handouts by Ronald H.W. Hoppe following the monograph P. Deuflhard Newton Methods for Nonlinear Problems Springer, Berlin-Heidelberg-New York, 2004 Num.

More information

Newton s Method and Efficient, Robust Variants

Newton s Method and Efficient, Robust Variants Newton s Method and Efficient, Robust Variants Philipp Birken University of Kassel (SFB/TRR 30) Soon: University of Lund October 7th 2013 Efficient solution of large systems of non-linear PDEs in science

More information

x 2 x n r n J(x + t(x x ))(x x )dt. For warming-up we start with methods for solving a single equation of one variable.

x 2 x n r n J(x + t(x x ))(x x )dt. For warming-up we start with methods for solving a single equation of one variable. Maria Cameron 1. Fixed point methods for solving nonlinear equations We address the problem of solving an equation of the form (1) r(x) = 0, where F (x) : R n R n is a vector-function. Eq. (1) can be written

More information

On Multigrid for Phase Field

On Multigrid for Phase Field On Multigrid for Phase Field Carsten Gräser (FU Berlin), Ralf Kornhuber (FU Berlin), Rolf Krause (Uni Bonn), and Vanessa Styles (University of Sussex) Interphase 04 Rome, September, 13-16, 2004 Synopsis

More information

Lecture 11: CMSC 878R/AMSC698R. Iterative Methods An introduction. Outline. Inverse, LU decomposition, Cholesky, SVD, etc.

Lecture 11: CMSC 878R/AMSC698R. Iterative Methods An introduction. Outline. Inverse, LU decomposition, Cholesky, SVD, etc. Lecture 11: CMSC 878R/AMSC698R Iterative Methods An introduction Outline Direct Solution of Linear Systems Inverse, LU decomposition, Cholesky, SVD, etc. Iterative methods for linear systems Why? Matrix

More information

Numerical Methods for Large-Scale Nonlinear Equations

Numerical Methods for Large-Scale Nonlinear Equations Slide 1 Numerical Methods for Large-Scale Nonlinear Equations Homer Walker MA 512 April 28, 2005 Inexact Newton and Newton Krylov Methods a. Newton-iterative and inexact Newton methods. Slide 2 i. Formulation

More information

Advanced Simulation Methods for Charge Transport in OLEDs

Advanced Simulation Methods for Charge Transport in OLEDs FLUXiM Advanced Simulation Methods for Charge Transport in OLEDs Evelyne Knapp, B. Ruhstaller Overview 1. Introduction 2. Physical Models 3. Numerical Methods 4. Outlook www.icp.zhaw.ch ICP Team Interdisciplinary

More information

Iterative methods for positive definite linear systems with a complex shift

Iterative methods for positive definite linear systems with a complex shift Iterative methods for positive definite linear systems with a complex shift William McLean, University of New South Wales Vidar Thomée, Chalmers University November 4, 2011 Outline 1. Numerical solution

More information

Research Article A Two-Grid Method for Finite Element Solutions of Nonlinear Parabolic Equations

Research Article A Two-Grid Method for Finite Element Solutions of Nonlinear Parabolic Equations Abstract and Applied Analysis Volume 212, Article ID 391918, 11 pages doi:1.1155/212/391918 Research Article A Two-Grid Method for Finite Element Solutions of Nonlinear Parabolic Equations Chuanjun Chen

More information

THE solution of the absolute value equation (AVE) of

THE solution of the absolute value equation (AVE) of The nonlinear HSS-like iterative method for absolute value equations Mu-Zheng Zhu Member, IAENG, and Ya-E Qi arxiv:1403.7013v4 [math.na] 2 Jan 2018 Abstract Salkuyeh proposed the Picard-HSS iteration method

More information

Accelerated residual methods for the iterative solution of systems of equations

Accelerated residual methods for the iterative solution of systems of equations Accelerated residual methods for the iterative solution of systems of equations N. C. Nguyen, P. Fernandez, R. M. Freund, and J. Peraire Abstract We develop accelerated residual methods for solving linear

More information

Solving Large Nonlinear Sparse Systems

Solving Large Nonlinear Sparse Systems Solving Large Nonlinear Sparse Systems Fred W. Wubs and Jonas Thies Computational Mechanics & Numerical Mathematics University of Groningen, the Netherlands f.w.wubs@rug.nl Centre for Interdisciplinary

More information

An Accelerated Block-Parallel Newton Method via Overlapped Partitioning

An Accelerated Block-Parallel Newton Method via Overlapped Partitioning An Accelerated Block-Parallel Newton Method via Overlapped Partitioning Yurong Chen Lab. of Parallel Computing, Institute of Software, CAS (http://www.rdcps.ac.cn/~ychen/english.htm) Summary. This paper

More information

Interpolation Based Local Postprocessing for Adaptive Finite Element Approximations in Electronic Structure Calculations

Interpolation Based Local Postprocessing for Adaptive Finite Element Approximations in Electronic Structure Calculations Interpolation Based Local Postprocessing for Adaptive Finite Element Approximations in Electronic Structure Calculations Jun Fang 1, Xingyu Gao 2, Xingao Gong 3, and Aihui Zhou 1 1 LSEC, Institute of Computational

More information

Constrained Minimization and Multigrid

Constrained Minimization and Multigrid Constrained Minimization and Multigrid C. Gräser (FU Berlin), R. Kornhuber (FU Berlin), and O. Sander (FU Berlin) Workshop on PDE Constrained Optimization Hamburg, March 27-29, 2008 Matheon Outline Successive

More information

Uniform exponential decay of the free energy for Voronoi finite volume discretized reaction-diffusion systems

Uniform exponential decay of the free energy for Voronoi finite volume discretized reaction-diffusion systems Weierstrass Institute for Applied Analysis and Stochastics Special Session 36 Reaction Diffusion Systems 8th AIMS Conference on Dynamical Systems, Differential Equations & Applications Dresden University

More information

Stochastic Gradient Descent with Variance Reduction

Stochastic Gradient Descent with Variance Reduction Stochastic Gradient Descent with Variance Reduction Rie Johnson, Tong Zhang Presenter: Jiawen Yao March 17, 2015 Rie Johnson, Tong Zhang Presenter: JiawenStochastic Yao Gradient Descent with Variance Reduction

More information

Stabilization and Acceleration of Algebraic Multigrid Method

Stabilization and Acceleration of Algebraic Multigrid Method Stabilization and Acceleration of Algebraic Multigrid Method Recursive Projection Algorithm A. Jemcov J.P. Maruszewski Fluent Inc. October 24, 2006 Outline 1 Need for Algorithm Stabilization and Acceleration

More information

Altered Jacobian Newton Iterative Method for Nonlinear Elliptic Problems

Altered Jacobian Newton Iterative Method for Nonlinear Elliptic Problems Altered Jacobian Newton Iterative Method for Nonlinear Elliptic Problems Sanjay K Khattri Abstract We present an Altered Jacobian Newton Iterative Method for solving nonlinear elliptic problems Effectiveness

More information

Inexactness and flexibility in linear Krylov solvers

Inexactness and flexibility in linear Krylov solvers Inexactness and flexibility in linear Krylov solvers Luc Giraud ENSEEIHT (N7) - IRIT, Toulouse Matrix Analysis and Applications CIRM Luminy - October 15-19, 2007 in honor of Gérard Meurant for his 60 th

More information

On the adaptive finite element analysis of the Kohn-Sham equations

On the adaptive finite element analysis of the Kohn-Sham equations On the adaptive finite element analysis of the Kohn-Sham equations Denis Davydov, Toby Young, Paul Steinmann Denis Davydov, LTM, Erlangen, Germany August 2015 Denis Davydov, LTM, Erlangen, Germany College

More information

Kasetsart University Workshop. Multigrid methods: An introduction

Kasetsart University Workshop. Multigrid methods: An introduction Kasetsart University Workshop Multigrid methods: An introduction Dr. Anand Pardhanani Mathematics Department Earlham College Richmond, Indiana USA pardhan@earlham.edu A copy of these slides is available

More information

arxiv: v1 [math.na] 11 Jul 2011

arxiv: v1 [math.na] 11 Jul 2011 Multigrid Preconditioner for Nonconforming Discretization of Elliptic Problems with Jump Coefficients arxiv:07.260v [math.na] Jul 20 Blanca Ayuso De Dios, Michael Holst 2, Yunrong Zhu 2, and Ludmil Zikatanov

More information

Contour Integral Method for the Simulation of Accelerator Cavities

Contour Integral Method for the Simulation of Accelerator Cavities Contour Integral Method for the Simulation of Accelerator Cavities V. Pham-Xuan, W. Ackermann and H. De Gersem Institut für Theorie Elektromagnetischer Felder DESY meeting (14.11.2017) November 14, 2017

More information

4.8 Arnoldi Iteration, Krylov Subspaces and GMRES

4.8 Arnoldi Iteration, Krylov Subspaces and GMRES 48 Arnoldi Iteration, Krylov Subspaces and GMRES We start with the problem of using a similarity transformation to convert an n n matrix A to upper Hessenberg form H, ie, A = QHQ, (30) with an appropriate

More information

Bindel, Spring 2016 Numerical Analysis (CS 4220) Notes for

Bindel, Spring 2016 Numerical Analysis (CS 4220) Notes for Life beyond Newton Notes for 2016-04-08 Newton s method has many attractive properties, particularly when we combine it with a globalization strategy. Unfortunately, Newton steps are not cheap. At each

More information

CONVERGENCE PROPERTIES OF COMBINED RELAXATION METHODS

CONVERGENCE PROPERTIES OF COMBINED RELAXATION METHODS CONVERGENCE PROPERTIES OF COMBINED RELAXATION METHODS Igor V. Konnov Department of Applied Mathematics, Kazan University Kazan 420008, Russia Preprint, March 2002 ISBN 951-42-6687-0 AMS classification:

More information

Finite Elements for Nonlinear Problems

Finite Elements for Nonlinear Problems Finite Elements for Nonlinear Problems Computer Lab 2 In this computer lab we apply finite element method to nonlinear model problems and study two of the most common techniques for solving the resulting

More information

Lecture 11 and 12: Penalty methods and augmented Lagrangian methods for nonlinear programming

Lecture 11 and 12: Penalty methods and augmented Lagrangian methods for nonlinear programming Lecture 11 and 12: Penalty methods and augmented Lagrangian methods for nonlinear programming Coralia Cartis, Mathematical Institute, University of Oxford C6.2/B2: Continuous Optimization Lecture 11 and

More information

Index. higher order methods, 52 nonlinear, 36 with variable coefficients, 34 Burgers equation, 234 BVP, see boundary value problems

Index. higher order methods, 52 nonlinear, 36 with variable coefficients, 34 Burgers equation, 234 BVP, see boundary value problems Index A-conjugate directions, 83 A-stability, 171 A( )-stability, 171 absolute error, 243 absolute stability, 149 for systems of equations, 154 absorbing boundary conditions, 228 Adams Bashforth methods,

More information

Rate optimal adaptive FEM with inexact solver for strongly monotone operators

Rate optimal adaptive FEM with inexact solver for strongly monotone operators ASC Report No. 19/2016 Rate optimal adaptive FEM with inexact solver for strongly monotone operators G. Gantner, A. Haberl, D. Praetorius, B. Stiftner Institute for Analysis and Scientific Computing Vienna

More information

Nonlinear Iterative Solution of the Neutron Transport Equation

Nonlinear Iterative Solution of the Neutron Transport Equation Nonlinear Iterative Solution of the Neutron Transport Equation Emiliano Masiello Commissariat à l Energie Atomique de Saclay /DANS//SERMA/LTSD emiliano.masiello@cea.fr 1/37 Outline - motivations and framework

More information

Summary of Iterative Methods for Non-symmetric Linear Equations That Are Related to the Conjugate Gradient (CG) Method

Summary of Iterative Methods for Non-symmetric Linear Equations That Are Related to the Conjugate Gradient (CG) Method Summary of Iterative Methods for Non-symmetric Linear Equations That Are Related to the Conjugate Gradient (CG) Method Leslie Foster 11-5-2012 We will discuss the FOM (full orthogonalization method), CG,

More information

MULTIGRID-CONJUGATE GRADIENT TYPE METHODS FOR REACTION DIFFUSION SYSTEMS *

MULTIGRID-CONJUGATE GRADIENT TYPE METHODS FOR REACTION DIFFUSION SYSTEMS * International Journal of Bifurcation and Chaos, Vol 14, No 1 (24) 3587 365 c World Scientific Publishing Company MULTIGRID-CONJUGATE GRADIENT TYPE METHODS FOR REACTION DIFFUSION SYSTEMS * S-L CHANG Center

More information

Technology Computer Aided Design (TCAD) Laboratory. Lecture 2, A simulation primer

Technology Computer Aided Design (TCAD) Laboratory. Lecture 2, A simulation primer Technology Computer Aided Design (TCAD) Laboratory Lecture 2, A simulation primer [Source: Synopsys] Giovanni Betti Beneventi E-mail: gbbeneventi@arces.unibo.it ; giobettibeneventi@gmail.com Office: Engineering

More information

Keywords: Nonlinear least-squares problems, regularized models, error bound condition, local convergence.

Keywords: Nonlinear least-squares problems, regularized models, error bound condition, local convergence. STRONG LOCAL CONVERGENCE PROPERTIES OF ADAPTIVE REGULARIZED METHODS FOR NONLINEAR LEAST-SQUARES S. BELLAVIA AND B. MORINI Abstract. This paper studies adaptive regularized methods for nonlinear least-squares

More information

Optimal Left and Right Additive Schwarz Preconditioning for Minimal Residual Methods with Euclidean and Energy Norms

Optimal Left and Right Additive Schwarz Preconditioning for Minimal Residual Methods with Euclidean and Energy Norms Optimal Left and Right Additive Schwarz Preconditioning for Minimal Residual Methods with Euclidean and Energy Norms Marcus Sarkis Worcester Polytechnic Inst., Mass. and IMPA, Rio de Janeiro and Daniel

More information

Local Density Approximation for the Almost-bosonic Anyon Gas. Michele Correggi

Local Density Approximation for the Almost-bosonic Anyon Gas. Michele Correggi Local Density Approximation for the Almost-bosonic Anyon Gas Michele Correggi Università degli Studi Roma Tre www.cond-math.it QMATH13 Many-body Systems and Statistical Mechanics joint work with D. Lundholm

More information

Pseudopotential generation and test by the ld1.x atomic code: an introduction

Pseudopotential generation and test by the ld1.x atomic code: an introduction and test by the ld1.x atomic code: an introduction SISSA and DEMOCRITOS Trieste (Italy) Outline 1 2 3 Spherical symmetry - I The Kohn and Sham (KS) equation is (in atomic units): [ 1 ] 2 2 + V ext (r)

More information

DRIFT-DIFFUSION SYSTEMS: VARIATIONAL PRINCIPLES AND FIXED POINT MAPS FOR STEADY STATE SEMICONDUCTOR MODELS

DRIFT-DIFFUSION SYSTEMS: VARIATIONAL PRINCIPLES AND FIXED POINT MAPS FOR STEADY STATE SEMICONDUCTOR MODELS DRIFT-DIFFUSION SYSTEMS: VARIATIONAL PRINCIPLES AND FIXED POINT MAPS FOR STEADY STATE SEMICONDUCTOR MODELS Joseph W. Jerome Department of Mathematics Northwestern University Evanston, IL 60208 Abstract

More information

Trust-Region SQP Methods with Inexact Linear System Solves for Large-Scale Optimization

Trust-Region SQP Methods with Inexact Linear System Solves for Large-Scale Optimization Trust-Region SQP Methods with Inexact Linear System Solves for Large-Scale Optimization Denis Ridzal Department of Computational and Applied Mathematics Rice University, Houston, Texas dridzal@caam.rice.edu

More information

M.A. Botchev. September 5, 2014

M.A. Botchev. September 5, 2014 Rome-Moscow school of Matrix Methods and Applied Linear Algebra 2014 A short introduction to Krylov subspaces for linear systems, matrix functions and inexact Newton methods. Plan and exercises. M.A. Botchev

More information

New Streamfunction Approach for Magnetohydrodynamics

New Streamfunction Approach for Magnetohydrodynamics New Streamfunction Approac for Magnetoydrodynamics Kab Seo Kang Brooaven National Laboratory, Computational Science Center, Building 63, Room, Upton NY 973, USA. sang@bnl.gov Summary. We apply te finite

More information

Algebraic Multigrid as Solvers and as Preconditioner

Algebraic Multigrid as Solvers and as Preconditioner Ò Algebraic Multigrid as Solvers and as Preconditioner Domenico Lahaye domenico.lahaye@cs.kuleuven.ac.be http://www.cs.kuleuven.ac.be/ domenico/ Department of Computer Science Katholieke Universiteit Leuven

More information

The WKB local discontinuous Galerkin method for the simulation of Schrödinger equation in a resonant tunneling diode

The WKB local discontinuous Galerkin method for the simulation of Schrödinger equation in a resonant tunneling diode The WKB local discontinuous Galerkin method for the simulation of Schrödinger equation in a resonant tunneling diode Wei Wang and Chi-Wang Shu Division of Applied Mathematics Brown University Providence,

More information

Inverse problems Total Variation Regularization Mark van Kraaij Casa seminar 23 May 2007 Technische Universiteit Eindh ove n University of Technology

Inverse problems Total Variation Regularization Mark van Kraaij Casa seminar 23 May 2007 Technische Universiteit Eindh ove n University of Technology Inverse problems Total Variation Regularization Mark van Kraaij Casa seminar 23 May 27 Introduction Fredholm first kind integral equation of convolution type in one space dimension: g(x) = 1 k(x x )f(x

More information

A Domain Decomposition Based Jacobi-Davidson Algorithm for Quantum Dot Simulation

A Domain Decomposition Based Jacobi-Davidson Algorithm for Quantum Dot Simulation A Domain Decomposition Based Jacobi-Davidson Algorithm for Quantum Dot Simulation Tao Zhao 1, Feng-Nan Hwang 2 and Xiao-Chuan Cai 3 Abstract In this paper, we develop an overlapping domain decomposition

More information

Adaptive Finite Element Approximations for Density Functional Models

Adaptive Finite Element Approximations for Density Functional Models HPPC Methods and Algorithms for Materials Defects, IMS Singapore, February 12, 2015 Adaptive Finite Element Approximations for Density Functional Models Aihui Zhou LSEC, Institute of Computational Mathematics

More information

A Non-Linear Eigensolver-Based Alternative to Traditional Self-Consistent Electronic Structure Calculation Methods

A Non-Linear Eigensolver-Based Alternative to Traditional Self-Consistent Electronic Structure Calculation Methods University of Massachusetts Amherst ScholarWorks@UMass Amherst Masters Theses 1911 - February 2014 2013 A Non-Linear Eigensolver-Based Alternative to Traditional Self-Consistent Electronic Structure Calculation

More information

An Introduction to the Discontinuous Galerkin Method

An Introduction to the Discontinuous Galerkin Method An Introduction to the Discontinuous Galerkin Method Krzysztof J. Fidkowski Aerospace Computational Design Lab Massachusetts Institute of Technology March 16, 2005 Computational Prototyping Group Seminar

More information

On Solving Large Algebraic. Riccati Matrix Equations

On Solving Large Algebraic. Riccati Matrix Equations International Mathematical Forum, 5, 2010, no. 33, 1637-1644 On Solving Large Algebraic Riccati Matrix Equations Amer Kaabi Department of Basic Science Khoramshahr Marine Science and Technology University

More information

Ritz Value Bounds That Exploit Quasi-Sparsity

Ritz Value Bounds That Exploit Quasi-Sparsity Banff p.1 Ritz Value Bounds That Exploit Quasi-Sparsity Ilse Ipsen North Carolina State University Banff p.2 Motivation Quantum Physics Small eigenvalues of large Hamiltonians Quasi-Sparse Eigenvector

More information

DELFT UNIVERSITY OF TECHNOLOGY

DELFT UNIVERSITY OF TECHNOLOGY DELFT UNIVERSITY OF TECHNOLOGY REPORT 11-14 On the convergence of inexact Newton methods R. Idema, D.J.P. Lahaye, and C. Vuik ISSN 1389-6520 Reports of the Department of Applied Mathematical Analysis Delft

More information

Domain-decomposed Fully Coupled Implicit Methods for a Magnetohydrodynamics Problem

Domain-decomposed Fully Coupled Implicit Methods for a Magnetohydrodynamics Problem Domain-decomposed Fully Coupled Implicit Methods for a Magnetohydrodynamics Problem Serguei Ovtchinniov 1, Florin Dobrian 2, Xiao-Chuan Cai 3, David Keyes 4 1 University of Colorado at Boulder, Department

More information

Recovery-Based A Posteriori Error Estimation

Recovery-Based A Posteriori Error Estimation Recovery-Based A Posteriori Error Estimation Zhiqiang Cai Purdue University Department of Mathematics, Purdue University Slide 1, March 2, 2011 Outline Introduction Diffusion Problems Higher Order Elements

More information

Electronic Structure Methodology 1

Electronic Structure Methodology 1 Electronic Structure Methodology 1 Chris J. Pickard Lecture Two Working with Density Functional Theory In the last lecture we learnt how to write the total energy as a functional of the density n(r): E

More information

Iterative Methods for Linear Systems of Equations

Iterative Methods for Linear Systems of Equations Iterative Methods for Linear Systems of Equations Projection methods (3) ITMAN PhD-course DTU 20-10-08 till 24-10-08 Martin van Gijzen 1 Delft University of Technology Overview day 4 Bi-Lanczos method

More information

Density Functional Theory

Density Functional Theory Density Functional Theory March 26, 2009 ? DENSITY FUNCTIONAL THEORY is a method to successfully describe the behavior of atomic and molecular systems and is used for instance for: structural prediction

More information

Numerical Modeling of Methane Hydrate Evolution

Numerical Modeling of Methane Hydrate Evolution Numerical Modeling of Methane Hydrate Evolution Nathan L. Gibson Joint work with F. P. Medina, M. Peszynska, R. E. Showalter Department of Mathematics SIAM Annual Meeting 2013 Friday, July 12 This work

More information

Linear Solvers. Andrew Hazel

Linear Solvers. Andrew Hazel Linear Solvers Andrew Hazel Introduction Thus far we have talked about the formulation and discretisation of physical problems...... and stopped when we got to a discrete linear system of equations. Introduction

More information

Numerical methods for PDEs FEM convergence, error estimates, piecewise polynomials

Numerical methods for PDEs FEM convergence, error estimates, piecewise polynomials Platzhalter für Bild, Bild auf Titelfolie hinter das Logo einsetzen Numerical methods for PDEs FEM convergence, error estimates, piecewise polynomials Dr. Noemi Friedman Contents of the course Fundamentals

More information

NUMERICAL ANALYSIS 2 - FINAL EXAM Summer Term 2006 Matrikelnummer:

NUMERICAL ANALYSIS 2 - FINAL EXAM Summer Term 2006 Matrikelnummer: Prof. Dr. O. Junge, T. März Scientific Computing - M3 Center for Mathematical Sciences Munich University of Technology Name: NUMERICAL ANALYSIS 2 - FINAL EXAM Summer Term 2006 Matrikelnummer: I agree to

More information

MODEL REDUCTION BY A CROSS-GRAMIAN APPROACH FOR DATA-SPARSE SYSTEMS

MODEL REDUCTION BY A CROSS-GRAMIAN APPROACH FOR DATA-SPARSE SYSTEMS MODEL REDUCTION BY A CROSS-GRAMIAN APPROACH FOR DATA-SPARSE SYSTEMS Ulrike Baur joint work with Peter Benner Mathematics in Industry and Technology Faculty of Mathematics Chemnitz University of Technology

More information

Rational Krylov methods for linear and nonlinear eigenvalue problems

Rational Krylov methods for linear and nonlinear eigenvalue problems Rational Krylov methods for linear and nonlinear eigenvalue problems Mele Giampaolo mele@mail.dm.unipi.it University of Pisa 7 March 2014 Outline Arnoldi (and its variants) for linear eigenproblems Rational

More information

An Inexact Newton Method for Nonlinear Constrained Optimization

An Inexact Newton Method for Nonlinear Constrained Optimization An Inexact Newton Method for Nonlinear Constrained Optimization Frank E. Curtis Numerical Analysis Seminar, January 23, 2009 Outline Motivation and background Algorithm development and theoretical results

More information

Efficient solution of stationary Euler flows with critical points and shocks

Efficient solution of stationary Euler flows with critical points and shocks Efficient solution of stationary Euler flows with critical points and shocks Hans De Sterck Department of Applied Mathematics University of Waterloo 1. Introduction consider stationary solutions of hyperbolic

More information

The amount of work to construct each new guess from the previous one should be a small multiple of the number of nonzeros in A.

The amount of work to construct each new guess from the previous one should be a small multiple of the number of nonzeros in A. AMSC/CMSC 661 Scientific Computing II Spring 2005 Solution of Sparse Linear Systems Part 2: Iterative methods Dianne P. O Leary c 2005 Solving Sparse Linear Systems: Iterative methods The plan: Iterative

More information

Scientific Computing: An Introductory Survey

Scientific Computing: An Introductory Survey Scientific Computing: An Introductory Survey Chapter 5 Nonlinear Equations Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002. Reproduction

More information

Semi-implicit Krylov Deferred Correction Methods for Ordinary Differential Equations

Semi-implicit Krylov Deferred Correction Methods for Ordinary Differential Equations Semi-implicit Krylov Deferred Correction Methods for Ordinary Differential Equations Sunyoung Bu University of North Carolina Department of Mathematics CB # 325, Chapel Hill USA agatha@email.unc.edu Jingfang

More information

Chapter 5 HIGH ACCURACY CUBIC SPLINE APPROXIMATION FOR TWO DIMENSIONAL QUASI-LINEAR ELLIPTIC BOUNDARY VALUE PROBLEMS

Chapter 5 HIGH ACCURACY CUBIC SPLINE APPROXIMATION FOR TWO DIMENSIONAL QUASI-LINEAR ELLIPTIC BOUNDARY VALUE PROBLEMS Chapter 5 HIGH ACCURACY CUBIC SPLINE APPROXIMATION FOR TWO DIMENSIONAL QUASI-LINEAR ELLIPTIC BOUNDARY VALUE PROBLEMS 5.1 Introduction When a physical system depends on more than one variable a general

More information

Preconditioning the Newton-Krylov method for reactive transport

Preconditioning the Newton-Krylov method for reactive transport Preconditioning the Newton-Krylov method for reactive transport Michel Kern, L. Amir, A. Taakili INRIA Paris-Rocquencourt Maison de la Simulation MoMaS workshop Reactive Transport Modeling in the Geological

More information

ANALYSIS AND NUMERICAL METHODS FOR SOME CRACK PROBLEMS

ANALYSIS AND NUMERICAL METHODS FOR SOME CRACK PROBLEMS INTERNATIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING, SERIES B Volume 2, Number 2-3, Pages 155 166 c 2011 Institute for Scientific Computing and Information ANALYSIS AND NUMERICAL METHODS FOR SOME

More information

j=1 r 1 x 1 x n. r m r j (x) r j r j (x) r j (x). r j x k

j=1 r 1 x 1 x n. r m r j (x) r j r j (x) r j (x). r j x k Maria Cameron Nonlinear Least Squares Problem The nonlinear least squares problem arises when one needs to find optimal set of parameters for a nonlinear model given a large set of data The variables x,,

More information

DISCRETE MAXIMUM PRINCIPLES in THE FINITE ELEMENT SIMULATIONS

DISCRETE MAXIMUM PRINCIPLES in THE FINITE ELEMENT SIMULATIONS DISCRETE MAXIMUM PRINCIPLES in THE FINITE ELEMENT SIMULATIONS Sergey Korotov BCAM Basque Center for Applied Mathematics http://www.bcamath.org 1 The presentation is based on my collaboration with several

More information

Iterative Methods for Incompressible Flow

Iterative Methods for Incompressible Flow Iterative Methods for Incompressible Flow Melanie McKay Thesis submitted to the Faculty of Graduate and Postdoctoral Studies in partial fulfillment of the requirements for the degree of Master s of Science

More information

Lecture 10: Finite Differences for ODEs & Nonlinear Equations

Lecture 10: Finite Differences for ODEs & Nonlinear Equations Lecture 10: Finite Differences for ODEs & Nonlinear Equations J.K. Ryan@tudelft.nl WI3097TU Delft Institute of Applied Mathematics Delft University of Technology 21 November 2012 () Finite Differences

More information

ITERATIVE METHODS FOR NONLINEAR ELLIPTIC EQUATIONS

ITERATIVE METHODS FOR NONLINEAR ELLIPTIC EQUATIONS ITERATIVE METHODS FOR NONLINEAR ELLIPTIC EQUATIONS LONG CHEN In this chapter we discuss iterative methods for solving the finite element discretization of semi-linear elliptic equations of the form: find

More information

STOP, a i+ 1 is the desired root. )f(a i) > 0. Else If f(a i+ 1. Set a i+1 = a i+ 1 and b i+1 = b Else Set a i+1 = a i and b i+1 = a i+ 1

STOP, a i+ 1 is the desired root. )f(a i) > 0. Else If f(a i+ 1. Set a i+1 = a i+ 1 and b i+1 = b Else Set a i+1 = a i and b i+1 = a i+ 1 53 17. Lecture 17 Nonlinear Equations Essentially, the only way that one can solve nonlinear equations is by iteration. The quadratic formula enables one to compute the roots of p(x) = 0 when p P. Formulas

More information

Numerical Simulations on Two Nonlinear Biharmonic Evolution Equations

Numerical Simulations on Two Nonlinear Biharmonic Evolution Equations Numerical Simulations on Two Nonlinear Biharmonic Evolution Equations Ming-Jun Lai, Chun Liu, and Paul Wenston Abstract We numerically simulate the following two nonlinear evolution equations with a fourth

More information

Bipolar quantum corrections in resolving individual dopants in atomistic device simulation

Bipolar quantum corrections in resolving individual dopants in atomistic device simulation Superlattices and Microstructures 34 (2003) 327 334 www.elsevier.com/locate/superlattices Bipolar quantum corrections in resolving individual dopants in atomistic device simulation Gareth Roy, Andrew R.

More information

The quadratic eigenvalue problem (QEP) is to find scalars λ and nonzero vectors u satisfying

The quadratic eigenvalue problem (QEP) is to find scalars λ and nonzero vectors u satisfying I.2 Quadratic Eigenvalue Problems 1 Introduction The quadratic eigenvalue problem QEP is to find scalars λ and nonzero vectors u satisfying where Qλx = 0, 1.1 Qλ = λ 2 M + λd + K, M, D and K are given

More information

A derivative-free nonmonotone line search and its application to the spectral residual method

A derivative-free nonmonotone line search and its application to the spectral residual method IMA Journal of Numerical Analysis (2009) 29, 814 825 doi:10.1093/imanum/drn019 Advance Access publication on November 14, 2008 A derivative-free nonmonotone line search and its application to the spectral

More information

Applied Numerical Mathematics

Applied Numerical Mathematics Applied Numerical Mathematics 131 (2018) 1 15 Contents lists available at ScienceDirect Applied Numerical Mathematics www.elsevier.com/locate/apnum The spectral-galerkin approximation of nonlinear eigenvalue

More information

Linear algebra issues in Interior Point methods for bound-constrained least-squares problems

Linear algebra issues in Interior Point methods for bound-constrained least-squares problems Linear algebra issues in Interior Point methods for bound-constrained least-squares problems Stefania Bellavia Dipartimento di Energetica S. Stecco Università degli Studi di Firenze Joint work with Jacek

More information

Algorithms and Computational Aspects of DFT Calculations

Algorithms and Computational Aspects of DFT Calculations Algorithms and Computational Aspects of DFT Calculations Part I Juan Meza and Chao Yang High Performance Computing Research Lawrence Berkeley National Laboratory IMA Tutorial Mathematical and Computational

More information

Outline. Scientific Computing: An Introductory Survey. Nonlinear Equations. Nonlinear Equations. Examples: Nonlinear Equations

Outline. Scientific Computing: An Introductory Survey. Nonlinear Equations. Nonlinear Equations. Examples: Nonlinear Equations Methods for Systems of Methods for Systems of Outline Scientific Computing: An Introductory Survey Chapter 5 1 Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign

More information

INSTITUTE BECKMAN. K. Hess, Y. Liu, F. Oyafuso, W.C. Ng and B.D. Klein. The Beckman Institute University of Illinois at Urbana-Champaign

INSTITUTE BECKMAN. K. Hess, Y. Liu, F. Oyafuso, W.C. Ng and B.D. Klein. The Beckman Institute University of Illinois at Urbana-Champaign BECKMAN INSTITUTE K. Hess, Y. Liu, F. Oyafuso, W.C. Ng and B.D. Klein. The Beckman Institute University of Illinois at Urbana-Champaign Photo by Don Hamerman Typical VCSEL Structure and Electronic Mesh

More information

Parallel Ensemble Monte Carlo for Device Simulation

Parallel Ensemble Monte Carlo for Device Simulation Workshop on High Performance Computing Activities in Singapore Dr Zhou Xing School of Electrical and Electronic Engineering Nanyang Technological University September 29, 1995 Outline Electronic transport

More information

Pseudopotentials for hybrid density functionals and SCAN

Pseudopotentials for hybrid density functionals and SCAN Pseudopotentials for hybrid density functionals and SCAN Jing Yang, Liang Z. Tan, Julian Gebhardt, and Andrew M. Rappe Department of Chemistry University of Pennsylvania Why do we need pseudopotentials?

More information

17 Solution of Nonlinear Systems

17 Solution of Nonlinear Systems 17 Solution of Nonlinear Systems We now discuss the solution of systems of nonlinear equations. An important ingredient will be the multivariate Taylor theorem. Theorem 17.1 Let D = {x 1, x 2,..., x m

More information

AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 23: GMRES and Other Krylov Subspace Methods; Preconditioning

AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 23: GMRES and Other Krylov Subspace Methods; Preconditioning AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 23: GMRES and Other Krylov Subspace Methods; Preconditioning Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Numerical Analysis I 1 / 18 Outline

More information

Numerical Methods I Solving Nonlinear Equations

Numerical Methods I Solving Nonlinear Equations Numerical Methods I Solving Nonlinear Equations Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 MATH-GA 2011.003 / CSCI-GA 2945.003, Fall 2014 October 16th, 2014 A. Donev (Courant Institute)

More information

Optimization. Benjamin Recht University of California, Berkeley Stephen Wright University of Wisconsin-Madison

Optimization. Benjamin Recht University of California, Berkeley Stephen Wright University of Wisconsin-Madison Optimization Benjamin Recht University of California, Berkeley Stephen Wright University of Wisconsin-Madison optimization () cost constraints might be too much to cover in 3 hours optimization (for big

More information

Basic Concepts of Adaptive Finite Element Methods for Elliptic Boundary Value Problems

Basic Concepts of Adaptive Finite Element Methods for Elliptic Boundary Value Problems Basic Concepts of Adaptive Finite lement Methods for lliptic Boundary Value Problems Ronald H.W. Hoppe 1,2 1 Department of Mathematics, University of Houston 2 Institute of Mathematics, University of Augsburg

More information

Lecture 9 Approximations of Laplace s Equation, Finite Element Method. Mathématiques appliquées (MATH0504-1) B. Dewals, C.

Lecture 9 Approximations of Laplace s Equation, Finite Element Method. Mathématiques appliquées (MATH0504-1) B. Dewals, C. Lecture 9 Approximations of Laplace s Equation, Finite Element Method Mathématiques appliquées (MATH54-1) B. Dewals, C. Geuzaine V1.2 23/11/218 1 Learning objectives of this lecture Apply the finite difference

More information

A Line search Multigrid Method for Large-Scale Nonlinear Optimization

A Line search Multigrid Method for Large-Scale Nonlinear Optimization A Line search Multigrid Method for Large-Scale Nonlinear Optimization Zaiwen Wen Donald Goldfarb Department of Industrial Engineering and Operations Research Columbia University 2008 Siam Conference on

More information