跃文

练习一：向前欧拉法解方程 y′(t)y(0)=−2y(t)+t=1\begin{aligned} y'(t)&=-2y(t)+t\\ y(0)&=1 \end{aligned} 算法解释：对于一般的常微分方程 y′(t)y(t0)=f(t,y)=y0\begin{aligned} y'(t)&=f(t,y)\\ y(t_0)&=y_0 \end{aligned} yi+1−yiΔt=f(ti

function fem1d_adaptive ( )%*****************************************************************************80 % %% MAIN is the main program for FEM1D_ADAPTIVE. % % Discussion: % % FEM1D_ADAPTIVE solv

# include <iostream> #include<vector> /* 注意这里要先声明 vector */ using namespace std; /*本程序：输入一组整数，找到最小值，然后每个元素减去这个最小值*/int main() { int n; cin >> n; vector<int>S(n); for (int i = 0; i < n;

#include <cstdio> #include <iostream> #include <cmath> #include <algorithm>using namespace std;double F(double x){ //这里自定义函数 return x * x + x; }double simpson(double a,double b){ //返回区间[a,b]的三

function sec1_2_burgersFDM(jmax) % % example driver for Burgers' equation in section 1.2. % it calls movfdm(). %% % Copyright (C) 2010 Weizhang Huang and Robert D. Russell % all rights reserved. % % Th