首页> 外文期刊>reliable computing >Robust algorithms that locate local extrema of a function of one variable from interval measurement results: A remark
【24h】

Robust algorithms that locate local extrema of a function of one variable from interval measurement results: A remark

机译:Robust algorithms that locate local extrema of a function of one variable from interval measurement results: A remark

获取原文
       

摘要

The problem of locating local maxima and minima of a function from approximate measurement results is vital for many physical applications: inspectral analysis, chemical species are identified by locating local maxima of the spectra; inradioastronomy, sources of celestial radio emission, and their subcomponents, are identified by locating local maxima of the measured brightness of the radio sky;elementary particlesare identified by locating local maxima of the experimental curves. Since measurements are never absolutely precise, as a result of the measurements, we have aclassof possible functions. If we measuref(xi) with interval uncertainty, this class consists of all functionsffor whichf(xi) ε yi−ɛ, yi+ɛ, whereyiare the results of measuringf(xi), andεis the measurement accuracy. For this class, in 2, a linear-time algorithm was desc

著录项

  • 来源
    《reliable computing》 |1996年第3期|213-218|共页
  • 作者

    Ch.Eick; KarenVillaverde;

  • 作者单位

    University of Houston;

    Northern Telecom/Bell Northern Research M/S D0-207;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 英语
  • 中图分类
  • 关键词

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号