搜索结果: 1-15 共查到“物理学 Computation”相关记录44条 . 查询时间(0.062 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Approximation and computation for the linear and nonlinear eigenvalue problems in photonic crystals
光子晶体 线性非线性特征值问题 近似 计算
2023/5/15
In this talk, we discuss the approximation and computation for the linear and nonlinear eigenvalue problems in photonic crystals. We discretize the shifted Maxwell operator with edge finite elements a...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Computation of phononic crystals using the PG finite element method
PG有限元法 计算 声子晶体
2023/4/17
Phononic crystals are composite materials with periodic distribution of two or more media. The difficulty of computing the band structure of the phononic crystals lies in capturing the complex geometr...
Quantum Computation under Micromotion in a Planar Ion Crystal
Quantum Computation Micromotion Planar Ion Crystal
2016/1/22
We propose a scheme to realize scalable quantum computation in a planar ion crystal confined by a Paul trap. We show that the inevitable in-plane micromotion affects the gate design via three separate...
Efficient computation of the Zassenhaus formula
Efficient computation Zassenhaus formula Mathematical Physics
2012/4/18
A new recursive procedure to compute the Zassenhaus formula up to high order is presented, providing each exponent in the factorization directly as a linear combination of independent commutators and ...
Sensitivity computation of periodic and chaotic limit cycle oscillations
Sensitivity analysis linear response adjoint equation unsteady adjoint chaos statistical average
2012/4/19
Sensitivity analysis can be a powerful tool for multi-disciplinary design optimization of nonlinear flow structure interaction. For computing sensitivity of time averaged quantities in chaotic oscilla...
Forward and Adjoint Sensitivity Computation of Chaotic Dynamical Systems
Sensitivity analysis linear response adjoint equation unsteady adjoint chaos statistical average
2012/2/29
This paper describes a forward algorithm and an adjoint algorithm for computing sensitivity derivatives in chaotic dynamical systems, such as the Lorenz attractor. The algorithms compute the derivativ...
Computation of electron quantum transport in graphene nanoribbons using GPU
Green's function formalism GPU graphene ribbon
2011/8/11
Abstract: The performance potential for simulating quantum electron transport on graphical processing units (GPUs) is studied. Using graphene ribbons of realistic sizes as an example it is shown that ...
Enhancing the understanding of entropy through computation
Enhancing entropy through computation computational algorithms distinguishable particles
2011/8/11
Abstract: We devise a hierarchy of computational algorithms to enumerate the microstates of a system comprising N independent, distinguishable particles. An important challenge is to cope with integer...
Multiscale approach for bone remodeling simulation based on finite element and neural network computation
Multiscale Hierarchical Bone remodeling Finite element Neural network
2011/8/5
Abstract: The aim of this paper is to develop a multiscale hierarchical hybrid model based on finite element analysis and neural network computation to link mesoscopic scale (trabecular network level)...
On Measurement and Computation
Quantum Computation Physical Computation computational complexity
2011/8/4
Abstract: Inspired by the work of Feynman, Deutsch, We formally propose the theory of physical computability and accordingly, the physical complexity theory. To achieve this, a framework that can eval...
Direct and Inverse Computation of Jacobi Matrices of Infinite Homogeneous Affine I.F.S
Jacobi Matrices Orthogonal Polynomials Singular Continuous Measures Iterated Function Systems Gaussian–I.F.S. Quadratures
2011/7/28
Abstract: We introduce a new set of algorithms to compute Jacobi matrices associated with measures generated by infinite systems of iterated functions. We demonstrate their relevance in the study of t...
The expansion in ultraspherical polynomials: a simple procedure for the fast computation of the ultraspherical coefficients
Ultraspherical expansions Gegenbauer coefficients Abel transform
2011/7/28
Abstract: We present a simple and fast algorithm for the computation of the coefficients of the expansion of a function f(cos u) in ultraspherical (Gegenbauer) polynomials. We prove that these coeffic...
abc: an R package for Approximate Bayesian Computation (ABC)
an R package pproximate Bayesian Computation
2011/9/14
Background: Many recent statistical applications involve inference under complex models, where it is computationally prohibitive to calculate likelihoods but possible to simulate data. Approximate Bay...
An efficient algorithm for the computation of the trace of the symmetrized product of an arbitrary number of Dirac matrices with two indices
Clifford algebra and Dirac matrices, Field theories in higher dimensions, Computer algebra
2011/9/13
Let a be Dirac matrices in d-dimensional Minkowski spacetime, and let i = Bab i ab, where ab = [ab] and Bab i are arbitrary antisymmetric tensors. Th...
An efficient algorithm for the computation of the trace of the symmetrized product of an arbitrary number of Dirac matrices with two indices
Clifford algebra and Dirac matrices Field theories in higher dimensions Computer algebra
2011/7/26
An efficient algorithm for the computation of the trace of the symmetrized product of an arbitrary number of Dirac matrices with two indices.