搜索结果: 1-9 共查到“计算数学 fast”相关记录9条 . 查询时间(0.046 秒)
We give an algorithm that computes the final state of certain growth models without computing all intermediate states. Our technique is based on a “least action principle” which characterizes the odom...
Monotonicity and restart in fast gradient methods
flat gradient algorithm oscillation values
2015/8/7
Fast gradient methods are known to be non-monotone algorithms, and oscillations typically occur around the solution. To avoid this behavior, we propose in this paper a fast gradient method with restar...
The fast Fourier Transform and fast Wavelet Transform for Patterns on the Torus
wavelets lattices multivariate fast Fourier transform periodic multiresolution analysis Dirichlet wavelets
2011/9/21
Abstract: We introduce a fast Fourier Transform on regular d-dimensional lattices. We investigate properties of congruence class representants, i.e. their ordering, to classify directions and derive a...
Analysis of a Fast Fourier Transform Based Method for Modeling of Heterogeneous Materials
Homogenization Fast Fourier Transform Conjugate Gradients
2011/9/20
Abstract: The focus of this paper is on the analysis of the Conjugate Gradient method applied to a non-symmetric system of linear equations, arising from a Fast Fourier Transform-based homogenization ...
A fast alternating projection method for complex frequency estimation
complex frequency estimation Numerical Analysis
2011/9/1
Abstract: The problem of approximating a sampled function using sums of a fixed number of complex exponentials is considered. We use alternating projections between fixed rank matrices and Hankel matr...
Finite Projective Geometry based Fast, Conflict-free Parallel Matrix Computations
Distributed Computing Parallel Algorithms Parallel Processing
2011/9/29
Abstract: Matrix computations, especially iterative PDE solving (and the sparse matrix vector multiplication subproblem within) using conjugate gradient algorithm, and LU/Cholesky decomposition for so...
Middle and Ripple, fast simple O(lg n) algorithms for Lucas Numbers
Lucas numbers algorithms iteration recursion Fibonacci
2011/3/1
A fast and simple O(log n) iteration algorithm for individual Lucas numbers is given. This is faster than using Fibonacci based methods because of the structure of Lucas numbers. Using a √5 conversion...
Fast conservative and entropic numerical methods for the Boson Boltzmann equation
Boson Boltzmann equation condensation quadrature formulas fast algorithms
2010/12/6
In this paper we derive accurate numerical methods for the quantum Boltzmann equation for a gas of interacting bosons. The schemes preserve the main physical features of the continuous problem, namely...
A fast algorithm for evaluating and displaying bivariate splInes in a three direction is preseNted based on two-level transfomation of the corresponding B-splines. The efficiency has been shown by exp...