- 博客(7)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 difference gradient
Calculating gradient of a function with different methods
2017-11-24 11:46:49
380
原创 Error Analysis
Error Analysis[1] “Generally, errors can be divided into two broad and rough but useful classes: systematic and random.”[2]As mentioned above, there are two types of errors associated with an experimen
2017-11-21 11:06:23
1390
原创 LU Decomposition
“Let A be a square matrix. An LU factorization refers to the factorization of A, with proper row and/or column orderings or permutations, into two factors, a lower triangular matrix L and an upper tria
2017-11-19 10:12:03
562
原创 QR分解法(QR decomposition)
QR decomposition divides a m by n matrix AAA into a product of an orthogonal matrix QQQ and an upper triangular matrix RRR:A=QRA=QR A = Q R Thus Ax=b=>QRx=b=>QTQRx=QTb=>Rx=QTbAx=b=>...
2017-11-19 10:08:09
5480
原创 Solving linear equation systems
现代数值计算方法一般都会转化为求解线性方程组. 线性方程组的矩阵形式如下所示:[A][x]=[b][A][x]=[b][A][x]=[b]其中 AAA 是 m×nm×nm \times n 矩阵,m≥nm≥nm \ge n, x∈Rnx∈Rnx \in R^{n}, b∈Rmb∈Rmb\in R^{m}. 由于求解线性方程组在数值分析中基础性核心地位, 线性方程组求解算法和技术一直层...
2017-11-17 19:35:59
601
1
原创 Dijkstra算法 学习笔记
Dijkstra算法是一种最短路径搜索算法.它的基本思路是 在一个带权有向图中,将图中所有顶点分为两组, 一组包含已经找到最短路径的顶点;另一组包含剩余未确定最短路径的顶点. 为了求得两个顶点之间的最短路径,Dijkstra算法从起始点为中心向外遍历,直到搜索到终点为止. Dijkstra算法使用穷举策略,虽然能保证得出最短路径,但计算效率低.
2017-11-09 21:12:37
842
1
原创 spearman
'use strict';var DEBUG = 0;module.exports = function( ) { this.spearman = function( x, y ) { // Checking parameters if( undefined == typeof( x ) ) {
2017-11-09 20:45:42
419
Sipesc.Opt
2013-02-28
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人