Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - minres matlab
Search - minres matlab - List
计算特征值和特征向量的幂法和反幂法以及计算矩阵的minres 算法的matlab程序-calculated eigenvalues and eigenvectors of power and anti-power-law and calculate the matrix algorithm mat minres lab procedures
Update : 2008-10-13 Size : 1.45kb Publisher : 韩国锋

计算特征值和特征向量的幂法和反幂法以及计算矩阵的minres 算法的matlab程序-calculated eigenvalues and eigenvectors of power and anti-power-law and calculate the matrix algorithm mat minres lab procedures
Update : 2025-02-19 Size : 1kb Publisher : 韩国锋

DL : 0
采用CG法求解稀疏对称奇异矩阵得到的Ax=b-Implementation of a conjugate-gradient type method for solving sparse linear equations: Solve Ax = b or (A- sI)x = b. The matrix A- sI must be symmetric but it may be definite or indefinite or singular. The scalar s is a shifting parameter – it may be any number. The method is based on Lanczos tridiagonalization. You may provide a preconditioner, but it must be positive definite.
Update : 2025-02-19 Size : 6kb Publisher : MINRES

主要是关于高等数值分析中关于CG法,MINRES法,Lanczos方法解大型稀疏矩阵的matlab算法实现-the matlab code about the advacned value analysis curriculum the algorithm for CG MINRES and Lanczos
Update : 2025-02-19 Size : 3.61mb Publisher : 饶刚

DL : 0
本程序为线性方程组的matlab代码,主要比较了CG,Lanczos和MINRES三种方法解方程Ax=b的效果。-This program is linear equations matlab code, the main comparison of CG, Lanczos and MINRES three ways to solve the equation Ax = b in effect.
Update : 2025-02-19 Size : 8kb Publisher :

DL : 0
krylov子空间法 krylov子空间方法的程序实现,用于解高阶矩阵-Matlab Codes for Krylov subspace methods 1. MINRES method by Paige and Saunders implementation function [ x, istop, itn, rnorm, Arnorm, Anorm, Acond, ynorm ] = ... minres( A, b, M, shift, show, check, itnlim, rtol ) [ x, istop, itn, rnorm, Arnorm, Anorm, Acond, ynorm ] = ... minres( A, b, M, shift, show, check, itnlim, rtol ) minres solves the n x n system of linear equations Ax = b or the n x n least squares problem min ||Ax- b||_2^2, where A is a symmetric matrix (possibly indefinite or singular) and b is a given vector. The dimension n is defined by length(b). INPUT: A may be a dense or sparse matrix (preferably sparse!) or a function handle such that y = A(x) returns the product y = A*x for any given n-vector x. If M = [], preconditioning is not used. Otherwise, M defines a positive-definite preconditioner M = C*C . M may be a dense or sparse matrix (preferably sparse!) or a function handle such that y = M(x) solves th
Update : 2025-02-19 Size : 6kb Publisher : lux

清华大学高等数值分析计算实践题目一,生成矩阵分析CG法、Lanczos法、MINRES法得收敛性(Tsinghua University higher numerical analysis and calculation of practical topics First, generate matrix analysis CG method, Lanczos method, MINRES method of convergence)
Update : 2025-02-19 Size : 4.35mb Publisher : Mao_tree
CodeBus is one of the largest source code repositories on the Internet!
Contact us :
1999-2046 CodeBus All Rights Reserved.