数值分析
文章平均质量分 89
HGGshiwo
这个作者很懒,什么都没留下…
展开
-
数值分析1.Mathematical Preliminaries
Truncation Error: 截断误差,由于计算公式产生的误差。Roundoff Error: 舍入误差,计算机内部表示对浮点数表示不精确产生的误差。需要注意的是,浮点数的表示是把一个无限小数表示为另一个无限小数。截断误差是把无限小数变为有限小数。看结果是不是有限位可以区分二者。absolute error:| p – p* |relative error:| p – p* | / | p |significant digits:精度精度有几位从第一个非0的开始数除小数,乘大数往往原创 2020-10-18 18:39:41 · 476 阅读 · 0 评论 -
数值分析2.Solutions of Equations in One Variable
1.Bisection(二分法)To find a solution to f (x) = 0 given the continuous function f on the interval [ a, b ], where f (a) and f (b) have opposite signs.Input: endpoints a, b; tolerance TOL; maximum number of iterations Nmax.Output: approximate solution原创 2021-01-17 21:42:11 · 329 阅读 · 0 评论 -
数值分析3.Interpolation and Polynomial Approximation
求多项式P(x)P(x)P(x),使得对给定的n个点(x0,f(x0)),(x2,f(x2)),...,(xn,f(xn))(x_0,f(x_0)),(x_2,f(x_2)),...,(x_n,f(x_n))(x0,f(x0)),(x2,f(x2)),...,(xn,f(xn))有f(xi)=P(xi)f(x_i)=P(x_i)f(xi)=P(xi)1.Lagrange Polynomial目标是第i项的系数为1,其余的系数为0。拉格朗日多项式为:P(x)=∑i=0n(x−x0),..原创 2020-12-20 23:52:46 · 440 阅读 · 1 评论 -
数值分析4.Numerical Differentiation and Integration
1.求f’(x0):三个点x0,x0+h,x0+2h:f′(x0)=12h[−3f(x0)+4f(x0+h)−f(x0+2h)]+h23f3(ϵ),x0<ϵ<x0+2hf'(x_0)=\frac{1}{2h}[-3f(x_0)+4f(x_0+h)-f(x_0+2h)]+\frac{h^2}{3}f^{3}(\epsilon),x_0<\epsilon<x_0+2hf′(x0)=2h1[−3f(x0)+4f(x0+h)−f(x0+2h)]+3h2f3(ϵ),x0<原创 2020-11-27 19:56:01 · 315 阅读 · 0 评论 -
数值分析5.Initial-Value Problems for Ordinary Differential Equations
已知1.y′=f(x)y'=f(x)y′=f(x)2.y(a)=αy(a)=\alphay(a)=α,3.x∈(a,b)x\in(a,b)x∈(a,b)求解yyy符号说明:取定整数Nh=b−aNh=\frac{b-a}Nh=Nb−ati=a+hit_i=a+hiti=a+hiwi=y(ti)w_i=y(t_i)wi=y(ti)Euler’s Method:w0=α,wi+1=wi+hf(ti,wi)w_0=\alpha,w_{i+1}=w_i+hf(t_i,w_i)w0=α,原创 2020-12-20 13:04:26 · 315 阅读 · 1 评论 -
数值分析 6.Direct Methods for Solving Linear Systems
求解线性方程组Ax=b1.Gaussian Elimination高斯消除法,首先将矩阵化为上三角阵,然后从后解未知数Step 1:如果a11不为0,则,(第2到n行减去mi1*row1)Step k:如果aii不为0,则从第k行到n行减去上一行乘n得到上三角矩阵:Backward-substitution:次数计算:消元法:共执行n-1步,乘法:a:(n-k)(n-k)次,b:(n-k)次,除法:m:(n-k)次..原创 2021-01-17 23:37:38 · 717 阅读 · 1 评论 -
数值分析7. Iterative Techniques in Matrix Algebra
数值法求解Ax=b1.Vector Norms满足正定性,齐次性,三角不等式,无穷范数是最大的坐标值范数等价的定义:If there exist positive constants C1 and C2 such that , then || · ||A and || · ||B are said to be equivalent.All the vector norms on Rn are equivalent.2.Matrix Norms...原创 2021-01-18 08:13:11 · 348 阅读 · 1 评论 -
数值分析 8.Approximation Theory
1.f(x)在[a,b]上的n次插值多项式。需要n个点构造拉格朗日多项式进行插值,n个点的选取如下:切比雪夫多项式的零点:ti=cos(2k−12nπ),k=1,2,...,nt_i = \cos(\frac{2k-1}{2n}\pi),k=1,2,...,nti=cos(2n2k−1π),k=1,2,...,n从[-1,1]线性映射到[a,b]xi=(b−a)t+(a+b)2x_i =\frac{(b-a)t+(a+b)}{2}xi=2(b−a)t+(a+b)使用xix_ixi进行原创 2020-11-27 18:39:17 · 376 阅读 · 0 评论 -
数值分析9.Approximating Eigenvalues
1.The Power Method寻找最大特征值。不断按照x=Au迭代,u是上一次的x归一化的结果。当前的特征值为x坐标中绝对值的最大的Algorithm: Power MethodTo approximate the dominant eigenvalue and an associated eigenvector of the n*n matrix A given a nonzero initial vector.Input: dimension n; matrix a.原创 2021-01-18 08:36:39 · 687 阅读 · 0 评论 -
Gaussian Elimination和Gauss-Jordan method
Gaussian Elimination对于某一行目的操作使主对角元为1该行所有元素除以aii把该行主对角元下所有元素变为0每次把该行乘-aji加到下方的行上共循环1到n-1次,循环到的行帮助其下方的行元素变为0每一行操作次数除法n-i(每个元素除主对角元,一共n-i个元素(主对角元就不用了))乘法(n-i)(n-i+1)(每次要乘n-i+1个元素,要乘n-i次)加法/减法(n-i)(n-i+1)(减每一行有n-i+1个元素,要原创 2020-10-01 15:32:58 · 1067 阅读 · 0 评论 -
数值分析(NA)PTA题解索引
完结撒花!emmm,虽然我做的时候也磕磕绊绊,网上到处搜题解,但是想着还是把自己所思所想以及一些经历记录下来。如果对大家有帮助那最好了。如果没有的话,就当我自娱自乐吧。分享一句话哦:我从地狱而来,梦想天堂,正路过人间。想着生活太难了的时候,咬咬牙再坚持一下吧,想着可能会好起来的,说不定真的就好起来了呀。索引6-1 Numerical Summation of a Series (40)6-2 Root of a Polynomial (50分)6-3 There is No Free L.原创 2020-12-13 09:28:16 · 2703 阅读 · 6 评论 -
6-1 Numerical Summation of a Series (40分)
Produce a table of the values of the seriesor the 3001 values of x, x = 0.0, 0.1, 0.2, …, 300.00. All entries of the table must have an absolute error less than 10−10 . This problem is based on a problem from Hamming (1962), when mainframes were very原创 2020-09-29 15:51:42 · 2587 阅读 · 1 评论 -
6-2 Root of a Polynomial (50分)
A polynomial of degree n has the common form as p(x)=cYour task is to write a function to find a root of a given polynomial in a given interval.Format of function:double Polynomial_Root(int n, double c[], double a, double b, double EPS);where int n原创 2020-09-29 16:21:04 · 2381 阅读 · 0 评论 -
6-3 There is No Free Lunch (40分)
One day, CYLL found an interesting piece of commercial from newspaper: the Cyber-restaurant was offering a kind of “Lunch Special” which was said that one could “buy one get two for free”. That is, if you buy one of the dishes on their menu, denoted by di原创 2020-10-11 15:31:36 · 2509 阅读 · 7 评论 -
6-4 Compare Methods of Jacobi with Gauss-Seidel (50分)
Use Jacobi and Gauss-Seidel methods to solve a given n×n linear system Ax⃗ =b⃗ with an initial approximationx⃗(0) .Note: When checking each aii , first scan downward for the entry with maximum absolute value (aii incl原创 2020-11-03 22:17:08 · 1681 阅读 · 0 评论 -
6-5 Approximating Eigenvalues (40分)
Approximate an eigenvalue and an associated eigenvector of a given n×n matrix A near a given value p and a nonzero vector x⃗ =(x1 ,⋯,xn )T .Format of function:int EigenV(int n, double a[][MAX_SIZE], double *lambda, double v[], double TOL, in原创 2020-11-13 01:23:39 · 1915 阅读 · 1 评论 -
6-6 Cubic Spline (50分)
Construct the cubic spline interpolant S for the function f, defined at points x0 <x1 <⋯<xn , satisfying some given boundary conditions. Partition a given interval into m equal-length subintervals, and approximate the function values at t原创 2020-11-13 17:19:57 · 1677 阅读 · 2 评论 -
6-7 Orthogonal Polynomials Approximation (40分)
Given a function f and a set of m>0 distinct points x1 <x2 <⋯<xm . You are supposed to write a function to approximate f by an orthogonal polynomial using the exact function values at the given m points with a weight w(xi ) assigned原创 2020-11-16 09:58:46 · 1807 阅读 · 0 评论 -
6-8 Shape Roof (50分)
The kind of roof shown in Figure 1 is shaped from plain flat rectangular plastic board in Figure 2.Figure 1Figure 2The transection of the roof is a sine curve which fits the function y(x)=lsin(lx) in centimeters. Given the length of the roof, your task原创 2020-12-13 09:11:07 · 1505 阅读 · 0 评论