派博傳思國際中心

標(biāo)題: Titlebook: Computational Physics; Simulation of Classi Philipp O.J. Scherer Textbook 2017Latest edition Springer Nature Switzerland AG 2017 Understand [打印本頁]

作者: antihistamine    時(shí)間: 2025-3-21 16:52
書目名稱Computational Physics影響因子(影響力)




書目名稱Computational Physics影響因子(影響力)學(xué)科排名




書目名稱Computational Physics網(wǎng)絡(luò)公開度




書目名稱Computational Physics網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Computational Physics被引頻次




書目名稱Computational Physics被引頻次學(xué)科排名




書目名稱Computational Physics年度引用




書目名稱Computational Physics年度引用學(xué)科排名




書目名稱Computational Physics讀者反饋




書目名稱Computational Physics讀者反饋學(xué)科排名





作者: 收藏品    時(shí)間: 2025-3-21 22:53
978-3-319-87002-1Springer Nature Switzerland AG 2017
作者: ARCHE    時(shí)間: 2025-3-22 03:01

作者: 大酒杯    時(shí)間: 2025-3-22 04:55

作者: 合法    時(shí)間: 2025-3-22 10:03

作者: figurine    時(shí)間: 2025-3-22 13:37

作者: figurine    時(shí)間: 2025-3-22 18:50
Wieland Appelfeller,Wolfgang Buchholznction are roots of the gradient. In one dimension bisection is a very robust but rather inefficient root finding method. If a good starting point close to the root is available and the function smooth enough, the Newton–Raphson method converges much faster. Special strategies are necessary to find
作者: 預(yù)知    時(shí)間: 2025-3-23 00:55
,IT-Unterstützung in der Beschaffung,tion of convolution integrals. In this chapter we discuss the discrete Fourier transformation as a numerical approximation to the continuous Fourier integral. It can be realized efficiently by Goertzel’s algorithm or the family of fast Fourier transformation methods. Computer experiments demonstrate
作者: 使習(xí)慣于    時(shí)間: 2025-3-23 03:08
Zusammenfassende Betrachtung und Ausblick, of thermodynamic averages e.g., Monte Carlo methods are very useful which sample the integration volume at randomly chosen points. In this chapter we discuss algorithms for the generation of pseudo-random numbers with given probability distribution which are essential for all Monte Carlo methods. W
作者: 消息靈通    時(shí)間: 2025-3-23 09:22

作者: Psa617    時(shí)間: 2025-3-23 13:10

作者: inventory    時(shí)間: 2025-3-23 16:45

作者: dowagers-hump    時(shí)間: 2025-3-23 19:55
Supplier Relationship Managemente rotational motion are important as well in astrophysics as in molecular physics. The orientation of a rigid body relative to the laboratory system can be described by a . matrix. Instead of solving nine equations for all its components, the rotation matrix can be parametrized by the four real comp
作者: antedate    時(shí)間: 2025-3-23 23:35

作者: anticipate    時(shí)間: 2025-3-24 05:53
Physical Representation of the Supply Chain,ples: In the first case the classical equations of motion are solved for a system of particles interacting pairwise by Lennard–Jones forces (Lennard–Jones fluid). The thermodynamic average is taken along the trajectory, i.e. over the calculated coordinates at different times. We evaluate the pair di
作者: 有其法作用    時(shí)間: 2025-3-24 10:08

作者: 主動(dòng)脈    時(shí)間: 2025-3-24 13:50

作者: Palpable    時(shí)間: 2025-3-24 17:13
Philipp O.J. SchererTeaches basic numerical methods in theoretical physics.Features numerous computer examples, for which no programming skills are required.Provides detailed explanations without mathematical proofs.Disc
作者: 千篇一律    時(shí)間: 2025-3-24 20:14

作者: 金盤是高原    時(shí)間: 2025-3-25 02:04
Textbook 2017Latest editionrithms and more recent methods are explained. Partial differential equations are treated generally comparing important methods, and equations of motion are solved by a large number of simple as well as more sophisticated methods. Several modern algorithms for quantum wavepacket motion are compared.
作者: 搜集    時(shí)間: 2025-3-25 06:07
Zusammenfassende Betrachtung und Ausblick,e show how the efficiency of Monte Carlo integration can be improved by sampling preferentially the important configurations. Finally the famous Metropolis algorithm is applied to classical many-particle systems and nonlinear optimization problems.
作者: 賞錢    時(shí)間: 2025-3-25 08:52
Supplier Relationship Managementnserve the orthogonality of the rotation matrix. Omelyan’s implicit quaternion method is very efficient and conserves orthogonality exactly. In computer experiments we compare different explicit and implicit methods for a free rotor, we simulate a rotor in an external field and the collision of two rotating molecules.
作者: dry-eye    時(shí)間: 2025-3-25 11:54

作者: 制定法律    時(shí)間: 2025-3-25 19:50

作者: 迫擊炮    時(shí)間: 2025-3-25 20:17
Thermodynamic Systemsplied to a one- or two-dimensional system of interacting spins (Ising model). The thermodynamic average is taken over a set of random configurations. We study the average magnetization in a magnetic field and the phase transition to the ferromagnetic state.
作者: 可用    時(shí)間: 2025-3-26 00:58
Random Numbers and Monte-Carlo Methodse show how the efficiency of Monte Carlo integration can be improved by sampling preferentially the important configurations. Finally the famous Metropolis algorithm is applied to classical many-particle systems and nonlinear optimization problems.
作者: fulmination    時(shí)間: 2025-3-26 04:56
1868-4513 vides detailed explanations without mathematical proofs.DiscThis textbook presents basic numerical methods and applies them to a large variety of physical models in multiple computer experiments. Classical algorithms and more recent methods are explained. Partial differential equations are treated g
作者: 暴行    時(shí)間: 2025-3-26 08:44

作者: Hla461    時(shí)間: 2025-3-26 14:45
,IT-Unterstützung in der Beschaffung,ntegral. It can be realized efficiently by Goertzel’s algorithm or the family of fast Fourier transformation methods. Computer experiments demonstrate trigonometric interpolation and nonlinear filtering as applications.
作者: 固定某物    時(shí)間: 2025-3-26 19:13

作者: 范例    時(shí)間: 2025-3-26 21:25

作者: 嘴唇可修剪    時(shí)間: 2025-3-27 01:44
Supplementary Schools and Their Communities. But this is unpractical in many cases due to the increase in computing time and memory requirements. . Results from more complex operations like square roots or trigonometric functions can have even larger errors since series expansions have to be truncated and iterations can accumulate the errors of the individual steps.
作者: 女歌星    時(shí)間: 2025-3-27 07:06

作者: foliage    時(shí)間: 2025-3-27 11:05
Error Analysis. But this is unpractical in many cases due to the increase in computing time and memory requirements. . Results from more complex operations like square roots or trigonometric functions can have even larger errors since series expansions have to be truncated and iterations can accumulate the errors of the individual steps.
作者: 墊子    時(shí)間: 2025-3-27 15:59

作者: 連鎖,連串    時(shí)間: 2025-3-27 20:13
Interpolationge method. Newton’s method is numerically efficient if the polynomial has to be evaluated at many interpolating points and Neville’s method has advantages if the polynomial is not needed explicitly and has to be evaluated only at one interpolation point. Polynomials are not well suited for interpola
作者: Abduct    時(shí)間: 2025-3-28 00:30

作者: ectropion    時(shí)間: 2025-3-28 04:29

作者: CHYME    時(shí)間: 2025-3-28 07:12
Discretization of Differential Equationsregular grids. Finite differences and finite volumes belong to the general class of finite element methods which are prominent in the engineering sciences and use an expansion in piecewise polynomials with small support. Spectral methods, on the other hand, expand the solution as a linear combinatio
作者: Ataxia    時(shí)間: 2025-3-28 11:44

作者: Commodious    時(shí)間: 2025-3-28 18:35
Molecular Mechanicss. Classical MD simulations for larger molecules use empirical force fields, which approximate the potential energy surface of the electronic ground state. They are able to describe structural and conformational changes but not chemical reactions which usually involve more than one electronic state.
作者: 宣誓書    時(shí)間: 2025-3-28 19:55

作者: 明智的人    時(shí)間: 2025-3-29 01:38

作者: machination    時(shí)間: 2025-3-29 05:19

作者: 單純    時(shí)間: 2025-3-29 07:58

作者: 擁護(hù)者    時(shí)間: 2025-3-29 12:41
Supplier relationships to family firms,more stable method. The dimensionality of a data matrix can be reduced with the help of singular value decomposition, which allows to approximate a matrix by another matrix of lower rank and is also useful for linear regression, especially if the columns of the data matrix are linearly dependent.
作者: Indelible    時(shí)間: 2025-3-29 18:22
https://doi.org/10.1007/978-81-322-3700-6regular grids. Finite differences and finite volumes belong to the general class of finite element methods which are prominent in the engineering sciences and use an expansion in piecewise polynomials with small support. Spectral methods, on the other hand, expand the solution as a linear combinatio
作者: 可商量    時(shí)間: 2025-3-29 21:50

作者: Complement    時(shí)間: 2025-3-29 23:57

作者: 為寵愛    時(shí)間: 2025-3-30 07:15
Eias Al Humdan,Yangyan Shi,Masud Behniaed length segments of the freely jointed chain are replaced by Hookean springs. This is utilized in a computer experiment to study the dependence of the polymer extension on an applied external force (this effect is known as entropic elasticity). The random motion of a heavy particle in a bath of li
作者: Heterodoxy    時(shí)間: 2025-3-30 10:46

作者: 青春期    時(shí)間: 2025-3-30 15:44
Error Analysisct values, the calculation uses values with some uncertainty. This can lead to large uncertainties of the calculated results if an unstable algorithm is used or if the unavoidable error inherent to the problem is large. . The arithmetic unit of a computer uses only a subset of the real numbers, the
作者: 橡子    時(shí)間: 2025-3-30 17:44

作者: Obverse    時(shí)間: 2025-3-30 22:50

作者: GROUP    時(shí)間: 2025-3-31 04:40

作者: 暗指    時(shí)間: 2025-3-31 05:07
Roots and Extremal Pointsnction are roots of the gradient. In one dimension bisection is a very robust but rather inefficient root finding method. If a good starting point close to the root is available and the function smooth enough, the Newton–Raphson method converges much faster. Special strategies are necessary to find
作者: 微枝末節(jié)    時(shí)間: 2025-3-31 13:05
Fourier Transformationtion of convolution integrals. In this chapter we discuss the discrete Fourier transformation as a numerical approximation to the continuous Fourier integral. It can be realized efficiently by Goertzel’s algorithm or the family of fast Fourier transformation methods. Computer experiments demonstrate




歡迎光臨 派博傳思國際中心 (http://www.pjsxioz.cn/) Powered by Discuz! X3.5
永修县| 阆中市| 昭通市| 沧源| 商水县| 绥芬河市| 柘城县| 百色市| 天柱县| 泸水县| 东乡族自治县| 名山县| 那坡县| 吉林市| 华安县| 汤原县| 泾阳县| 根河市| 宝鸡市| 奉化市| 高陵县| 谷城县| 哈巴河县| 新乐市| 林州市| 德清县| 博野县| 曲沃县| 桐柏县| 长岭县| 茌平县| 应用必备| 海南省| 镇远县| 积石山| 晋城| 大石桥市| 长岭县| 搜索| 富蕴县| 北海市|