代码搜索结果
找到约 10,000 项符合
Input 的代码
alg027.m
% HORNER'S ALGORITHM 2.7
%
% To evaluate the polynomial
% p(x) = a(n) * x^n + a(n-1) * x^(n-1) + ... + a(1) * x + a(0)
% and its derivative p'(x) at x = x0;
%
% INPUT: degree n; co
alg031.m
% NEVILLE'S ITERATED INTERPOLATION ALGORITHM 3.1
%
% To evaluate the interpolating polynomial P on the
% (n+1) distinct numbers x(0), ..., x(n) at the number x
% for the function f:
%
% I
alg054.m
% ADAMS-FOURTH ORDER PREDICTOR-CORRECTOR ALGORITHM 5.4
%
% To approximate the solution of the initial value problem
% y' = f(t,y), a
alg112.m
% NONLINEAR SHOOTING ALGORITHM 11.2
%
% To approximate the solution of the nonlinear boundary-value problem
%
% Y'' = F(X,Y,Y'), A
alg052.m
% RUNGE-KUTTA (ORDER 4) ALGORITHM 5.2
%
% TO APPROXIMATE THE SOLUTION TO THE INITIAL VALUE PROBLEM:
% Y' = F(T,Y), A
alg036.m
% BEZIER CURVE ALGORITHM 3.6
%
% To construct the cubic Bezier curves C0, ..., Cn-1 in
% parameter form, where Ci is represented by
%
% (xi(t),yi(t)) = ( a0(i) + a1(i)*t + a2(i)*t^2 + a3(i)
alg114.m
% NONLINEAR FINITE-DIFFERENCE ALGORITHM 11.4
%
% To approximate the solution to the nonlinear boundary-value problem
%
% Y'' = F(X,Y,Y'), A
alg032.m
% NEWTONS INTERPOLATORY DIVIDED-DIFFERENCE FORMULA ALGORITHM 3.2
% To obtain the divided-difference coefficients of the
% interpolatory polynomial P on the (n+1) disti
alg027.m
% HORNER'S ALGORITHM 2.7
%
% To evaluate the polynomial
% p(x) = a(n) * x^n + a(n-1) * x^(n-1) + ... + a(1) * x + a(0)
% and its derivative p'(x) at x = x0;
%
% INPUT: degree n; co
alg031.m
% NEVILLE'S ITERATED INTERPOLATION ALGORITHM 3.1
%
% To evaluate the interpolating polynomial P on the
% (n+1) distinct numbers x(0), ..., x(n) at the number x
% for the function f:
%
% I