Optimization NLFFF Model J.McTiernan SSL/UCB HMI/SDO 27-Jan-2005.

Slides:



Advertisements
Similar presentations
5.4 Curve Sketching. Slide Copyright © 2008 Pearson Education, Inc. Publishing as Pearson Addison- Wesley Example 1: Graph the function f given.
Advertisements

Understanding optimum solution
H EURISTIC S OLVER  Builds and tests alternative fuel treatment schedules (solutions) at each iteration  In each iteration:  Evaluates the effects of.
Optimization : The min and max of a function
CSCI 347 / CS 4206: Data Mining Module 07: Implementations Topic 03: Linear Models.
Planning under Uncertainty
Adnan Khan Lahore University of Management Sciences Peter Kramer Rensselaer Polytechnic Institute.
ECIV 201 Computational Methods for Civil Engineers Richard P. Ray, Ph.D., P.E. Error Analysis.
Comparison of NLFFF Extrapolations for Chromospheric and Photospheric Magnetograms of AR J. McTiernan SSL/UCB SHINE 2005 Workhsop.
Reducing the Divergence of Optimization-Generated Magnetic Fields J.M. McTiernan, B.T. Welsch, G.H. Fisher, D.J. Bercik, W.P. Abbett Space Sciences Lab.
Non-linear FFF Model J.McTiernan 17-May Optimization method (cont): Iterative process, start with Potential field, extrapolated from magnetogram.
Non-linear FFF Model: AR8210 J.McTiernan 1-Mar-2004.
NLFFF Solar and Model Results J.McTiernan NLFFF workshop 5-jun-2006.
NLFFF Solar and Model Results J.McTiernan NLFFF workshop 5-jun-2006.
Network Goodness and its Relation to Probability PDP Class Winter, 2010 January 13, 2010.
Nonlinear Force Free Field Extrapolation for AR J.McTiernan 7-Nov-2005.
Nonlinear Force Free Field Models for AR J.McTiernan, H.Hudson (SSL/UCB) T.Metcalf (LMSAL)
Optimization Methods One-Dimensional Unconstrained Optimization
NLFFF Extrapolation for AR J.McTiernan. *Chromospheric* Vector Magnetogram of AR (from Tom Metcalf) 18:46 UT Image is of Line of sight B (B.
Tests of NLFFF Models of AR J.McTiernan SSL/UCB.
NLFFF Energy Measurement of AR8210 J.McTiernan SSL/UCB.
Games & Adversarial Search Chapter 6 Section 1 – 4.
Summary of UCB MURI workshop on vector magnetograms Have picked 2 observed events for targeted study and modeling: AR8210 (May 1, 1998), and AR8038 (May.
Optimization Methods One-Dimensional Unconstrained Optimization
On the convergence of SDDP and related algorithms Speaker: Ziming Guan Supervisor: A. B. Philpott Sponsor: Fonterra New Zealand.
Introduction to Optimization (Part 1)
1-1 Introduction to Optimization and Linear Programming Chapter 1.
Chapter 4 Systems of Linear Equations; Matrices
The Marriage Problem Finding an Optimal Stopping Procedure.
1.2 Gaussian Elimination.
Introduction and Analysis of Error Pertemuan 1
Section 1.2 Linear Equations and Rational Equations
Information Representation (Level ISA3) Floating point numbers.
Multiple Integrals 12. Double Integrals over General Regions 12.3.
Copyright © Cengage Learning. All rights reserved Double Integrals over General Regions.
Section 2: Finite Element Analysis Theory
Numerical Methods Applications of Loops: The power of MATLAB Mathematics + Coding 1.
Scientific Computing Partial Differential Equations Poisson Equation.
Optimization_fff as a Data Product J.McTiernan HMI/AIA Meeting 16-Feb-2006.
Physics Chapter 3 - Acceleration What Does Acceleration Mean? Cars on the starting grid for a race are stopped or stationary (Their speed = 0 m/s). When.
Polynomials and other functions. Graphing Polynomials Can you find the end behavior? Can you identify the zeros, roots, x-intercepts, or solutions? Can.
8.5 Exponential Growth and 8.6 Exponential Decay FUNctions
Chapter 1 Section 1. Examples: 2 x 2 system 2 x 3 system 3 x 2 system.
CS101 Computer Programming I Chapter 4 Extra Examples.
LP Narrowing: A New Strategy for Finding All Solutions of Nonlinear Equations Kiyotaka Yamamura Naoya Tamura Koki Suda Chuo University, Tokyo, Japan.
1 1 Slide © 2005 Thomson/South-Western Linear Programming: The Simplex Method n An Overview of the Simplex Method n Standard Form n Tableau Form n Setting.
1 OUTPUT ANALYSIS FOR SIMULATIONS. 2 Introduction Analysis of One System Terminating vs. Steady-State Simulations Analysis of Terminating Simulations.
Date: 2.4 Real Zeros of Polynomial Functions
1 Introduction to Statistics − Day 4 Glen Cowan Lecture 1 Probability Random variables, probability densities, etc. Lecture 2 Brief catalogue of probability.
An Introduction to Simulated Annealing Kevin Cannons November 24, 2005.
LECTURE 17 THE PARTICLE IN A BOX PHYSICS 420 SPRING 2006 Dennis Papadopoulos.
CARIOCA Dead-time & inefficiency - UPDATE M2 station has been reanalysed from the Davide measurements at 20 MHz BC of counting rates on the bi-gap physical.
G. Cowan Lectures on Statistical Data Analysis Lecture 9 page 1 Statistical Data Analysis: Lecture 9 1Probability, Bayes’ theorem 2Random variables and.
Vishnu Kotrajaras, PhD.1 Data Structures
Correlation Assumptions: You can plot a scatter graph You know what positive, negative and no correlation look like on a scatter graph.
Operations Research By: Saeed Yaghoubi 1 Graphical Analysis 2.
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
Chapter 12 Graphs and the Derivative Abbas Masum.
Extrapolating Coronal Magnetic Fields T. Metcalf.
Chapter 4 Systems of Linear Equations; Matrices
Chapter 4 Systems of Linear Equations; Matrices
NLFFF Energy Measurement of AR8210
Scalable Load-Distance Balancing
Programming assignment #1. Solutions and Discussion
Real Neurons Cell structures Cell body Dendrites Axon
optimal basis will not change
5.4 Curve Sketching.
Slides for Sampling from Posterior of Shape
optimal basis will not change
Games & Adversarial Search
Presentation transcript:

Optimization NLFFF Model J.McTiernan SSL/UCB HMI/SDO 27-Jan-2005

Optimization method (cont): The first step is to set up the initial conditions. The method requires that the B field on all boundaries be unchanged. For the test case of the Low-Lou field, the B field on all boundaries is known. For real data, only the lower boundary is known; the bottom boundary is the magnetogram, the upper and side boundaries are the initial field. The initial field can be a potential field or a linear force-free field that is extrapolated from the magnetogram. In the test case with all known boundaries, this results initially in discontinuities at the outer boundaries. These smooth out during iterations.

Optimization method (cont): Iterative process, starts with initial B field. Calculate F, set new B = B + F*dt (typical dt =1.0e-5) “Objective function”, L, is guaranteed to decrease, because dL/dt is guaranteed to be negative since dB/dt is proportional to F. The change in L becomes smaller as the number of iterations increases, L asymptotically approaches zero, but never quite gets there. Keep iterating until L stops decreasing, or until some preset iteration limit (currently set to ).

Optimization method (cont): For the test case, the quantity F, that drives the minimization, is non zero only on the boundaries. Differences between the calculated and initial field propagate into the volume as we iterate. For the case with only the lower boundary, F is only non-zero at the lower boundary, the difference between the calculated and initial fields propagates upwards from the lower boundary. The final extrapolation is dependent on the boundary conditions. If only the lower boundary condition is specified the solution also depends on the initial field.

Tests of NLFFF model: 4 different tests, based on the Low-Lou model discussed in previous presentation: 1 st test, 64x64x64 cube, all boundary fields are specified by LL model. On 2.4 GHz Linux machine, this took 4300 minutes, (max) iterations, and L was still noticeably decreasing at the end of the calculation. (Note that the code is written in IDL. Run time scales with the total number of grid points, e.g., a 32x32x32 cube will take 1/8 th the time.) A typical value for real data, for a 64x64x64 cube, is 200 minutes. This is because real data has noise.

Tests of NLFFF model: 2 nd Test, added random noise to the initial field; the maximum noise level on the lower boundary was set to be 2% of the max total field strength on that boundary, approximately 6 Gauss. (How realistic is this?) This “converged”-- the objective function, L, stopped decreasing after about 4140 iterations, or about 370 minutes. If the noise level is doubled, the iterations stop after 211 minutes.

Tests of NLFFF model: 3 rd Test, ignored the outer boundaries of the LL field, and set the outer boundaries to the initial potential field. This is still running, (as of 26-Jan pm) after iterations, and about 1790 minutes… 4 th test, same as 3 rd test, but with noise added to lower boundary as in 2 nd test. Converged after 8600 iterations and 500 minutes. (For some reason, the tests with only the lower BC’s are about 60% faster, per iteration, about 3 sec per iteration, instead of 5 sec per iteration for the tests with all BC’s specified.)

Tests of NLFFF model: We can conclude that noise matters, and the level of noise will restrict the eventual use of the field extrapolation, in the sense that the field will not converge to as force-free a state. Also the field lines can be different. This could be an issue when interpreting model results. Future work will include more realistic noise estimates and Monte Carlo tests for simulated and real magnetogram data, spherical coordinates version is being debugged, will have to redo in Fortran…