Module org.bzdev.math
Package org.bzdev.math
package org.bzdev.math
Mathematics package.
This package contains implementations of special functions, algorithms for numerical quadrature, solutions to differential equations, etc.
Please see the description of this package for additional information.
-
ClassDescriptionClass representing a summation.Add a series of values using the Kahan summation algorithm.Encapsulate the state of an instance of Adder.Kahan.Add a series of numbers using pairwise summation.Class representing polynomials using a Bernstein basis.Compute Bézout coefficients for two integers.Bicubic Interpolation class.Interpolation based on cubic triangular Bernstein-Bézier patches.Class for computing binomial coefficients.Class implementing B-splines.Modes for creating a B-spline from a set of data points.Class implementing vector-valued B-splines.Cholesky Decomposition class.Class defining various mathematical constants.Class providing a cubic spline for an evenly spaced set of values, with each segment using a Bernstein Polynomial basis.Abstract class defining a cubic spline.The mode for creating a spline.Class providing a cubic spline for an evenly spaced set of values.Create a cubic spline for an unevenly spaced set of values.Eigenvalues and eigenvectors of a real n by n matrix A.Fast Fourier Transform.Factory class for creating FFT instances that satisfy various criteria.FFT length mode.FFT normalization mode.Class implementing elementary and special functions.Class containing methods specific to Bernstein polynomials.This class does a high-precision computation of erfc, which fills in a table used to create a spline to allow us to interpolate over a range of values where accuracy is a problem: values high enough that erf(x) is too close to 1.0 for erfc(x) = 1 - erf(x) to be an accurate approximation, but too low for the asymptotic expansion to be accurate to one part in 10 to the 10th.Class providing static methods for computing Gamma functions, their logarithms, and asymptotic values.Class representing Legendre polynomials.GLQuadrature<P>Implementation of Gauss-Legendre quadrature.Class representing common operations for least square fits.Class providing a least squares fit using a BSpline.Linear least squares fit using a specified function basis.Class for linear least-squares fit.Class to provide non-linear least-squares fits.Class to provide data that controls the algorithm used to create a least-squares fit.Class to provide a linear least squares fit when the basis functions are the functions whose values are 1, x, x2, x3, etc.Class to implement the Levenberg-Marquardt algorithm for solving non-linear least squares problems.LMA exception class for the case where convergence fails.The mode determining how a sum of squares is calculated.LU Decomposition class.Exception for errors in computing mathematical functions.Basic matrix operations.Class implementing vector-valued NURBS (Non Uniform Rational B-Splines).Permutation class.Table implementation for generating Poisson-distributed values.Class representing polynomials using a monomial basis.Class providing operations on polynomials.Exception to indicate that the polynomial passed to
Polynomials.integrateRootP4(Polynomial,double,double)
has a factor with whose minimum value is close to zero.QR Decomposition of an m by n matrix where m ≥ n.A mapping from a double-precision number to a vector of double-precision numbers.Operations for the domain of a function with a single real-valued argument.Class defining a real-valued function with a real argument.Class defining a real-valued function with three real arguments.Class defining a real-valued function with two real arguments.Class defining a real-valued function with an arbitrary number of arguments.Class representing a real-valued function of the form f(x,β1,...) = ∑i βifi(x).Interface representing a real-valued function.Interface representing a real-valued function of two arguments.Interface representing a real-valued function of two arguments.Interface representing a real-valued function with a variable number of arguments.RootFinder<P>Root finder.RootFinder class using Brent's method.RootFinder exception class.RootFinder class using Halley's method.RootFinder class using Newton's method.RungeKutta<P>Implementation of the Runge Kutta algorithm for first-order differential equations.RungeKutta2<P>Runge Kutta algorithm for solutions of second order differential equations.RungeKuttaMV<P>Multi-variable implementation of the Runge Kutta algorithm.SimpsonsRule<P>Implementation of Simpson's rule.Random-number generator class.Singular Value Decomposition for an m by n matrix.Interface representing common operations for triangular decompositions of matrices.Solve the equation y = Ax where x and y are column vectors and A is a tridiagonal matrix (one with nonzero values on and direction above and below the diagonal).Operations for function domains when there is a variable number of arguments.Vector-algebra operations.Base class for vector-valued functions with one argument.Vector-valued functions with a variable number of arguments.Implementation of Gauss-Legendre quadrature that returns multiple integrals over the same range, with the results stored in an array.