
Convolution integral approximation via trapezoidal quadrature rule 1.0 File ID: 78508 


 Convolution integral approximation via trapezoidal quadrature rule 1.0 License: Freeware File Size: 41.0 KB Downloads: 71
Submit Rating: 



Convolution integral approximation via trapezoidal quadrature rule 1.0 Description 

Description: This code computes the approximation of the convolution integral (*) between two functions, f(t) and g(t), sampled at the times t1,t2,...,tm (unit spacing), via the trapezoidal quadrature rule. To compute the integral with other than unit spacing, multiply the result by the spacing increment.
Computation is very fast because it has been used the built in function conv(). To conv() result has then been added what misses for trapezoidal approximation.
Convolution integral is defined as: (*) h(t)=int{f(tau)*g(ttau)}dtau.
License: Freeware Related: built, incrementcomputation, result, multiply, Function, added, dintftaugttaudtau, Defined, approximationconvolution, misses, Compute, Functions, integral, convolution, approximation, sampled, times O/S:BSD, Linux, Solaris, Mac OS X File Size: 41.0 KB Downloads: 71


More Similar Code 

This function computes the integral "I" via Simpson's rule in the interval [a,b] with n+1 equally spaced points
Syntax: I = simpsons(f,a,b,n)
Where, f= can either be an anonymous function (e.g. f=@(x) sin(x)) or a vector containing equally spaced values of the function to be integrated a= Initial point of interval b= Last point of interval n= # of subintervals (panels), must be...
A new general IIR digital fractional order differentiator/integrator based on continued fraction expansion of weighted operator which is mixed scheme of the trapezoidal (Tustin) rule and the backward difference (Euler) rule.
For more...
A new general IIR type digital fractionalorder differentiator and integrator based on power series expansion of the trapezoidal (Tustin) rule.
For more details and help write: >> help dfod3
See also my previous...
The nondimensional form of Volterra's model for population growth in a closed system is given by
k*(du/dt) = u  u^2  u int_0^t u(x) dx
This gui allows the user to input the initial population u0, nondimensional constant k,...
QUADCC is a robust, doublyadaptive quadrature routine using ClenshawCurtis rules. This is a Matlab implementation of "Algorithm 3" as described in "Increasing the Reliability of Adaptive Quadrature Using Explicit...
generates zeros of a Hermite polynomial of degree n to tolerance "tol" and their associated weights. Uses recursion relation to generate the Hermite function and finds zeros via change of sign and linear interpolation. If a...
Computes the nth moment mean of a function (needs more implentation).
m = moment(x, y, n)
m = nth moment of y x = domain y = data n = nth moment == 1 by default
m = int(x^n * y) / int(y)
Z = CUMSIMPSUM(Y,DEL) computes an approximation of the cumulative integral of Y from a=0 to b via the Simpson's rule (with unit spacing). For matrices Y, CUMSIMPSUM works on columns of Y. DEL contains the upper limit(s) b.
CUMSIMPSUM is...
FASTRMS Instantaneous rootmeansquare (RMS) power via convolution.
FASTRMS(X), when X is a vector, is the timevarying RMS power of X, computed using a 5point rectangular window centered at each point in the signal. The output is the...
SIMPSON: Simpson's rule for quadratic and cubic numerical integration RES = SIMPSON(Y) computes an approximation of the integral of Y via Simpson's 1/3 rule (with unit spacing). Simpson's 1/3 rule uses quadratic interpolants for... 
User Review for Convolution integral approximation via trapezoidal quadrature rule 
