R.L. Burden & J.D. Faires, Numerical Analysis, 6th Ed., Brooks/Cole, Pacific Grove, CA, 1997.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....FINITE ELEMENT method (FEM) is one of the topics introduced in our upper level undergraduate course, Math 4503, Numerical Methods. During the Fall 1999 semester, we used a computer algebra system (CAS) Mathematica, to assist in teaching an introduction to FEM. The textbook used for this course [1] presents an introductory section on finite elements, and we supplemented this section. A Mathematica notebook (program) that implements a basic two dimensional FEM using linear, triangular elements was made available to students at the website, http: euler.mcs.utulsa.edu ma4503 index.html [2] ....

R. L. Burden and J. L. Faires, Numerical Analysis, 6th edition, Brooks/Cole, Pacific Grove (1997) pp. 707722.

....contour plot. Figure 12: Solution to the Heat test problem u(0; t) u( t) 0; t 0; u(x; 0) sin x; 0 x : The closed form solution is known to be u(x; t) e Gammat sin x: 18) Figure 12 shows the surface and contour plots of the solution. Our second problem, which comes from [2] page 717 question 12, is r aeC = u t ; 19) u(0; t) u(l; t) 0; 0 x l; u(x; 0) sin l ; t 0; l = 1:5cm; 1:04cal=cm Delta deg Delta s; ae = 10:6g=cm ; C = 0:056cal=g Delta deg and r(x; t; u) 5:0cal=cm : This problem models the temperature of a thin ....

Richard L. Burden and J. Douglas Faires. Numerical Analysis. Brooks/Cole, 7 edition, 2001.

....STAGE A. Problem Statement The ideal filter that allows fractional delay with no distortion is given by sin(4n D] h, n] 3] 1) Where D is the normalised fractional delay comprised in the range from 0 to 1, measured from sample (N l) 2 (Nth order filter delay) Lagrange interpolation [8] can be implemented as a digital filter, whose impulsive response h[n] fi N I 2D 2i , 0 2(N n i) 2) iN k For a zero order hold, h[n] 8[n] and for a linear interpolator h[n] DS[n] 1 D)8[n 1] The distortion introduced can be evaluated as the difference between (1) and (2) e[n] l (h, n ....

Richard L. Burden, J. Douglas Faires, Numerical Analysis, Ed. PWS, Boston, 1985. 984

....first is a simple one dimensional heat problem, Gamma = 0 (17) u(0; t) u( t) 0; t 0; u(x; 0) sin x; 0 x : The closed form solution is known to be, u(x; t) e Gammat sin x: 18) Figure 12 shows the surface and contour plots of the solution. Our second problem, comes from [2] page 717 question 12, aeC = u t ; 19) u(0; t) u(l; t) 0; 0 x l; u(x; 0) sin l ; t 0; l = 1:5cm; 1:04cal=cm Delta deg Delta s; ae = 10:6g=cm ; C = 0:056cal=g Delta deg and r(x; t; u) 5:0cal=cm : This problem models the temperature of a thin conducting ....

Richard L. Burden and J. Douglas Faires. Numerical Analysis. Brooks/Cole, 7 edition, 2001.

....3.3. Comparison of parametric and arc length subdivisions. The same curve is marked at equal parametric intervals (above) and equal intervals of arc length (below) 14 This section was adapted from and inspired by a number of sources. For further numerical approximations to integration see [Burden81 ] and [Press92] For a more com plete discussion of arc length computation see [Watt92] and [Guenter90] 3.1.2 Interpreting 2D Splines as Function Graphs In order to use a two dimensional spline curve as a function graph we must find a way to map from the parametric representation of the curve ....

R. Burden, J. Faire, and A. Reynolds, Numerical Analysis, Prindle, Webster Schmidt, Boston, 1981.

.... t # [t 0 , t 0 #t] Then the blocking probability # C(t) t) is approximated by a constant over t # [t 0 , t 0 #t] by solving (4) together with (5) The PSFFA model (1) can then be numerically integrated using a standard technique, such as, the Runge Kutta Fehlberg numerical method [2], where the step size parameter is optimized based on prescribed tolerance values. The numerical solution yields the value of the state variable at the end of the time interval, x(t 0 #t) which then becomes the initial condition for the next time step [t 0 #t, t 0 2#t] We then adjust the ....

R. Burden, J.D. Faires, and A. C. Reynolds, Numerical Analysis, Second Edition. Prindle,Weber & Schmidt, Boston, MA, 1981.

....of Q, for evaluating P i#j (t) This computation is the running time bottleneck in CPU intensive applications for phylogenetic inference, like [6] or the algorithm in section 2.2. We accelerate the computation of P i#j (t) by numerical approximation using the Chebyshev polynomial series [2]. Each of the 20 20 functions P i#j (t) of the single variable t, is approximated by a Chebyshev polynomial of degree d, for the range of reasonable t values. All the 400(d 1) polynomial coe#cients are precomputed, allowing rapid evaluation of P i#j (t) which empirically attains a 62 fold ....

R. L. Burden and J. D. Faires. Numerical analysis. PWS-KENT, 1989.

....results are strongly dependent on the step size, furthermore for smaller values of #r function oscillates substantially. Finally, the relation between function Smm and functions K(r) and g 2 (r) is inspected. To evaluate integrals (2.42, 2. 43) adaptive Simpson s integration scheme was used (see [Burden and Faires, 1989]) with prescribed tolerance 10 4 . Results shown in Fig. 2.11 are obtained from K(r) or g 2 (r) functions and simulation for 50,000 repetitions of sampling 32 0.0 2.0 4.0 6.0 8.0 10.0 r R 0.20 0.25 0.30 0.35 0.40 0.45 0.50 0.55 0.60 S mm S mm from simulation S mm from K S mm ....

Burden, R. and Faires, J. D. (1989). Numerical Analysis. PWSKent Publishing Company, 4th edition.

....permutation of the columns of L 0 and L for which the first r columns of L 0 and L are independent. Then there is an invertible matrix R such that J N (L)R = J 0 N (L 0 ) from which it follows that N (L) R = I k B J 0 ) N (L 0 ) Method of proof The Sherman Morrison matrix update formula [2] provides an explicit formula for J in terms of J 0 in the case when B has just one non zero element, and can be used to prove the lemma for this case. To lift the result to the general case requires the assumption that K 0 can be transformed to K with a succession of additions of 1 to one element ....

....t d) binary row echelon matrices of rank d, and there are fewer than 3:5 2 d(n Gammat) of these. The work can be cut to O(nd) multiplications per matrix tested by enumerating the matrices so that each differs from the previous one in just one element, and using the Sherman Morrison formula [2] as in the proof of the matrix update lemma. To finish on an aesthetically pleasing note, this enumeration is an adaptation of the following way of enumerating r bit integers so that each differs from the previous one in just one bit position. Let s = 2 r Gamma 1 and number the integers a 0 : ....

BURDEN R.L., FAIRES J.D., and REYNOLDS A.C. "Numerical Analysis." 2nd. Ed., Prindle, Weber, and Schmidt, 1981. Page 458.

....no twist ) Hence, we do not pursue this line of investigation. 2. Numerical integration. Presented in this section are the graphical results of numerical investigations into the asymptotic behavior of the QP Mathieu equation. Numerical integration employing the Runge Kutta method of order 4 [3] is carried out to generate stability charts by integrating equation (1.1) forward in time over a grid of parameter values in the # # parameter plane. To determine whether or not the solution associated with a given point (#, #) of the grid becomes unbounded with time (i.e. is unstable) two ....

R. L. Burden and J. D. Faires, Numerical Analysis, 3rd ed., Prindle, Weber & Schmidt, Boston, MA, 1985.

.... from g Figure 2.15: The two point matrix probability function To conclude, we inspect the unique connection (2.36) between Smm and functions K(r) and g 2 (r) for the isotropic and ergodic medium. Integrals (2.41, 2. 42) are evaluated numerically using adaptive Simpson s integration scheme (see [Burden and Faires, 1989]) with the prescribed tolerance 10 4 . Fig. 2.15 shows the variation of function Smm derived from various approaches. Coincidence of individual curves is evident. Note that procedure which requires solution of (2.36) for a given distribution of K(r) is considerably more e#cient then the one based ....

Burden, R. and Faires, J. D. (1989). Numerical Analysis. PWSKent Publishing Company, 4th edition.

....r (resp. r 1) for MIDS (for MVC and MEDS) it is not easy to find a closed expression (depending on the c j s) for the functions y j i and consequently optimise the choice of the c j s. However an alternative approach based on solving the relevant systems numerically using a Runge Kutta method [8], gives remarkably good results. Given a positive integer M and an upper bound c r on , let t 0 = 0 and t h = t h 1 cr M for all h 2 f1; Mg. Any (r 1) set fs 1 ; s r 1 g over f1; M 1g defines a subsequence of t h . The system for Phase j is then solved numerically ....

R. L. Burden, J. D. Faires, A. C. Reynolds. Numerical Analysis. Wadsworth Int., 1981.

....considerations, this discussion will primarily concern linear force laws. They are simple and yield the features that we require from the simulation. The discussion will assume that the reader is basically familiar with numerical integration. For a more complete discussion, see [Press92] or [Burde96]. 4.1 Linear Springs The basic unit of many flexible body simulations is the damped linear harmonic oscillator. Recall that an equilibrium length, a spring coefficient (called the Hooke s law constant) and a damping coefficient define such a spring. Let p 1 and p 2 be particles in space and ....

....in the spring constant to mass ratio by a factor of four. The above time step guidelines are only estimates and depend on a great many factors including the other forces present in the system and on the distribution of springs in the model. For more sophisticated error estimates see [Press92] or [Burde96]. These experimental guidelines do, however work for simple situations. If a time step fails, the usual solution applies. Lower the time step until the simulation is stable, or use an adaptive time step integration method [Press92] If the stable time step is so small as to make the simulation ....

Burden, R, Faires, D: Numerical Analysis, Sixth Edition, Brooks & Cole Publishing, 1996

....solution, since a boundary choice of the tax rate would produce zero revenues for that moment. I assumed the depreciation cost function c(Q(t) 002Q(t) 27) I estimated the basic model of Section 2, using the Runge Kutta method of the fourth order, in steps of 1 16, to compute (t) and Q(t) [6]. 27 To identify an interior candidate, I estimate (5) and a rearrangement of (8) as a system of simultaneous differential equations for (t) and Q(t) check the transversality conditions; and, if the conditions are not met, proceed to time t 1, using the estimated values for (t) and Q(t) in ....

Burden, Richard L. and J. Douglas Faires. 1989. Numerical analysis. Fourth edition. Boston, MA: PWS-Kent Publishing.

....mentioned: consideration of the more efficient algorithms would carry us beyond the scope of this tutorial. 4. 1 Euler s method A discussion of the basic ideas of Euler s method can be found in the tutorial [Fosdick 91] and any elementary numerical analysis book, for example [Conte de Boor 80, Burden Faires 85] We describe it briefly in terms of the equations we are interested in solving. We begin with mx = f(x) 45) with initial conditions x(0) x (0) x(0) x (0) 46) The first step is to write the second order differential equation, Eq. 45) as a pair of coupled first order ....

BURDEN, RICHARD L. AND J. DOUGLAS FAIRES. [1985]. Numerical Analysis. Prindle, Weber & Schmidt, third edition. ISBN 0-87150-857-5.

....supporting medium is loaded beyond the proportional limit. These procedures were implemented in stand alone computer software. The algorithm employs the Newton Raphson solution method, including a pre conditioned, conjugategradient, iterative equation solver that is applied at each solution cycle (Burden and Faires 1993). The selected modeling procedures have been verified by comparisons to classical solutions and results from both physical tests and analytical studies of reinforced concrete plates under various loading conditions. For example, Figure 1 shows excellent agreement between the basic T1 element and ....

Burden, R. L. and Faires, J. D. (1993). Numerical Analysis. Fifth Edition. PWS Publishing Company, 20 Park Plaza, Boston, Massachusetts.

....the distance that minimizes the fitted polynomial. Then we can move the configuration in 2N space to the specified point along the gradient direction. We terminate the algorithm when we cannot move in any direction and improve our fit. The basic method is described for one dimensional functions in Burden and Faires (1985, chap. 9) and has been modified for our higher dimensional problem. This method works well when the initial position is close to a local minimum. It does not require the initial configuration to be as close as is required for quadratic methods such as Newton s method, but it can take a long time ....

Burden, R., and Faires, J. D. (1985), Numerical Analysis (3rd ed.), Boston, MA: PWS Publishers, Duxbury Press.

No context found.

R.L. Burden & J.D. Faires, Numerical Analysis, 6th Ed., Brooks/Cole, Pacific Grove, CA, 1997.

No context found.

R. L. Burden and J. D. Faires, Numerical Analysis. Boston, MA: Prindle, Weber Schmidt, 1985.

No context found.

Burden, R.L., Faires, J.D., Reynolds, A.C. Numerical Analysis, Prindle, Weber & Scmidt Publ., 1978.

No context found.

R.L. Burden, J.D. Faires and A.C. Reynolds, Numerical Analysis, Prindle, Weber & Scmidt, 1978.

No context found.

R. L. Burden and J. D. Faires. Numerical Analysis. PWS-KENT, Boston, MA, 5 th edition, 1993.

No context found.

R. L. Burden and J. D. Faires. Numerical Analysis. PWS-KENT, Boston, MA, 5 th edition, 1993.

No context found.

R. Burden and J. D. Faires. Numerical Analysis. Prindle,Weber, and Schmidt, 1985.

No context found.

R. L. Burden and J. D. Faires, Numerical Analysis, 6th ed. (Brooks Cole, Pacific Grove, Calif., 1997).

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