[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fKw7or6cZPSpC6E4_pcvRbEyzC4nhdYobbZF6rgmKZyw":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":10,"question":13,"related":14,"source":24,"type":31},[],"2024-12-05 08:04:31",1002644864,[8,9],"对","错",{"courseImg":11,"courseName":12},"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F7599edd2b29fde97bd2818297875bdeb.jpg","[共享课]数值计算方法（山东联盟）","设向量x与y的无穷范数相等,则存在Householder变换把x变为Hx=y",[15,26,32,37,40,45,54,59,64,69],{"answer":16,"createTime":5,"id":17,"options":18,"question":23,"source":24,"type":25},[],1002644849,[19,20,21,22],"1.622","1.645","1.690","1.712","exp(x)在区间[0,1]上的1次最佳平方逼近多项式的1次项系数等于","v2",0,{"answer":27,"createTime":5,"id":28,"options":29,"question":30,"source":24,"type":31},[],1002644851,[8,9],"求解同一个方程组的Jacobi迭代法与G-S迭代法具有相同的收敛性",3,{"answer":33,"createTime":5,"id":34,"options":35,"question":36,"source":24,"type":31},[],1002644858,[8,9],"设迭代矩阵M=[0.8,-0.5;-0.7,0.5],则迭代法x[k+1]=M*x[k-1]+g,k=0,1,2,…发散",{"answer":38,"createTime":5,"id":6,"options":39,"question":13,"source":24,"type":31},[],[8,9],{"answer":41,"createTime":5,"id":42,"options":43,"question":44,"source":24,"type":31},[],1002644917,[8,9],"共轭梯度法的思想是把求解方程组Ax=b的问题转化为最优化问题即求x'Ax-2b'x的极小值的问题",{"answer":46,"createTime":5,"id":47,"options":48,"question":53,"source":24,"type":25},[],1002644929,[49,50,51,52],"0.623","0.629","0.675","0.712","取迭代初值为0.8,Newton迭代法解方程f(x)=cos(x)+x^2-1.2=0,迭代2次,得到的根的近似值是多少",{"answer":55,"createTime":5,"id":56,"options":57,"question":58,"source":24,"type":31},[],1002644931,[8,9],"具有两位有效数字的近似数,其十分位和百分位的数字都是准确的",{"answer":60,"createTime":5,"id":61,"options":62,"question":63,"source":24,"type":31},[],1002644942,[8,9],"设A是n阶矩阵,则可经过不超过n(n-1)\u002F2次Givens变换把矩阵A化为上三角矩阵",{"answer":65,"createTime":5,"id":66,"options":67,"question":68,"source":24,"type":31},[],1002644944,[8,9],"设函数f在区间[a,b]上连续,f(a)f(b)<0,则方程f(x)=0在[a,b]内必有唯一根",{"answer":70,"createTime":5,"id":71,"options":72,"question":77,"source":24,"type":78},[],1002644952,[73,74,75,76],"M的谱半径小于1","M的2范数小于或等于1","M的无穷范数小于1","M是严格对角占优矩阵","求解线性方程组的迭代法x[k+1]=M*x[k-1]+g,k=0,1,2,…收敛的充分条件有哪些",1]