Computing interval parameter bounds from fallible...

Data processing: structural design – modeling – simulation – and em – Modeling by mathematical expression

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

10620973

ABSTRACT:
One embodiment of the present invention provides a system that computes interval parameter bounds from fallible measurements. During operation, the system receives a set of measurements z1, . . . , zn, wherein an observation model describes each zias a function of a p-element vector parameter x=(x1, . . . , xp). Next, the system forms a system of nonlinear equations zi−h(x)=0 (i=1, . . . , n) based on the observation model. Finally, the system solves the system of nonlinear equations to determine interval parameter bounds on x.

REFERENCES:
Author unknown; Interval Arithmetic in High Performance Technical Computing; Sun Microsystems White Paper obtained from Assignee's website; pp. 1-6, 2002.
Walster; Interval and HPC; slides presented Nov. 4, 2000, pp. 1-21.
Publication: “Design, implementation and evaluation of the constraint language cc (FD)” by Pascal Van Hentenryck et al., The Journal of Logic Programming 37, 1998, pp. 139-164.
E.R. Hansen, “Global Optimization Using Interval Analysis,” Marcel Dekker, Inc., New York, NY, 1992.
R.B. Kearfott, “A Fortran 90 Environment for Research and Prototyping of Enclosure Algorithms for Nonlinear Equations and Global Optimization,” ACM Transactions on Mathematical Software, vol. 21, No. 1, Mar. 1995, pp. 63-78 http://interval.louisiana.edu/preprints.html.
R. B. Kearfott, Algorithm 763: Interval Arithmetic: A Fortran 90 Module for an Interval Data Type, ACM Trans. Math. Software, 22, vol. 4, 1996, pp. 385-392. http://interval.louisiana.edu/preprints.html.
R. B. Kearfott and M. Novoa III, “Algorithm 681: INTBIS, A portable interval Newton/bisection package”, ACM Trans. Math Software, vol. 16, No. 2, pp. 152-147, http://www.netlib.org/toms/681, no date.
R. B. Kearfott, M. Dawande, K.S. Du, and C. Hu, “Algorithm 737: INTLIB: A Portable Fortran 737 Interval Standard Function Library,” ACM Trans. Math. Software, 20, vol. 4, Dec. 1994, pp. 447-458.
R. B. Kearfott and G.W. Walster, “On Stopping Criteria in Verified Nonlinear Systems or Optimization Algorithms,” ACM Trans. Math. Software, 26, vol. 3, Sep. 2000, pp. 323-351. The publication itself says Received: Jul. 1999; revised: Mar. 2000; accepted: Mar. 2000. http://interval.louisiana.edu/preprints.html.
R.E. Moore and S.T. Jones “Safe Starting Regions for Iterative Methods”, SIAM Journal on Numerical Analysis, vol. 14, No. 6 (Dec. 1977), pp. 1051-1065.
A. Neumaier, “The Enclosure of Solutions of Parameter-Dependent Systems of Euqations,” Cambridge University Press, Cambridge, 1990, ISBN: 0-12-505630-3, Reliability in Computing pp. 269-286.
S.M. Rump, “Verification Methods for Dense and Sparse Systems of Equations,”in Topics in Validated Computations: Proceedings of the IMACS-GAMM International Workshop on Validated Computations, University of Oldenburg, J. Herzberger, ed., Elsevier Studies in Computational Mathematics, Elsevier, 1994, pp. 63-136.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Computing interval parameter bounds from fallible... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Computing interval parameter bounds from fallible..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing interval parameter bounds from fallible... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3758482

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.