Search NASA⌕ Search

SEARCH · Search NASA

Results for “eigenvalue problems”

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 1,045 records · Page 58

Real-Time Krylov Theory for Quantum Computing Algorithms

Quantum computers provide new avenues to access ground and excited state properties of systems otherwise difficult to simulate on classical hardware. New approaches using subspaces generated by real-time evolution have shown efficiency in extracting eigenstate information, but the full capabilities of such approaches are still not understood. In recent work, we developed the variational quantum phase estimation (VQPE) method, a compact and efficient real-time algorithm to extract eigenvalues on quantum hardware. Here we build on that work by theoretically and numerically exploring a generalized Krylov scheme where the Krylov subspace is constructed through a parametrized real-time evolution, which applies to the VQPE algorithm as well as others. We establish an error bound that justifies the fast convergence of our spectral approximation. We also derive how the overlap with high energy eigenstates becomes suppressed from real-time subspace diagonalization and we visualize the process that shows the signature phase cancellations at specific eigenenergies. We investigate various algorithm implementations and consider performance when stochasticity is added to the target Hamiltonian in the form of spectral statistics. To demonstrate the practicality of such real-time evolution, we discuss its application to fundamental problems in quantum computation such as electronic structure predictions for strongly correlated systems.

97 MATHEMATICS AND COMPUTING↗

Statistical analysis of the modal properties of large structural systems.

A theory is developed to predict eigenvalue and eigenvector uncertainty in large dynamic models. The uncertainty is based on physical property uncertainty and should not be confused with numerical roundoff, although the method can be extended to include the latter. The theory, when implemented on a computer, is used to analyze the uncertainties in frequencies and mode shapes based on uncertainties in mass, stiffness, modulus of elasticity, etc. The method incorporates a linear statistical model which is quite adequate for handling property uncertainties of 10% or more. The model is not limited to small systems but uses certain statistical assumptions as well as selective matrix manipulations to keep the size of all matrix operations to within the number of degrees of freedom of the system. Examples are given for two longitudinal vibration problems, and the results are supported by a Monte Carlo analysis.

Collins, J. D.↗

On the Retrieval of Lightning Radio Sources from Time-of-Arrival Data

We examine the problem of retrieving three-dimensional lightning locations from radio frequency Time-Of-Arrival (TOA) measurements. Arbitrary antenna locations are considered. By judiciously differencing measurements that are related to the location of the antennas and their excitation times, the problem is converted from the initial spherical nonlinear form to a system of linear equations. In the linear formalism, the source location and time-of-occurrence is viewed geometrically as an intersection of hyperplanes in the four-dimensional Minkowski space (x,y,z,t). The linear equations are solved to obtain explicit analytic expressions for the location and time variables. Retrieval errors are not interpreted with conventional Geometrical Dilution of Precision (GDOP) arguments as discussed by Holmes and Reedy (1951), but with more recent inversion analyses considered by Twomey (1977). Measurement errors are propagated analytically so that the specific effect of these errors on the solution is clarified. The sensitivity of the solution on the number of antennas used, antenna network geometry, source position, and measurement differencing schemes are discussed in terms of the eigenvalues of the linear system.

Koshak, William J.↗

Code Coverage Status of the ARC Code PERSENT

The Argonne Reactor Code (ARC) software system supports users in their fast reactor design goals by providing neutronic, thermal-hydraulic, and structural analysis capabilities. PERSENT fulfills the role of generating reactivity coefficients for a given time point of a REBUS calculation usable in a point kinetics based safety analysis capability. PERSENT also provides a sensitivity coefficient capability on eigenvalue, reactivity worth, and several other key coefficients that are used in the follow-on safety analysis. Given a co-variance matrix, PERSENT can carry out the uncertainty quantification to indicate the amount of error in the reactivity coefficients derived from the errors in the cross section measurements. With continued improvement of computational resources, many of the geometry modeling capabilities in DIF3D that were primarily used in low order schemes are not really needed anymore. Today, the diffusion and transport capabilities of DIF3D-VARIANT are primarily used in the reactor design process with some scattered usage of DIF3D-FD and DIF3D-Nodal. PERSENT is part of the ARC code system and is built around DIF3D-VARIANT and the flux solution it provides. The purpose of the present work is to identify a set of test problems for PERSENT and assess the code coverage of PERSENT for those test problems. PERSENT treats the DIF3D executable as an external executable and thus the code coverage considerations only need to focus on the PERSENT source code and only a fraction of the connected modules in the existing ARC software library. The goal is to document what parts of the existing PERSENT code are touched by the set of test problems and which are not. Because the verification work done on PERSENT was focused on the most common uses of PERSENT for fast reactor analysis, the code coverage assessment of those capabilities is the highest priority. This will ensure that nothing is being missed by the existing verification test problems that users of PERSENT rely upon. The code coverage analysis of PERSENT was performed with the Code Coverage Tool of the Intel Fortran compiler which requires modifications to the compilation of PERSENT. The detailed coverage tables are given for each submodule of PERSENT. Most of the uncovered parts/files could be easily ignored because they are either for error message and debugging output or not needed by PERSENT today. Only a few uncovered parts of PERSENT deserve extending the verification test suite.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Monte Carlo Perturbation Theory Estimates of Sensitivities to System Dimensions

Here, Monte Carlo methods are developed using adjoint-based perturbation theory and the differential operator method to compute the sensitivities of the k-eigenvalue, linear functions of the flux (reaction rates), and bilinear functions of the forward and adjoint flux (kinetics parameters) to system dimensions for uniform expansions or contractions. The calculation of sensitivities to system dimensions requires computing scattering and fission sources at material interfaces using collisions occurring at the interface—which is a set of events with infinitesimal probability. Kernel density estimators are used to estimate the source at interfaces using collisions occurring near the interface. The methods for computing sensitivities of linear and bilinear ratios are derived using the differential operator method and adjoint-based perturbation theory and are shown to be equivalent to methods previously developed using a collision history–based approach. The methods for determining sensitivities to system dimensions are tested on a series of fast, intermediate, and thermal critical benchmarks as well as a pressurized water reactor benchmark problem with iterated fission probability used for adjoint-weighting. The estimators are shown to agree within 5% and 3σ of reference solutions obtained using direct perturbations with central differences for the majority of test problems.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Explicit Quantum Circuits for Block Encodings of Certain Sparse Matrices

Many standard linear algebra problems can be solved on a quantum computer by using recently developed quantum linear algebra algorithms that make use of block encodings and quantum eigenvalue/singular value transformations. A block encoding embeds a properly scaled matrix of interest A in a larger unitary transformation U that can be decomposed into a product of simpler unitaries and implemented efficiently on a quantum computer. Although quantum algorithms can potentially achieve exponential speedup in solving linear algebra problems compared to the best classical algorithm, such a gain in efficiency ultimately hinges on our ability to construct an efficient quantum circuit for the block encoding of A, which is difficult in general, and not trivial even for well structured sparse matrices. Here, in this paper, we give a few examples on how efficient quantum circuits can be explicitly constructed for some well structured sparse matrices and discuss a few strategies used in these constructions. We also provide implementations of these quantum circuits in MATLAB.

97 MATHEMATICS AND COMPUTING↗

The dynamics and control of large flexible space structures - 12, supplement 11

The rapid 2-D slewing and vibrational control of the unsymmetrical flexible SCOLE (Spacecraft Control Laboratory Experiment) with multi-bounded controls is considered. Pontryagin's Maximum Principle is applied to the nonlinear equations of the system to derive the necessary conditions for the optimal control. The resulting two point boundary value problem is then solved by using the quasilinearization technique, and the near minimum time is obtained by sequentially shortening the slewing time until the controls are near the bang-bang type. The tradeoff between the minimum time and the minimum flexible amplitude requirements is discussed. The numerical results show that the responses of the nonlinear system are significantly different from those of the linearized system for rapid slewing. The SCOLE station-keeping closed loop dynamics are re-examined by employing a slightly different method for developing the equations of motion in which higher order terms in the expressions for the mast modal shape functions are now included. A preliminary study on the effect of actuator mass on the closed loop dynamics of large space systems is conducted. A numerical example based on a coupled two-mass two-spring system illustrates the effect of changes caused in the mass and stiffness matrices on the closed loop system eigenvalues. In certain cases the need for redesigning control laws previously synthesized, but not accounting for actuator masses, is indicated.

Bainum, Peter M.↗

Sunspot Pattern Classification using PCA and Neural Networks (Poster)

The sunspot classification scheme presented in this paper is considered as a 2-D classification problem on archived datasets, and is not a real-time system. As a first step, it mirrors the Zuerich/McIntosh historical classification system and reproduces classification of sunspot patterns based on preprocessing and neural net training datasets. Ultimately, the project intends to move from more rudimentary schemes, to develop spatial-temporal-spectral classes derived by correlating spatial and temporal variations in various wavelengths to the brightness fluctuation spectrum of the sun in those wavelengths. Once the approach is generalized, then the focus will naturally move from a 2-D to an n-D classification, where "n" includes time and frequency. Here, the 2-D perspective refers both to the actual SOH0 Michelson Doppler Imager (MDI) images that are processed, but also refers to the fact that a 2-D matrix is created from each image during preprocessing. The 2-D matrix is the result of running Principal Component Analysis (PCA) over the selected dataset images, and the resulting matrices and their eigenvalues are the objects that are stored in a database, classified, and compared. These matrices are indexed according to the standard McIntosh classification scheme.

Rajkumar, T.↗

Flutter and Divergence Analysis using the Generalized Aeroelastic Analysis Method

The Generalized Aeroelastic Analysis Method (GAAM) is applied to the analysis of three well-studied checkcases: restrained and unrestrained airfoil models, and a wing model. An eigenvalue iteration procedure is used for converging upon roots of the complex stability matrix. For the airfoil models, exact root loci are given which clearly illustrate the nature of the flutter and divergence instabilities. The singularities involved are enumerated, including an additional pole at the origin for the unrestrained airfoil case and the emergence of an additional pole on the positive real axis at the divergence speed for the restrained airfoil case. Inconsistencies and differences among published aeroelastic root loci and the new, exact results are discussed and resolved. The generalization of a Doublet Lattice Method computer code is described and the code is applied to the calculation of root loci for the wing model for incompressible and for subsonic flow conditions. The error introduced in the reduction of the singular integral equation underlying the unsteady lifting surface theory to a linear algebraic equation is discussed. Acknowledging this inherent error, the solutions of the algebraic equation by GAAM are termed 'exact.' The singularities of the problem are discussed and exponential series approximations used in the evaluation of the kernel function shown to introduce a dense collection of poles and zeroes on the negative real axis. Again, inconsistencies and differences among published aeroelastic root loci and the new 'exact' results are discussed and resolved. In all cases, aeroelastic flutter and divergence speeds and frequencies are in good agreement with published results. The GAAM solution procedure allows complete control over Mach number, velocity, density, and complex frequency. Thus all points on the computed root loci can be matched-point, consistent solutions without recourse to complex mode tracking logic or dataset interpolation, as in the k and p-k solution methods.

Edwards, John W.↗

When and why PINNs fail to train: A neural tangent kernel perspective

Physics-informed neural networks (PINNs) have lately received great attention thanks to their flexibility in tackling a wide range of forward and inverse problems involving partial differential equations. However, despite their noticeable empirical success, little is known about how such constrained neural networks behave during their training via gradient descent. More importantly, even less is known about why such models sometimes fail to train at all. Here in this work, we aim to investigate these questions through the lens of the Neural Tangent Kernel (NTK); a kernel that captures the behavior of fully-connected neural networks in the infinite width limit during training via gradient descent. Specifically, we derive the NTK of PINNs and prove that, under appropriate conditions, it converges to a deterministic kernel that stays constant during training in the infinite-width limit. This allows us to analyze the training dynamics of PINNs through the lens of their limiting NTK and find a remarkable discrepancy in the convergence rate of the different loss components contributing to the total training error. To address this fundamental pathology, we propose a novel gradient descent algorithm that utilizes the eigenvalues of the NTK to adaptively calibrate the convergence rate of the total training error. Finally, we perform a series of numerical experiments to verify the correctness of our theory and the practical effectiveness of the proposed algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

INVESTIGATING THE FEASIBILITY AND STABILITY FOR MODELING ACOUSTIC WAVE SCATTERING USING A TIME-DOMAIN BOUNDARY INTEGRAL EQUATION WITH IMPEDANCE BOUNDARY CONDITION

Reducing aircraft noise is a major objective in the field of computational aeroacoustics. When designing next generation quiet and environmentally friendly aircraft, it is important to be able to accurately and efficiently predict the acoustic scattering by an aircraft body from a given noise source. Acoustic liners are an effective tool for aircraft noise reduction and are characterized by a frequency-dependent impedance. Converted into the time-domain using Fourier transforms, an impedance boundary condition can be used to simulate the acoustic wave scattering by geometric bodies treated with acoustic liners. This work considers using either an impedance or an admittance (inverse of impedance) boundary condition to allow for acoustic scattering problems to be modeled with geometries consisting of both un-lined and lined surfaces. Three acoustic liner models are discussed: the Extended Helmholtz Resonator Model, the Three-Parameter Impedance Model, and the Broadband Impedance Model. In both the Helmholtz and Three-Parameter models, liner impedance is specified at a given frequency, whereas the Broadband model allows for the investigation of multiple frequencies simultaneously. The impedance and admittance boundary conditions for acoustic liners are derived for each model and coupled with a time-domain boundary integral equation. The scattering solution is obtained iteratively using a boundary element method with constant spatial and third-order temporal basis functions. Time-domain boundary integral equations are unfortunately prone to numerical instabilities due to resonant frequencies resulting from non-trivial solutions in the interior domain. When reformulated with the Burton-Miller method, the instabilities are eliminated. Using a Burton-Miller reformulation, the stability of the boundary element method assuming a liner boundary condition is assessed using eigenvalue analysis. The stability of each liner model is discussed, and it is shown that the Three-Parameter and Broadband models are sufficient for modeling an acoustic liner on the surface of scattering bodies. The Helmholtz model demonstrates strict limitations for stability, whereas the Three-Parameter and Broadband models are stable for most cases. Also included in this work is an assessment of the spatial accuracy of the time-domain boundary element method with respect to the surface element basis functions, as well as a performance study of the numerical algorithm.

computational mathematics↗

Validation of MPACT BWR capabilities against critical experiments

Over the years, significant validation work for the neutronics code MPACT has been performed against zero-power critical benchmarks and measured data from operating nuclear power plants. As a part of the Modeling and Analysis of Exelon BWRs for Eigenvalue and Thermal Limits Predictability project, new validation efforts relevant to boiling water reactor (BWR) core applications have been performed. This paper presents the results of the critical experiment portion of the BWR validation efforts for MPACT. The Kritz-4 experiments and IPEN/MB-01 BWR-relevant configurations are modeled with MPACT. The Kritz-4 BWR critical experiments were performed at both cold and hot conditions, which is a unique feature among other critical experiment facilities. The MPACT results with linear source (LS) Method of Characteristics (MOC) have very good agreement with the measured criticality. When using the 60-group BWR library with LS and P2 scattering, the maximum k{sub eff} error is 109 pcm, and the average cold-hot bias is only -0.11 pcm/K. The fission rate distributions of MPACT are also verified with Serpent calculations. For the IPEN facility, two configurations are considered: one with a large central void, and one with a cruciform control rod. The MPACT k{sub eff} errors are less than 50 pcm for all IPEN problems. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

The direct criterion of Newcomb for the ideal MHD stability of an axisymmetric toroidal plasma

A method is presented for determining the ideal magnetohydrodynamic stability of an axisymmetric toroidal plasma, based on a toroidal generalization of the method developed by Newcomb for fixed-boundary modes in a cylindrical plasma. For toroidal mode number n≠0, the stability problem is reduced to the numerical integration of a high-order complex system of ordinary differential equations, the Euler-Lagrange equation for extremizing the potential energy, for the coupled amplitudes of poloidal harmonics m as a function of the radial coordinate ψ in a straight-fieldline flux coordinate system. Unlike the cylindrical case, different poloidal harmonics couple to each other, which introduces coupling between adjacent singular intervals. A boundary condition is used at each singular surface, where m = nq and q(ψ) is the safety factor, to cross the singular surface and continue the solutions beyond it. Fixed-boundary instability is indicated by the vanishing of a real determinant of a Hermitian complex matrix constructed from the fundamental matrix of solutions, the generalization of Newcomb's crossing criterion. In the absence of fixed-boundary instabilities, an M × M plasma response matrix W P with M the number of poloidal harmonics used, is constructed from the Euler-Lagrange solutions at the plasma-vacuum boundary. This is added to a vacuum response matrix W V to form a total response matrix W T . Finally, the existence of negative eigenvalues of W T indicates the presence of free-boundary instabilities. The method is implemented in the fast and accurate DCON code.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A study of the control problem of the shoot side environment delivery system of a closed crop growth research chamber

The details of our initial study of the control problem of the crop shoot environment of a hypothetical closed crop growth research chamber (CGRC) are presented in this report. The configuration of the CGRC is hypothetical because neither a physical subject nor a design existed at the time the study began, a circumstance which is typical of large scale systems control studies. The basis of the control study is a mathematical model which was judged to adequately mimic the relevant dynamics of the system components considered necessary to provide acceptable realism in the representation. Control of pressure, temperature, and flow rate of the crop shoot environment, along with its oxygen, carbon dioxide, and water concentration is addressed. To account for mass exchange, the group of plants is represented in the model by a source of oxygen, a source of water vapor, and a sink for carbon dioxide. In terms of the thermal energy exchange, the group of plants is represented by a surface with an appropriate temperature. Most of the primitive equations about an experimental operating condition and a state variable representation which was extracted from the linearized equations are presented. Next, we present the results of a real Jordan decomposition and the repositioning of an undesirable eigenvalue via full state feedback. The state variable representation of the modeling system is of the nineteenth order and reflects the eleven control variables and eight system disturbances. Five real eigenvalues are very near zero, with one at zero, three having small magnitude positive values, and one having a small magnitude negative value. A Singular Value Decomposition analysis indicates that these non-zero eigenvalues are not results of numerical error.

Blackwell, C. C.↗

CUDA Enabled Graph Subset Examiner

Finding Godsil-McKay switching sets in graphs is one way to demonstrate that a specific graph is not determined by its spectrum--the eigenvalues of its adjacency matrix. An important area of active research in pure mathematics is determining which graphs are determined by their spectra, i.e. when the spectrum of the adjacency matrix uniquely determines the underlying graph. We are interested in exploring the spectra of graphs in the Johnson scheme and specifically seek to determine which of these graphs are determined by their spectra. Given a graph G, a Godsil-McKay switching set is an induced subgraph H on 2k vertices with the following properties: I) H is regular, ii) every vertex in G/H is adjacent to either 0, k, or 2k vertices of H, and iii) at least one vertex in G/H is adjacent to k vertices in H. The software package examines each subset of a user specified size to determine whether or not it satisfies those 3 conditions. The software makes use of the massive parallel processing power of CUDA enabled GPUs. It also exploits the vertex transitivity of graphs in the Johnson scheme by reasoning that if G has a Godsil-McKay switching set, then it has a switching set which includes vertex 1. While the code (in its current state) is tuned to this specific problem, the method of examining each induced subgraph of G can be easily re-written to check for any user specified conditions on the subgraphs and can therefore be used much more broadly.

Johnston, JeremyT.↗

CUDA Enabled Graph Subset Examiner

Finding Godsil-McKay switching sets in graphs is one way to demonstrate that a specific graph is not determined by its spectrum--the eigenvalues of its adjacency matrix. An important area of active research in pure mathematics is determining which graphs are determined by their spectra, i.e. when the spectrum of the adjacency matrix uniquely determines the underlying graph. We are interested in exploring the spectra of graphs in the Johnson scheme and specifically seek to determine which of these graphs are determined by their spectra. Given a graph G, a Godsil-McKay switching set is an induced subgraph H on 2k vertices with the following properties: I) H is regular, ii) every vertex in G/H is adjacent to either 0, k, or 2k vertices of H, and iii) at least one vertex in G/H is adjacent to k vertices in H. The software package examines each subset of a user specified size to determine whether or not it satisfies those 3 conditions. The software makes use of the massive parallel processing power of CUDA enabled GPUs. It also exploits the vertex transitivity of graphs in the Johnson scheme by reasoning that if G has a Godsil-McKay switching set, then it has a switching set which includes vertex 1. While the code (in its current state) is tuned to this specific problem, the method of examining each induced subgraph of G can be easily re-written to check for any user specified conditions on the subgraphs and can therefore be used much more broadly.

Johnston, Jeremy T.↗

Liquid-gas phase transitions and C K symmetry in quantum field theories

A general field-theoretic framework for the treatment of liquid-gas phase transitions is developed. Starting from a fundamental four-dimensional field theory at nonzero temperature and density, an effective three-dimensional field theory is derived. The effective field theory has a sign problem at finite density. Although finite density explicitly breaks charge conjugation C , there remains a symmetry under C K , where K is complex conjugation. Here, we consider four models: relativistic fermions, nonrelativistic fermions, static fermions and classical particles. The interactions are via an attractive potential due to scalar field exchange and a repulsive potential due to massive vector exchange. The field-theoretic representation of the partition function is closely related to the equivalence of the sine-Gordon field theory with a classical gas. The thermodynamic behavior is extracted from C K -symmetric complex saddle points of the effective field theory at tree level. In the cases of nonrelativistic fermions and classical particles, we find complex saddle point solutions but no first-order transitions, and neither model has a ground state at tree level. The relativistic and static fermions show a liquid-gas transition at tree level in the effective field theory. The liquid-gas transition, when it occurs, manifests as a first-order line at low temperature and high density, terminated by a critical end point. The mass matrix controlling the behavior of correlation functions is obtained from fluctuations around the saddle points. Due to the C K symmetry of the models, the eigenvalues of the mass matrix are not always real but can be complex. This then leads to the existence of disorder lines, which mark the boundaries where the eigenvalues go from purely real to complex. The regions where the mass matrix eigenvalues are complex are associated with the critical line. In the case of static fermions, a powerful duality between particles and holes allows for the analytic determination of both the critical line and the disorder lines. Depending on the values of the parameters, either zero, one, or two disorder lines are found. Our numerical results for relativistic fermions give a very similar picture.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Ex-Core Radiation Transport Modeling with VERA User Manual

It is important to be able to accurately predict the neutron flux outside the immediate reactor core for a variety of safety and material analyses. Monte Carlo radiation transport calculations are required to produce these high–fidelity ex-core responses. The Virtual Environment for Reactor Applications (VERA) provides the automated capability to launch independent Shift fixed-source and eigenvalue Monte Carlo (MC) calculations for user-specified state points during a standard Virtual Environment for Reactor Applications (VERA) calculation. VERA couples MPACT with COBRA-TF (CTF) to Shift to perform ex-core tallies for multiple state points concurrently, with each component capable of parallel execution on independent processor domains. In these ex-core calculations, MPACT is coupled to CTF and performs the in-core depletion and heat transfer calculation, followed by a fixed-source Shift transport calculation including ex-core regions to produce ex-core responses. The fission source, fuel pin temperatures, moderator temperature and density, boron concentration, and fuel pin depleted isotopic compositions can be transferred to Shift from the MPACT calculation. Specifically, VERA performs fluence calculations in the core barrel outward to the end of the pressure vessel and detector response calculations in ex-core detectors. It also performs the requested tallies in any user-defined ex-core regions. VERA takes advantage of the General Geometry (GG) package in Shift. This gives VERA the flexibility to explicitly model features outside the core barrel, including detailed vessel models, detectors, and power plant details. A very limited set of experimental and numerical benchmarks is available for ex-core simulation comparison. The Consortium for Advanced Simulation of Light Water Reactors has developed a set of ex-core benchmark problems to include as part of the VERA verification and validation set of problems. The ex-core capability in VERA has been tested on small representative assembly problems, multi-assembly problems, as well as quarter-core and full-core problems. VERA View has also been extended to visualize these vessel fluence results from VERA. This manual serves to present a guide to VERA users about the methodology behind ex-core calculations and the details of input, output, and analysis of results from these calculations. Details in this version of the manual are based on features in VERA 4.0.1.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗