向量微积分、线性代数和微分形式

向量微积分、线性代数和微分形式 pdf epub mobi txt 电子书 下载 2025

John H.Hubbard
想要找书就要到 静流书站
立刻按 ctrl+D收藏本页
你会得到大惊喜!!
2013-10-1 Paperback 9787510061509

具体描述

John Hamal Hubbard was born on October 6 or 7, 1945 (the actual date is unknown). He is an American mathematician who is currently a professor at Cornell University and the Université de Provence. He is well known for the mathematical contributions he made with Adrien Douady in the field of complex dynamics, including a study of the Mandelbrot set. One of their most important results is that the Mandelbrot set is connected.Hubbard graduated with a Doctorat d'État from Université de Paris-Sud in 1973 under the direction of Adrien Douady; his thesis was entitled Sur Les Sections Analytiques de La Courbe Universelle de Teichmüller and was published by the American Mathematical Society.

用户评价

评分

线性方程是高斯算法,而非线性问题是牛顿算法,牛顿算法在隐函数定理和逆函数定理证明中比较Picard迭代收敛更快

评分

线性方程是高斯算法,而非线性问题是牛顿算法,牛顿算法在隐函数定理和逆函数定理证明中比较Picard迭代收敛更快

评分

##勘误:http://matrixeditions.com/errata.html 还有续集?Advanced Topics in Calculus by John H. Hubbard and Barbara Burke Hubbard (sequel to Vector Calclulus, Linear Algebra, and Differential Forms: A Unified Approach) 维基: Hubbard is a former student of Harvard University's infamous Math 55, where he...  

评分

线性方程是高斯算法,而非线性问题是牛顿算法,牛顿算法在隐函数定理和逆函数定理证明中比较Picard迭代收敛更快

评分

评分

线性方程是高斯算法,而非线性问题是牛顿算法,牛顿算法在隐函数定理和逆函数定理证明中比较Picard迭代收敛更快

评分

线性方程是高斯算法,而非线性问题是牛顿算法,牛顿算法在隐函数定理和逆函数定理证明中比较Picard迭代收敛更快

评分

线性方程是高斯算法,而非线性问题是牛顿算法,牛顿算法在隐函数定理和逆函数定理证明中比较Picard迭代收敛更快

评分

线性方程是高斯算法,而非线性问题是牛顿算法,牛顿算法在隐函数定理和逆函数定理证明中比较Picard迭代收敛更快

本站所有内容均为互联网搜索引擎提供的公开搜索信息,本站不存储任何数据与内容,任何内容与数据均与本站无关,如有需要请联系相关搜索引擎包括但不限于百度google,bing,sogou

© 2025 windowsfront.com All Rights Reserved. 静流书站 版权所有