Chebychev Propagator for Inhomogeneous Schrödinger Equations
|
|
- Samantha Greer
- 5 years ago
- Views:
Transcription
1 Chebychev Propagator for Inhomogeneous Schrödinger Equations Michael Goerz May 16, 2011
2 Solving the Schrödinger Equation Schrödinger Equation Ψ(t) = Ĥ Ψ(t) ; e.g. Ĥ = t ( V1 (R) ) µɛ(t) µɛ(t) V 2 (R)
3 Solving the Schrödinger Equation Schrödinger Equation Ψ(t) = Ĥ Ψ(t) ; e.g. Ĥ = t ( V1 (R) ) µɛ(t) µɛ(t) V 2 (R) Solution Ψ(t) = e iĥt Ψ 0 if Ĥ not time dependent
4 Solving the Schrödinger Equation Schrödinger Equation Ψ(t) = Ĥ Ψ(t) ; e.g. Ĥ = t ( V1 (R) ) µɛ(t) µɛ(t) V 2 (R) Solution Ψ(t + t) = e iĥ t Ψ(t) piecewise constant pulses
5 Solving the Schrödinger Equation Schrödinger Equation Ψ(t) = Ĥ Ψ(t) ; e.g. Ĥ = t ( V1 (R) ) µɛ(t) µɛ(t) V 2 (R) Solution Ψ(t + t) = e iĥ t Ψ(t) piecewise constant pulses Evaluation of the Time Evolution Operator Expand into series: N e iĥt a np n(ĥ) k=1
6 Solving the Schrödinger Equation Schrödinger Equation Ψ(t) = Ĥ Ψ(t) ; e.g. Ĥ = t ( V1 (R) ) µɛ(t) µɛ(t) V 2 (R) Solution Ψ(t + t) = e iĥ t Ψ(t) piecewise constant pulses Evaluation of the Time Evolution Operator Expand into series: N e iĥt a np n(ĥ) k=1 cf. Runge-Kutta: solving the differential equation, instead of evaluating the analytical solution
7 Chebychev Polynomials Properties of Chebychev polynomials P 0 = 1, P 1 (x) = x, P n(x) = 2xP n 1 (x) P n 2 (x) Defined over range [ 1, 1] normalize Hamiltonian Ĥ norm = 2 Ĥ E min1 E Fastest converging polynomial expansion 1 P n(x) = cos(nθ) with θ = arccos(x) Cosine transform for coefficients Chebychev coefficients Expansion coefficients a n for function f (x): a n = 2 δ n0 π +1 1 f (x)p n(x) 1 x 2 For f (Ĥ norm) = e iĥ norm t : a n Bessel functions. dx
8 Inhomogeneous Schrödinger Equation t Ψ(t) = Ĥ Ψ(t) + Φ(t)
9 Inhomogeneous Schrödinger Equation t Ψ(t) = Ĥ Ψ(t) + Φ(t) Note: not the same as nonlinear SE: e.g. t Ψ(t) = (Ĥ + Ψ(t) 2 ) Ψ(t)
10 OCT with State-Dependent Costs Optimization Functional J = F [Ψ t] + g a[ɛ(t)] dt + g b [Ψ(t)] dt; g b [Ψ] = λ b Ψ(t) ˆP allow Ψ(t)
11 OCT with State-Dependent Costs Optimization Functional J = F [Ψ t] + g a[ɛ(t)] dt + g b [Ψ(t)] dt; g b [Ψ] = λ b Ψ(t) ˆP allow Ψ(t) also: time-dependent targets
12 Reminder: Krotov The Chebychev Propagator 1 backward propagation with old pulse ɛ 1 ɛ 2 ɛ nt 2 ɛ nt 1 Ψ bw (t 0) Ψ bw (t) Ψ. bw..(t) Ψ bw (t) Ψ t Ψ t ˆµ ˆµ.. ˆµ. ˆµ = τ Ψ i Ψ fw (t) Ψ. fw.(t). Ψ fw (t) Ψ fw (T ) Ψ fw (T ) ɛ 1 ɛ 2 ɛ nt 2 ɛ nt 1 2 forward propagation with new pulse Pulse update by matching forward- and backward-propagated states
13 Inhomogeneous Backward-Propagation Daniel: Second Order Krotov Preprint (arxiv: v1) Optimization Functional J = F [Ψ t] + g a[ɛ(t)] dt + g b [Ψ(t)] dt; g b [Ψ] = λ b Ψ(t) ˆP allow Ψ(t) Pulse Update ɛ Im χ (0) (t) ˆµ φ (1) (t) Backward Propagation d dt χ(0) (t) = i Ĥ [ϕ (0), ɛ (0) ] χ (0) (t) + ϕ g b ϕ (0) (t) χ (0) (T ) = ϕ J T ϕ (0) (T )
14 Inhomogeneous Backward-Propagation Daniel: Second Order Krotov Preprint (arxiv: v1) Optimization Functional J = F [Ψ t] + g a[ɛ(t)] dt + g b [Ψ(t)] dt; g b [Ψ] = λ b Ψ(t) ˆP allow Ψ(t) Pulse Update ɛ Im χ (0) (t) ˆµ φ (1) (t) Backward Propagation d dt χ(0) (t) = i Ĥ [ϕ (0), ɛ (0) ] χ (0) ϕ (t) + ˆP (0) allow (t) χ (0) (T ) = ϕ J T ϕ (0) (T )
15 Solving the Inhomogeneous Schrödinger Equation Numerically
16 References The Chebychev Propagator [1] JCP 130, (2009) A Chebychev propagator for inhomogeneous Schrödinger equations Mamadou Ndong, 1 Hillel Tal-Ezer, 2 Ronnie Kosloff, 3 and Christiane P. Koch 1,a 1 Institut für Theoretische Physik, Freie Universität Berlin, Arnimallee 14, Berlin, Germany 2 School of Computer Sciences, The Academic College of Tel-Aviv Yaffo, 2 Rabenu Yeruham St., Tel-Aviv 61803, Israel 3 Department of Physical Chemistry and The Fritz Haber Research Center, The Hebrew University, Jerusalem 91904, Israel THE JOURNAL OF CHEMICAL PHYSICS 130, [2] JCP 132, (2010) A Chebychev propagator with iterative time ordering for explicitly time-dependent Hamiltonians Mamadou Ndong, 1 Hillel Tal-Ezer, 2 Ronnie Kosloff, 3 and Christiane P. Koch 1,a 1 Institut für Theoretische Physik, Freie Universität Berlin, Arnimallee 14, Berlin, Germany 2 School of Computer Sciences, The Academic College of Tel Aviv-Yaffo, Rabenu Yeruham St., Tel-Aviv 61803, Israel 3 Institute of Chemistry and The Fritz Haber Research Center, The Hebrew University, Jerusalem 91904, Israel THE JOURNAL OF CHEMICAL PHYSICS 132,
17 Treating the Inhomogeneity in Order m Inhomogeneous SE Expansion of Φ(t) Ψ(t) = Ĥ Ψ(t) + Φ(t) t m 1 Φ(t) m = Φj Pj ( t) j=0 Expand inhomogeneous term in Chebychev series
18 Treating the Inhomogeneity in Order m Inhomogeneous SE Expansion of Φ(t) Ψ(t) = Ĥ Ψ(t) + Φ(t) t m 1 m 1 t j Φ(t) m = Φj Pj ( t) Φ (j) j! j=0 j=0 Expand inhomogeneous term in Chebychev series Reorder into power series (or use Taylor to begin with)
19 Treating the Inhomogeneity in Order m Inhomogeneous SE Expansion of Φ(t) Ψ(t) = Ĥ Ψ(t) + Φ(t) t m 1 m 1 t j Φ(t) m = Φj Pj ( t) Φ (j) j! j=0 j=0 Expand inhomogeneous term in Chebychev series Reorder into power series (or use Taylor to begin with) Decide on which order to solve: 1, 2, 3, maybe 4 The smaller the order, the smaller t has to be
20 The Analytical Solution Inhomogeneous SE (Φ to order m) m 1 Ψ(t) = Ĥ Ψ(t) + t j=0 t j Φ (j) j! Solution m 1 Ψ(t) (m) = j=0 t j j! λ (j) + f m(ĥ) λ (m) m 1 f m = ( iĥ) m e iĥt ( iĥt) j j! j=0 λ (0) = Ψ 0 λ (j) = iĥ λ (j 1) + Φ (j 1) e.g. Ψ(t) (3) = Ψ 0 + t λ (1) + t2 2 λ (2) + f 3 (Ĥ) λ 3, with ( ) 3 ( ) f 3 (Ĥ) = iĥ e iĥt 1 iĥt
21 The Analytical Solution Inhomogeneous SE (Φ to order m) m 1 Ψ(t) = Ĥ Ψ(t) + t j=0 t j Φ (j) j! Solution m 1 Ψ(t) (m) = j=0 t j j! λ (j) + f m(ĥ) λ (m) m 1 f m = ( iĥ) m e iĥt ( iĥt) j j! j=0 λ (0) = Ψ 0 λ (j) = iĥ λ (j 1) + Φ (j 1) e.g. Ψ(t) (3) = Ψ 0 + t λ (1) + t2 2 λ (2) + f 3 (Ĥ) λ 3, with ( ) 3 ( ) f 3 (Ĥ) = iĥ e iĥt 1 iĥt
22 The Analytical Solution Inhomogeneous SE (Φ to order m) m 1 Ψ(t) = Ĥ Ψ(t) + t j=0 t j Φ (j) j! Solution m 1 Ψ(t) (m) = j=0 t j j! λ (j) + f m(ĥ) λ (m) m 1 f m = ( iĥ) m e iĥt ( iĥt) j j! j=0 λ (0) = Ψ 0 λ (j) = iĥ λ (j 1) + Φ (j 1) e.g. Ψ(t) (0) = e iĥt Ψ 0 homogeneous propagation
23 Chebychev Propagation Solution m 1 Ψ(t) (m) = j=0 t j j! λ (j) + f m(ĥ) λ (m) ; { } Φ (j) λ Idea Evaluate f m(ĥ) by expanding it into Chebychev Polynomials (just like for the standard Chebychev propagator with f 0 (Ĥ) = e iĥt )
24 Chebychev Propagation Solution m 1 Ψ(t) (m) = j=0 t j j! λ (j) + f m(ĥ) λ (m) ; { } Φ (j) λ Idea Evaluate f m(ĥ) by expanding it into Chebychev Polynomials (just like for the standard Chebychev propagator with f 0 (Ĥ) = e iĥt ) Algorithm Outline (for fixed m) For each time step: determine { Φ (j) } and from that { λ (j)} run through the Chebychev series for f m sum everything up, yielding Ψ(t) (m)
25 Details of the Algorithm
26 Global Initialization (before any actual propagation) Calculate Chebychev Coefficients Calculate the Chebychev expansion coefficients a n for f m(ĥ), for the chosen order m.
27 Global Initialization (before any actual propagation) Calculate Chebychev Coefficients Calculate the Chebychev expansion coefficients a n for f m(ĥ), for the chosen order m. a n cannot be calculated analytically (like for the standard Chebychev) Calculation of a n is done through a fast cosine-transform: a n = 2 δ n0 N N 1 f m(θ k ) cos(nθ k ) k=0 Ĥ needs to be normalized a n might have to be re-calculated if spectral radius changes (after each OCT iteration) On a non-equidistant time grid, the a n would have to be re-calculated at every time step For small Ĥ, the term ( iĥ) m might lead to numerical instability. We could use Taylor instead....?
28 Local Initialization (at every time step) Calculate Expansion of Inhomogeneous Term Calculate all necessary Φ (j) (i.e. up to order m) to approximate the local Φ(t i ), either by an intermediate Chebychev expansion, fallowed by calculation of coefficients in the power series, or by a direct Taylor series.
29 Local Initialization (at every time step) Calculate Expansion of Inhomogeneous Term Calculate all necessary Φ (j) (i.e. up to order m) to approximate the local Φ(t i ), either by an intermediate Chebychev expansion, fallowed by calculation of coefficients in the power series, or by a direct Taylor series. Calculation via Taylor: Calculate derivatives through FFT Calculation via Chebychev: Sample Φ(t) at intermediate points around t by interpolation (splining should be fine) Calculate Chebychev coefficients Φ j by cosine transform Calculate Φ (j) from Φ j by formulas in References (just collect the powers)
30 Propagation Step The Chebychev Propagator Solution m 1 Ψ(t) (m) = j=0 t j j! λ (j) + f m(ĥ) λ (m) Calculate λ (j), j = 0... m 1 λ (j) = iĥ λ (j 1) + Φ (j 1) Calculate f m(ĥ) λ (m) by Chebychev recursion (Choose N to reach machine precision) f m(ĥ) λ (m) N = a np n(ĥ) λ (m) n=1 P n(ĥ) = 2ĤP n 1 (Ĥ) P n 2 (Ĥ) Calculate Ψ(t) (m)
31 in QDYN
32 Propagation Routines (prop.f90) prop subroutine prop(psi, grid, ham, work, para, from ti, to ti, bw, & & info hook, pulses, alt pulse, upd hook, storage) prop step subroutine prop step(psi, grid, ham, work, para, ti, bw, & & pulses, alt pulses, alt pulse, upd hook)
33 Propagation Routines (prop.f90) prop subroutine prop(psi, grid, ham, work, para, from ti, to ti, bw, & & info hook, pulses, alt pulse, upd hook, storage) prop with optional inhomogeneous term subroutine prop(psi, grid, ham, work, para, from ti, to ti, bw, inh psi, & & get inh phi, info hook, pulses, alt pulse, upd hook, storage) inh psi: stored array of forward-propagated states get inh phi: function that calculates Φ from Ψ (e.g. ˆP allow Ψ ). prop step subroutine prop step(psi, grid, ham, work, para, ti, bw, & & pulses, alt pulses, alt pulse, upd hook) prop step with optional inhomogeneous term subroutine prop step(psi, grid, ham, work, para, ti, bw, inh psi, & & get inh phi, pulses, alt pulses, alt pulse, upd hook)
34 Calculation of Chebychev Coefficients Calculate Chebychev Coefficients Calculate the Chebychev expansion coefficients a n for f m(ĥ), for the chosen order m. in inhom cheby.f90: subroutine init inh cheby(ham, wcheby, order, para) Use the same work array (wcheby) as for the homogeneous Chebychev propagation. Sufficient a n are calculated and stored in wcheby to reach machine precision Watch out for numerical instability ( Taylor)
35 Expansion of Inhomogeneous Term Calculate Expansion of Inhomogeneous Term Calculate all necessary Φ (j) (i.e. up to order m) to approximate the local Φ(t i ), either by an intermediate Chebychev expansion, fallowed by calculation of coefficients in the power series, or by a direct Taylor series. in inhom cheby.f90: subroutine expand inh phi(inh psi, get inh phi, order, phi coeffs) phi coeffs stores the Φ (j) (power series) invoke monic transf to calculate Φ (j) from Φ j Continue with calculation of λ (j) : subroutine get inh lambda(lambda, phi, ham,...)
36 Performing the Propagation Step Solution m 1 Ψ(t) (m) = j=0 t j j! λ (j) + f m(ĥ) λ (m) in inhom cheby.f90: subroutine inhom cheby(psi, work, ham, grid, lambda, para, dt, ti, & & alt pulses, alt pulse) Identical interface to cheby, except for λ coefficients are implicit in work
Optimal Controlled Phasegates for Trapped Neutral Atoms at the Quantum Speed Limit
at the Quantum Speed Limit Michael Goerz Tommaso Calarco Christiane P. Koch Universität Kassel Universität Ulm DPG Spring Meeting Dresden March 6, 2 Universal Quantum Computing Controlled Phasegate e iχ
More informationOptimal Controlled Phasegates for Trapped Neutral Atoms at the Quantum Speed Limit
with Ultracold Trapped Atoms at the Quantum Speed Limit Michael Goerz May 31, 2011 with Ultracold Trapped Atoms Prologue: with Ultracold Trapped Atoms Classical Computing: 4-Bit Full Adder Inside the CPU:
More informationProtecting coherence in Optimal Control Theory: state dependent constraint approach
Protecting coherence in Optimal Control Theory: state dependent constraint approach José P. Palao, 1 Ronnie Kosloff, 2 and Christiane P. Koch 3 1 Departamento de Física Fundamental II, Universidad de La
More informationIntroduction to the GRAPE Algorithm
June 8, 2010 Reference: J. Mag. Res. 172, 296 (2005) Journal of Magnetic Resonance 172 (2005) 296 305 www.elsevier.com/locate/jmr Optimal control of coupled spin dynamics: design of NMR pulse sequences
More informationComputational Physics: Quantum Dynamics & Control
Computational Physics: Quantum Dynamics & Control ultrafast processes frequency domain pulse shaping using AOM s or LCD s for both amplitude and phase... the versatility of laser light available in VIS,
More informationAn Overly Simplified and Brief Review of Differential Equation Solution Methods. 1. Some Common Exact Solution Methods for Differential Equations
An Overly Simplified and Brief Review of Differential Equation Solution Methods We will be dealing with initial or boundary value problems. A typical initial value problem has the form y y 0 y(0) 1 A typical
More informationConsistency and Convergence
Jim Lambers MAT 77 Fall Semester 010-11 Lecture 0 Notes These notes correspond to Sections 1.3, 1.4 and 1.5 in the text. Consistency and Convergence We have learned that the numerical solution obtained
More informationIntroduction to the Numerical Solution of IVP for ODE
Introduction to the Numerical Solution of IVP for ODE 45 Introduction to the Numerical Solution of IVP for ODE Consider the IVP: DE x = f(t, x), IC x(a) = x a. For simplicity, we will assume here that
More informationMultistep Methods for IVPs. t 0 < t < T
Multistep Methods for IVPs We are still considering the IVP dy dt = f(t,y) t 0 < t < T y(t 0 ) = y 0 So far we have looked at Euler s method, which was a first order method and Runge Kutta (RK) methods
More informationLecture 4: Numerical solution of ordinary differential equations
Lecture 4: Numerical solution of ordinary differential equations Department of Mathematics, ETH Zürich General explicit one-step method: Consistency; Stability; Convergence. High-order methods: Taylor
More informationDefect-based a-posteriori error estimation for implicit ODEs and DAEs
1 / 24 Defect-based a-posteriori error estimation for implicit ODEs and DAEs W. Auzinger Institute for Analysis and Scientific Computing Vienna University of Technology Workshop on Innovative Integrators
More informationThe Pseudospectral Method
The Pseudospectral Method Heiner Igel Department of Earth and Environmental Sciences Ludwig-Maximilians-University Munich Heiner Igel Computational Seismology 1 / 43 Outline 1 Introduction Motivation History
More informationSemi-Lagrangian Formulations for Linear Advection Equations and Applications to Kinetic Equations
Semi-Lagrangian Formulations for Linear Advection and Applications to Kinetic Department of Mathematical and Computer Science Colorado School of Mines joint work w/ Chi-Wang Shu Supported by NSF and AFOSR.
More informationNUMERICAL 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 informationIntroduction to optimal control theory
Introduction to optimal control theory Christiane P. Koch Laboratoire Aimé Cotton CNRS, France The Hebrew University Jerusalem, Israel Outline 0. Terminology 1. Intuitive control schemes and their experimental
More informationSuboptimal feedback control of PDEs by solving Hamilton-Jacobi Bellman equations on sparse grids
Suboptimal feedback control of PDEs by solving Hamilton-Jacobi Bellman equations on sparse grids Jochen Garcke joint work with Axel Kröner, INRIA Saclay and CMAP, Ecole Polytechnique Ilja Kalmykov, Universität
More informationFunctional Data Analysis
FDA 1-1 Functional Data Analysis Michal Benko Institut für Statistik und Ökonometrie Humboldt-Universität zu Berlin email:benko@wiwi.hu-berlin.de FDA 1-2 Outline of this talk: Introduction Turning discrete
More information2007 Summer College on Plasma Physics
856-7 Summer College on Plasma Physics July - 4 August, 7 Numerical methods and simulations. Lecture : Simulation of partial differential equations. B. Eliasson Institut Fuer Theoretische Physik IV Ruhr-Universitaet
More informationHigh-order time-splitting methods for Schrödinger equations
High-order time-splitting methods for Schrödinger equations and M. Thalhammer Department of Mathematics, University of Innsbruck Conference on Scientific Computing 2009 Geneva, Switzerland Nonlinear Schrödinger
More informationPropagators for TDDFT
Propagators for TDDFT A. Castro 1 M. A. L. Marques 2 A. Rubio 3 1 Institut für Theoretische Physik, Fachbereich Physik der Freie Universität Berlin 2 Departamento de Física, Universidade de Coimbra, Portugal.
More informationNumerical Methods - Initial Value Problems for ODEs
Numerical Methods - Initial Value Problems for ODEs Y. K. Goh Universiti Tunku Abdul Rahman 2013 Y. K. Goh (UTAR) Numerical Methods - Initial Value Problems for ODEs 2013 1 / 43 Outline 1 Initial Value
More informationQuantum soliton dynamics in vibrational chains: Comparison of fully correlated, mean field, and classical dynamics
JOURNAL OF CHEMICAL PHYSICS VOLUME 118, NUMBER 13 1 APRIL 2003 Quantum soliton dynamics in vibrational chains: Comparison of fully correlated, mean field, and classical dynamics Daniel Neuhauser Chemistry
More informationTheory, Solution Techniques and Applications of Singular Boundary Value Problems
Theory, Solution Techniques and Applications of Singular Boundary Value Problems W. Auzinger O. Koch E. Weinmüller Vienna University of Technology, Austria Problem Class z (t) = M(t) z(t) + f(t, z(t)),
More informationNumerical Methods. King Saud University
Numerical Methods King Saud University Aims In this lecture, we will... find the approximate solutions of derivative (first- and second-order) and antiderivative (definite integral only). Numerical Differentiation
More informationFINITE DIFFERENCES. Lecture 1: (a) Operators (b) Forward Differences and their calculations. (c) Backward Differences and their calculations.
FINITE DIFFERENCES Lecture 1: (a) Operators (b) Forward Differences and their calculations. (c) Backward Differences and their calculations. 1. Introduction When a function is known explicitly, it is easy
More informationChecking the Radioactive Decay Euler Algorithm
Lecture 2: Checking Numerical Results Review of the first example: radioactive decay The radioactive decay equation dn/dt = N τ has a well known solution in terms of the initial number of nuclei present
More informationNumerical Programming I (for CSE)
Technische Universität München WT 1/13 Fakultät für Mathematik Prof. Dr. M. Mehl B. Gatzhammer January 1, 13 Numerical Programming I (for CSE) Tutorial 1: Iterative Methods 1) Relaxation Methods a) Let
More informationOptimal control of time-dependent targets
Optimal control of time-dependent targets Diploma Thesis Submitted to the Free University Berlin, Physics Department Ioana Şerban Advisor: Professor Dr. Eberhard Groß Berlin, August 3, 24 Title page: time-dependent
More informationEvolution equations with spectral methods: the case of the wave equation
Evolution equations with spectral methods: the case of the wave equation Jerome.Novak@obspm.fr Laboratoire de l Univers et de ses Théories (LUTH) CNRS / Observatoire de Paris, France in collaboration with
More information4. Supplementary Notes on Time and Space Evolution of a Neutrino Beam
Lecture Notes for Quantum Physics II & III 8.05 & 8.059 Academic Year 1996/1997 4. Supplementary Notes on Time and Space Evolution of a Neutrino Beam c D. Stelitano 1996 As an example of a two-state system
More informationCHAPTER 5: Linear Multistep Methods
CHAPTER 5: Linear Multistep Methods Multistep: use information from many steps Higher order possible with fewer function evaluations than with RK. Convenient error estimates. Changing stepsize or order
More informationThe answer in each case is the error in evaluating the taylor series for ln(1 x) for x = which is 6.9.
Brad Nelson Math 26 Homework #2 /23/2. a MATLAB outputs: >> a=(+3.4e-6)-.e-6;a- ans = 4.449e-6 >> a=+(3.4e-6-.e-6);a- ans = 2.224e-6 And the exact answer for both operations is 2.3e-6. The reason why way
More informationLecture 20. Parity and Time Reversal
Lecture 20 Parity and Time Reversal November 15, 2009 Lecture 20 Time Translation ( ψ(t + ɛ) = Û[T (ɛ)] ψ(t) = I iɛ ) h Ĥ ψ(t) Ĥ is the generator of time translations. Û[T (ɛ)] = I iɛ h Ĥ [Ĥ, Ĥ] = 0 time
More informationMATHEMATICAL METHODS INTERPOLATION
MATHEMATICAL METHODS INTERPOLATION I YEAR BTech By Mr Y Prabhaker Reddy Asst Professor of Mathematics Guru Nanak Engineering College Ibrahimpatnam, Hyderabad SYLLABUS OF MATHEMATICAL METHODS (as per JNTU
More informationTime in Quantum Physics: from an extrinsic parameter to an in
Time in Quantum Physics: from an extrinsic parameter to an intrinsic observable 60th Anniversary of Abhay Ashtekar II. Institut für Theoretische Physik, Hamburg (based on joint work with Romeo Brunetti
More informationNumerical solution of ODEs
Numerical solution of ODEs Arne Morten Kvarving Department of Mathematical Sciences Norwegian University of Science and Technology November 5 2007 Problem and solution strategy We want to find an approximation
More informationMathematics for Engineers. Numerical mathematics
Mathematics for Engineers Numerical mathematics Integers Determine the largest representable integer with the intmax command. intmax ans = int32 2147483647 2147483647+1 ans = 2.1475e+09 Remark The set
More informationG : Quantum Mechanics II
G5.666: Quantum Mechanics II Notes for Lecture 5 I. REPRESENTING STATES IN THE FULL HILBERT SPACE Given a representation of the states that span the spin Hilbert space, we now need to consider the problem
More informationEnd-to-End Distribution Function of Two-Dimensional Stiff Polymers for all Persistence Lengths
End-to-End Distribution Function of Two-Dimensional Stiff Polymers for all Persistence Lengths B. Hamprecht 1, W. Janke and H. Kleinert 1 1 Institut für Theoretische Physik, Freie Universität Berlin, Arnimallee
More informationApplied Math for Engineers
Applied Math for Engineers Ming Zhong Lecture 15 March 28, 2018 Ming Zhong (JHU) AMS Spring 2018 1 / 28 Recap Table of Contents 1 Recap 2 Numerical ODEs: Single Step Methods 3 Multistep Methods 4 Method
More informationDifferential Equations
Differential Equations Definitions Finite Differences Taylor Series based Methods: Euler Method Runge-Kutta Methods Improved Euler, Midpoint methods Runge Kutta (2nd, 4th order) methods Predictor-Corrector
More informationPARTIAL DIFFERENTIAL EQUATIONS
MATHEMATICAL METHODS PARTIAL DIFFERENTIAL EQUATIONS I YEAR B.Tech By Mr. Y. Prabhaker Reddy Asst. Professor of Mathematics Guru Nanak Engineering College Ibrahimpatnam, Hyderabad. SYLLABUS OF MATHEMATICAL
More informationBlock-Structured Adaptive Mesh Refinement
Block-Structured Adaptive Mesh Refinement Lecture 2 Incompressible Navier-Stokes Equations Fractional Step Scheme 1-D AMR for classical PDE s hyperbolic elliptic parabolic Accuracy considerations Bell
More informationNumerical Optimal Control Part 2: Discretization techniques, structure exploitation, calculation of gradients
Numerical Optimal Control Part 2: Discretization techniques, structure exploitation, calculation of gradients SADCO Summer School and Workshop on Optimal and Model Predictive Control OMPC 2013, Bayreuth
More informationNumerical Methods I Orthogonal Polynomials
Numerical Methods I Orthogonal Polynomials Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 Course G63.2010.001 / G22.2420-001, Fall 2010 Nov. 4th and 11th, 2010 A. Donev (Courant Institute)
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY DEPARTMENT OF MECHANICAL ENGINEERING CAMBRIDGE, MASSACHUSETTS NUMERICAL FLUID MECHANICS FALL 2011
MASSACHUSETTS INSTITUTE OF TECHNOLOGY DEPARTMENT OF MECHANICAL ENGINEERING CAMBRIDGE, MASSACHUSETTS 02139 2.29 NUMERICAL FLUID MECHANICS FALL 2011 QUIZ 2 The goals of this quiz 2 are to: (i) ask some general
More informationNumerical solution of the Schrödinger equation on unbounded domains
Numerical solution of the Schrödinger equation on unbounded domains Maike Schulte Institute for Numerical and Applied Mathematics Westfälische Wilhelms-Universität Münster Cetraro, September 6 OUTLINE
More information2007 Summer College on Plasma Physics
856-57 2007 Summer College on Plasma Physics 30 July - 24 August, 2007 Numerical methods and simulations. Lecture 4: Solution of nonlinear systems of equations and nonlinear boundary value problems B.
More informationLecture V: The game-engine loop & Time Integration
Lecture V: The game-engine loop & Time Integration The Basic Game-Engine Loop Previous state: " #, %(#) ( #, )(#) Forces -(#) Integrate velocities and positions Resolve Interpenetrations Per-body change
More informationOrdinary differential equations - Initial value problems
Education has produced a vast population able to read but unable to distinguish what is worth reading. G.M. TREVELYAN Chapter 6 Ordinary differential equations - Initial value problems In this chapter
More information1 The Continuous Wavelet Transform The continuous wavelet transform (CWT) Discretisation of the CWT... 2
Contents 1 The Continuous Wavelet Transform 1 1.1 The continuous wavelet transform (CWT)............. 1 1. Discretisation of the CWT...................... Stationary wavelet transform or redundant wavelet
More informationLectures 9-10: Polynomial and piecewise polynomial interpolation
Lectures 9-1: Polynomial and piecewise polynomial interpolation Let f be a function, which is only known at the nodes x 1, x,, x n, ie, all we know about the function f are its values y j = f(x j ), j
More informationExamination paper for TMA4130 Matematikk 4N: SOLUTION
Department of Mathematical Sciences Examination paper for TMA4 Matematikk 4N: SOLUTION Academic contact during examination: Morten Nome Phone: 9 84 97 8 Examination date: December 7 Examination time (from
More information(0, 0), (1, ), (2, ), (3, ), (4, ), (5, ), (6, ).
1 Interpolation: The method of constructing new data points within the range of a finite set of known data points That is if (x i, y i ), i = 1, N are known, with y i the dependent variable and x i [x
More informationThe direct midpoint method as a quantum mechanical integrator II
The direct midpoint method as a quantum mechanical integrator II Ulrich Mutze A reversible integrator for the time-dependent Schrödinger equation associated with an arbitrary potentially time-dependent)
More informationMethod in 1D. Introduction of the Basic Concepts and Comparison to Optimal FD Operators
The Spectral Element Method in 1D Introduction of the Basic Concepts and Comparison to Optimal FD Operators Seismology and Seismics Seminar 17.06.2003 Ludwigs-Maximilians-Universität München by Bernhard
More informationChapter 9 Implicit Methods for Linear and Nonlinear Systems of ODEs
Chapter 9 Implicit Methods for Linear and Nonlinear Systems of ODEs In the previous chapter, we investigated stiffness in ODEs. Recall that an ODE is stiff if it exhibits behavior on widelyvarying timescales.
More informationDeutscher Wetterdienst
Stability Analysis of the Runge-Kutta Time Integration Schemes for the Convection resolving Model COSMO-DE (LMK) COSMO User Seminar, Langen 03.+04. March 2008 Michael Baldauf Deutscher Wetterdienst, Offenbach,
More informationLecture Note 3: Interpolation and Polynomial Approximation. Xiaoqun Zhang Shanghai Jiao Tong University
Lecture Note 3: Interpolation and Polynomial Approximation Xiaoqun Zhang Shanghai Jiao Tong University Last updated: October 10, 2015 2 Contents 1.1 Introduction................................ 3 1.1.1
More informationScientific Computing II
Scientific Computing II Molecular Dynamics Numerics Michael Bader SCCS Technical University of Munich Summer 018 Recall: Molecular Dynamics System of ODEs resulting force acting on a molecule: F i = j
More informationPowerPoints organized by Dr. Michael R. Gustafson II, Duke University
Part 5 Chapter 21 Numerical Differentiation PowerPoints organized by Dr. Michael R. Gustafson II, Duke University 1 All images copyright The McGraw-Hill Companies, Inc. Permission required for reproduction
More informationFast Algorithms for the Computation of Oscillatory Integrals
Fast Algorithms for the Computation of Oscillatory Integrals Emmanuel Candès California Institute of Technology EPSRC Symposium Capstone Conference Warwick Mathematics Institute, July 2009 Collaborators
More informationReview Higher Order methods Multistep methods Summary HIGHER ORDER METHODS. P.V. Johnson. School of Mathematics. Semester
HIGHER ORDER METHODS School of Mathematics Semester 1 2008 OUTLINE 1 REVIEW 2 HIGHER ORDER METHODS 3 MULTISTEP METHODS 4 SUMMARY OUTLINE 1 REVIEW 2 HIGHER ORDER METHODS 3 MULTISTEP METHODS 4 SUMMARY OUTLINE
More informationRome - May 12th Université Paris-Diderot - Laboratoire Jacques-Louis Lions. Mean field games equations with quadratic
Université Paris-Diderot - Laboratoire Jacques-Louis Lions Rome - May 12th 2011 Hamiltonian MFG Hamiltonian on the domain [0, T ] Ω, Ω standing for (0, 1) d : (HJB) (K) t u + σ2 2 u + 1 2 u 2 = f (x, m)
More informationPowerPoints organized by Dr. Michael R. Gustafson II, Duke University
Part 6 Chapter 20 Initial-Value Problems PowerPoints organized by Dr. Michael R. Gustafson II, Duke University All images copyright The McGraw-Hill Companies, Inc. Permission required for reproduction
More information11. Recursion Method: Concepts
University of Rhode Island DigitalCommons@URI Nonequilibrium Statistical Physics Physics Course Materials 16 11. Recursion Method: Concepts Gerhard Müller University of Rhode Island, gmuller@uri.edu Creative
More informationGradient Descent and Implementation Solving the Euler-Lagrange Equations in Practice
1 Lecture Notes, HCI, 4.1.211 Chapter 2 Gradient Descent and Implementation Solving the Euler-Lagrange Equations in Practice Bastian Goldlücke Computer Vision Group Technical University of Munich 2 Bastian
More informationMITOCW watch?v=rwzg8ieoc8s
MITOCW watch?v=rwzg8ieoc8s PROFESSOR: ih bar d psi dt equal E psi where E hat is equal to p squared over 2m, the operator. That is the Schrodinger equation. The free particle Schrodinger equation-- you
More informationAdditional exercises with Numerieke Analyse
Additional exercises with Numerieke Analyse March 10, 017 1. (a) Given different points x 0, x 1, x [a, b] and scalars y 0, y 1, y, z 1, show that there exists at most one polynomial p P 3 with p(x i )
More informationMathematics Qualifying Exam Study Material
Mathematics Qualifying Exam Study Material The candidate is expected to have a thorough understanding of engineering mathematics topics. These topics are listed below for clarification. Not all instructors
More informationFinite Difference and Finite Element Methods
Finite Difference and Finite Element Methods Georgy Gimel farb COMPSCI 369 Computational Science 1 / 39 1 Finite Differences Difference Equations 3 Finite Difference Methods: Euler FDMs 4 Finite Element
More informationSelf-Concordant Barrier Functions for Convex Optimization
Appendix F Self-Concordant Barrier Functions for Convex Optimization F.1 Introduction In this Appendix we present a framework for developing polynomial-time algorithms for the solution of convex optimization
More informationPreface. 2 Linear Equations and Eigenvalue Problem 22
Contents Preface xv 1 Errors in Computation 1 1.1 Introduction 1 1.2 Floating Point Representation of Number 1 1.3 Binary Numbers 2 1.3.1 Binary number representation in computer 3 1.4 Significant Digits
More informationAssignment 6, Math 575A
Assignment 6, Math 575A Part I Matlab Section: MATLAB has special functions to deal with polynomials. Using these commands is usually recommended, since they make the code easier to write and understand
More informationOn The Power Of Coherently Controlled Quantum Adiabatic Evolutions
On The Power Of Coherently Controlled Quantum Adiabatic Evolutions Maria Kieferova (RCQI, Slovak Academy of Sciences, Bratislava, Slovakia) Nathan Wiebe (QuArC, Microsoft Research, Redmond, WA, USA) [arxiv:1403.6545]
More informationCorrelation dynamics after short-pulse photoassociation
Correlation dynamics after short-pulse photoassociation Christiane P. Koch 1, and Ronnie Kosloff 2 1 Institut für Theoretische Physik, Freie Universität Berlin, Arnimallee 14, 14195 Berlin, Germany 2 Institute
More informationNUMERICAL METHODS FOR ENGINEERING APPLICATION
NUMERICAL METHODS FOR ENGINEERING APPLICATION Second Edition JOEL H. FERZIGER A Wiley-Interscience Publication JOHN WILEY & SONS, INC. New York / Chichester / Weinheim / Brisbane / Singapore / Toronto
More informationTutorials to Quantum Mechanics II, SS Problem Sheet 5 - Solutions
Lehrstuhl für Kosmologie, Professor Dr. V. Mukhanov Tutorials to Quantum Mechanics II, SS 29 Problem Sheet 5 - Solutions Exercise 31 1. Calculate ˆq ˆp 2ˆq ˆp ˆq 2 ˆp. 2. Write the Hamiltonian Ĥ ˆq ˆp2
More informationExam in TMA4215 December 7th 2012
Norwegian University of Science and Technology Department of Mathematical Sciences Page of 9 Contact during the exam: Elena Celledoni, tlf. 7359354, cell phone 48238584 Exam in TMA425 December 7th 22 Allowed
More informationA High Order Conservative Semi-Lagrangian Discontinuous Galerkin Method for Two-Dimensional Transport Simulations
Motivation Numerical methods Numerical tests Conclusions A High Order Conservative Semi-Lagrangian Discontinuous Galerkin Method for Two-Dimensional Transport Simulations Xiaofeng Cai Department of Mathematics
More informationLecture IV: Time Discretization
Lecture IV: Time Discretization Motivation Kinematics: continuous motion in continuous time Computer simulation: Discrete time steps t Discrete Space (mesh particles) Updating Position Force induces acceleration.
More informationUniversity of Houston, Department of Mathematics Numerical Analysis, Fall 2005
4 Interpolation 4.1 Polynomial interpolation Problem: LetP n (I), n ln, I := [a,b] lr, be the linear space of polynomials of degree n on I, P n (I) := { p n : I lr p n (x) = n i=0 a i x i, a i lr, 0 i
More informationQuantum Mechanics I Physics 5701
Quantum Mechanics I Physics 5701 Z. E. Meziani 02/23//2017 Physics 5701 Lecture Outline 1 General Formulation of Quantum Mechanics 2 Measurement of physical quantities and observables 3 Representations
More informationNUMERICAL SOLUTION OF DELAY DIFFERENTIAL EQUATIONS VIA HAAR WAVELETS
TWMS J Pure Appl Math V5, N2, 24, pp22-228 NUMERICAL SOLUTION OF DELAY DIFFERENTIAL EQUATIONS VIA HAAR WAVELETS S ASADI, AH BORZABADI Abstract In this paper, Haar wavelet benefits are applied to the delay
More informationBessel Functions and Their Application to the Eigenvalues of the Laplace Operator
Bessel Functions and Their Application to the Eigenvalues of the Laplace Operator Matthew Jin June 1, 2014 1 Introduction Bessel functions of the first kind, J n, are the solutions of Bessel s differential
More informationNumerical Algorithms for ODEs/DAEs (Transient Analysis)
Numerical Algorithms for ODEs/DAEs (Transient Analysis) Slide 1 Solving Differential Equation Systems d q ( x(t)) + f (x(t)) + b(t) = 0 dt DAEs: many types of solutions useful DC steady state: state no
More informationApplied Numerical Analysis (AE2220-I) R. Klees and R.P. Dwight
Applied Numerical Analysis (AE0-I) R. Klees and R.P. Dwight February 018 Contents 1 Preliminaries: Motivation, Computer arithmetic, Taylor series 1 1.1 Numerical Analysis Motivation..........................
More informationENO and WENO schemes. Further topics and time Integration
ENO and WENO schemes. Further topics and time Integration Tefa Kaisara CASA Seminar 29 November, 2006 Outline 1 Short review ENO/WENO 2 Further topics Subcell resolution Other building blocks 3 Time Integration
More informationA note on adiabatic theorem for Markov chains
Yevgeniy Kovchegov Abstract We state and prove a version of an adiabatic theorem for Markov chains using well known facts about mixing times. We extend the result to the case of continuous time Markov
More informationCHAPTER 4. Interpolation
CHAPTER 4 Interpolation 4.1. Introduction We will cover sections 4.1 through 4.12 in the book. Read section 4.1 in the book on your own. The basic problem of one-dimensional interpolation is this: Given
More informationMath 411 Preliminaries
Math 411 Preliminaries Provide a list of preliminary vocabulary and concepts Preliminary Basic Netwon's method, Taylor series expansion (for single and multiple variables), Eigenvalue, Eigenvector, Vector
More informationEnd-to-end distribution function of two-dimensional stiff polymers for all persistence lengths
Physics Letters A 33 (24 254 259 www.elsevier.com/locate/pla End-to-end distribution function of two-dimensional stiff polymers for all persistence lengths B. Hamprecht a,w.janke b, H. Kleinert a, a Institut
More information(f(x) P 3 (x)) dx. (a) The Lagrange formula for the error is given by
1. QUESTION (a) Given a nth degree Taylor polynomial P n (x) of a function f(x), expanded about x = x 0, write down the Lagrange formula for the truncation error, carefully defining all its elements. How
More informationIntroduction to MCTDH
Introduction to MCTDH Hans-Dieter Meyer Theoretische Chemie Universität Heidelberg 2nd HDQD workshop, Montpellier, February 2008 1 Historical Overview The Beginning 2 MCTDH 3 Potential representations
More informationDAMOCO: MATLAB toolbox for multivariate data analysis, based on coupled oscillators approach Version 1.0
DAMOCO: MATLAB toolbox for multivariate data analysis, based on coupled oscillators approach Version 1.0 Björn Kralemann 1, Michael Rosenblum 2, Arkady Pikovsky 2 1 Institut für Pädagogik, Christian-Albrechts-Universität
More informationPath Integral for Spin
Path Integral for Spin Altland-Simons have a good discussion in 3.3 Applications of the Feynman Path Integral to the quantization of spin, which is defined by the commutation relations [Ŝj, Ŝk = iɛ jk
More information1 Mathematical preliminaries
1 Mathematical preliminaries The mathematical language of quantum mechanics is that of vector spaces and linear algebra. In this preliminary section, we will collect the various definitions and mathematical
More informationNumerical methods for the Navier- Stokes equations
Numerical methods for the Navier- Stokes equations Hans Petter Langtangen 1,2 1 Center for Biomedical Computing, Simula Research Laboratory 2 Department of Informatics, University of Oslo Dec 6, 2012 Note:
More informationTheoretical Photochemistry WiSe 2016/17
Theoretical Photochemistry WiSe 2016/17 Lecture 8 Irene Burghardt burghardt@chemie.uni-frankfurt.de) http://www.theochem.uni-frankfurt.de/teaching/ Theoretical Photochemistry 1 Topics 1. Photophysical
More informationDo not turn over until you are told to do so by the Invigilator.
UNIVERSITY OF EAST ANGLIA School of Mathematics Main Series UG Examination 216 17 INTRODUCTION TO NUMERICAL ANALYSIS MTHE612B Time allowed: 3 Hours Attempt QUESTIONS 1 and 2, and THREE other questions.
More information