open issues in transportation and propagation in field
play

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


  1. OPEN ISSUES IN TRANSPORTATION AND PROPAGATION IN FIELD J. Apostolakis

  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.

  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)

  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

  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

  6. CHALLENGE • G4V Intersection Locator role is to Candidate confirm and refine a candidate intersection point. • Three implementations - challenges • “Simple” Locator - ‘linear’ • Multi-Level Locator - adds ‘bi-section’ • Brent Locator - adds quadratic conv.

  7. BASE ALGORITHM S 1 • “Simple” Locator Candidate S 2 • Estimate nearest point on curve S 3 S 4 • Check both segments • Weaknesses: • linear convergence (slow) • can fail to converge in 1,000 steps • not really simple …

  8. REFINED ALGORITHM • Multi-Level Locator S 3 • Check if linear algorithm is not making good progress • If not, break remainder into two S 4 sections - ‘stacking’ the second • Logic is very complex

  9. 4th-Halving 3rd-Halving 2nd try - linear (slow convergence) 1st 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,

  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.

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend