Search results for "MathematicsofComputing_NUMERICALANALYSIS"
showing 10 items of 149 documents
Cholesky decomposition techniques in electronic structure theory
2011
We review recently developed methods to efficiently utilize the Cholesky decomposition technique in electronic structure calculations. The review starts with a brief introduction to the basics of the Cholesky decomposition technique. Subsequently, examples of applications of the technique to ab inito procedures are presented. The technique is demonstrated to be a special type of a resolution-of-identity or density-fitting scheme. This is followed by explicit examples of the Cholesky techniques used in orbital localization, computation of the exchange contribution to the Fock matrix, in MP2, gradient calculations, and so-called method specific Cholesky decomposition. Subsequently, examples o…
Cryptanalysis of Knapsack Cipher Using Ant Colony Optimization
2018
Ant Colony Optimization is a search metaheuristic inspired by the behavior of real ant colonies and shown their effectiveness, robustness to solve a wide variety of complex problems. In this paper, we present a novel Ant Colony Optimization (ACO) based attack for cryptanalysis of knapsack cipher algorithm. A Cipher-text only attack is used to discover the plaintext from the cipher-text. Moreover, our approach allows us to break knapsack cryptosystem in a minimum search space when compared with other techniques. Experimental results prove that ACO can be used as an effective tool to attack knapsack cipher.
Optimizing PolyACO Training with GPU-Based Parallelization
2016
A central part of Ant Colony Optimisation (ACO) is the function calculating the quality and cost of solutions, such as the distance of a potential ant route. This cost function is used to deposit an opportune amount of pheromones to achieve an apt convergence, and in an active ACO implementation a significant part of the runtime is spent in this part of the code. In some cases, the cost function accumulates up towards 94 % in its run time making it a performance bottle neck.
Numerical experiments with a parallel fast direct elliptic solver on Cray T3E
1997
A parallel fast direct O(N log N) solver is shortly described for linear systems with separable block tridiagonal matrices. A good parallel scalability of the proposed method is demonstrated on a Cray T3E parallel computer using MPI in communication. Also, the sequential performance is compared with the well-known BLKTRI-implementation of the generalized. cyclic reduction method using a single processor of Cray T3E.
Computer code from Sex roles and the evolution of parental care specialization.
2019
Computer code for the mathematical model in Mathematica
Computer code from Sex roles and the evolution of parental care specialization
2019
Computer code for the mathematical model in Mathematica
Computer code from Sex roles and the evolution of parental care specialization.
2019
Computer code for the mathematical model in Mathematica
SSPMO: A Scatter Tabu Search Procedure for Non-Linear Multiobjective Optimization
2007
We describe the development and testing of a metaheuristic procedure, based on the scatter-search methodology, for the problem of approximating the efficient frontier of nonlinear multiobjective optimization problems with continuous variables. Recent applications of scatter search have shown its merit as a global optimization technique for single-objective problems. However, the application of scatter search to multiobjective optimization problems has not been fully explored in the literature. We test the proposed procedure on a suite of problems that have been used extensively in multiobjective optimization. Additional tests are performed on instances that are an extension of those consid…
R Code for Hausdorff and Simplex Dispersion Orderings in the 2D Case
2010
This paper proposes a software implementation using R of the Hausdorff and simplex dispersion orderings. A copy can be downloaded from http://www.uv.es/~ayala/software/fun-disp.R . The paper provides some examples using the functions exactHausdorff for the Hausdorff dispersion ordering and the function simplex for the simplex dispersion orderings. Some auxiliary functions are commented too.
Incomplete Riemann Solvers Based on Functional Approximations to the Absolute Value Function
2021
We give an overview on the work developed in recent years about certain classes of incomplete Riemann solvers for hyperbolic systems. These solvers are based on polynomial or rational approximations to |x|, and they do not require the knowledge of the complete eigenstructure of the system, but only a bound on the maximum wave speed. Our solvers can be readily applied to nonconservative hyperbolic systems, by following the theory of path-conservative schemes. In particular, this allows for an automatic treatment of source or coupling terms in systems of balance laws. The properties of our schemes have been tested with some challenging numerical experiments involving systems such as the Euler…