Formal solvers of the RT equation

Similar documents
Appendix B. The Finite Difference Scheme

Numerical Solution of Ordinary Differential Equations

Numerical Heat and Mass Transfer

Lecture 12: Discrete Laplacian

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

NUMERICAL DIFFERENTIATION

Lecture 21: Numerical methods for pricing American type derivatives

PHYS 705: Classical Mechanics. Calculus of Variations II

ME 501A Seminar in Engineering Analysis Page 1

Chapter 12. Ordinary Differential Equation Boundary Value (BV) Problems

Chapter 4: Root Finding

Review of Taylor Series. Read Section 1.2

Lecture 13 APPROXIMATION OF SECOMD ORDER DERIVATIVES

Difference Equations

NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS

Lecture 10 Support Vector Machines II

Inductance Calculation for Conductors of Arbitrary Shape

Causal Diamonds. M. Aghili, L. Bombelli, B. Pilgrim

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system

Implicit Integration Henyey Method

AERODYNAMICS I LECTURE 6 AERODYNAMICS OF A WING FUNDAMENTALS OF THE LIFTING-LINE THEORY

A new Approach for Solving Linear Ordinary Differential Equations

Bezier curves. Michael S. Floater. August 25, These notes provide an introduction to Bezier curves. i=0

ALGORITHM FOR THE CALCULATION OF THE TWO VARIABLES CUBIC SPLINE FUNCTION

( ) [ ( k) ( k) ( x) ( ) ( ) ( ) [ ] ξ [ ] [ ] [ ] ( )( ) i ( ) ( )( ) 2! ( ) = ( ) 3 Interpolation. Polynomial Approximation.

Workshop: Approximating energies and wave functions Quantum aspects of physical chemistry

Thermal-Fluids I. Chapter 18 Transient heat conduction. Dr. Primal Fernando Ph: (850)

Module 1 : The equation of continuity. Lecture 1: Equation of Continuity

Topic 5: Non-Linear Regression

Kernel Methods and SVMs Extension

EEE 241: Linear Systems

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Nice plotting of proteins II

Finite Element Modelling of truss/cable structures

DUE: WEDS FEB 21ST 2018

Modeling curves. Graphs: y = ax+b, y = sin(x) Implicit ax + by + c = 0, x 2 +y 2 =r 2 Parametric:

Vector Norms. Chapter 7 Iterative Techniques in Matrix Algebra. Cauchy-Bunyakovsky-Schwarz Inequality for Sums. Distances. Convergence.

Introduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:

Report on Image warping

ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Lecture Note 3. Eshelby s Inclusion II

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2

Consistency & Convergence

Solution of Linear System of Equations and Matrix Inversion Gauss Seidel Iteration Method

Open string operator quantization

2 Finite difference basics

Section 8.3 Polar Form of Complex Numbers

Linear Approximation with Regularization and Moving Least Squares

CHAPTER 14 GENERAL PERTURBATION THEORY

Linear Feature Engineering 11

Frequency dependence of the permittivity

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction

Supplementary Notes for Chapter 9 Mixture Thermodynamics

Tensor Analysis. For orthogonal curvilinear coordinates, ˆ ˆ (98) Expanding the derivative, we have, ˆ. h q. . h q h q

MMA and GCMMA two methods for nonlinear optimization

Lecture 5.8 Flux Vector Splitting

Discretization. Consistency. Exact Solution Convergence x, t --> 0. Figure 5.1: Relation between consistency, stability, and convergence.

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity

Normally, in one phase reservoir simulation we would deal with one of the following fluid systems:

Generalized Linear Methods

Additional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty

G4023 Mid-Term Exam #1 Solutions

Errors for Linear Systems

PART 8. Partial Differential Equations PDEs

princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg

Rate of Absorption and Stimulated Emission

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

For now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.

A Hybrid Variational Iteration Method for Blasius Equation

PHYS 705: Classical Mechanics. Newtonian Mechanics

Exercise Solutions to Real Analysis

Physics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1

8.6 The Complex Number System

Lecture 2: Numerical Methods for Differentiations and Integrations

Some modelling aspects for the Matlab implementation of MMA

Chapter 3 Differentiation and Integration

One-sided finite-difference approximations suitable for use with Richardson extrapolation

Research Article Green s Theorem for Sign Data

2.29 Numerical Fluid Mechanics Fall 2011 Lecture 12

4DVAR, according to the name, is a four-dimensional variational method.

Modelli Clamfim Equazioni differenziali 7 ottobre 2013

Expected Value and Variance

1 Matrix representations of canonical matrices

Structure and Drive Paul A. Jensen Copyright July 20, 2003

Solutions to Problem Set 6

6.3.4 Modified Euler s method of integration

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

Week 9 Chapter 10 Section 1-5

2.29 Numerical Fluid Mechanics

CHAPTER 6. LAGRANGE S EQUATIONS (Analytical Mechanics)

Lab session: numerical simulations of sponateous polarization

The Quadratic Trigonometric Bézier Curve with Single Shape Parameter

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 13

Open Systems: Chemical Potential and Partial Molar Quantities Chemical Potential

1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations

8 Derivation of Network Rate Equations from Single- Cell Conductance Equations

Finite Wings Steady, incompressible flow

Computational Electromagnetics in Antenna Analysis and Design

Bernoulli Numbers and Polynomials

Transcription:

Formal solvers of the RT equaton

Formal RT solvers Runge- Kutta (reference solver) Pskunov N.: 979, Master Thess Long characterstcs (Feautrer scheme) Cannon C.J.: 970, ApJ 6, 55 Short characterstcs (Hermtan scheme) Bellot Rubo et al.: 998, ApJ 506, 805 Short characterstcs (Bezer attenuaton operator) de la Cruz Rodríguez & Pskunov: o3, ApJ 764, 33

Why we need a formal solver? What s a formal solver? We assume that we know the source functon and the opactes along our ray. Ths s suffcent to compute the ntenstes (as functon of wavelength). In practce, local opactes and source functon may also depend on the ntenstes comng from dfferent drectons. Ths wll requre teratons. In the next lecture we wll talk about how to get to self- consstency.

Solvng RT wth RK Smple mnded approach: dy = f( x) y+ g( x); y( x ) = y k = f( x ) y + g( x ) 0 0 h hk h k = f x + y g x + + + h hk h k3 = f x + y + + g x + ( ) ( ) ( ) k = f x + h y + hk + g x + h 4 3 h y = y + k + k + k + k 6 ( ) + 3 4

More clever RK. Prevous example suffers from all problems nherent to RK, specally when dealng wth complex medum where f and g have sharp varatons. Instead one can solve RT analytcally: τ ʹ ʹ Δτ ( t) I ( ) I ( ) e τʹ ʹ B ( t) e τʹ ʹ = τʹ + dt τ ʹ In partcular, ths s useful for a half- nfnte medum where we can easly use Gauss quadratures for the ntegral: I (0) B ( t) e t dt ω B ( τ ), 0 = N = =

The nodes and weghts for Laguerre polynomals: Nodes 0.37793470540 3.08445765E-0 0.79454549503 4.099955E-0.8083490740.8068876E-0 3.40433697855 6.0874560987E-0 5.5549640064 9.50569758E-03 8.3305746764 7.53008388588E-04.843785837900.859334960E-05 6.795783378 4.493398496E-07 Weghts The only problem s that values of T are not known n τ,ι We can fnd them solvng ODE for optcal depth: =, x = 0 dτ k ( x) ( x) τ 0 ρ = Advantages: smple boundary condton, RHS does not depend on unknown functon and RHS s always non- negatve.

4th order Runge-Kutta for the geometrcal depth = ; x0 = 0 dτ α ( x) k k = ; k = ( x ) α x hk α = ; k = ( + ) 3 4 α 3 ( x + hk ) α ( x + hk ) h x = x + k + k + k + k 6 ( ) + 3 4 We ntegrate the equaton for x from 0 to each of the τ, consecutvely. For each x we fnd the temperature and then ntensty usng Gauss quadratures.

Requrements for a formal solver RK s good to study the propertes of your envronment, selectng the grd etc. For practcal applcatons the solver must be quck and stable. It should be able to acheve good accuracy on the prescrbed grd. The formal solver should not propagate/amplfy errors whch may be deadly of we need teratons. These requrements force us to use fnte dfferences schemes.

Method classfca6on RT s solved along rays or characterstcs that do not necessarly concde wth the selected grd. Indvdual ray can be followed through the whole medum boundary- to- boundary or over a short part extendng the length of one grd cell. RT solvers based on complete rays are known as long characterstcs methods. RT solvers that follow radaton through a sngle grd cell at a tme are called short characterstcs methods. In D there s obvously no dfference between short and long characterstc methods

Method classfcaton Long characterstcs Short characterstcs

Comparson of long versus short Long: Use both boundary condtons Get ntenstes n both drectons Mean of the two ntenstes s actually a component of J Expansve n D or 3D f the geometrcal grd does match the ray drectons Short: Fast Follow the geometrcal grd no matter what Need two- drectonal ntegraton to evaluate J Suffers from numercal lght defocussng

Lght defocussng

Feautrer RT solver Equaton of radatve transfer (agan) di = ( I S ) α where x s a geometrcal dstance along the ray Let s splt the ntensty n two flows: I + n the drecton of ncreasng x and I - n the opposte drecton. The RT equaton can be wrtten for each drecton: + di + = α ( I S) di = α ( I S)

We defne two new varables U=½(I + + I - ) and V=½(I + - I - ). Now we can add/subtract the two equatons of RT and dvde the results by : di + di + du + = α ( I S ) = α ( I S ) = α V di di + dv + = α ( I S ) = α ( I S ) = α ( U S )

nd order form of RT We substtute the dervatve of V n the nd equaton usng the expresson for V from the st equaton: V = ( ) α du dv = α ( U S ) The equatons for U and V can be combned nto a sngle nd order ODE: d du α α = ( ) ( U S )

Boundary Condtons Boundary condtons are set n the two ends of the medum. For the smallest x we can wrte: du ( ) α + A = V = ( I I ) = For the opposte end we have: du = ( I + I ) I = U I ( ) B + + A+ α + = V = ( I I ) = = ( I + I ) + I = U + I + B

Fnte dfferences equaton have famlar form (note the sgn n the defntons of a and c ): au + bu cu = d for =, K, N a c + ( α ) + ( α ) = x x x x,, + ( α ) + ( α ) = x x x x, +, + + b = a + c + α d, = α S,,

For = we can wrte a lnear boundary condton: b U U + U ( τ τ ) du = U + = dτ ( τ τ) ( A = U + U I ) ( τ τ) ( α + α) x x c ( α + α) U + ( x x) U = ( α + α) ( ) = x x I A d

or we can wrte quadratc boundary condton: U+ U du δτ d U U δτ U = + + +... dτ τ dτ τ b ( α + α) ( x x) δτ U U + δτ ( U I ) + δτ ( U S ) A c + δτ + δτ U = A = δτ I + δτ S The case of =N s smlar d

For sem- nfnte medum boundary condton at looks a bt dfferent: du + = U I dτ du d S = + ds = + St () = S( τ) + ( t τ) dτ dt t= τ cn = δτ Ths s known as dffuson b boundary condton N = + δτ ( S, N S, N) dn = ( S, N + S, N) + δτ + ( t ) I τ S () t e dt U S τ τ + ds dτ dτ I S deep

How does ths work? Select drecton. Setup a D grd and compute opactes, sources functon and optcal steps. Compute the Feautrer coeffcents ncludng those gven by the boundary condtons. Solve 3- dagonal SLE As free lunch you get the contrbuton of ths ray to the angle- averaged ntensty J whch s U and to the flux dvergence whch s V.

Hermtan method Taylor expanson for the ntensty n pont τ : 4 n n δ d I I+ = I + n n! dτ I I n= di d I d I d I δ δ δ dτ dτ dτ 6 dτ ( δ ) d I d I d I dτ dτ dτ 3 4 ' 3 = + + + 3 4 3 4 " = + δ + δ 3 4 δ ( ) ' ' ( " " ) + + + ' I = α I S ( ) ( ) ( ) " ' ' I = α α I S S + α I S + δ δ I = I + I + I + I I I = q I + p

Attenuaton operator solver Soluton of RT over one grd cell can be wrtten: ( τ+ τ) I ( τ ) = e I ( τ ) + + τ+ + τ ( τ+ t) S () t e dt where τ s the optcal path along the ray Suppose S slowly changes wth τ whch can be approxmated by a lnear functon. Then we can take the ntegral analytcally! ( ) ( τ τ ) ( ) + S() τ = S ( ), + S ( ), + τ+ τ τ+ τ + ( τ+ ) = ( τ) + η, I I e τ τ τ τ

Source Func6on Approxma6on Quadratc approxmaton for the source functon s better than lnear, but Bezer splnes are a much more robust alternatve February, 05 3D Radatve Transport

How does ths work? Short characterstcs result n recurrence relaton between I and I + Select drecton For startng grd ponts ncomng ntensty s gven by boundary condtons Compute the opacty and the source functon n the grd ponts and nterpolate for the up- stream and down- stream ponts (for quadratc schemes). Compute ntenstes for all ponts n the next layer.

Comparson of the solvers

Home work 4 Compute spectral synthess usng a method of your choce for a statc D model atmosphere of the Sun. For a fxed geometrcal depth grd and wavelength grd you are gven a D array of opactes and D array of source functon. The boundary condtons: no radaton enters through the surface and the flux spectrum at the deepest atmosphere pont s gven.