<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[mucai1的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/mucai1</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; mucai1]]></copyright><item><title><![CDATA[nonono]]></title><link>https://blog.youkuaiyun.com/mucai1/article/details/103951513</link><guid>https://blog.youkuaiyun.com/mucai1/article/details/103951513</guid><author>mucai1</author><pubDate>Mon, 13 Jan 2020 00:53:35 +0800</pubDate><description><![CDATA[1. suppose we are at the i-th step of the continuous process and the i-th solution is ...(假设。。。)

2.For this simulation, load data from March 31st were sourcedfrom CAISO OASIS [10], and scaled such ...]]></description><category></category></item><item><title><![CDATA[Eigen 使用]]></title><link>https://blog.youkuaiyun.com/mucai1/article/details/103518862</link><guid>https://blog.youkuaiyun.com/mucai1/article/details/103518862</guid><author>mucai1</author><pubDate>Thu, 12 Dec 2019 23:51:37 +0800</pubDate><description><![CDATA[矩阵拼接
	水平：

	
MatrixXd C(A.rows(), A.cols()+B.cols());
C &lt;&lt; A, B;


	垂直：

	
MatrixXd D(A.rows()+B.rows(), A.cols());
D &lt;&lt; A,
     B;
	
]]></description><category></category></item><item><title><![CDATA[Julia 相关]]></title><link>https://blog.youkuaiyun.com/mucai1/article/details/99616669</link><guid>https://blog.youkuaiyun.com/mucai1/article/details/99616669</guid><author>mucai1</author><pubDate>Wed, 14 Aug 2019 22:31:23 +0800</pubDate><description><![CDATA[1. JuMP

 自动微分获得导数信息

http://www.autodiff.org/Docs/euroad/17th%20EuroAd%20Workshop%20-%20Miles%20Lubin%20%20%20Jarrett%20Revels%20-%20Automatic%20differentiation%20in%20Julia.pdf

2. julia简明教程

htt...]]></description><category></category></item><item><title><![CDATA[理解prony 算法]]></title><link>https://blog.youkuaiyun.com/mucai1/article/details/94425436</link><guid>https://blog.youkuaiyun.com/mucai1/article/details/94425436</guid><author>mucai1</author><pubDate>Tue, 02 Jul 2019 06:46:32 +0800</pubDate><description><![CDATA[刚开始阅读一些文章，在介绍prony方法时，一上来就跳到构造线性差分方程，由于好久没做动态的东西，很是想不通怎么求解。 之后翻看了一些以前的基本知识，才逐渐明白。

1. 首先prony 方法的目的是：采用 p 个具有任意幅值、相位、频率和衰减因子的指数函数的线性组合对振荡数据进行等间距采样，提取并分析振荡特征，进行模式识别

                 ...]]></description><category></category></item><item><title><![CDATA[CentOS 扩容]]></title><link>https://blog.youkuaiyun.com/mucai1/article/details/92881529</link><guid>https://blog.youkuaiyun.com/mucai1/article/details/92881529</guid><author>mucai1</author><pubDate>Thu, 20 Jun 2019 03:31:56 +0800</pubDate><description><![CDATA[virtualBox虚拟机linux（CentOS）扩容（增加原先设置的大小 扩容至根目录）



https://blog.youkuaiyun.com/onlysingleboy/article/details/38562283



最主要的是，确定自己新扩出来的是什么名字：



编译版本切换 gcc6 到 gcc 7


sudo yum install centos-release-scl...]]></description><category></category></item><item><title><![CDATA[matlab mex 编译C++  .cpp文件， 静态库文件  .so]]></title><link>https://blog.youkuaiyun.com/mucai1/article/details/90688105</link><guid>https://blog.youkuaiyun.com/mucai1/article/details/90688105</guid><author>mucai1</author><pubDate>Thu, 30 May 2019 03:10:56 +0800</pubDate><description><![CDATA[1. 链接动态、静态库文件

https://blog.youkuaiyun.com/shaoxiaohu1/article/details/37744309



2. mexfunction （）介绍

https://blog.youkuaiyun.com/u010545732/article/details/22975491
]]></description><category></category></item><item><title><![CDATA[挺有意思的 电压等级变化]]></title><link>https://blog.youkuaiyun.com/mucai1/article/details/90198984</link><guid>https://blog.youkuaiyun.com/mucai1/article/details/90198984</guid><author>mucai1</author><pubDate>Tue, 14 May 2019 05:41:22 +0800</pubDate><description><![CDATA[raisinbran, eventhough you concluded,let me supplement as this was a topic intriguing me.My search concluded as below:
CommercialElectric distribution was first done by Edison and his Manhattan DC li...]]></description><category></category></item><item><title><![CDATA[转：matlab调用python，matlab找不到python]]></title><link>https://blog.youkuaiyun.com/mucai1/article/details/89325437</link><guid>https://blog.youkuaiyun.com/mucai1/article/details/89325437</guid><author>mucai1</author><pubDate>Tue, 16 Apr 2019 06:32:21 +0800</pubDate><description><![CDATA[matlab找不到python，可以输入pyversion python.exe的执行路径即可。（我的python.exe的执行路径是D:\Anaconda\python.exe所以我输入pyversion D:\Anaconda\python.exe就行）。



转自：https://blog.youkuaiyun.com/xiaotao_1/article/details/79214275
...]]></description><category></category></item><item><title><![CDATA[OPF 难解case]]></title><link>https://blog.youkuaiyun.com/mucai1/article/details/88361685</link><guid>https://blog.youkuaiyun.com/mucai1/article/details/88361685</guid><author>mucai1</author><pubDate>Sat, 09 Mar 2019 04:15:46 +0800</pubDate><description><![CDATA[14bus case; 当前线路功率极限为Slmax

调整为0.89*Slmax, OPF收敛
	调整为0.93-1.0001*Slmax,OPF不收敛
	调整为1.1*Slmax, OPF 收敛
其实整个计算过程中，line flow 是not active. 但是在有解时，发电机active power 抵在下限，reactive power 抵在上限。

这个case失败是因为内点法本身的...]]></description><category></category></item><item><title><![CDATA[最小二乘算法介绍]]></title><link>https://blog.youkuaiyun.com/mucai1/article/details/87699061</link><guid>https://blog.youkuaiyun.com/mucai1/article/details/87699061</guid><author>mucai1</author><pubDate>Tue, 19 Feb 2019 12:33:55 +0800</pubDate><description><![CDATA[本博客基本是ceres 的翻译，更多信息请查看 http://ceres-solver.org/nnls_solving.html

待求解最小二乘问题：

                                                           

其中： and 

 

求解方法主要分为两类：

1. Trust Region methods

2. linear...]]></description><category></category></item><item><title><![CDATA[OPTI 返回值 意思]]></title><link>https://blog.youkuaiyun.com/mucai1/article/details/87149774</link><guid>https://blog.youkuaiyun.com/mucai1/article/details/87149774</guid><author>mucai1</author><pubDate>Wed, 13 Feb 2019 06:26:17 +0800</pubDate><description><![CDATA[1 Optimal Solution

0 Iteration / Function Evaluation / Time Limit Reached

-1 Infeasible Problem

-2 Unbounded / Solver Error

-3 Solver Specific Error

-5 User exited]]></description><category></category></item><item><title><![CDATA[验证Hessian 矩阵正确性（matpower）代码]]></title><link>https://blog.youkuaiyun.com/mucai1/article/details/86698407</link><guid>https://blog.youkuaiyun.com/mucai1/article/details/86698407</guid><author>mucai1</author><pubDate>Wed, 30 Jan 2019 07:35:37 +0800</pubDate><description><![CDATA[
%%-----  do numerical check using (central) finite differences  -----
if 1
    nx = length(x);
    step = 1e-5;
    num_d2f = sparse(nx, nx);
    num_d2G = sparse(nx, nx);
    num_d2H = sparse(nx, nx...]]></description><category></category></item><item><title><![CDATA[Linux(Ubuntu) cplex /IPOPT  Eclipse使用]]></title><link>https://blog.youkuaiyun.com/mucai1/article/details/86561322</link><guid>https://blog.youkuaiyun.com/mucai1/article/details/86561322</guid><author>mucai1</author><pubDate>Sun, 20 Jan 2019 13:24:26 +0800</pubDate><description><![CDATA[跳坑多了，将经验记下来，防止下次再跳进去，也帮助跳坑的人快点爬出来

 

 

1. 我使用eclipse, cplex 需要加入include lib 路径 在链接里有介绍

https://www.ibm.com/support/knowledgecenter/zh/SSSA5P_12.7.0/ilog.odms.cplex.help/CPLEX/GettingStarted/topics/...]]></description><category></category></item><item><title><![CDATA[好的PPT]]></title><link>https://blog.youkuaiyun.com/mucai1/article/details/86490438</link><guid>https://blog.youkuaiyun.com/mucai1/article/details/86490438</guid><author>mucai1</author><pubDate>Tue, 15 Jan 2019 12:00:22 +0800</pubDate><description><![CDATA[

来自：https://www.minlp.org/pdf/Bologna07.pdf]]></description><category></category></item><item><title><![CDATA[几种矩阵分解算法： LU分解，Cholesky分解，QR分解，SVD分解，Jordan分解]]></title><link>https://blog.youkuaiyun.com/mucai1/article/details/85242098</link><guid>https://blog.youkuaiyun.com/mucai1/article/details/85242098</guid><author>mucai1</author><pubDate>Tue, 25 Dec 2018 06:49:40 +0800</pubDate><description><![CDATA[目录

1.LU分解

2. LDLT分解法

3. Cholesky分解的形式

4. QR分解

5.SVD分解

5.1 SVD与广义逆矩阵

6. Jordan 分解

参考文章：

                                                                                                        ...]]></description><category></category></item><item><title><![CDATA[计算库链接]]></title><link>https://blog.youkuaiyun.com/mucai1/article/details/85011286</link><guid>https://blog.youkuaiyun.com/mucai1/article/details/85011286</guid><author>mucai1</author><pubDate>Sat, 15 Dec 2018 04:29:56 +0800</pubDate><description><![CDATA[1. IPOPT

   IPOPT是在linux下开发的，但是对于windows使用很不方便

  github 上有cmake好的文件：https://github.com/ampl/coin

  下载下来，利用CMAke编译好即可（该文件包含了coin项目的很多其他库）

 

2. suitesparse

   大规模线性计算：也是在github上有cmake工程

  https:/...]]></description><category></category></item><item><title><![CDATA[islide 安装 PPT崩溃问题]]></title><link>https://blog.youkuaiyun.com/mucai1/article/details/82595305</link><guid>https://blog.youkuaiyun.com/mucai1/article/details/82595305</guid><author>mucai1</author><pubDate>Mon, 10 Sep 2018 20:15:49 +0800</pubDate><description><![CDATA[islide 是近两年出现并火起来的PPT制作插件。

对我们这些没有太多精力设计PPT的人，是一个福音

但是在安装时，安装好islide后，PPT启动就提示“”“已停止工作”

卸载重装都无济于事

最后添加islide技术QQ支持群527140614

技术人员建议我卸载net 4.6

 

然后安装群里面的dotnet打头的文件

 

islide就可以使用了





...]]></description><category></category></item><item><title><![CDATA[广义逆]]></title><link>https://blog.youkuaiyun.com/mucai1/article/details/81750843</link><guid>https://blog.youkuaiyun.com/mucai1/article/details/81750843</guid><author>mucai1</author><pubDate>Thu, 16 Aug 2018 23:54:11 +0800</pubDate><description><![CDATA[https://wenku.baidu.com/view/0bc3ac86ccbff121dc368302.html?from=search

 

讲解了广义逆的相关内容

 

在矩阵不满秩时，主要是Moore-Penrose逆，是最小二乘逆，广泛用于线性方程计算中。

 

所以当解不唯一时，求得的是最小范数逆

 

如果作为迭代计算的话，是可以作为步长更新用的...]]></description><category></category></item><item><title><![CDATA[泛函基本概念]]></title><link>https://blog.youkuaiyun.com/mucai1/article/details/81677102</link><guid>https://blog.youkuaiyun.com/mucai1/article/details/81677102</guid><author>mucai1</author><pubDate>Wed, 15 Aug 2018 00:49:17 +0800</pubDate><description><![CDATA[1. Cauchy 序列

  设是中的序列，若对任意给定, 都存在正数N,使得对一切m,n, 都有

                

则称是中的Cauchy序列，或基本序列

2. Banach空间

 设X为赋范空间，如果X中的任意Cauchy序列都收敛，则称X是完备的赋范空间，简称为Banach空间



3. 级数

 设是赋范线性空间X...]]></description><category></category></item><item><title><![CDATA[ODE 求解方法]]></title><link>https://blog.youkuaiyun.com/mucai1/article/details/81182864</link><guid>https://blog.youkuaiyun.com/mucai1/article/details/81182864</guid><author>mucai1</author><pubDate>Tue, 24 Jul 2018 13:05:41 +0800</pubDate><description><![CDATA[本篇博客将对ODE求解方法的一些基本概念，方法做一个学习，总结

we want to solve the differential equations 

                                                               

Numerical methods for solving first-order IVPs often fal...]]></description><category></category></item></channel></rss>