OPEN ISSUES IN TRANSPORTATION AND PROPAGATION IN FIELD J. - - PowerPoint PPT Presentation

open issues in transportation and propagation in field
SMART_READER_LITE
LIVE PREVIEW

OPEN ISSUES IN TRANSPORTATION AND PROPAGATION IN FIELD J. - - PowerPoint PPT Presentation

OPEN ISSUES IN TRANSPORTATION AND PROPAGATION IN FIELD J. Apostolakis NORMALS Optical processes depend on the exit normal Problem in presence of coincident surfaces A partial fix created in October 2014 (included in 10.1) Some


slide-1
SLIDE 1

OPEN ISSUES IN TRANSPORTATION AND PROPAGATION IN FIELD

  • J. Apostolakis
slide-2
SLIDE 2

NORMALS

  • Optical processes depend on the exit normal
  • Problem in presence of coincident surfaces
  • A partial fix created in October 2014 (included

in 10.1)

  • Some cases still give the wrong answer.
slide-3
SLIDE 3

STEPPER ISSUES & DEVEL.

  • There are robustness issues with G4NystromRK4 - even tough

ATLAS’ version works

  • New steppers (short presentation in Field Working Session 5C)
  • Templated steppers - efficiency (GSoC 2014)
  • High order steppers (Somnath Banerjee, GSoC 2015)
  • New Nystrom steppers (Jason Suagee, GSoC 2015)
slide-4
SLIDE 4

BIGGEST PROBLEM IN FIELD

  • ATLAS - Particles think they are in poly-cone too

long

  • Seen in G4 9.6 and 10.1
  • ALICE - Crashes with negative step size
  • Both linked to Multi Level Locator
slide-5
SLIDE 5

SYMPTOMS

  • ATLAS: Propagation in Field becomes confused: Track

continued inside Polycone, much beyond its extent

  • First fix: Navigator uses Solid’s response in

DistanceToOut(p,v) to identify when track has already left the ‘mother volume’

  • This improved the behaviour in ATLAS - however the

problem persists in 10.1-patch02

slide-6
SLIDE 6

CHALLENGE

  • G4V Intersection Locator role is to

confirm and refine a candidate intersection point.

  • Three implementations - challenges
  • “Simple” Locator - ‘linear’
  • Multi-Level Locator - adds ‘bi-section’
  • Brent Locator - adds quadratic conv.

Candidate

slide-7
SLIDE 7

BASE ALGORITHM

  • “Simple” Locator
  • Estimate nearest point on curve
  • Check both segments
  • Weaknesses:
  • linear convergence (slow)
  • can fail to converge in 1,000 steps
  • not really simple …

Candidate S1 S2 S3 S4

slide-8
SLIDE 8

REFINED ALGORITHM

  • Multi-Level Locator
  • Check if linear algorithm is not making

good progress

  • If not, break remainder into two

sections - ‘stacking’ the second

  • Logic is very complex

S3 S4

slide-9
SLIDE 9

A DIFFICULT CASE

  • The algorithm must cope with challenging cases such as

the one above.

  • The track just misses a surface, but it is almost grazing it for

an extended distance.

  • If the acceptable sagital accuracy (‘miss-distance’) is larger

than the distance between the curve and the surface, 1st 2nd try - linear (slow convergence) 3rd-Halving 4th-Halving

slide-10
SLIDE 10

MULTI-LEVEL LOCATOR

  • When a segment has no intersection, you need to proceed to

the next one

  • Must make sure that a candidate intersection exists for the next

segment

  • This was missing - the old candidate is kept instead (!)
  • A first fix created in August - but it had a ‘hole’
  • And problems occur in ALICE so it is not robust - yet.