课题基金 / 基金详情

Model Discovery and Verification With Symbolic, Hybrid Symbolic-Numeric and Parallel Computation

Model Discovery and Verification With Symbolic, Hybrid Symbolic-Numeric and Parallel Computation
使用符号、混合符号数值和并行计算进行模型发现和验证
批准号:
0830347
负责人:
Erich Kaltofen
金额:
$30.0万
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
2008
资助国家:
美国
项目状态:
已结题
起止时间:
2008-09-01 至 2012-08-31

项目摘要

项目成果

Erich Kaltofen的其他基金

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
ABSTRACT:A mathematical model for a natural (e.g., the heart beat of ahuman) or man-made process (e.g., the radio wave of a wirelesssignal) is a mathematical expression or an algorithm that onevaluation of system parameters (such as a point in time) yieldsa model value (e.g., the amplitude of a wave). Models arecreated by understanding the process, which suggests the formof the expression, and by observing and measuring an actualprocess. From those data points the best model is fitted bya computation. Erich Kaltofen studies both how to fit to datacertain models, such as fractions of sparse polynomials, andthen how to certify that the computation has produced the bestpossible model. The algorithms for creation of best fits andsubsequent certification of optimality can be compute-intensiveand require multi-processor computing environments.Erich Kaltofen and his students and collaborators will designalgorithms for symbolic models such as sparse multivariaterational functions and formulas with very large and evenparametric exponents. Our algorithms can work with both exactand approximate data, the latter by hybrid symbolic/numerictechniques. Computation with floating point scalars requiresa new kind of probabilistic analysis when randomization isapplied, and we will make use of recent results on estimatingthe spectra and condition numbers of random matrices. Oneapplication of such randomization is the efficient solutionof highly under- and overdetermined dense linear systems.A new alternative to error analysis is the exact validation viasymbolic computation of the global optimality of our approximatesolutions. Semidefinite programming and Newton refinementare used to compute a numerical sum-of-squares representation,which is converted to an exact rational identity for a nearbyrational lower bound. Since the exact certificates leave nodoubt, the numeric heuristics need not be fully analyzed.We will search for rationalizations that can validate verylarge sums-of-squares and hence apply to large inputs. We willdevelop parallel and distribute computing tools for the arisingsymbolic and hybrid symbolic-numeric computation tasks.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
AF: Small: Symbolic Computation with Certificates, Sparsity and Error Correction
  • 批准号:
    1717100
  • 项目类别:
    Standard Grant
  • 资助金额:
    $49.64万
  • 财政年份:
    2017
  • 负责人:
    Erich Kaltofen
  • 依托单位:
AF: Small: Symbolic computation with sparsity, error checking and error correction
  • 批准号:
    1421128
  • 项目类别:
    Standard Grant
  • 资助金额:
    $46.99万
  • 财政年份:
    2014
  • 负责人:
    Erich Kaltofen
  • 依托单位:
AF: Small: Efficient Exact/Certified Symbolic Computation By Hybrid Symbolic-Numeric and Parallel Methods
  • 批准号:
    1115772
  • 项目类别:
    Standard Grant
  • 资助金额:
    $42.5万
  • 财政年份:
    2011
  • 负责人:
    Erich Kaltofen
  • 依托单位:
Workshop on Advanced Cyber-Enabled Discovery & Innovation (CDI) Through Symbolic and Numeric Computation
  • 批准号:
    0751501
  • 项目类别:
    Standard Grant
  • 资助金额:
    $0.0万
  • 财政年份:
    2007
  • 负责人:
    Erich Kaltofen
  • 依托单位:
海外基金