Computational Methods for Numerical Analysis


[Up] [Top]

Documentation for package ‘cmna’ version 1.0.3

Help Pages

cmna-package Computational Methods for Numerical Analysis
adamsbashforth Initial value problems
adaptint Adaptive Integration
betterpoly Horner's rule
bezier Bezier curves
bilinear Bilinear interpolation
bisection The Bisection Method
bvp Boundary value problems
bvpexample Boundary value problems
bvpexample10 Boundary value problems
cbezier Bezier curves
cgmmatrix Solve a matrix using iterative methods
choleskymatrix Cholesky Decomposition
cmna Computational Methods for Numerical Analysis
cubicspline Natural cubic spline interpolation
detmatrix Calculate the determinant of the matrix
discmethod Volumes of solids of revolution
division Algorithms for divisions
euler Initial value problems
eulersys Initial value problems for systems of ordinary differential equations
fibonacci Fibonacci numbers
findiff Finite Differences
findiff2 Finite Differences
gauss.hermite Gaussian integration method driver
gauss.laguerre Gaussian integration method driver
gauss.legendre Gaussian integration method driver
gaussint Gaussian integration method driver
gaussseidel Solve a matrix using iterative methods
gd Gradient descent
gdls Least squares with graident descent
giniquintile Gini coefficients
goldsect Golden Section Search
goldsectmax Golden Section Search
goldsectmin Golden Section Search
gradasc Gradient descent
graddsc Gradient descent
gradient Gradient descent
heat Heat Equation via Forward-Time Central-Space
hillclimbing Hill climbing
himmelblau Himmelblau Function
horner Horner's rule
invmatrix Invert a matrix
isPrime Test for Primality
iterativematrix Solve a matrix using iterative methods
ivp Initial value problems
ivpsys Initial value problems for systems of ordinary differential equations
jacobi Solve a matrix using iterative methods
kahansum Two summing algorithms
linterp Linear interpolation
longdiv Algorithms for divisions
lumatrix LU Decomposition
mcint Monte Carlo Integration
mcint2 Monte Carlo Integration
midpt rectangle method
midptivp Initial value problems
naivediv Algorithms for divisions
naivepoly Horner's rule
naivesum Two summing algorithms
newton Newton's method
nn Nearest interpolation
nthroot The n-th root formula
polyinterp Polynomial interpolation
pwiselinterp Piecewise linear interpolation
pwisesum Two summing algorithms
qbezier Bezier curves
quadratic The quadratic equation.
quadratic2 The quadratic equation.
rdiff Finite Differences
refmatrix Matrix to Row Echelon Form
replacerow Elementary row operations
resizeImage Image resizing
resizeImageBL Image resizing
resizeImageNN Image resizing
revolution-solid Volumes of solids of revolution
rhorner Horner's rule
romberg Romberg Integration
rowops Elementary row operations
rrefmatrix Matrix to Row Echelon Form
rungekutta4 Initial value problems
sa Simulated annealing
scalerow Elementary row operations
secant Secant Method
shellmethod Volumes of solids of revolution
simp Simpson's rule
simp38 Simpson's 3/8 rule
solvematrix Matrix to Row Echelon Form
summation Two summing algorithms
swaprows Elementary row operations
symdiff Finite Differences
trap Trapezoid method
tridiagmatrix Solve a tridiagonal matrix
tspsa Simulated annealing
vecnorm Norm of a vector
wave Wave Equation using
wilkinson Wilkinson's Polynomial