MULTIDIMENSIONAL UNCERTAINTY ANALYSIS
Field of the Invention
This invention relates to analysis of simultaneous variation of one or more random variables, representing device structure or manufacturing process characteristics (parameters), and to applications of the results to statistical analysis of semiconductor device behavior and semiconductor fabrication processes. Background of the Invention Since the early 1960s, technology simulation has played a crucial role in the evolution of semiconductor integrated circuit (IC) technology. The initial simulation of fundamental operating principles of key structures, for example, bipolar and MOS transistors, has provided critical insight into the phenomena associate with the scaling of devices and has led to the development of large scale integration (LSI).
At present, technology simulation is best viewed within the framework of an overall IC Electronic Computer-Aided Design (ECAD) system. Starting from the basic fabrication input, — the individual process "recipes" and data to generate lithographic masks and layouts ~ these systems attempt to model a complete circuit from the physical structure of its components through to the estimation of overall system performance. As part of the overall ECAD framework, a Technology Computer-Aided Design (TCAD) system's main components are typically a process simulator and/or a device simulator, with appropriate interfaces that mimic experimental setups as closely as possible.
The device simulator's task is to analyze the electrical behavior of the most basic of IC building blocks, the individual transistors or even small sub-circuits, at a very fundamental level. As such, the simulator uses as inputs the individual structural definitions (geometry, material definitions, impurity profiles, contact placement) generated by process simulation, together with appropriate operating conditions, such as ambient temperature, terminal currents and voltages, possibly as functions of time or frequency. A TCAD system's principal outputs are terminal
currents and voltages, appropriate for generating more compact models to be used in circuit simulations. A circuit simulator typically defines the interface to higher-level, application-specific synthesis tools. In principle, given a recipe and a set of masks, the TCAD tools themselves can build virtual device structures and then predict performance of entire circuits to a very high degree of accuracy. Modern process and device simulators are capable of rapid characterization, on the order of many structures per hour, as compared to experiments where on is sometimes fortunate to obtain a new structure within a period of a couple months. At present, TCAD is extensively used during all stages of semiconductor devices and systems manufacturing, from the design phase to process control, when the technology has matured into mass production. Examples of this are discussed by R.W. Dutton and M.R. Pinto, "The use of computer aids in IC technology evolution", Proc. I.E.E.E., vol. 74, no. 12 (December 1986) pp. 1730-1740, and by H. Hosack, "Process modeling and process control needs for process synthesis for ULSI devices", (in) ULSI Science and Technology (1995). As a result of its application, TCAD offers enormous acceleration of the prototyping process for devices, integrated circuits and systems, because expensive manufacturing and metrology can be reduced to a minimum, or even become superfluous.
Existing technologies, which are accurately represented in a TCAD environment, can be extrapolated into regions of more aggressively scaled down design rules.
In many semiconductor device fabrication processes, interest centers on variation of several variables or parameters that are random, not deterministic. These fabrication processes may include substrate formation, ion implantation, thermal diffusion, etching of a trench or via, surface passivation, packaging and other similar processes. Examples of random variables or parameters associated with these processes include concentration of a semiconductor dopant deposited in a semiconductor substrate, temperature of a substrate, temperature used for a thermal drive process for diffusion of a selected dopant into a substrate, initial impurity concentration of the substrate used for the thermal drive process, thickness
of a substrate used for the thermal drive process, concentration of a selected ion used for implantation of the ion into a substrate, average ion energy used for implantation of an ion into a substrate, areal concentration of an ion used for implantation of the ion into a substrate, thickness of a substrate used for an ion implantation process, initial impurity concentration of a substrate used for an ion implantation process, desired incidence angle for etch into a substrate, desired etch distance into a substrate, and thickness of a passivation layer.
Two types of uncertainty affect one's confidence in modeling response of an electronic process, or of an electronic device produced by such a process: structural uncertainty, arising from use of inaccurate or incomplete models; and parametric uncertainty, arising from incomplete knowledge of the relevant variables and of the random distributions of these variables. Parametric uncertainty can be reduced by (1) refining measurements of the input variables that significantly affect the outcome of an electronic fabrication process and/or resulting device and (2) refining the knowledge of interactions between variations of two or more of the input variables and the effects of these joint variations on the process and/or resulting device. Sensitivity of a fabrication process or a resulting device to variation of one or more of these variables may depend strongly upon the particular values of the other variables. One well known method of examining the effects of variation of one or more variables on a particular result is the Monte Carlo method, wherein each of the variables is varied, often independently, and a plurality of calculations is run, one or more with each different permutation of the set of variable values. If interest centers on variation of N variables (N≥l), numbered n = 1, 2, ... , N, and if variable number n is to be examined for, say, Kn discrete values, a conventional Monte Carlo approach will require running and analyzing K = KjxK^x ... XKJS situations in order to fully explore the variable ranges and interactions of values of the variables. Each Monte Carlo sample or run to model one or more steps in a fabrication process may require use of a complex physical model in order to reflect the interactions of the
variables, and each run may require many tens of seconds or minutes to complete. Further, the totality of runs may not adequately illuminate the joint effect of simultaneous variation of several variables because of the plethora of data generated. What is needed is an approach that allows modeling of simultaneous variation of N random variables, where N is at least 1, so that subsequent Monte Carlo sampling can be performed in less time. Preferably, this approach should allow estimation of an N-variable model function and calculation of joint moments, such as means and variances, for any subset of the N variables. Preferably, this approach should allow presentation of at least some of the results in analytic form as well as in numerical form. Summary of the Invention
These needs are met by the invention, which provides an approach for determining a model function for an N-variable process (N≥l) related to modeling of output responses for semiconductor fabrication and semiconductor device behavior. An output response for a process or an electronic device is approximated by a model function G(xι ,...,X ) that is mathematically tractable and that can be used to estimate a probability density function that applies to the N variables jointly. Once obtained, the model function can be used to calculate statistical moments (mean, variance, skew, kurtosis, etc.) for these variables jointly or individually and can be used to identify regions in (xi ,...,xjsτ)-space where subsequent
Monte Carlo sampling may be reduced or eliminated.
The approach begins with a probability density function pj(xj) for each of N individual variables XJ (i = 1, 2, ... , N; N≥l) and determines a associated sequence {Hj ri( i)}ri of polynomials of degree ri ≥ 0 in xj that are mutually orthogonal when integrated using the probability density function as an integrand weighting function. A multidimensional model function G(xj,...,xjsr) of degree up to D in the variables is constructed as a selected sum of polynomial products H^ rι( χ)H2 r2(x2)— Hj f rN(χN)
(0<rl+r2+...+rN≤D), each multiplied by an undetermined coefficient, which is to be determined. Alternatively, each orthogonal polynomial set
{Hj ri(xi)}ri may have its own maximum polynomial degree Dj (O≤ri≤Dj).
The polynomial coefficients are determined by requiring that values of the model function G(xχ,...,xjsτ) be close to observed or simulated values of an output response function F(xχ,...,xj ), when the N variables are set equal to any of a set of collocation values. The collocation values are determined from equations Hj I+D(XΪ) = 0, or Hj χ+Di(χi) = ^' °r ^e orthogonal polynomials.
After the values of the undetermined coefficients in the selected sum are estimated, an estimate G(xχ,...,xjsτ) for the multidimensional model function is now fully determined, up to terms of total degree D in the variables, or up to terms of degree Dj in the variable XJ. The estimate
G(xχ,...,xj f) may be used in subsequent Monte Carlo sampling or other statistical sampling to characterize the output response of interest. The estimate G(x ,...,xjNf) may also be used to estimate statistical moments for the different variables, individually or jointly. Brief Description of the Drawings
Figure 1 illustrates a suitable use of the invention.
Figure 2 is a flow chart illustrating a procedure to practicing the invention.
Figure 3 is a schematic view of computer apparatus arranged to practice the invention. Description of Best Modes of the Invention
Figure 1 illustrates an environment in which the invention might be used. A fabrication process for a semiconductor or other electronic device depends in some way on N randomly varying variables x , X2> ... , X
(N≥l), each of which is preferably continuously variable over its own finite or infinite range, aj < XJ < bj. Each variable XJ has an associated non-negative probability density function PJ(XJ). In response to use of particular values for the variables, XJ = Xj (i = 1, 2, ... , N), the process produces a numerically measurable output response F=F(Xι , X2, ... , XN). The output response F may be a physical measurement, such as a
threshold or breakdown voltage for a particular gate produced by one or more steps in a fabrication process. Alternatively, the output response F may be a predicted value for a variable produced by a measurement or a simulation used to model the process. One object of the invention is to estimate a suitable multidimensional model function G(xι , X2, ... , XN) that can be used for various numerical calculations in modeling, but is easier to calculate than the output response(s) for the process.
In addition, one wishes to compute a probability density function for an output response that can be estimated or approximated as a polynomial in the model function G:
D
P(G) = ∑ Bj (G)i, (1) i=0 where D is a chosen maximum degree for the polynomial p(G) and the coefficients Bj are to be determined. The coefficients BQ and Bi are associated with the mean and the variance, respectively, for the output response. A conventional approach for determining the coefficients Bj is to perform conventional Monte Carlo sampling of the variables (xι , X2, ...
, X ) at the outset and to calculate the coefficients Bj by averaging. This approach will require tens or hundreds of thousands of test runs, and an individual test run may require complex modeling and calculations for a fabrication process.
The invention provides a different approach that substantially reduces the expense of Monte Carlo sampling required for adequate modeling. Each variable XJ has an associated probability density function
PJ(XJ) (aj < x < bj) that can be used as a weighting function in an integrand to generate an associated sequence of polynomials {Hj rj(x)}n of degree ri ≥ 0 that are orthogonal when integrated over the domain aj < x < bj. That is, the polynomials Hj rι(x) and Hj r2(x) satisfy the orthogonality relations J pj(x) Hi?rl(x) Hj5r2(x) d'x = Cj>rl δri 5r2 , (2) where δrι r2 is the Kronecker delta (= 0 if rl ≠ r2; = 1 if rl = r2) and Cj τι is a positive constant. The sequence of orthogonal polynomials
obtained will depend upon the variable range (aj < XJ < bj) and upon the nature of the weighting function pj(xj).
Use of a Gaussian distribution pj(x) = (2π)~l/2 exp(-x2/2) and a symmetric infinite interval (-∞ < x < oo) leads to the Hermite polynomials, defined by
Hn(x) = (-l)n exp(x2/2) (d/dx)n exp(-x2/2). (3A)
H0(x) = 1, (3B)
Hχ(x) = x, (3C)
H2(x) = x2 - 1, (3D) H3(x) = x3 - 3 x, (3E)
H4(x) = x4 - 6 x2 + 3. (3F)
A Gaussian distribution is one of the most useful distributions. A random variable is more likely to be distributed according to this distribution than to be distributed according to any other distribution. Use of a semi-infinite interval (0 < x < ∞) and an exponential weighting function pj(x) = exp(-x) (a low order Poisson process), leads to the Laguerre polynomials. This exponential distribution is useful where the variable has a semi-infinite range.
Use of a finite symmetric interval, such as (-1 < x < 1) and a uniform weighting function pj(x) = 1/2, leads to the Legendre polynomials, defined by
Len(x) = (2n n!)"1 (d/3x)n {(x2-l)n} . (4A)
Le0(x) = 1, (4B)
Le3(x) = x3 - (3/5) x, (4E)
Le4(x) = x4 - (6/7) x2 + 3/35. (4F)
Use of a finite (symmetric) interval (-1 < x < 1), and of a non- uniform weighting function such as pj(x) = (1-x2)-!'2, leads to the Chebyshev polynomials. This distribution might be used where the variable values are more likely to occur at or near the ends of a finite interval.
In a functional domain, where only deterministic variables XJ are present, the variable G might be represented as a sum of products, such as
N Gd(x1,...,xN) = Σ cri >#>e>rN ri(Xq)rcϊ, (5) ({ri},N,D) q=l where the summation symbol
Σ ({ri},N,D) indicates a permutation sum of terms in which each of a set of N numbers rl, ... , rN assumes all possible non-negative integer values that collectively satisfy the following constraint:
0 < rl + ... + rN ≤ D. (6)
Here, D is a selected positive integer representing the highest degree of approximation desired for the output variable G, and the coefficients crl ... rN are characteristic of the deterministic process studied (Figure
1). The permutation sum operator in Eq. (5) forms a sum of terms, with each term in this sum being a distinct permutation of the indicated indices rl, ... , rN, subject to the constraint in Eq. (6). For example, if N=2 and D=2, Eq. (5) becomes 2
Gd( l>x2) = ∑ crl ,r2 π(xq)rcl, ({ri} ,N=2,D=2) q=l = c0,0 + cl,0 xl + c0,l x2+ c2,0 xl2 + cl,l xl x2 + c0,2 x22-(7> In another permutation sum, a system of one or more constraints O ≤ ri ≤ Dj (i = 1, ..., N) (8) replaces the single constraint set forth in Eq. (6), where Dj is a selected non-negative integer. An example of this is
2 Gd(xι ,x2) = Σ crl r2 π(Xq)r(l, ({ri},N=2,D1=3,D2=l) q=l
= c0,0 + cl,0 xl + c0,l x2+ c2,0 xl2 + cl,l xl x2
+ c2>ι xi2 X2 + c3?0 i3 + c jl x 3 x2. (9)
In a statistical domain, the deterministic variables XJ are replaced by randomly distributed variables XJ, and the deterministic output variable Gd is replaced by an output variable with an associated random distribution
N G(Xl,...,xN) = ∑ ri9...jrN ri(Hq?rq(xq)) (10)
({ri},N,D) q=l where the same permutation sum operator is applied to the same N polynomial indices rl, ... , rN as in Eq. (5). For any orthogonal polynomial set, Hq?rq_o(Xq) = 1 (or another non-zero constant). The coefficients Ar ΓN- are determined in the following manner.
For purposes of illustration, an output response function F(xι ,x2) = xι2 + xiX2. (11) is used for an estimate for a two-variable process shown in Figure 1. For purposes of this illustration, N=2 variables with a maximum polynomial degree D=2 are used. An estimated multidimensional model function for the random variable G in Eq. (10) is
G(xι,x2) = A0,0 + Al,0 Hl,l(χl) + A0,l H2,l(χ2) + A2,0 Hl,2(χl) + AU HU(X1) H2j(x2) + A0,2 H2,2( 2)> (i2) where Aø , AI Q. AQ I, A2 Q, AJ 1 , and AQ 2 are undetermined coefficients. Assume, for purposes of this illustration, that the first variable xi is uniformly distributed on the domain (1,10), with associated mean and standard deviation of μj = 5.5 and σj = (6.75), respectively; and that the second variable X2 is normally distributed with mean μ2 = 2.0 and standard deviation 02 = 1.0 on (-∞,∞). New transformed variables ZJ = (XJ - μj)/σj (i = 1, ..., N) (13) are introduced for all Gaussian variables (here, only X2) in Eqs. (3A)-
(3F), in order to normalize each of the new variables to mean 0 and standard deviation 1.0. Optionally, a random variable XJ that is not
Gaussian (e.g., distributed according to an exponential or finite uniform or finite non-uniform distribution) can be transformed similarly, if desired.
The variable G(xι , ..., XN) is evaluated at collocation points, which are solutions of the orthogonal polynomials of degree D+l, where D is the highest degree for the variables x ]_, ..., XN that appear in G(xι , ..., XN).
For this example, N=2 and D=2, and the collocation points (xj,X2) =
become the solutions for the equations
Le3(xι ) = (Xl-5.5)3/(4.5)3 - (3/5) (x 5.5)/(4.5)= 0, (14)
H3(x2) = (x2-2)3 - 3 (x2-2) = 0. (15)
The collocation point pairs become
(χlc,l'x2c,l) = (2-01431, 0.267949), (16A) (χlc,2> 2c!2) = (2- 1431, 2), (16B)
(χlc,3>x2c,3) = (2.01431,3.73205), (16C)
(χlc,4'x2c,4) = (5-5' 0.267949), (16D)
(χlc,5'x2c,5) = (5-5' 2)> d6E)
(χlc,6'x2c,6) = (5-5> 3.73205), (16F) (χlc,7>x2c,7) = (8.98569, 0.267949), (16G)
(χlc!8'x2c!δ) = (8-98569, 2), (16H)
(χlc,9>x2c,9) = (8.98569, 3.73205), (161) where a single index k is used to distinguish different collocation pairs.
More generally, where N variables appear in the output response function F, Eq. (11), the collocation points will appear as N-tuples.
The coefficients AQ Q, AJ Q, AQ \, A2 oΑχ 1, and AQ 2 n Eq.
(12) are chosen to minimize the functional ε( A0,0> A 1 ,0' A0, 1. A2,0' Al , 1. A0,2)
9 = ∑ Wk(A0,0 + Al,0 Hl,l(χlc,k) + A0,l H2,l(χ2c,k) k=l
+ A2,0 Hl,2(χlc,k) + Al,l Hl,l(χ2c,k) H2,l(χ2c,k)
+
A0,2
H2,2(
χ2c,k)
" F(
χlc,k>
x2c,k)}
2> (
7) where the quantities w^ are selected non-negative weighting coefficients and the quantities F(xι
c k,X2c k)
are numerical values obtained from calculations using the output response equation (11). For purposes of this
example, all weighting coefficients w^ are set equal to 1. Minimization of ε in Eq. (17) results in the choices
A2,0 = I-00' (18D)
AU = 10"15 ( °)> (!8E)
A0 2 = 6.00 (18F) for the undetermined coefficients in Eq. (12). In many practical instances, the number Ml of undetermined coefficients will be less than the number M2 of collocation value N-tuples (xjc, ...,XNC) that are calculated using an output response function, such as that shown in Eq. (11).
Where the maximum polynomial degree of approximation Dj is specified separately for each variable XJ, the number of collocation value
N-tuples will be
N
i=l Where an overall polynomial degree of approximation D is specified,
M2 = (1+D)N. (19B)
Determination of the number Ml of undetermined coefficients is more complex but may be verified to be
N Ml = πU+Dj), (individual degrees Dj) (20A) i=l Ml = (D+N)!/{D! N! } (overall degree D) (20B)
When Ml = M2, Eqs. (17) is replaced by a set of N linear equations in the N unknown coefficients Arj rN> and the unknown coefficient values Arι # ΓN can be found exactly.
After the coefficient values Arj ΓN are determined, Eq. (12) can serve as an estimate for the actual two-variable output response function
F(x ,X2) adopted in Eq. (11). Monte Carlo sampling can now be performed, using the two-variable model function G(x ,X2) to determine the relative number of sample runs to be made in each region of (xj,X2)- space. This approach will usually be less expensive, measured in computer time, effort and funds expended, than a conventional approach to Monte
Carlo sampling of the process would be. This approach may also identify a region, corresponding to a coefficient Ar _ rN wi h very small magnitude, where little or no interaction of the variables is expected so that the number of Monte Carlo samplings in this region may be reduced or eliminated.
Optionally, the system may provide or compute one or more quality of approximation statistics Q(G) that provide a measure of how well the model function G(XJ,...,XN) fits the available data. One such measure,
Q(G), is the mean square error MSS, defined as the average of the residual sum of squares
M2 M2
MSS = ∑wk{G(xlc k, ..., XNc,k) " F(χlc,k'— xNc,k)>2/∑wκ » (21) k=l κ= l where {wk} is a set of selected non-negative weighting numbers and the sum extends over all combinations of collocation points xj=Xjc in the M2 collocation N-tuples (x c k>«..»x-Nc k) °r ^e variables XJ in the model function G. A low value for MSS is desired, preferably one that increases no faster than a constant multiplied by V(M2).
Another such measure, Q(G), is the coefficient of determination R
2, which measures the proportion of the variation in the actual process values
that can be predicted by changes in the variables
using the model function G
R2 = NUM DENOM, (22)
M2 NUM = Σ wk {F(x1C)k, ..., xNc,k) " F(mean)}2 , (23) k=l
M2 DENOM = ∑ w {G(xlc k, ..., XNc,k) " F(mean)}2 , (24) k=l
M2 M2 F(mean) = ∑ wk F(xl c? , ...,XNc,k)/{ ∑ wκ} - (25) k=l κ= l
In many instances the weights wk are all set equal to 1. Ideally, the
R2 statistic equals 1, or is very close to 1. The statistic 1- R2 is preferably less than a threshold value, such as 0.1 or 0.3. As the number M2 of simulations is reduced, the R2 statistic will increase monotonically, but not necessarily strictly monotonically.
Another measure Q(G) is an adjusted coefficient of determination R2(adj), which partly compensates for the increase of R2 as M2 is reduced and is defined by 1 - R2(adj) = (1 - R2)(M2-1)/(M2-M1), (26)
A first preferred condition here is that the quantity 1 - R2 be no greater than a selected threshold value. A second preferred condition is that R (adj) and R2 be reasonably close to each other. If R2 and R2(adj) differ substantially, it is probable that the model is not sufficiently accurate. Figure 2 illustrates a procedure corresponding to one embodiment of the invention. In step 11, the system receives a specification for each of N randomly varying variables XJ, a corresponding non-negative probability density function pj(xj) (i = 1, 2, ... , N; aj < XJ < bj) for each variable XJ, the integer N and the output response function F(XJ,...,XN) (analogous to Eq. (11)).
In step 13 (optional), the mean and standard deviation of each variable XJ is specified and Eq. (13) is used to transform each Gaussian variable (and, optionally, one or more non-Gaussian variables) to a mean=0, standard deviation=l variable. In step 15, a maximum polynomial degree of approximation Dj for each variable Xj, is specified. In place of the N polynomial degrees of approximations Dj, a single overall polynomial degree of approximation D can be specified here, as discussed in the preceding development.
In step 17, each probability density function pj(xj) is used as a weighting function to generate a sequence of orthogonal polynomials {Hj rj(xj)}r associated with the weighting function, where the polynomial Hj rj(xj) is of degree ri in the variable XJ, with O≤ri≤Dj, and the polynomials satisfy the orthogonality relations set forth in Eq. (2).
Alternatively, the polynomial degrees ri associated with the polynomials Hj rj(xj) collectively satisfy the constraint 0<rl+r2+...+rN<D.
In step 19, an estimate G(XJ,...,XN) for the N-variable model function G(XJ,...,XN) is generated, using Eq. (10) or another suitable estimate. This estimate will have several coefficients whose values are to be determined.
In step 21, the collocation points Xjc for the corresponding orthogonal polynomial of degree Dj+1 are determined, and collocation N- tuples (XJC,X2C,...,XNC) are formed. This will provide a total of M2 collocation N-tuples.
In step 23, the process function F(X^,...,XN) is evaluated at each of the collocation N-tuples.
In step 25, the coefficients Ar ΓN appearing in Eq. (9) are determined. This may be done by least squares minimization, using the analogue of Eq. (17), or by solving a linear set of M2 equations in M2 unknowns, if Ml = M2.
In steps 27 and 28 (optional), at least one quality of approximation parameter Q(G) is provided or computed for the model function G(XJ,...,XN), and the system inquires if Q(G) is no greater than a selected threshold number Q(G)mr? If Q(G) < Q(G)tjιr, the system proceeds to step 31.
If Q(G) > Q(G)mr, the system moves to step 29, where the system increases at least one of the maximum polynomial degrees of approximation Dj, or alternatively the overall polynomial degree of approximation D, and recycles to step 17.
In step 31 (optional), one or more regions of (xj,...,XN)-space is identified where the magnitude of a corresponding coefficient Ar _ ΓN is less than a specified coefficient threshold value.
In step 33 (optional), an estimate G(xj, ...,XN) for the N-variable response output F(xj, ...,XN) of interest is assembled and used to perform Monte Carlo sampling in the N variables XJ. The N-variable function G(XJ,...,XN) is preferably used to determine the relative number of sample runs to be made in each region of (x ,...,XN)-space. This sampling can be used to estimate the values of the coefficients Bj in Eq. (1). The process illustrated in Figure 1 may be supplanted by K processes (K≥2) in which (i) each process k (k=l, 2, ... , K) has its own output response function F
k(x^,...,XN) (k = 1,... ,K) or (ii) all K processes participate in a combined process with a single output response
or (iii) all K processes participate in a combined process that has K' output responses F
k'(x ,...,XN) (k' = 1, ...., K';K'≥2).
Preferably, polynomial approximations with low orders, Dj = 1, 2 or 3 or D = 1, 2 or 3, are used here in order to limit the number of coefficients Arj ΓN to a manageable number. The number N of variables XJ is often limited to a relatively small number in the range l≤N≤lO but may be larger if desired. However, the invention will accommodate any reasonable maximum polynomial degree Dj or D and any reasonable number N of random variables.
Figure 3 schematically illustrates an arrangement of computer apparatus 40 suitable for practicing the invention. The apparatus 40 includes: a CPU 41 and associated registers for numerical and logical processing; a data/command entry mechanism 43 (keyboard or similar device) for entering selected estimation parameters (N, D or {O , ...,
DNL model function, statistical distribution for each variable X (i =
1,...,N), coefficient magnitude threshold, etc.) to be used to estimate an N- variable model function; a memory component 45A to receive the parameters entered using the data/command entry mechanism 43; a memory component 45B that stores the software commands used to
perform the steps set forth in the flow chart in Figure 2; a visual display
47 (optional) to display the estimated N-variable model function and/or the numerical values of the coefficients A
rj
ΓN determined for the model function estimate
(Eq. (9)), and an I/O interface 49 (optional) used to import data to, or export data from, the apparatus 40. The apparatus 40 may exchange these data with a CD/ROM, an floppy diskette, a hard disk, an internetwork or any other suitable source of destination for these data. Optionally, the computer apparatus 40 includes a memory component 45C that stores the software commands used (i) to identify one or more regions of (x
j ,...,XN)-space where a coefficient A
r ^ ΓN has a magnitude no larger than a specified coefficient threshold (e.g., 10
"3 or
10" '), if such region exists, (ii) to perform Monte Carlo sampling of regions in (xj,...,XN)-space where the coefficients Aτ Γ have magnitudes larger than the specified coefficient threshold and/or (iii) perform a quality of approximation analysis on the model function estimate G(X^,...,XN).
The collocation method developed and applied here is analogous to the method of Gaussian integration that is applied to estimate the value of a definite integral using orthogonal polynomials. Gaussian integration is discussed by F.B. Hildebrand, Introduction to Numerical Analysis.
McGraw-Hill, Second Edition, 1974, pp. 378-445. Application of a collocation method to geophysical studies is discussed by W. Pan et al in "Uncertainty analysis of direct radiative forcing by anthropogenic sulfate aerosols," Jour. Geophys. Res., vol. 102 (1997) pp. 21915-21924, by M. A. Tatang et al in "An efficient method for parametric uncertainty analysis of numerical geophysical models," Jour. Geophys. Res., vol. 102 (1997) pp. 21925-21932, and by M. Webster et al in "Application of the Probabilistic Collocation Method for an Uncertainty Analysis of a Simple Ocean Model," M.I.T. Joint Program on the Science and Policy of Global Change, Report No. 4 (January 1996).
Solution of polynomial equations to identify collocation points, solution of least squares problems and solution of systems of linear equations can be performed using routines available in a numerical routine
software package such as LAPACK, which is available on the Internet at lapack@cs.utk.edu. Currently, Version 2 of LAPACK is available. A printed version of the LAPACK Users' Guide is available for purchase from the Society of Industrial and Applied Mathematics, 3600 University City Science Center, Philadelphia, PA 19104-2688.