Results 1  10
of
890,551
ON THE HIGHLY ACCURATE SUMMATION OF CERTAIN SERIES OCCURRING IN PLATE CONTACT PROBLEMS
"... Abstract. The infinite series Rp = P∞ k=1 (2k − 1)−p x2k−1, 0 < 1 − x ≪ 1, p =2 or3,and the related series C(x, b, 2) = S(x, b, 3) = ∞X ∞X k=1 (2k − 1) −2 cosh(2k − 1)x / cosh(2k − 1)b, 0 < 1 − x/b ≪ 1, (2k − 1) −3 sinh(2k − 1)x / cosh(2k − 1)b, k=1 are of interest in problems concerning conta ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
contact between plates and unilateral supports. This article will reexamine a previously published result of Baratella and Gabutti for Rp, and will present new, rapidly convergent, series
On certain slowly convergent series occurring in plate contact problems
 Math. Comput
, 1991
"... Abstract. A simple computational procedure is developed for accurately summing series of the form ¿Z^^lk + l)~pz +, where z is complex with \z \ < 1 and p = 1 or 3, as well as series of the type and oo Yl(2k + l)~"cosh{lk + l)x/cosh{lk + l)b k=0 oo]T)(2A: + l)~Psinh(2/t+ l)x/cosh(2A;+l)Z> ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. A simple computational procedure is developed for accurately summing series of the form ¿Z^^lk + l)~pz +, where z is complex with \z \ < 1 and p = 1 or 3, as well as series of the type and oo Yl(2k + l)~"cosh{lk + l)x/cosh{lk + l)b k=0 oo]T)(2A: + l)~Psinh(2/t+ l)x/cosh(2A
Network Centric Warfare: Developing and Leveraging Information Superiority
 Command and Control Research Program (CCRP), US DoD
, 2000
"... the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technolo ..."
Abstract

Cited by 308 (5 self)
 Add to MetaCart
the mission of improving DoD’s understanding of the national security implications of the Information Age. Focusing upon improving both the state of the art and the state of the practice of command and control, the CCRP helps DoD take full advantage of the opportunities afforded by emerging technologies. The CCRP pursues a broad program of research and analysis in information superiority, information operations, command and control theory, and associated operational concepts that enable us to leverage shared awareness to improve the effectiveness and efficiency of assigned missions. An important aspect of the CCRP program is its ability to serve as a bridge between the operational, technical, analytical, and educational communities. The CCRP provides leadership for the command and control research community by: n n
ULTIMATELY FAST ACCURATE SUMMATION

, 2009
"... We present two new algorithms FastAccSum and FastPrecSum, one to compute a faithful rounding of the sum of floatingpoint numbers and the other for a result “as if” computed in Kfold precision. Faithful rounding means the computed result either is one of the immediate floatingpoint neighbors of th ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
of the problem. The second algorithm does not need extra memory, and the computing time depends only on the number of summands and K. Both algorithms are the fastest known in terms of flops. They allow good instructionlevel parallelism so that they are also fast in terms of measured computing time
Accurate floatingpoint summation
, 2005
"... Given a vector of floatingpoint numbers with exact sum s, we present an algorithm for calculating a faithful rounding of s into the set of floatingpoint numbers, i.e. one of the immediate floatingpoint neighbors of s. If the s is a floatingpoint number, we prove that this is the result of our a ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
Given a vector of floatingpoint numbers with exact sum s, we present an algorithm for calculating a faithful rounding of s into the set of floatingpoint numbers, i.e. one of the immediate floatingpoint neighbors of s. If the s is a floatingpoint number, we prove that this is the result of our algorithm. The algorithm adapts to the condition number of the sum, i.e. it is very fast for mildly conditioned sums with slowly increasing computing time proportional to the condition number. All statements are also true in the presence of underflow. Furthermore algorithms with Kfold accuracy are derived, where in that case the result is stored in a vector of K floatingpoint numbers. We also present an algorithm for rounding the sum s to the nearest floatingpoint number. Our algorithms are fast in terms of measured computing time because they neither require special operations such as access to mantissa or exponent, they contain no branch in the inner loop, nor do they require extra precision: The only operations used are standard floatingpoint addition, subtraction and multiplication in one working precision, for example double precision. Moreover, in contrast to other approaches, the algorithms are ideally suited for parallelization. We also sketch dot product algorithms with similar properties.
Accurate floating point summation
"... Abstract We present and analyze several simple algorithms for accurately summing n floating pointnumbers S = Pni=1 si, independent of how much cancellation occurs in the sum. Let f be thenumber of significant bits in the si. We assume a register is available with F> f significantbits. Then assumi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract We present and analyze several simple algorithms for accurately summing n floating pointnumbers S = Pni=1 si, independent of how much cancellation occurs in the sum. Let f be thenumber of significant bits in the si. We assume a register is available with F> f significantbits
Neurofuzzy modeling and control
 IEEE Proceedings
, 1995
"... Abstract  Fundamental and advanced developments in neurofuzzy synergisms for modeling and control are reviewed. The essential part of neurofuzzy synergisms comes from a common framework called adaptive networks, which uni es both neural networks and fuzzy models. The fuzzy models under the framew ..."
Abstract

Cited by 231 (1 self)
 Add to MetaCart
the framework of adaptive networks is called ANFIS (AdaptiveNetworkbased Fuzzy Inference System), which possess certain advantages over neural networks. We introduce the design methods for ANFIS in both modeling and control applications. Current problems and future directions for neurofuzzy approaches
Lekner summations and Ewald summations for
, 2008
"... L.P.T.Orsay Using the specific model of a bilayer of classical charged particles (bilayer Wigner crystal), we compare the predictions for energies and pair distribution functions obtained by Monte Carlo simulations using three different methods available to treat the long range Coulomb interactions ..."
Abstract
 Add to MetaCart
L.P.T.Orsay Using the specific model of a bilayer of classical charged particles (bilayer Wigner crystal), we compare the predictions for energies and pair distribution functions obtained by Monte Carlo simulations using three different methods available to treat the long range Coulomb interactions in systems periodic in two directions but bound in the third one. The three methods compared are: the Ewald method for quasitwo dimensional systems
Robust, Efficient, and Accurate Contact Algorithms
, 2010
"... Robust, efficient, and accurate contact response remains a challenging problem in the simulation of deformable materials. Contact models should robustly handle contact between geometry by preventing interpenetrations. This should be accomplished while respecting natural laws in order to maintain phy ..."
Abstract
 Add to MetaCart
Robust, efficient, and accurate contact response remains a challenging problem in the simulation of deformable materials. Contact models should robustly handle contact between geometry by preventing interpenetrations. This should be accomplished while respecting natural laws in order to maintain
Results 1  10
of
890,551