K.E.Atkinson.An Introduction to Numerical Analysis. John Wiley and Sons, New York, second ed., 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....they are fully contaminated the terminal part of the spectrum. The part of the spectrum lying between will be called the intermediate part or the transitional part. 2. An example. In this section we will introduce a simple minded example from image processing. Let x(t) represent an image on [0, 1], and consider the Gaussian blurring operator b(t) Z x(s)e s t ds. We will discretize this operator by choosing an integer n and setting t i = i=1, n 1, and generating a matrix K whose elements are # ij = e t j t i . The resulting matrix is then scaled so that ....

....1 0.5 1 1.5 2 2.5 3 3.5 Fig. 2.1. x(t) solid) and b(t) dashed) Fig. 2.2. # i (solid) # i (dotted) and # i , # i (dashed) of x(t) and b(t) The divergence at the ends of the intervals is due to the fact that at those points the part of the blurring distribution that lies outside [0, 1] becomes significant. Figure 2.2 shows the vectors b, b, and x after they have been transformed to the spectral coordinates. Note that for i 15 values # i are significantly contaminated with error. The plot also shows the eigenvalues of A, which decrease slowly at first and then rapidly ....

[Article contains additional citation context not shown here]

K. E. Atkinson, An Introduction to Numerical Analysis, John Wiley, New York, 1978.

....acceleration schemes depend only on information that is available at the nth iteration. For sequences satisfying (4) we define ; 9) for sequences satisfying (5) we set ; 10) and for sequences satisfying (6) we use : 11) We note that (9) reduces to Aitken s method (see [1] or [2] in the particular case when p = 1. In any case, we prove that (8) is true, i.e. the accelerated sequence is (super linearly) faster than the original sequence. We apply our schemes to the secant method, Newton s method, as well as to a method of order 1:839 Delta Delta Delta ....

Atkinson, K. E.: An Introduction to Numerical Analysis, 2nd ed. New York: John Wiley & Sons 1988.

..... K T . The first approach appears the simpler and will be the one pursued. The second will be discussed later and some references provided. Consider the model (1) The interpolated values can be written: B k,1 (t T )Y (# k 1 ) with the B k,1 B splines of order 1, see the Appendix, [2], 12] 16] for details of these. Next Y (# j ) Y (# j ) noise 1 and from (1) Y (# j ) g(X(# j ) noise 2 leading to Y (# j ) g(X(# j ) noise 2 noise 1 (3) Because of the additivity of the overall error term, equation (3) has the form of the nonparametric regression model, with the ....

....following the scheme proposed in the previous section. The data available are denoted (# k ) for the Careiro and j ) for the Solimoes. Being downriver from Manacapuro the Careiro series is viewed as the dependent one. To begin a linear interpolation spline is run through the Careiro data [2], 12] Specifically the missing Careiro discharge values were estimated by linear spline interpolation, i.e. a curve is passed through the points (# k ,Y(# k ) and consists of straight lines between the points. This has the advantage that if a # j is actually a # k then the observation Y (# k ) ....

K. E. Atkinson. An Introduction to Numerical Analysis. J. Wiley, New York, 1978.

....significantly increases the speed of the code. There are many times in the numerical code where we need to compute the temperature. We propose a new way of doing this. An implicit equation can be written for the temperature, and we show that it can be solved with Newton Raphson iteration [7]. A great deal of CPU time is required to do numerical simulations with ENO. We speed up the code by only using ENO in the regions of the domain with complex phenomena. In smooth regions of the domain, we use a computationally cheaper scheme. Many numerical algorithms work well on model ....

....j ) 24x = 1 1 1 and they continue in that manner. The nth divided difference of H is times the (n Gamma 1)th divided difference of f . 29] According to the rules of polynomial interpolation, we can take any path along the divided difference table to construct H [7], although they do not all give good results. ENO reconstruction consists of two important features: 1. Choose D H in the upwind direction. 2. Choose higher order divided differences by taking the smaller in absolute value of the two possible choices. 26 Once we construct H(x j ) we ....

[Article contains additional citation context not shown here]

Atkinson, Kendall E., An Introduction to Numerical Analysis, Wiley, 1989.

....of P0 satisfying: 0 = f(xo(p) yo(p) p) 2.8) 0 = g(xo(p) yo(p) p) 2. 9) i.e. the operating point is a function of the parameters locally and it can be moved by adjusting the values of the parameters It is a well known fact that the eigenvalues of any matrix depend continuously on its entries [2, 16, 22]. In this case the entries of the matrix in question, A, are the functions of (xo(p) yo(p) p) and hence its eigenvalues are also functions of the parameters: xo(p) yo(p) p) p) 2.10) Since the eigenvalues are functions of the parameters and the eigenvalue locations determine the stability ....

....other hand, the cluster equations should not be affected by the outer variables and the cluster variables should not affect the outer world. This means 6091 6092 that Y2 and Yx should have small entries. In the case where those matrices have entries of order O(e) a the geometric series expansion [2] can be used to approximate 6091 6092 60gi (60gj 1 60gj will be of order O(e 2) A11. Since Y2 and Yx are of order O(e) Oyj OyjJ Yi 47 Therefore the following expansion can be written down (with the second term on the left being of order O(e2) Oyi k ; This entry frequ[ntly appears in A ....

[Article contains additional citation context not shown here]

Kendall E. Atkinson. An Introduction to Numerical Analysis. Addison Wesley, 1988.

....## #### # ######### # ######## # # # # ## ### # # # ######### # ######## # # # (4) It is easy to take interval extensions of a Hermite interpolation polynomial and of its derivatives. The only remaining issue is to bound the error terms. The following standard theorem (e.g. SB80] [Atk88]) provides the necessary theoretical basis. Proposition 2 (Hermite Error Term) Let #### be the Hermite(#) interpolation polynomial in # wrt # and ### ##. Let #### # ##### ## ##, # # # #### ## # ###, # # # ### # # and ##### .We have (# # # # #) ### # # # # # # ### ##### # # ## # ....

K. E. Atkinson. An introduction to Numerical Analysis. John Wiley & Sons, New York, 1988.

....We will then present explicit Euler method and determine, for various elementary functions, how to choose the step (the distance between two consecutive t n ) We will finally proceed in the same manner for the classical Runge Kutta RK4 method. For more definitions and results, see for instance [Atkinson (1989), Iserles (1996) 2.2 Definitions and theorems for single step methods Single step method The problem is to find an approximation of the solution of the ODE y(t 0 ) j on interval [t 0 ; b] An equally spaced subdivision of [t 0 ; b] with N 1 points is defined by a = t 0 , t n = a ....

....y n 1 = y n (k 1 3k 2 ) The aim of such methods is to reach a given order without evaluating any derivatives of f (which can be cumbersome both to establish and to evaluate) Naturally, a minimal number of evaluations of f is sought. Known methods can be sum up in the following table (cf. [Atkinson (1989)] number of function evaluations 1 2 3 4 5 6 7 8 maximal order 1 2 3 4 4 5 6 6 and this motivates the general choice of a Runge Kutta method of order 4, denoted by RK4. The classical RK4 method is the following: k 1 = f(t n ; yn ) k 4 = f(t n h; yn hk 3 ) yn 1 = y n 6 (k 1 ....

K. Atkinson, An introduction to numerical analysis, 2nd edition, Wiley, 1989.

....900 1000 0 0.01 0.02 0.03 0.04 0.05 0.06 0.07 0.08 0.09 0.1 (Kbits s) Loss Probability RTT=0.07s RTT=0.1s RTT=0.3s RTT=0.5s RTT=0.7s Fig. 10. Throughput vs. loss probability for different RTT 1 ) We use the bisection method for finding the inverse of w.r.t. numerically [26], and to iterate for the values of and , we start from g . These two values bound the whole scale of possible loss probability, meaning that a valid value of can be calculated by the Intermediate Value Theorem [26] However, is a function of other variables like , which ....

....bisection method for finding the inverse of w.r.t. numerically [26] and to iterate for the values of and , we start from g . These two values bound the whole scale of possible loss probability, meaning that a valid value of can be calculated by the Intermediate Value Theorem [26]. However, is a function of other variables like , which impose other limitations on the throughput achieved at certain as shown in Figure 10. So, given some values for , and there is a maximum value for the throughput, that can be achieved. This is the value calculated ....

Kendall E. Atkinson, An Introduction to Numerical Analysis, John Wiley and Sons, New York, 2nd ed., 1989.

....type of singularity, as obtained by Lyness [8] 9] provides a basis for extrapolation methods in the same way as the Euler Maclaurin expansion is used as a basis for Romberg integration. For the one dimensional case, a standard discussion of these methods and others can be found in Atkinson [3]. In this paper we discuss adaptive numerical integration for the two dimensional case. The process of placing node points with variable spacing so as to better reflect the integrand is called adaptive refinement or grading the mesh. We propose a type of adaptive refinement for which the order of ....

K. Atkinson(1989) An Introduction to Numerical Analysis, 2nd ed., John Wiley and Sons.

No context found.

K. Atkinson, An Introduction to Numerical Analysis, John Wiley, New York, 1989.

No context found.

K.E.Atkinson.An Introduction to Numerical Analysis. John Wiley and Sons, New York, second ed., 1989.

No context found.

Kendall E. Atkinson. An Introduction to Numerical Analysis. John Wiley & Sons, New York, New York, 1989.

No context found.

ATKINSON K.: An Introduction to Numerical Analysis. John Wiley & Sons, 1989. 5

No context found.

Atkinson, K.E., An introduction to numerical analysis, 2nd edn, John Wiley & Sons, Inc., New York, 1989.

No context found.

K. Atkinson, An Introduction to Numerical Analysis, 2nd Edition, John Wiley and Sons, New York, 1989.

No context found.

K. E. Atkinson. An introduction to Numerical Analysis. John Wiley & Sons, New York, 1988.

No context found.

Atkinson, K.E.: An Introduction to Numerical Analysis, 2nd Edition. John Wiley and Sons, New York (1989).

No context found.

K. E. Atkinson. An Introduction to Numerical Analysis. John Wiley & Sons, New York, 1988.

No context found.

Atkinson, K., An Introduction to Numerical Analysis, John Wiley and Sons, New York, pg. 229.

No context found.

K. E. Atkinson. An Introduction to Numerical Analysis. John Wiley & Sons, New York, 1988.

No context found.

K. Atkinson, "An Introduction to Numerical Analysis", John Wiley & Sons, 1978.

No context found.

K. E. Atkinson. An introduction to Numerical Analysis. John Wiley & Sons, New York, 1988.

No context found.

K. Atkinson (1989) An Introduction to Numerical Analysis,2 ed., John Wile Pub.

No context found.

K.E. Atkinson, An Introduction to Numerical Analysis, 2nd Ed., John Wiley & Sons, New York, 1989.

No context found.

K. E. Atkinson, An Introduction to Numerical Analysis. Wiley, New York (1978).

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC