数学公式集

Mathematical Formula

  1. Taylor expansion

    g(x)=g(x0)+k=1nfk(xx0)kk!(xx0)k+Rn(x)

    Rn(x) refers to the Lagrange remainder, which is

    Rn(x)=fn+1(ξ)(n+1)!(xx0)n+1

    Lagrange remainder is derived from Cauchy mean value theorem.

  2. Cauchy mean value theorem

    Between a and b always exits a ξ(a,b) to make

    f(b)f(a)g(b)g(b)=f(ξ)g(ξ)

    true.

  3. Why all the functions represent to the sum of the odd and even functions?

    For a regular function f(x)

    f(x)=f(x)+f(x)2+f(x)f(x)2

    even function on the left and odd function on the right.

  4. A method for solving first order nonlinear differential equations.

    For a regular first order nonlinear differential equation

    (1)dydx+P(x)y=Q(x)

    Let y=uv, u and v are all functions about x, so we get

    dydx=vdudx+udvdx

    Then the differential equation become

    (2)dudxv+u(dvdx+P(x)v)=Q(x)

    We want solve the v to make the formula inside the parenthesis to be zero, that is

    dvdx+P(x)v=0

    This is a first order linear differential equation, it's general solution is

    (3)v=C1eP(x)dx

    Let's substitute v into the formula (2), we get

    (4)dudxC1eP(x)dx=Q(x)

    This is a linear differential equation, we can easily solve it, the general solution of u is

    u=1C1Q(x)eP(x)dxdx+C2

    So our target y is

    y=uv=[e(P(x)dx)Q(x)dx+C]e(P(x)dx)

posted @   kaleidopink  阅读(280)  评论(0编辑  收藏  举报
编辑推荐:
· 从 HTTP 原因短语缺失研究 HTTP/2 和 HTTP/3 的设计差异
· AI与.NET技术实操系列:向量存储与相似性搜索在 .NET 中的实现
· 基于Microsoft.Extensions.AI核心库实现RAG应用
· Linux系列:如何用heaptrack跟踪.NET程序的非托管内存泄露
· 开发者必知的日志记录最佳实践
阅读排行:
· winform 绘制太阳,地球,月球 运作规律
· AI与.NET技术实操系列(五):向量存储与相似性搜索在 .NET 中的实现
· 超详细:普通电脑也行Windows部署deepseek R1训练数据并当服务器共享给他人
· 【硬核科普】Trae如何「偷看」你的代码?零基础破解AI编程运行原理
· 上周热点回顾(3.3-3.9)
点击右上角即可分享
微信分享提示