When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. GPOPS-II - Wikipedia

    en.wikipedia.org/wiki/GPOPS-II

    GPOPS-II (pronounced "GPOPS 2") is a general-purpose MATLAB software for solving continuous optimal control problems using hp-adaptive Gaussian quadrature collocation and sparse nonlinear programming.

  3. CORDIC - Wikipedia

    en.wikipedia.org/wiki/CORDIC

    CORDIC (coordinate rotation digital computer), Volder's algorithm, Digit-by-digit method, Circular CORDIC (Jack E. Volder), [1] [2] Linear CORDIC, Hyperbolic CORDIC (John Stephen Walther), [3] [4] and Generalized Hyperbolic CORDIC (GH CORDIC) (Yuanyong Luo et al.), [5] [6] is a simple and efficient algorithm to calculate trigonometric functions, hyperbolic functions, square roots ...

  4. Crout matrix decomposition - Wikipedia

    en.wikipedia.org/wiki/Crout_matrix_decomposition

    The Crout matrix decomposition algorithm differs slightly from the Doolittle method. Doolittle's method returns a unit lower triangular matrix and an upper triangular matrix, while the Crout method returns a lower triangular matrix and a unit upper triangular matrix. So, if a matrix decomposition of a matrix A is such that: A = LDU

  5. Comparison of programming languages (syntax) - Wikipedia

    en.wikipedia.org/wiki/Comparison_of_programming...

    import package.functionMATLAB; import package.class.function – Scala; ... (Documentation string when first line of module, class, method, or function) R ...

  6. List of numerical libraries - Wikipedia

    en.wikipedia.org/wiki/List_of_numerical_libraries

    Functionality similar to MATLAB and Octave. LAPACK++, a C++ wrapper library for LAPACK and BLAS; MFEM is a free, lightweight, scalable C++ library for finite element methods. Intel MKL, Intel Math Kernel Library (in C and C++), a library of optimized math routines for science, engineering, and financial applications, written in C/C++ and ...

  7. Tridiagonal matrix algorithm - Wikipedia

    en.wikipedia.org/wiki/Tridiagonal_matrix_algorithm

    In numerical linear algebra, the tridiagonal matrix algorithm, also known as the Thomas algorithm (named after Llewellyn Thomas), is a simplified form of Gaussian elimination that can be used to solve tridiagonal systems of equations.

  8. Numerical methods for ordinary differential equations

    en.wikipedia.org/wiki/Numerical_methods_for...

    multiderivative methods, which use not only the function f but also its derivatives. This class includes Hermite–Obreschkoff methods and Fehlberg methods, as well as methods like the Parker–Sochacki method [17] or Bychkov–Scherbakov method, which compute the coefficients of the Taylor series of the solution y recursively.

  9. Macaulay's method - Wikipedia

    en.wikipedia.org/wiki/Macaulay's_method

    Macaulay's method (the double integration method) is a technique used in structural analysis to determine the deflection of Euler-Bernoulli beams.Use of Macaulay's technique is very convenient for cases of discontinuous and/or discrete loading.