Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “block structured meshes”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 163 records · Page 9

Algorithms for the automatic generation of 2-D structured multi-block grids

Two different approaches to the fully automatic generation of structured multi-block grids in two dimensions are presented. The work aims to simplify the user interactivity necessary for the definition of a multiple block grid topology. The first approach is based on an advancing front method commonly used for the generation of unstructured grids. The original algorithm has been modified toward the generation of large quadrilateral elements. The second method is based on the divide-and-conquer paradigm with the global domain recursively partitioned into sub-domains. For either method each of the resulting blocks is then meshed using transfinite interpolation and elliptic smoothing. The applicability of these methods to practical problems is demonstrated for typical geometries of fluid dynamics.

Schoenfeld, Thilo↗

A HYBRID SOLAR WIND MODEL OF THE CESE+HLL METHOD WITH A YIN-YANG OVERSET GRID AND AN AMR GRID

A hybrid three-dimensional (3D) MHD model for solar wind study is proposed in the present paper with combined grid systems and solvers. The computational domain from the Sun to Earth space is decomposed into the near-Sun and off-Sun domains, which are respectively constructed with a Yin-Yang overset grid system and a Cartesian adaptive mesh refinement (AMR) grid system and coupled with a domain connection interface in the overlapping region between the near-Sun and off-Sun domains. The space-time conservation element and solution element method is used in the near-Sun domain, while the Harten-Lax-Leer method is employed in the off-Sun domain. The Yin-Yang overset grid can avoid well-known singularity and polar grid convergence problems and its body-fitting property helps achieve high-quality resolution near the solar surface. The block structured AMR Cartesian grid can automatically capture far-field plasma flow features, such as heliospheric current sheets and shock waves, and at the same time, it can save significant computational resources compared to the uniformly structured Cartesian grid. A numerical study of the solar wind structure for Carrington rotation 2069 shows that the newly developed hybrid MHD solar wind model successfully produces many realistic features of the background solar wind, in both the solar corona and interplanetary space, by comparisons with multiple solar and interplanetary observations.

79 ASTRONOMY AND ASTROPHYSICS↗

Directed-Assembly of Block Copolymers for Large-Scale, Three-Dimensional, Optical Metamaterials at Visible Wavelengths. Final LDRD Report

Metamaterials are composites with patterned subwavelength features where the choice of materials and subwavelength structuring bestows upon the metamaterials unique optical properties not found in nature, thereby enabling optical applications previously considered impossible. However, because the structure of optical metamaterials must be subwavelength, metamaterials operating at visible wavelengths require features on the order of 100 nm or smaller, and such resolution typically requires top-down lithographic fabrication techniques that are not easily scaled to device-relevant areas that are square centimeters in size. In this project, we developed a new fabrication route using block copolymers to make over large device-relevant areas optical metamaterials that operate at visible wavelengths. Our structures are smaller in size (sub-100 nm) and cover a larger area (cm 2 ) than what has been achieved with traditional nanofabrication routes. To guide our experimental efforts, we developed an algorithm to calculate the expected optical properties (specifically the index of refraction) of such metamaterials that predicts that we can achieve surprisingly large changes in optical properties with small changes in metamaterials’ structure. In the course of our work, we also found that the ordered metal nanowires meshes produced by our scalable fabrication route for making optical metamaterials may also possibly act as transparent electrodes, which are needed in electrical displays and solar cells. We explored the ordered metal nanowires meshes’ utility for this application and developed design guidelines to aide our experimental efforts.

36 MATERIALS SCIENCE↗

A Structured Grid Based Solution-Adaptive Technique for Complex Separated Flows

The objective of this work was to enhance the predictive capability of widely used computational fluid dynamic (CFD) codes through the use of solution adaptive gridding. Most problems of engineering interest involve multi-block grids and widely disparate length scales. Hence, it is desirable that the adaptive grid feature detection algorithm be developed to recognize flow structures of different type as well as differing intensity, and adequately address scaling and normalization across blocks. In order to study the accuracy and efficiency improvements due to the grid adaptation, it is necessary to quantify grid size and distribution requirements as well as computational times of non-adapted solutions. Flow fields about launch vehicles of practical interest often involve supersonic freestream conditions at angle of attack exhibiting large scale separate vortical flow, vortex-vortex and vortex-surface interactions, separated shear layers and multiple shocks of different intensity. In this work, a weight function and an associated mesh redistribution procedure is presented which detects and resolves these features without user intervention. Particular emphasis has been placed upon accurate resolution of expansion regions and boundary layers. Flow past a wedge at Mach=2.0 is used to illustrate the enhanced detection capabilities of this newly developed weight function.

Thornburg, Hugh↗

A hybrid porous model for full reactor core scale CFD investigation of a prismatic HTGR

Three-dimensional (3-D) Computational Fluid Dynamics (CFD) analysis of a whole nuclear reactor core is a tremendous challenge due to the large geometric volume and complex structures. Here, this research presents a hybrid porous (HP) model to simplify a prismatic High Temperature Gas-cooled Reactor (HTGR) core, so 3-D CFD investigation can be performed on a full reactor core scale. In the HP model, the prototypic small coolant channels in the nuclear fuel blocks are lumped together to form multiple equivalent large coolant channels, and then the porous medium flow model is applied to each of them. Therefore, heat transfer in fuel blocks is computed by a hybrid combination of solid energy and porous flow energy equations. The similarity between the HP model and prototypic model is achieved by deriving the porous flow permeability, inertial resistance factor, and artificial thermophysical properties. Compared with the widely used whole porous (WP) flow model, the HP model preserves more realistic geometric structures, and therefore more accurate physical processes. The General Atomics' Modular High Temperature Gas-cooled Reactor (MHTGR) design was chosen as a prototype to demonstrate the methodology. Simulations were performed using the prototypic CFD model and HP model at steady-state forced circulation, steady-state natural circulation, and transient conditions that correspond to normal operation, extended period of pressurized cool down, and short-term transients after reactor shutdown, respectively. The comparison shows good agreement between the HP model and prototypic model in the maximum fuel temperature, average solid temperature, and helium flow rate, which demonstrates the potential applicability of the HP model for a full reactor core scale simulation in the future. As a benefit, the HP model reduces the mesh quantity by a factor of 50 from a prototypic model. Correspondingly, the computation time was reduced by a factor of at least 30.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A Navier-Strokes Chimera Code on the Connection Machine CM-5: Design and Performance

We have implemented a three-dimensional compressible Navier-Stokes code on the Connection Machine CM-5. The code is set up for implicit time-stepping on single or multiple structured grids. For multiple grids and geometrically complex problems, we follow the 'chimera' approach, where flow data on one zone is interpolated onto another in the region of overlap. We will describe our design philosophy and give some timing results for the current code. A parallel machine like the CM-5 is well-suited for finite-difference methods on structured grids. The regular pattern of connections of a structured mesh maps well onto the architecture of the machine. So the first design choice, finite differences on a structured mesh, is natural. We use centered differences in space, with added artificial dissipation terms. When numerically solving the Navier-Stokes equations, there are liable to be some mesh cells near a solid body that are small in at least one direction. This mesh cell geometry can impose a very severe CFL (Courant-Friedrichs-Lewy) condition on the time step for explicit time-stepping methods. Thus, though explicit time-stepping is well-suited to the architecture of the machine, we have adopted implicit time-stepping. We have further taken the approximate factorization approach. This creates the need to solve large banded linear systems and creates the first possible barrier to an efficient algorithm. To overcome this first possible barrier we have considered two options. The first is just to solve the banded linear systems with data spread over the whole machine, using whatever fast method is available. This option is adequate for solving scalar tridiagonal systems, but for scalar pentadiagonal or block tridiagonal systems it is somewhat slower than desired. The second option is to 'transpose' the flow and geometry variables as part of the time-stepping process: Start with x-lines of data in-processor. Form explicit terms in x, then transpose so y-lines of data are in-processor. Form explicit terms in y, then transpose so z-lines are in processor. Form explicit terms in z, then solve linear systems in the z-direction. Transpose to the y-direction, then solve linear systems in the y-direction. Finally transpose to the x direction and solve linear systems in the x-direction. This strategy avoids inter-processor communication when differencing and solving linear systems, but requires a large amount of communication when doing the transposes. The transpose method is more efficient than the non-transpose strategy when dealing with scalar pentadiagonal or block tridiagonal systems. For handling geometrically complex problems the chimera strategy was adopted. For multiple zone cases we compute on each zone sequentially (using the whole parallel machine), then send the chimera interpolation data to a distributed data structure (array) laid out over the whole machine. This information transfer implies an irregular communication pattern, and is the second possible barrier to an efficient algorithm. We have implemented these ideas on the CM-5 using CMF (Connection Machine Fortran), a data parallel language which combines elements of Fortran 90 and certain extensions, and which bears a strong similarity to High Performance Fortran. We make use of the Connection Machine Scientific Software Library (CMSSL) for the linear solver and array transpose operations.

Jespersen, Dennis C.↗

Navier-Stokes Aerodynamic Simulation of the V-22 Osprey on the Intel Paragon MPP

The paper will describe the Development of a general three-dimensional multiple grid zone Navier-Stokes flowfield simulation program (ENS3D-MPP) designed for efficient execution on the Intel Paragon Massively Parallel Processor (MPP) supercomputer, and the subsequent application of this method to the prediction of the viscous flowfield about the V-22 Osprey tiltrotor vehicle. The flowfield simulation code solves the thin Layer or full Navier-Stoke's equation - for viscous flow modeling, or the Euler equations for inviscid flow modeling on a structured multi-zone mesh. In the present paper only viscous simulations will be shown. The governing difference equations are solved using a time marching implicit approximate factorization method with either TVD upwind or central differencing used for the convective terms and central differencing used for the viscous diffusion terms. Steady state or Lime accurate solutions can be calculated. The present paper will focus on steady state applications, although time accurate solution analysis is the ultimate goal of this effort. Laminar viscosity is calculated using Sutherland's law and the Baldwin-Lomax two layer algebraic turbulence model is used to compute the eddy viscosity. The Simulation method uses an arbitrary block, curvilinear grid topology. An automatic grid adaption scheme is incorporated which concentrates grid points in high density gradient regions. A variety of user-specified boundary conditions are available. This paper will present the application of the scalable and superscalable versions to the steady state viscous flow analysis of the V-22 Osprey using a multiple zone global mesh. The mesh consists of a series of sheared cartesian grid blocks with polar grids embedded within to better simulate the wing tip mounted nacelle. MPP solutions will be shown in comparison to equivalent Cray C-90 results and also in comparison to experimental data. Discussions on meshing considerations, wall clock execution time, load balancing, and scalability will be provided.

Vadyak, Joseph↗

Three-Dimensional Aeroelastic and Aerothermoelastic Behavior in Hypersonic Flow

The aeroelastic and aerothermoelastic behavior of three-dimensional configurations in hypersonic flow regime are studied. The aeroelastic behavior of a low aspect ratio wing, representative of a fin or control surface on a generic hypersonic vehicle, is examined using third order piston theory, Euler and Navier-Stokes aerodynamics. The sensitivity of the aeroelastic behavior generated using Euler and Navier-Stokes aerodynamics to parameters governing temporal accuracy is also examined. Also, a refined aerothermoelastic model, which incorporates the heat transfer between the fluid and structure using CFD generated aerodynamic heating, is used to examine the aerothermoelastic behavior of the low aspect ratio wing in the hypersonic regime. Finally, the hypersonic aeroelastic behavior of a generic hypersonic vehicle with a lifting-body type fuselage and canted fins is studied using piston theory and Euler aerodynamics for the range of 2.5 less than or equal to M less than or equal to 28, at altitudes ranging from 10,000 feet to 80,000 feet. This analysis includes a study on optimal mesh selection for use with Euler aerodynamics. In addition to the aeroelastic and aerothermoelastic results presented, three time domain flutter identification techniques are compared, namely the moving block approach, the least squares curve fitting method, and a system identification technique using an Auto-Regressive model of the aeroelastic system. In general, the three methods agree well. The system identification technique, however, provided quick damping and frequency estimations with minimal response record length, and therefore o ers significant reductions in computational cost. In the present case, the computational cost was reduced by 75%. The aeroelastic and aerothermoelastic results presented illustrate the applicability of the CFL3D code for the hypersonic flight regime.

McNamara, Jack J.↗

Visualization and Quantification of Rotor Tip Vortices in Helicopter Flows

Helicopter aeromechanics encompasses a highly vortical flow field. The vortices generated at each blade tip contain unsteady, complex, three-dimensional structures, which interact with each other, other blades, the fuselage and various components of the helicopter. It is crucial to understand vortex kinematics and their subsequent dynamic evolution. Much research has been devoted to the understanding of helicopter vortex dynamics, including a number of experimental studies.1-6 In May 2010 Particle Image Velocimetry (PIV) measurements of a full-scale UH-60A rotor were acquired in the National Full-Scale Aerodynamics Complex (NFAC) 40- by 80-Foot Wind Tunnel.1 These measurements were taken at a plane just downstream of the advancing blade in the vicinity of the blade tip—the so-called PIV plane. The resulting PIV data were then processed using an ensemble-average approach to create graphical representations of the vortical wake velocity and vorticity fields, which, in turn, have enhanced the understanding of rotorcraft vortical wake flow field physics and have provided a more detailed validation of vortical wake computer simulations.7 A common approach used to analyze flow field features is to compute and plot color contour maps of various scalar quantities such as pressure, velocity magnitude and vorticity magnitude. For example, the color map of the vorticity magnitude is typically used to determine vortical flow structure. With this approach the vortex core may appear larger or smaller, depending on the contour levels that are selected. Thus, the resulting visualization is sensitive to user-specified contour levels. For vortex core radius measurements, it is more accurate to calculate the vortex core radius using the cross-flow velocity profile across the vortex core. The task of extracting the cross-flow velocity profile can be time consuming with existing tools since the user needs to manually select the core center then specify sampling points along the profile axis. The task becomes even more challenging when the associated grid system uses AMR (Adaptive Mesh Refinement) where the profile axis could span multiple grid blocks. There are a number of existing techniques for profiling of vortex core attributes;8-9 however, these techniques are not fully automatic in that the user still needs to select the vortex core center to compute the cross-flow velocity profile. The present study introduces a new color map scheme that is based on the vortex core radius, which is fully automatic and does not require user intervention. Analysis and visualization of blade tip vortices on the PIV plane using the proposed new color map scheme are described in Section II. The new approach is evaluated using two case studies, which are described in Section III. The paper ends with a summary in Section IV.

Quantification↗

Structure and function of the interacting domains of Spire and Fmn-family formins

Evidence for cooperation between actin nucleators is growing. The WH2-containing nucleator Spire and the formin Cappuccino interact directly, and both are essential for assembly of an actin mesh during Drosophila oogenesis. Their interaction requires the kinase noncatalytic C-lobe domain (KIND) domain of Spire and the C-terminal tail of the formin. Here we describe the crystal structure of the KIND domain of human Spir1 alone and in complex with the tail of Fmn2, a mammalian ortholog of Cappuccino. The KIND domain is structurally similar to the C-lobe of protein kinases. The Fmn2 tail is coordinated in an acidic cleft at the base of the domain that appears to have evolved via deletion of a helix from the canonical kinase fold. Our functional analysis of Cappuccino reveals an unexpected requirement for its tail in actin assembly. In addition, we find that the KIND/tail interaction blocks nucleation by Cappuccino and promotes its displacement from filament barbed ends providing insight into possible modes of cooperation between Spire and Cappuccino.

59 BASIC BIOLOGICAL SCIENCES↗

3D Navier-Stokes Time Accurate Solutions Using Multipartitioning Parallel Computation Methodology

A parallel CFD code solving 3D time accurate Navier-Stokes equations with multipartitioning parallel Methodology is being developed in collaboration with Ohio State University within the Air Vehicle Directorate, at Wright Patterson Air Force Base. The advantage of the multipartitioning parallel method is that the domain decomposition will not introduce domain boundaries for the implicit operators. A ring structure data communication is employed so that the implicit time accurate method can be implemented for multi-processors with the same accuracy as for the single processor. No sub-iteration is needed at the domain boundaries. The code has been validated for some typical unsteady flows, which include Coutte Flow, flow passing a cylinder. The code now is being employed for a large scale time accurate wall jet transient flow computation. 'ne preliminary results are promising. The mesh has been refined to capture more details of the flow field. The mesh refinement computation is in progress and would be difficult to successfully implement without the parallel computation techniques used. A modified version of the code with more efficient inversion of the diagonalized block matrix is currently being tested.

Zha, Ge-Cheng↗

The Keck keyword layer

Each Keck instrument presents a consistent software view to the user interface programmer. The view consists of a small library of functions, which are identical for all instruments, and a large set of keywords, that vary from instrument to instrument. All knowledge of the underlying task structure is hidden from the application programmer by the keyword layer. Image capture software uses the same function library to collect data for the image header. Because the image capture software and the instrument control software are built on top of the same keyword layer, a given observation can be 'replayed' by extracting keyword-value pairs from the image header and passing them back to the control system. The keyword layer features non-blocking as well as blocking I/O. A non-blocking keyword write operation (such as setting a filter position) specifies a callback to be invoked when the operation is complete. A non-blocking keyword read operation specifies a callback to be invoked whenever the keyword changes state. The keyword-callback style meshes well with the widget-callback style commonly used in X window programs. The first keyword library was built for the two Keck optical instruments. More recently, keyword libraries have been developed for the infrared instruments and for telescope control. Although the underlying mechanisms used for inter-process communication by each of these systems vary widely (Lick MUSIC, Sun RPC, and direct socket I/O, respectively), a basic user interface has been written that can be used with any of these systems. Since the keyword libraries are bound to user interface programs dynamically at run time, only a single set of user interface executables is needed. For example, the same program, 'xshow', can be used to display continuously the telescope's position, the time left in an instrument's exposure, or both values simultaneously. Less generic tools that operate on specific keywords, for example an X display that controls optical instrument exposures, have also been written using the keyword layer.

Conrad, A. R.↗

SIAM Conference on Parallel Processing for Scientific Computing, 4th, Chicago, IL, Dec. 11-13, 1989, Proceedings

Attention is given to such topics as an evaluation of block algorithm variants in LAPACK and presents a large-grain parallel sparse system solver, a multiprocessor method for the solution of the generalized Eigenvalue problem on an interval, and a parallel QR algorithm for iterative subspace methods on the CM2. A discussion of numerical methods includes the topics of asynchronous numerical solutions of PDEs on parallel computers, parallel homotopy curve tracking on a hypercube, and solving Navier-Stokes equations on the Cedar Multi-Cluster system. A section on differential equations includes a discussion of a six-color procedure for the parallel solution of elliptic systems using the finite quadtree structure, data parallel algorithms for the finite element method, and domain decomposition methods in aerodynamics. Topics dealing with massively parallel computing include hypercube vs. 2-dimensional meshes and massively parallel computation of conservation laws. Performance and tools are also discussed.

Dongarra, Jack↗

Adaptive Numerical Algorithms in Space Weather Modeling

Space weather describes the various processes in the Sun-Earth system that present danger to human health and technology. The goal of space weather forecasting is to provide an opportunity to mitigate these negative effects. Physics-based space weather modeling is characterized by disparate temporal and spatial scales as well as by different physics in different domains. A multi-physics system can be modeled by a software framework comprising of several components. Each component corresponds to a physics domain, and each component is represented by one or more numerical models. The publicly available Space Weather Modeling Framework (SWMF) can execute and couple together several components distributed over a parallel machine in a flexible and efficient manner. The framework also allows resolving disparate spatial and temporal scales with independent spatial and temporal discretizations in the various models. Several of the computationally most expensive domains of the framework are modeled by the Block-Adaptive Tree Solar wind Roe Upwind Scheme (BATS-R-US) code that can solve various forms of the magnetohydrodynamics (MHD) equations, including Hall, semi-relativistic, multi-species and multi-fluid MHD, anisotropic pressure, radiative transport and heat conduction. Modeling disparate scales within BATS-R-US is achieved by a block-adaptive mesh both in Cartesian and generalized coordinates. Most recently we have created a new core for BATS-R-US: the Block-Adaptive Tree Library (BATL) that provides a general toolkit for creating, load balancing and message passing in a 1, 2 or 3 dimensional block-adaptive grid. We describe the algorithms of BATL and demonstrate its efficiency and scaling properties for various problems. BATS-R-US uses several time-integration schemes to address multiple time-scales: explicit time stepping with fixed or local time steps, partially steady-state evolution, point-implicit, semi-implicit, explicit/implicit, and fully implicit numerical schemes. Depending on the application, we find that different time stepping methods are optimal. Several of the time integration schemes exploit the block-based granularity of the grid structure. The framework and the adaptive algorithms enable physics based space weather modeling and even forecasting.

Toth, Gabor↗

Full Multigrid Flow Solver

FMG3D (full multigrid 3 dimensions) is a pilot computer program that solves equations of fluid flow using a finite difference representation on a structured grid. Infrastructure exists for three dimensions but the current implementation treats only two dimensions. Written in Fortran 90, FMG3D takes advantage of the recursive subroutine feature, dynamic memory allocation, and structured-programming constructs of that language. FMG3D supports multi-block grids with three types of block-to-block interfaces: periodic, C-zero, and C-infinity. For all three types, grid points must match at interfaces. For periodic and C-infinity types, derivatives of grid metrics must be continuous at interfaces. The available equation sets are as follows: scalar elliptic equations, scalar convection equations, and the pressure-Poisson formulation of the Navier-Stokes equations for an incompressible fluid. All the equation sets are implemented with nonzero forcing functions to enable the use of user-specified solutions to assist in verification and validation. The equations are solved with a full multigrid scheme using a full approximation scheme to converge the solution on each succeeding grid level. Restriction to the next coarser mesh uses direct injection for variables and full weighting for residual quantities; prolongation of the coarse grid correction from the coarse mesh to the fine mesh uses bilinear interpolation; and prolongation of the coarse grid solution uses bicubic interpolation.

Mineck, Raymond E.↗

Geometric Mapping of Tasks to Processors on Parallel Computers with Mesh or Torus Networks

We present a new method for reducing parallel applications' communication time by mapping their MPI tasks to processors in a way that lowers the distance messages travel and the amount of congestion in the network. Assuming geometric proximity among the tasks is a good approximation of their communication interdependence, we use a geometric partitioning algorithm to order both the tasks and the processors, assigning task parts to the corresponding processor parts. In this way, interdependent tasks are assigned to “nearby” cores in the network. We also present a number of algorithmic optimizations that exploit specific features of the network or application to further improve the quality of the mapping. We specifically address the case of sparse node allocation, where the nodes assigned to a job are not necessarily located in a contiguous block nor within close proximity to each other in the network. Furthermore, our methods generalize to contiguous allocations as well, and results are shown for both contiguous and non-contiguous allocations. We show that, for the structured finite difference mini-application MiniGhost, our mapping methods reduced communication time up to 75% relative to MiniGhost's default mapping on 128K cores of a Cray XK7 with sparse allocation. For the atmospheric modeling code E3SM/HOMME, our methods reduced communication time up to 31% on 16K cores of an IBM BlueGene/Q with contiguous allocation.

97 MATHEMATICS AND COMPUTING↗

An Adaptive Mesh Algorithm: Mesh Structure and Generation

The purpose of Adaptive Mesh Refinement is to minimize spatial errors over the computational space not to minimize the number of computational elements. The additional result of the technique is that it may reduce the number of computational elements needed to retain a given level of spatial accuracy. Adaptive mesh refinement is a computational technique used to dynamically select, over a region of space, a set of computational elements designed to minimize spatial error in the computational model of a physical process. The fundamental idea is to increase the mesh resolution in regions where the physical variables are represented by a broad spectrum of modes in k-space, hence increasing the effective global spectral coverage of those physical variables. In addition, the selection of the spatially distributed elements is done dynamically by cyclically adjusting the mesh to follow the spectral evolution of the system. Over the years three types of AMR schemes have evolved; block, patch and locally refined AMR. In block and patch AMR logical blocks of various grid sizes are overlaid to span the physical space of interest, whereas in locally refined AMR no logical blocks are employed but locally nested mesh levels are used to span the physical space. The distinction between block and patch AMR is that in block AMR the original blocks refine and coarsen entirely in time, whereas in patch AMR the patches change location and zone size with time. The type of AMR described herein is a locally refi ned AMR. In the algorithm described, at any point in physical space only one zone exists at whatever level of mesh that is appropriate for that physical location. The dynamic creation of a locally refi ned computational mesh is made practical by a judicious selection of mesh rules. With these rules the mesh is evolved via a mesh potential designed to concentrate the nest mesh in regions where the physics is modally dense, and coarsen zones in regions where the physics is modally sparse.

97 MATHEMATICS AND COMPUTING↗

Infrared measurements and simulations of metal meshes in a focused beam

Infrared transmittance measurements of quasioptical filters are often restricted to a focused beam due to the optical design of the spectrometer. In contrast, numerical simulations assume an incident plane wave, which makes it difficult to compare theory with experimental data. We compare transmittance measurements with numerical simulations of square arrays of circular holes in 3-μm thick Cu sheets at angles of incidence from 0° to 20° for both s and p polarizations. These simple structures allow detailed tests of our electromagnetic simulation methods and show excellent agreement between theory and measurement. Measurements in a focused beam are accurately simulated by combining plane wave calculations over a range of angles that correspond to the focal ratio of the incident beam. Similar screens have been used as components of narrow bandpass filters for far-infrared astronomy, but these results show that the transmittance variations with angle of incidence and polarization limit their use to collimated beams at near normal incidence. The simulations are accurate enough to eliminate a costly trial-and-error approach to the design of more complex and useful quasioptical infrared filters and to predict their in-band performance and out-of-band blocking in focused beams.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗