代码搜索结果

// IOPoint.java // Function block for block diagram animation // import java.awt.*; import java.util.*; public class IOPoint extends LabelledBox { boolean Input; Arc input; Vector output;

% SECANT ALGORITHM 2.4 % % To find a solution to the equation f(x) = 0 % given initial approximations p0 and p1: % % INPUT: initial approximation p0, p1; tolerance TOL; % maxim

% TRAPEZOIDAL WITH NEWTON ITERATION ALGORITHM 5.8 % % TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM: % Y' = F(T,Y), A

% LINEAR FINITE-DIFFERENCE ALGORITHM 11.3 % % To approximate the solution of the boundary-value problem % % Y'' = P(X)Y' + Q(X)Y + R(X), A

% NEWTON-RAPHSON ALGORITHM 2.3 % % To find a solution to f(x) = 0 given an % initial approximation p0: % % INPUT: initial approximation p0; tolerance TOL; % maxi

% EULER'S ALGORITHM 5.1 % % TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM: % Y' = F(T,Y), A

% SIMPSON'S COMPOSITE ALGORITHM 4.1 % % To approximate I = integral ( ( f(x) dx ) ) from a to b: % % INPUT: endpoints a, b; even positive integer n. % % OUTPUT: approximation XI to I.

% LINEAR SHOOTING ALGORITHM 11.1 % % To approximate the solution of the boundary-value problem % % -Y'' + P(X)Y' + Q(X)Y + R(X) = 0, A

% SECANT ALGORITHM 2.4 % % To find a solution to the equation f(x) = 0 % given initial approximations p0 and p1: % % INPUT: initial approximation p0, p1; tolerance TOL; % maxim

% TRAPEZOIDAL WITH NEWTON ITERATION ALGORITHM 5.8 % % TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM: % Y' = F(T,Y), A