Search results for "Algorithm"
showing 10 items of 4887 documents
Analysis of Rectangular Orthotropic Membranes for Mechanical Properties Identification through Load-Displacement Data
2021
In this paper, an innovative procedure is introduced for the identification of the mechanical properties of orthotropic membranes based on load-displacement data. To this end, novel functional forms of the displacement components for rectangular membranes are appropriately introduced. Unknown coefficients of these displacement functions are determined, minimizing the total potential energy of the membrane. The energy method is then combined with an optimization procedure to estimate the elastic constants of the membranes in a straightforward manner. Specifically, a genetic algorithm is used to minimize a properly defined objective function directly related to the sought mechanical propertie…
Reconstruction Problem of Reinforced Concrete Beams under Harmonic Excitations
2007
A damage detection method based on harmonic structural vibrations has been applied to reconstruct realistic damage patterns of reinforced concrete beams. It was shown that the application of a hybrid method (genetic algorithm and Levenberg-Marquardt minimization technique) makes it possible to effectively reconstruct the flexural stiffness drops as small as 10-20% with the maximum error of 4%. The error increases to about 7 to 9% with the presence of 1% measurement noise.
Diagonalization of large matrices: a new parallel algorithm.
2015
On the basis of a dressed matrices formalism, a new algorithm has been devised for obtaining the lowest eigenvalue and the corresponding eigenvector of large real symmetric matrices. Given an N × N matrix, the proposed algorithm consists in the diagonalization of (N - 1)2 × 2 dressed matrices. Both sequential and parallel versions of the proposed algorithm have been implemented. Tests have been performed on a Hilbert matrix, and the results show that this algorithm is up 340 times faster than the corresponding LAPACK routine for N = 10(4) and about 10% faster than the Davidson method. The parallel MPI version has been tested using up to 512 nodes. The speed-up for a N = 10(6) matrix is fair…
A star product on the spherical harmonics
1996
We explicitly define a star product on the spherical harmonics using the Moyal star product on ℝ6, and a polarization equation allowing its restriction on S2.
A new dynamic identification technique: application to the evaluation of the equivalent strut for infilled frames
2003
A new time domain identification technique for systems under Gaussian white noise input is presented, requiring for its application the measurement of the system response but no information about input intensity. The technique proposed is based on the statistic moment equations derived by using a special class of mathematical models named "potential models". These models allow one to determine fundamental properties of the response statistics, making it possible to identify stiffness and dissipation features of a structural system, and also to determine the excitation input. The technique proposed is here applied to the identification of the strut equivalent to the infill of a single story-…
A general framework for a class of non-linear approximations with applications to image restoration
2018
Este artículo se encuentra disponible en la página web de la revista en la siguiente URL: https://www.sciencedirect.com/science/article/abs/pii/S0377042717301188 Este es el pre-print del siguiente artículo: Candela, V., Falcó, A. & Romero, PD. (2018). A general framework for a class of non-linear approximations with applications to image restoration. Journal of Computational and Applied Mathematics, vol. 330 (mar.), pp. 982-994, que se ha publicado de forma definitiva en https://doi.org/10.1016/j.cam.2017.03.008 This is the pre-peer reviewed version of the following article: Candela, V., Falcó, A. & Romero, PD. (2018). A general framework for a class of non-linear approximations with applic…
Iterative Reconstruction of Memory Kernels.
2017
In recent years, it has become increasingly popular to construct coarse-grained models with non-Markovian dynamics to account for an incomplete separation of time scales. One challenge of a systematic coarse-graining procedure is the extraction of the dynamical properties, namely, the memory kernel, from equilibrium all-atom simulations. In this article, we propose an iterative method for memory reconstruction from dynamical correlation functions. Compared to previously proposed noniterative techniques, it ensures by construction that the target correlation functions of the original fine-grained systems are reproduced accurately by the coarse-grained system, regardless of time step and disc…
On Constraint Handling in Surrogate-Assisted Evolutionary Many-Objective Optimization
2016
Surrogate-assisted evolutionary multiobjective optimization algorithms are often used to solve computationally expensive problems. But their efficacy on handling constrained optimization problems having more than three objectives has not been widely studied. Particularly the issue of how feasible and infeasible solutions are handled in generating a data set for training a surrogate has not received much attention. In this paper, we use a recently proposed Kriging-assisted evolutionary algorithm for many-objective optimization and investigate the effect of infeasible solutions on the performance of the surrogates. We assume that constraint functions are computationally inexpensive and consid…
A parallel variable neighborhood search approach for the obnoxious p -median problem
2018
A genetic algorithm for the minimum generating set problem
2016
Graphical abstractDisplay Omitted HighlightsWe propose a novel formulation for the MGS problem based on multiple knapsack.The so-conceived MGS problem is solved by a novel GA.The GA embeds an intelligent construction method and specialized crossover operators.We perform a thorough comparison with regards to state-of-the-art algorithms.The proposal proves to be very competitive, specially for large and hard instances. Given a set of positive integers S, the minimum generating set problem consists in finding a set of positive integers T with a minimum cardinality such that every element of S can be expressed as the sum of a subset of elements in T. It constitutes a natural problem in combinat…