Boole's rule

Last updated

In mathematics, Boole's rule, named after George Boole, is a method of numerical integration.

Contents

Formula

Simple Boole's Rule

It approximates an integral:

by using the values of f at five equally spaced points: [1]

It is expressed thus in Abramowitz and Stegun: [2]

where the error term is

for some number between and where 945 = 1 × 3 × 5 × 7 × 9.

It is often known as Bode's rule, due to a typographical error that propagated from Abramowitz and Stegun. [3]

The following constitutes a very simple implementation of the method in Common Lisp which ignores the error term:

(defunintegrate-booles-rule(fx1x5)"Calculates the Boole's rule numerical integral of the function F in   the closed interval extending from inclusive X1 to inclusive X5   without error term inclusion."(declare(type(function(real)real)f))(declare(typerealx1x5))(let((h(/(-x5x1)4)))(declare(typerealh))(let*((x2(+x1h))(x3(+x2h))(x4(+x3h)))(declare(typerealx2x3x4))(*(/(*2h)45)(+(*7(funcallfx1))(*32(funcallfx2))(*12(funcallfx3))(*32(funcallfx4))(*7(funcallfx5)))))))

Composite Boole's Rule

In cases where the integration is permitted to extend over equidistant sections of the interval , the composite Boole's rule might be applied. Given divisions, where mod , the integrated value amounts to: [4]

where the error term is similar to above. The following Common Lisp code implements the aforementioned formula:

(defunintegrate-composite-booles-rule(fabn)"Calculates the composite Boole's rule numerical integral of the   function F in the closed interval extending from inclusive A to   inclusive B across N subintervals."(declare(type(function(real)real)f))(declare(typerealab))(declare(type(integer1*)n))(let((h(/(-ba)n)))(declare(typerealh))(flet((f[i](i)(declare(type(integer0*)i))(let((xi(+a(*ih))))(declare(typerealxi))(thereal(funcallfxi)))))(*(/(*2h)45)(+(*7(+(f[i]0)(f[i]n)))(*32(loopforifrom1to(-n1)by2sum(f[i]i)))(*12(loopforifrom2to(-n2)by4sum(f[i]i)))(*14(loopforifrom4to(-n4)by4sum(f[i]i))))))))

See also

Notes

Related Research Articles

<span class="mw-page-title-main">Bessel function</span> Families of solutions to related differential equations

Bessel functions, first defined by the mathematician Daniel Bernoulli and then generalized by Friedrich Bessel, are canonical solutions y(x) of Bessel's differential equation

In mathematics, the Euler–Maclaurin formula is a formula for the difference between an integral and a closely related sum. It can be used to approximate integrals by finite sums, or conversely to evaluate finite sums and infinite series using integrals and the machinery of calculus. For example, many asymptotic expansions are derived from the formula, and Faulhaber's formula for the sum of powers is an immediate consequence.

<span class="mw-page-title-main">Quasigroup</span> Magma obeying the Latin square property

In mathematics, especially in abstract algebra, a quasigroup is an algebraic structure resembling a group in the sense that "division" is always possible. Quasigroups differ from groups mainly in that the associative and identity element properties are optional.

In mathematics, a surjective function (also known as surjection, or onto function ) is a function f such that, for every element y of the function's codomain, there exists at least one element x in the function's domain such that f(x) = y. In other words, for a function f : XY, the codomain Y is the image of the function's domain X. It is not required that x be unique; the function f may map one or more elements of X to the same element of Y.

<span class="mw-page-title-main">Taylor series</span> Mathematical approximation of a function

In mathematics, the Taylor series or Taylor expansion of a function is an infinite sum of terms that are expressed in terms of the function's derivatives at a single point. For most common functions, the function and the sum of its Taylor series are equal near this point. Taylor series are named after Brook Taylor, who introduced them in 1715. A Taylor series is also called a Maclaurin series when 0 is the point where the derivatives are considered, after Colin Maclaurin, who made extensive use of this special case of Taylor series in the 18th century.

In abstract algebra, a splitting field of a polynomial with coefficients in a field is the smallest field extension of that field over which the polynomial splits, i.e., decomposes into linear factors.

<span class="mw-page-title-main">Newton–Cotes formulas</span> Formulas for numerical integration

In numerical analysis, the Newton–Cotes formulas, also called the Newton–Cotes quadrature rules or simply Newton–Cotes rules, are a group of formulas for numerical integration based on evaluating the integrand at equally spaced points. They are named after Isaac Newton and Roger Cotes.

<span class="mw-page-title-main">Cartesian product of graphs</span> Operation in graph theory

In graph theory, the Cartesian productGH of graphs G and H is a graph such that:

In 1893 Giuseppe Lauricella defined and studied four hypergeometric series FA, FB, FC, FD of three variables. They are :

In numerical linear algebra, the Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to solve a system of linear equations. It is named after the German mathematicians Carl Friedrich Gauss and Philipp Ludwig von Seidel, and is similar to the Jacobi method. Though it can be applied to any matrix with non-zero elements on the diagonals, convergence is only guaranteed if the matrix is either strictly diagonally dominant, or symmetric and positive definite. It was only mentioned in a private letter from Gauss to his student Gerling in 1823. A publication was not delivered before 1874 by Seidel.

In numerical analysis, Aitken's delta-squared process or Aitken extrapolation is a series acceleration method, used for accelerating the rate of convergence of a sequence. It is named after Alexander Aitken, who introduced this method in 1926. Its early form was known to Seki Kōwa and was found for rectification of the circle, i.e. the calculation of π. It is most useful for accelerating the convergence of a sequence that is converging linearly.

In computer vision a camera matrix or (camera) projection matrix is a matrix which describes the mapping of a pinhole camera from 3D points in the world to 2D points in an image.

In the context of combinatorial mathematics, stars and bars is a graphical aid for deriving certain combinatorial theorems. It was popularized by William Feller in his classic book on probability. It can be used to solve many simple counting problems, such as how many ways there are to put n indistinguishable balls into k distinguishable bins.

BMW X may refer to the following BMW crossovers, SAVs, and SACs:

Symbolic circuit analysis is a formal technique of circuit analysis to calculate the behaviour or characteristic of an electric/electronic circuit with the independent variables, the dependent variables, and the circuit elements represented by symbols.

Cluster algebras are a class of commutative rings introduced by Fomin and Zelevinsky. A cluster algebra of rank n is an integral domain A, together with some subsets of size n called clusters whose union generates the algebra A and which satisfy various conditions.

<span class="mw-page-title-main">Vibration of plates</span>

The vibration of plates is a special case of the more general problem of mechanical vibrations. The equations governing the motion of plates are simpler than those for general three-dimensional objects because one of the dimensions of a plate is much smaller than the other two. This permits a two-dimensional plate theory to give an excellent approximation to the actual three-dimensional motion of a plate-like object.

The Benning Road Line, designated Route X1, X3 is a weekday peak hour only bus route operated by the Washington Metropolitan Area Transit Authority between Minnesota Avenue station of the Orange Line of the Washington Metro and Foggy Bottom–GWU station of the Orange, Blue, and Silver Lines of the Washington Metro (X1) or Duke Ellington Bridge in Adams Morgan (X3). The line operates every 10–31 minutes during weekday peak hours in the peak direction only. X1 trips are roughly 41 minutes while X3 trips are roughly 45 minutes. All service along the X1 and X3 lines is currently suspended.

In mathematics and computer science, polynomial evaluation refers to computation of the value of a polynomial when its indeterminates are substituted for some values. In other words, evaluating the polynomial at consists of computing See also Polynomial ring § Polynomial evaluation

References