@InProceedings{   Krietenstein_1998aa,
  abstract      = {Computational tools for the design of accelerating structures are in use since decades. While highly accurate methods exist for quasi two dimensional cavities, fully three dimensional modeling with high precision is still a big challenge. The most widely used computer code in this area is MAFIA, basing on the Finite Integration Theory (FIT, [1,2]). While being well known for its robustness and reliability, MAFIA nevertheless suffers somewhat from a deficiency in being able to model very complicated 3D-cavities including curved boundaries with high precision. In this paper we present two recently developed algorithms, facing this challenge within FIT: the usage of generalized non-orthogonal computational grids (NO-FIT), and the so-called Perfect Boundary Approximation (PBA) technique. Both methods represent consistent extensions of FIT, preserving all important properties as second order accuracy and stability of the transient solver. Especially the PBA technique reveals to be a highly efficient method, as it combines easy-to-use Cartesian grids with a perfect approximation of boundaries. We compare MAFIA with the PBA technique for typical accelerator components, and it turns out, that the PBA technique is more than one order of magnitude faster than the conventional method if many non Cartesian metallic boundaries appear inside the modeled structure.},
  address       = {Argonne, IL, USA},
  author        = {Krietenstein, Bernd and Schuhmann, Rolf and Thoma, Peter and Weiland, Thomas},
  booktitle     = {Proceedings of the {XIX} International Linear Accelerator Conference},
  file          = {Krietenstein_1998aa.pdf},
  group         = {casper},
  keywords      = {fit,field,physics,nonorthogonal},
  langid        = {english},
  pages         = {860--862},
  title         = {The Perfect Boundary Approximation Technique Facing the Big Challenge of High Precision Field Computation},
  year          = {1998}
}

{"_id":"gfHDvzktGENaicJmB","bibbaseid":"krietenstein-schuhmann-thoma-weiland-theperfectboundaryapproximationtechniquefacingthebigchallengeofhighprecisionfieldcomputation-1998","authorIDs":[],"author_short":["Krietenstein, B.","Schuhmann, R.","Thoma, P.","Weiland, T."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","abstract":"Computational tools for the design of accelerating structures are in use since decades. While highly accurate methods exist for quasi two dimensional cavities, fully three dimensional modeling with high precision is still a big challenge. The most widely used computer code in this area is MAFIA, basing on the Finite Integration Theory (FIT, [1,2]). While being well known for its robustness and reliability, MAFIA nevertheless suffers somewhat from a deficiency in being able to model very complicated 3D-cavities including curved boundaries with high precision. In this paper we present two recently developed algorithms, facing this challenge within FIT: the usage of generalized non-orthogonal computational grids (NO-FIT), and the so-called Perfect Boundary Approximation (PBA) technique. Both methods represent consistent extensions of FIT, preserving all important properties as second order accuracy and stability of the transient solver. Especially the PBA technique reveals to be a highly efficient method, as it combines easy-to-use Cartesian grids with a perfect approximation of boundaries. We compare MAFIA with the PBA technique for typical accelerator components, and it turns out, that the PBA technique is more than one order of magnitude faster than the conventional method if many non Cartesian metallic boundaries appear inside the modeled structure.","address":"Argonne, IL, USA","author":[{"propositions":[],"lastnames":["Krietenstein"],"firstnames":["Bernd"],"suffixes":[]},{"propositions":[],"lastnames":["Schuhmann"],"firstnames":["Rolf"],"suffixes":[]},{"propositions":[],"lastnames":["Thoma"],"firstnames":["Peter"],"suffixes":[]},{"propositions":[],"lastnames":["Weiland"],"firstnames":["Thomas"],"suffixes":[]}],"booktitle":"Proceedings of the XIX International Linear Accelerator Conference","file":"Krietenstein_1998aa.pdf","group":"casper","keywords":"fit,field,physics,nonorthogonal","langid":"english","pages":"860–862","title":"The Perfect Boundary Approximation Technique Facing the Big Challenge of High Precision Field Computation","year":"1998","bibtex":"@InProceedings{ Krietenstein_1998aa,\n abstract = {Computational tools for the design of accelerating structures are in use since decades. While highly accurate methods exist for quasi two dimensional cavities, fully three dimensional modeling with high precision is still a big challenge. The most widely used computer code in this area is MAFIA, basing on the Finite Integration Theory (FIT, [1,2]). While being well known for its robustness and reliability, MAFIA nevertheless suffers somewhat from a deficiency in being able to model very complicated 3D-cavities including curved boundaries with high precision. In this paper we present two recently developed algorithms, facing this challenge within FIT: the usage of generalized non-orthogonal computational grids (NO-FIT), and the so-called Perfect Boundary Approximation (PBA) technique. Both methods represent consistent extensions of FIT, preserving all important properties as second order accuracy and stability of the transient solver. Especially the PBA technique reveals to be a highly efficient method, as it combines easy-to-use Cartesian grids with a perfect approximation of boundaries. We compare MAFIA with the PBA technique for typical accelerator components, and it turns out, that the PBA technique is more than one order of magnitude faster than the conventional method if many non Cartesian metallic boundaries appear inside the modeled structure.},\n address = {Argonne, IL, USA},\n author = {Krietenstein, Bernd and Schuhmann, Rolf and Thoma, Peter and Weiland, Thomas},\n booktitle = {Proceedings of the {XIX} International Linear Accelerator Conference},\n file = {Krietenstein_1998aa.pdf},\n group = {casper},\n keywords = {fit,field,physics,nonorthogonal},\n langid = {english},\n pages = {860--862},\n title = {The Perfect Boundary Approximation Technique Facing the Big Challenge of High Precision Field Computation},\n year = {1998}\n}\n\n","author_short":["Krietenstein, B.","Schuhmann, R.","Thoma, P.","Weiland, T."],"key":"Krietenstein_1998aa","id":"Krietenstein_1998aa","bibbaseid":"krietenstein-schuhmann-thoma-weiland-theperfectboundaryapproximationtechniquefacingthebigchallengeofhighprecisionfieldcomputation-1998","role":"author","urls":{},"keyword":["fit","field","physics","nonorthogonal"],"downloads":0,"html":""},"bibtype":"inproceedings","biburl":"http://dl.schoeps.org/database.bib","creationDate":"2019-12-26T16:51:17.543Z","downloads":0,"keywords":["fit","field","physics","nonorthogonal"],"search_terms":["perfect","boundary","approximation","technique","facing","big","challenge","high","precision","field","computation","krietenstein","schuhmann","thoma","weiland"],"title":"The Perfect Boundary Approximation Technique Facing the Big Challenge of High Precision Field Computation","year":1998,"dataSources":["P4aBgbzF45TWvxzbZ"]}