Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “convergence”

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,549 records · Page 86

Fundamental investigations of the finite element solutions for acoustic propagation in ducts

The question of convergence of three finite element algorithms for the modelling of acoustic transmission in ducts carrying a nonuniform mean flow is addressed. The details of each algorithm are stated and example calculations in uniform and nonuniform ducts are made and assessed for accuracy and convergence. The algorithm based on the assumption of irrotationality is found to be highly convergent. This algorithm is the one used in current turbo-fan inlet acoustic radiation codes. A theoretical analysis indicating convergence is supported by example calculations. Two additional algorithms which do not require irrotationality are found to be less convergent, and perhaps not convergent at all for certain severely sheared velocity profiles. No theoretical convergence criteria can presently be established for these algorithms and convergence difficulties are shown here by example. Included in this class of algorithms is the duct analysis program ADAM which is known to display apparently nonconvergent solutions in certain cases.

Walkington, N. J.↗

Notes on Accuracy of Finite-Volume Discretization Schemes on Irregular Grids

Truncation-error analysis is a reliable tool in predicting convergence rates of discretization errors on regular smooth grids. However, it is often misleading in application to finite-volume discretization schemes on irregular (e.g., unstructured) grids. Convergence of truncation errors severely degrades on general irregular grids; a design-order convergence can be achieved only on grids with a certain degree of geometric regularity. Such degradation of truncation-error convergence does not necessarily imply a lower-order convergence of discretization errors. In these notes, irregular-grid computations demonstrate that the design-order discretization-error convergence can be achieved even when truncation errors exhibit a lower-order convergence or, in some cases, do not converge at all.

Diskin, Boris↗

A nonlinearly preconditioned conjugate gradient algorithm for rank‐ R canonical tensor approximation

Summary Alternating least squares (ALS) is often considered the workhorse algorithm for computing the rank‐ R canonical tensor approximation, but for certain problems, its convergence can be very slow. The nonlinear conjugate gradient (NCG) method was recently proposed as an alternative to ALS, but the results indicated that NCG is usually not faster than ALS. To improve the convergence speed of NCG, we consider a nonlinearly preconditioned NCG (PNCG) algorithm for computing the rank‐ R canonical tensor decomposition. Our approach uses ALS as a nonlinear preconditioner in the NCG algorithm. Alternatively, NCG can be viewed as an acceleration process for ALS. We demonstrate numerically that the convergence acceleration mechanism in PNCG often leads to important pay‐offs for difficult tensor decomposition problems, with convergence that is significantly faster and more robust than for the stand‐alone NCG or ALS algorithms. We consider several approaches for incorporating the nonlinear preconditioner into the NCG algorithm that have been described in the literature previously and have met with success in certain application areas. However, it appears that the nonlinearly PNCG approach has received relatively little attention in the broader community and remains underexplored both theoretically and experimentally. Thus, this paper serves several additional functions, by providing in one place a concise overview of several PNCG variants and their properties that have only been described in a few places scattered throughout the literature, by systematically comparing the performance of these PNCG variants for the tensor decomposition problem, and by drawing further attention to the usefulness of nonlinearly PNCG as a general tool. In addition, we briefly discuss the convergence of the PNCG algorithm. In particular, we obtain a new convergence result for one of the PNCG variants under suitable conditions, building on known convergence results for non‐preconditioned NCG. Copyright © 2014 John Wiley & Sons, Ltd.

Sterck, Hans De↗

Removing Basis Set Incompleteness Error in Finite-Temperature Electronic Structure Calculations: Two-Electron Systems

We investigate the basis-set-size dependence for quantities related to interacting electrons in the canonical ensemble. Calculations are performed using exact diagonalization (finite temperature full configuration interaction method) on two-electron model systems–the uniform electron gas (UEG) and the helium atom. Our data reproduce previous observations of a competition for how the internal energy converges between the ground-state correlation energy and the high-temperature kinetic energy. We explore how this can be related to component parts of the internal energy including kinetic, exchange, and correlation energies and show there is surprising nuance in how this can be broken down into mostly monotonically converging quantities. We also show that separation of the free energy into a free energy with/without correlation allows for monotonic convergence with basis set size due to the variational principle. We find that the free energy convergence matches the previously observed convergence properties of the internal energy. We discuss the free energy divergence that happens when converging a finite basis analytical hydrogen atom to the complete basis set limit and compare this to the energies of a helium atom in a large periodic box. Reducing the box size, we saw convergence trends for the helium atom that were similar to the UEG.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Temperature dependence of the electronic structure of semiconductors and insulators

The renormalization of electronic eigenenergies due to electron-phonon coupling (temperature dependence and zero-point motion effect) is sizable in many materials with light atoms. This effect, often neglected in ab initio calculations, can be computed using the perturbation-based Allen-Heine-Cardona theory in the adiabatic or non-adiabatic harmonic approximation. After a short description of the recent progresses in this field and a brief overview of the theory, we focus on the issue of phonon wavevector sampling convergence, until now poorly understood. Indeed, the renormalization is obtained numerically through a slowly converging q-point integration. For non-zero Born effective charges, we show that a divergence appears in the electron-phonon matrix elements at q → Γ, leading to a divergence of the adiabatic renormalization at band extrema. This problem is exacerbated by the slow convergence of Born effective charges with electronic wavevector sampling, which leaves residual Born effective charges in ab initio calculations on materials that are physically devoid of such charges. Here, we propose a solution that improves this convergence. However, for materials where Born effective charges are physically non-zero, the divergence of the renormalization indicates a breakdown of the adiabatic harmonic approximation, which we assess here by switching to the non-adiabatic harmonic approximation. Also, we study the convergence behavior of the renormalization and develop reliable extrapolation schemes to obtain the converged results. Finally, the adiabatic and non-adiabatic theories, with corrections for the slow Born effective charge convergence problem (and the associated divergence) are applied to the study of five semiconductors and insulators: α-AlN, β-AlN, BN, diamond, and silicon. For these five materials, we present the zero-point renormalization, temperature dependence, phonon-induced lifetime broadening, and the renormalized electronic band structure.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Microbiome dynamics in the congregate environment of U.S. Army Infantry training

Within military training and operational environments, individuals from diverse backgrounds share common spaces, follow structured routines and diets, and engage in physically demanding tasks. While there has been interest in leveraging microbiome features to predict and improve military health and performance, the longitudinal convergence of microbiomes in such constrained environments has not been established. To assess the degree of microbiome convergence, we performed shotgun metagenomic sequencing on swab samples from a military trainee cohort. Samples were taken across four different body sites, three timepoints, and two spatially distinct platoons. We observed evidence of convergence in one platoon, whereby similarity in microbiome composition increased over time, with numerous differentially abundant species. We found no indication of strain transfer between individuals, suggesting that convergence was influenced by external environmental factors, diet, and lifestyle. Microbial shifts observed in the convergence process included a decrease in fungal species, such as Malassezia restricta in nasal cavities, and a decrease in Prevotella species at inguinal regions across time. Shifts in multiple Corynebacterium species were also observed with varying magnitudes depending on the body site. Overall, we provide preliminary evidence of convergence of host microbial communities in military-associated environments that were distinguishable using shotgun metagenomic sequencing approaches. The data presented here on microbiome convergence, dynamics, and stability may inform risk-based mitigation in congregate military settings facilitating development of targeted microbial, dietary, or other interventions to optimize health and performance of military populations.

Biological and medical sciences↗

Analysis of the SiMPL Method for Density-Based Topology Optimization

We present a rigorous convergence analysis of a new method for density-based topology optimization that provides pointwise bound-preserving design updates and faster convergence than other popular first-order topology optimization methods. Due to its strong bound preservation, the method is exceptionally robust, as demonstrated in numerous examples here and in the companion article [D. Kim et al., Struct. Multidiscip. Optim., 68 (2025), 74]. Furthermore, it is easy to implement with clear structure and analytical expressions for the updates. Our analysis covers two versions of the method, characterized by the employed line search strategies. We consider a modified Armijo backtracking line search and a Bregman backtracking line search. For both line search algorithms, our algorithm delivers a strict monotone decrease in the objective function and further intuitive convergence properties, e.g., strong and pointwise convergence of the density variables on the active sets, norm convergence to zero of the increments, convergence of the Lagrange multipliers, and more. In addition, the numerical experiments demonstrate apparent mesh-independent convergence of the algorithm. Here, we refer to the new algorithm as the SiMPL method (pronounced “simple”), which stands for Sigmoidal Mirror descent with a Projected Latent variable.

97 MATHEMATICS AND COMPUTING↗

Lack of robustness and accuracy of many numerical schemes for phase-field simulations

In this paper, we study the stability, accuracy and convergence behavior of various numerical schemes for phase-field modeling through a simple ODE model. Both theoretical analysis and numerical experiments are carried out on this ODE model to demonstrate the limitation of most numerical schemes that have been used in practice. One main conclusion is that the first-order fully implicit scheme is the only robust algorithm for phase-field simulations while all other schemes (that have been analyzed) may have convergence issue if the time step size is not exceedingly small. More specifically, by rigorous analysis in most cases, we have the following conclusions: (i) The first-order fully implicit scheme converges to the correct steady state solution for all time step sizes. In the case of multiple solutions, one of the solution branches always converges to the correct steady state solution. (ii) The first-order convex splitting scheme, which is equivalent to the first-order fully implicit scheme with a different time scaling, always converges to the correct steady state solution but may seriously lack numerical accuracy for transient solutions. (iii) For the second-order fully implicit and convex splitting schemes, for any time step size $δt > 0$, there exists an initial condition $u_0$ , with $|u_0| > 1$, such that the numerical solution converges to the wrong steady state solution. (iv) For $|u_0|$ ≤ 1, all second-order schemes studied in this paper converge to the correct steady state solution although severe numerical oscillations occur for most of them if the time step size is not sufficiently small. (v) An unconditionally energy-stable scheme (such as the modified Crank–Nicolson scheme) is not necessarily better than a conditionally energy-stable scheme (such as the Crank–Nicolson scheme). Finally, most, if not all, of the above conclusions are expected to be true for more general Allen–Cahn and other phase-field models.

97 MATHEMATICS AND COMPUTING↗

Modeling of Rolling Element Bearing Mechanics: Computer Program Updates

The Rolling Element Bearing Analysis System (REBANS) extends the capability available with traditional quasi-static bearing analysis programs by including the effects of bearing race and support flexibility. This tool was developed under contract for NASA-MSFC. The initial version delivered at the close of the contract contained several errors and exhibited numerous convergence difficulties. The program has been modified in-house at MSFC to correct the errors and greatly improve the convergence. The modifications consist of significant changes in the problem formulation and nonlinear convergence procedures. The original approach utilized sequential convergence for nested loops to achieve final convergence. This approach proved to be seriously deficient in robustness. Convergence was more the exception than the rule. The approach was changed to iterate all variables simultaneously. This approach has the advantage of using knowledge of the effect of each variable on each other variable (via the system Jacobian) when determining the incremental changes. This method has proved to be quite robust in its convergence. This technical memorandum documents the changes required for the original Theoretical Manual and User's Manual due to the new approach.

Ryan, S. G.↗

Solving Upwind-Biased Discretizations: Defect-Correction Iterations

This paper considers defect-correction solvers for a second order upwind-biased discretization of the 2D convection equation. The following important features are reported: (1) The asymptotic convergence rate is about 0.5 per defect-correction iteration. (2) If the operators involved in defect-correction iterations have different approximation order, then the initial convergence rates may be very slow. The number of iterations required to get into the asymptotic convergence regime might grow on fine grids as a negative power of h. In the case of a second order target operator and a first order driver operator, this number of iterations is roughly proportional to h-1/3. (3) If both the operators have the second approximation order, the defect-correction solver demonstrates the asymptotic convergence rate after three iterations at most. The same three iterations are required to converge algebraic error below the truncation error level. A novel comprehensive half-space Fourier mode analysis (which, by the way, can take into account the influence of discretized outflow boundary conditions as well) for the defect-correction method is developed. This analysis explains many phenomena observed in solving non-elliptic equations and provides a close prediction of the actual solution behavior. It predicts the convergence rate for each iteration and the asymptotic convergence rate. As a result of this analysis, a new very efficient adaptive multigrid algorithm solving the discrete problem to within a given accuracy is proposed. Numerical simulations confirm the accuracy of the analysis and the efficiency of the proposed algorithm. The results of the numerical tests are reported.

Diskin, Boris↗

Comparison of Node-Centered and Cell-Centered Unstructured Finite-Volume Discretizations: Inviscid Fluxes

Cell-centered and node-centered approaches have been compared for unstructured finite-volume discretization of inviscid fluxes. The grids range from regular grids to irregular grids, including mixed-element grids and grids with random perturbations of nodes. Accuracy, complexity, and convergence rates of defect-correction iterations are studied for eight nominally second-order accurate schemes: two node-centered schemes with weighted and unweighted least-squares (LSQ) methods for gradient reconstruction and six cell-centered schemes two node-averaging with and without clipping and four schemes that employ different stencils for LSQ gradient reconstruction. The cell-centered nearest-neighbor (CC-NN) scheme has the lowest complexity; a version of the scheme that involves smart augmentation of the LSQ stencil (CC-SA) has only marginal complexity increase. All other schemes have larger complexity; complexity of node-centered (NC) schemes are somewhat lower than complexity of cell-centered node-averaging (CC-NA) and full-augmentation (CC-FA) schemes. On highly anisotropic grids typical of those encountered in grid adaptation, discretization errors of five of the six cell-centered schemes converge with second order on all tested grids; the CC-NA scheme with clipping degrades solution accuracy to first order. The NC schemes converge with second order on regular and/or triangular grids and with first order on perturbed quadrilaterals and mixed-element grids. All schemes may produce large relative errors in gradient reconstruction on grids with perturbed nodes. Defect-correction iterations for schemes employing weighted least-square gradient reconstruction diverge on perturbed stretched grids. Overall, the CC-NN and CC-SA schemes offer the best options of the lowest complexity and secondorder discretization errors. On anisotropic grids over a curved body typical of turbulent flow simulations, the discretization errors converge with second order and are small for the CC-NN, CC-SA, and CC-FA schemes on all grids and for NC schemes on triangular grids; the discretization errors of the CC-NA scheme without clipping do not converge on irregular grids. Accurate gradient reconstruction can be achieved by introducing a local approximate mapping; without approximate mapping, only the NC scheme with weighted LSQ method provides accurate gradients. Defect correction iterations for the CC-NA scheme without clipping diverge; for the NC scheme with weighted LSQ method, the iterations either diverge or converge very slowly. The best option in curved geometries is the CC-SA scheme that offers low complexity, second-order discretization errors, and fast convergence.

Diskin, Boris↗

Krylov iterative methods and synthetic acceleration for transport in binary statistical media

In particle transport applications there are numerous physical constructs in which heterogeneities are randomly distributed. The quantity of interest in these problems is the ensemble average of the flux, or the average of the flux over all possible material 'realizations.' The Levermore-Pomraning closure assumes Markovian mixing statistics and allows a closed, coupled system of equations to be written for the ensemble averages of the flux in each material. Generally, binary statistical mixtures are considered in which there are two (homogeneous) materials and corresponding coupled equations. The solution process is iterative, but convergence may be slow as either or both materials approach the diffusion and/or atomic mix limits. A three-part acceleration scheme is devised to expedite convergence, particularly in the atomic mix-diffusion limit where computation is extremely slow. The iteration is first divided into a series of 'inner' material and source iterations to attenuate the diffusion and atomic mix error modes separately. Secondly, atomic mix synthetic acceleration is applied to the inner material iteration and S{sub 2} synthetic acceleration to the inner source iterations to offset the cost of doing several inner iterations per outer iteration. Finally, a Krylov iterative solver is wrapped around each iteration, inner and outer, to further expedite convergence. A spectral analysis is conducted and iteration counts and computing cost for the new two-step scheme are compared against those for a simple one-step iteration, to which a Krylov iterative method can also be applied.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Second Order Self-Consistent IMEX Method for Radiation Hydrodynamics

We present a second order non-linearly consistent implicit/explicit (methods that use com- bination of implicit/explicit discretizations are often referred to as IMEX (IMplicit/EXplicit) methods [2,1,3]) time integration technique for solving radiation hydrodynamics problems. The idea is to hybridize an implicit and an explicit discretization in a nonlinearly consis- tent way in order to achieve second order time convergent calculations. In this scope, the hydrodynamics equations are discretized explicitly making use of the capability of well- understood explicit schemes. On the other hand , the radiation diffusion part is solved implicitly. In the view of the non-linearly consistent IMEX method, the hydrodynamics equations are solved as part of the non-linear function evaluation within the framework of the Jacobian-Free Newton Krylov (JFNK) method [16,14]. This is to avoid order reductions in time convergence due to the operator splitting. We present results from several test prob- lems in order to validate the numerical order of the scheme. For each test, we established second order time convergence.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

A second-order 3D electromagnetics algorithm for curved interfaces between anisotropic dielectrics on a Yee mesh

A new frequency-domain electromagnetics algorithm is developed for simulating curved interfaces between anisotropic dielectrics embedded in a Yee mesh with second-order error in resonant frequencies. The algorithm is systematically derived using the finite integration formulation of Maxwell's equations on the Yee mesh. Second-order convergence of the error in resonant frequencies is achieved by guaranteeing first-order error on dielectric boundaries and second-order error in bulk (possibly anisotropic) regions. Convergence studies, conducted for an analytically solvable problem and for a photonic crystal of ellipsoids with anisotropic dielectric constant, both show second-order convergence of frequency error; the convergence is sufficiently smooth that Richardson extrapolation yields roughly third-order convergence. The convergence of electric fields near the dielectric interface for the analytic problem is also presented.

97 MATHEMATICS AND COMPUTING↗

Three-dimensional simulations of low foot and high foot implosion experiments on the National Ignition Facility

In order to achieve the several hundred Gbar stagnation pressures necessary for inertial confinement fusion ignition, implosion experiments on the National Ignition Facility (NIF) [E. I. Moses et al., Phys. Plasmas 16, 041006 (2009)] require the compression of deuterium-tritium fuel layers by a convergence ratio as high as forty. Such high convergence implosions are subject to degradation by a range of perturbations, including the growth of small-scale defects due to hydrodynamic instabilities, as well as longer scale modulations due to radiation flux asymmetries in the enclosing hohlraum. Due to the broad range of scales involved, and also the genuinely three-dimensional (3D) character of the flow, accurately modeling NIF implosions remains at the edge of current simulation capabilities. This paper describes the current state of progress of 3D capsule-only simulations of NIF implosions aimed at accurately describing the performance of specific NIF experiments. Current simulations include the effects of hohlraum radiation asymmetries, capsule surface defects, the capsule support tent and fill tube, and use a grid resolution shown to be converged in companion two-dimensional simulations. The results of detailed simulations of low foot implosions from the National Ignition Campaign are contrasted against results for more recent high foot implosions. While the simulations suggest that low foot performance was dominated by ablation front instability growth, especially the defect seeded by the capsule support tent, high foot implosions appear to be dominated by hohlraum flux asymmetries, although the support tent still plays a significant role. For both implosion types, the simulations show reasonable, though not perfect, agreement with the data and suggest that a reliable predictive capability is developing to guide future implosions toward ignition.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

The near vacuum hohlraum campaign at the NIF: A new approach

The near vacuum campaign on the National Ignition Facility has concentrated its efforts over the last year on finding the optimum target geometry to drive a symmetric implosion at high convergence ratio (30x). As the hohlraum walls are not tamped with gas, the hohlraum is filling with gold plasma and the challenge resides in depositing enough energy in the hohlraum before it fills up. Hohlraum filling is believed to cause symmetry swings late in the pulse that are detrimental to the symmetry of the hot spot at high convergence. This paper describes a series of experiments carried out to examine the effect of increasing the distance between the hohlraum wall and the capsule (case to capsule ratio) on the symmetry of the hot spot. These experiments have shown that smaller Case to Capsule Ratio (CCR of 2.87 and 3.1) resulted in oblate implosions that could not be tuned round. Larger CCR (3.4) led to a prolate implosion at convergence 30x implying that inner beam propagation at large CCR is not impeded by the expanding hohlraum plasma. A Case to Capsule ratio of 3.4 is a promising geometry to design a round implosion but in a smaller hohlraum where the hohlraum losses are lower, enabling a wider cone fraction range to adjust symmetry.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Impact of post-Born lensing on the CMB

Lensing of the CMB is affected by post-Born lensing, producing corrections to the convergence power spectrum and introducing field rotation. We show numerically that the lensing convergence power spectrum is affected at the ∼< 0.2% level on accessible scales, and that this correction and the field rotation are negligible for observations with arcminute beam and noise levels ∼> 1 μK arcmin. The field rotation generates ∼ 2.5% of the total lensing B-mode polarization amplitude (0.2% in power on small scales), but has a blue spectrum on large scales, making it highly subdominant to the convergence B modes on scales where they are a source of confusion for the signal from primordial gravitational waves. Since the post-Born signal is non-linear, it also generates a bispectrum with the convergence. We show that the post-Born contributions to the bispectrum substantially change the shape predicted from large-scale structure non-linearities alone, and hence must be included to estimate the expected total signal and impact of bispectrum biases on CMB lensing reconstruction quadratic estimators and other observables. The field-rotation power spectrum only becomes potentially detectable for noise levels || 1 μK arcmin, but its bispectrum with the convergence may be observable at ∼ 3σ with Stage IV observations. Rotation-induced and convergence-induced B modes are slightly correlated by the bispectrum, and the bispectrum also produces additional contributions to the lensed BB power spectrum.

79 ASTRONOMY AND ASTROPHYSICS↗

Efficient Levenberg-Marquardt minimization of the maximum likelihood estimator for Poisson deviates

Histograms of counted events are Poisson distributed, but are typically fitted without justification using nonlinear least squares fitting. The more appropriate maximum likelihood estimator (MLE) for Poisson distributed data is seldom used. We extend the use of the Levenberg-Marquardt algorithm commonly used for nonlinear least squares minimization for use with the MLE for Poisson distributed data. In so doing, we remove any excuse for not using this more appropriate MLE. We demonstrate the use of the algorithm and the superior performance of the MLE using simulations and experiments in the context of fluorescence lifetime imaging. Scientists commonly form histograms of counted events from their data, and extract parameters by fitting to a specified model. Assuming that the probability of occurrence for each bin is small, event counts in the histogram bins will be distributed according to the Poisson distribution. We develop here an efficient algorithm for fitting event counting histograms using the maximum likelihood estimator (MLE) for Poisson distributed data, rather than the non-linear least squares measure. This algorithm is a simple extension of the common Levenberg-Marquardt (L-M) algorithm, is simple to implement, quick and robust. Fitting using a least squares measure is most common, but it is the maximum likelihood estimator only for Gaussian-distributed data. Non-linear least squares methods may be applied to event counting histograms in cases where the number of events is very large, so that the Poisson distribution is well approximated by a Gaussian. However, it is not easy to satisfy this criterion in practice - which requires a large number of events. It has been well-known for years that least squares procedures lead to biased results when applied to Poisson-distributed data; a recent paper providing extensive characterization of these biases in exponential fitting is given. The more appropriate measure based on the maximum likelihood estimator (MLE) for the Poisson distribution is also well known, but has not become generally used. This is primarily because, in contrast to non-linear least squares fitting, there has been no quick, robust, and general fitting method. In the field of fluorescence lifetime spectroscopy and imaging, there have been some efforts to use this estimator through minimization routines such as Nelder-Mead optimization, exhaustive line searches, and Gauss-Newton minimization. Minimization based on specific one- or multi-exponential models has been used to obtain quick results, but this procedure does not allow the incorporation of the instrument response, and is not generally applicable to models found in other fields. Methods for using the MLE for Poisson-distributed data have been published by the wider spectroscopic community, including iterative minimization schemes based on Gauss-Newton minimization. The slow acceptance of these procedures for fitting event counting histograms may also be explained by the use of the ubiquitous, fast Levenberg-Marquardt (L-M) fitting procedure for fitting non-linear models using least squares fitting (simple searches obtain {approx}10000 references - this doesn't include those who use it, but don't know they are using it). The benefits of L-M include a seamless transition between Gauss-Newton minimization and downward gradient minimization through the use of a regularization parameter. This transition is desirable because Gauss-Newton methods converge quickly, but only within a limited domain of convergence; on the other hand the downward gradient methods have a much wider domain of convergence, but converge extremely slowly nearer the minimum. L-M has the advantages of both procedures: relative insensitivity to initial parameters and rapid convergence. Scientists, when wanting an answer quickly, will fit data using L-M, get an answer, and move on. Only those that are aware of the bias issues will bother to fit using the more appropriate MLE for Poisson deviates. However, since there is a simple, analytical formula for the appropriate MLE measure for Poisson deviates, it is inexcusable that least squares estimators are used almost exclusively when fitting event counting histograms. There have been ways found to use successive non-linear least squares fitting to obtain similarly unbiased results, but this procedure is justified by simulation, must be re-tested when conditions change significantly, and requires two successive fits. There is a great need for a fitting routine for the MLE estimator for Poisson deviates that has convergence domains and rates comparable to the non-linear least squares L-M fitting. We show in this report that a simple way to achieve that goal is to use the L-M fitting procedure not to minimize the least squares measure, but the MLE for Poisson deviates.

59 BASIC BIOLOGICAL SCIENCES↗