Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group
  • Applied Spectroscopy
  • Vol. 46,
  • Issue 1,
  • pp. 176-178
  • (1992)

ESR Spectrum Simulation: The Simplex Algorithm with Quadratic Convergence and Error Estimation

Not Accessible

Your library or personal account may give you access

Abstract

The simplex algorithm is a natural choice in applications requiring the analysis of spectra by curve fitting. The kinds of spectra which have been analyzed in this way include: positron lifetime spectra, NMR spectra for which overlap of lines made the use of the computer program LAOCN3 unsuitable, energy dispersion spectra, Mössbauer spectra, spectra recorded with the use of heterodyne detection, and spectra consisting of multiple overlapping Gaussian components. Beckwith and Brumby used the simplex algorithm to simulate ESR spectra with the aim of determining the spectral parameters precisely. They applied their method to the analysis of ESR spectra of free radicals in solution, but stressed the generality of the method. Fajer <i>et al.</i> similarly used the simplex algorithm for the fitting of ESR spectra.

PDF Article
More Like This
Iterative deconvolution algorithm with quadratic convergence

C. E. Morris, M. A. Richards, and M. H. Hayes
J. Opt. Soc. Am. A 4(1) 200-207 (1987)

Multiresolution, error-convergence halftone algorithm

Eli Peli
J. Opt. Soc. Am. A 8(4) 625-636 (1991)

Convergence of a Spectrum Shaping Algorithm

B. Liu and N. C. Gallagher
Appl. Opt. 13(11) 2470-2471 (1974)

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All Rights Reserved