亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

蟲蟲首頁| 資源下載| 資源專輯| 精品軟件
登錄| 注冊

Triangular

  • The "GEE! It s Simple" package illustrates Gaussian elimination with partial pivoting, which produce

    The "GEE! It s Simple" package illustrates Gaussian elimination with partial pivoting, which produces a factorization of P*A into the product L*U where P is a permutation matrix, and L and U are lower and upper Triangular, respectively. The functions in this package are accurate, but they are far slower than their MATLAB equivalents (x=A\b, [L,U,p]=lu(A), and so on). They are presented here merely to illustrate and educate. "Real" production code should use backslash and lu, not this package.

    標簽: illustrates elimination Gaussian pivoting

    上傳時間: 2016-11-09

    上傳用戶:wang5829

  • The "GEE! It s Simple" package illustrates Gaussian elimination with partial pivoting, which produce

    The "GEE! It s Simple" package illustrates Gaussian elimination with partial pivoting, which produces a factorization of P*A into the product L*U where P is a permutation matrix, and L and U are lower and upper Triangular, respectively. The functions in this package are accurate, but they are far slower than their MATLAB equivalents (x=A\b, [L,U,p]=lu(A), and so on). They are presented here merely to illustrate and educate. "Real" production code should use backslash and lu, not this package.

    標簽: illustrates elimination Gaussian pivoting

    上傳時間: 2014-01-21

    上傳用戶:lxm

  • SuperLU is a general purpose library for the direct solution of large, sparse, nonsymmetric systems

    SuperLU is a general purpose library for the direct solution of large, sparse, nonsymmetric systems of linear equations on high performance machines. The library is written in C and is callable from either C or Fortran. The library routines will perform an LU decomposition with partial pivoting and Triangular system solves through forward and back substitution. The LU factorization routines can handle non-square matrices but the Triangular solves are performed only for square matrices. The matrix columns may be preordered (before factorization) either through library or user supplied routines. This preordering for sparsity is completely separate from the factorization. Working precision iterative refinement subroutines are provided for improved backward stability. Routines are also provided to equilibrate the system, estimate the condition number, calculate the relative backward error, and estimate error bounds for the refined solutions.

    標簽: nonsymmetric solution SuperLU general

    上傳時間: 2017-02-20

    上傳用戶:lepoke

  • distmesh

    matlab有限元網格劃分程序 DistMesh is a simple MATLAB code for generation of unstructured Triangular and tetrahedral meshes. It was developed by Per-Olof Persson (now at UC Berkeley) and Gilbert Strang in the Department of Mathematics at MIT. A detailed description of the program is provided in our SIAM Review paper, see documentation below. One reason that the code is short and simple is that the geometries are specified by Signed Distance Functions. These give the shortest distance from any point in space to the boundary of the domain. The sign is negative inside the region and positive outside. A simple example is the unit circle in 2-D, which has the distance function d=r-1, where r is the distance from the origin. For more complicated geometries the distance function can be computed by interpolation between values on a grid, a common representation for level set methods. For the actual mesh generation, DistMesh uses the Delaunay triangulation routine in MATLAB and tries to optimize the node locations by a force-based smoothing procedure. The topology is regularly updated by Delaunay. The boundary points are only allowed to move tangentially to the boundary by projections using the distance function. This iterative procedure typically results in very well-shaped meshes. Our aim with this code is simplicity, so that everyone can understand the code and modify it according to their needs. The code is not entirely robust (that is, it might not terminate and return a well-shaped mesh), and it is relatively slow. However, our current research shows that these issues can be resolved in an optimized C++ code, and we believe our simple MATLAB code is important for demonstration of the underlying principles. To use the code, simply download it from below and run it from MATLAB. For a quick demonstration, type "meshdemo2d" or "meshdemond". For more details see the documentation.

    標簽: matlab有限元網格劃分程序

    上傳時間: 2015-08-12

    上傳用戶:凜風拂衣袖

主站蜘蛛池模板: 东兰县| 玉田县| 湘西| 兴仁县| 北宁市| 宁化县| 安康市| 霸州市| 台江县| 华容县| 乐业县| 民丰县| 白沙| 班戈县| 城步| 工布江达县| 阿图什市| 晋州市| 公安县| 阿坝| 河北区| 防城港市| 松桃| 湘西| 桑植县| 信丰县| 华亭县| 平陆县| 呼伦贝尔市| 平舆县| 营山县| 灵璧县| 大石桥市| 监利县| 望城县| 福海县| 海城市| 福贡县| 东阳市| 舒兰市| 鹤岗市|