Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Tuomo Rossi is active.

Publication


Featured researches published by Tuomo Rossi.


electronic commerce | 2008

An enhanced memetic differential evolution in filter design for defect detection in paper production

Ville Tirronen; Ferrante Neri; Tommi Kärkkäinen; Kirsi Majava; Tuomo Rossi

This article proposes an Enhanced Memetic Differential Evolution (EMDE) for designing digital filters which aim at detecting defects of the paper produced during an industrial process. Defect detection is handled by means of two Gabor filters and their design is performed by the EMDE. The EMDE is a novel adaptive evolutionary algorithm which combines the powerful explorative features of Differential Evolution with the exploitative features of three local search algorithms employing different pivot rules and neighborhood generating functions. These local search algorithms are the Hooke Jeeves Algorithm, a Stochastic Local Search, and Simulated Annealing. The local search algorithms are adaptively coordinated by means of a control parameter that measures fitness distribution among individuals of the population and a novel probabilistic scheme. Numerical results confirm that Differential Evolution is an efficient evolutionary framework for the image processing problem under investigation and show that the EMDE performs well. As a matter of fact, the application of the EMDE leads to a design of an efficiently tailored filter. A comparison with various popular metaheuristics proves the effectiveness of the EMDE in terms of convergence speed, stagnation prevention, and capability in detecting solutions having high performance.


SIAM Journal on Scientific Computing | 1999

A Parallel Fast Direct Solver for Block Tridiagonal Systems with Separable Matrices of Arbitrary Dimension

Tuomo Rossi; Jari Toivanen

A parallel fast direct solution method for linear systems with separable block tridiagonal matrices is considered. Such systems appear, for example, when discretizing the Poisson equation in a rectangular domain using the five-point finite difference scheme or the piecewise linear finite elements on a triangulated, possibly nonuniform rectangular mesh. The method under consideration has the arithmetical complexity


Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing | 2009

A Memetic Differential Evolution in Filter Design for Defect Detection in Paper Production

Ville Tirronen; Ferrante Neri; Tommi Kärkkäinen; Kirsi Majava; Tuomo Rossi

{\mathcal O}(N\log N)


congress on evolutionary computation | 2007

Fitness diversity based adaptation in Multimeme Algorithms:A comparative study

Ferrante Neri; Ville Tirronen; Tommi Kärkkäinen; Tuomo Rossi

, and it is closely related to the cyclic reduction method, but instead of using the matrix polynomial factorization, the so-called partial solution technique is employed. Hence, in this paper, the method is called the partial solution variant of the cyclic reduction method (PSCR method). The method is presented and analyzed in a general radix-q framework and, based on this analysis, the radix-4 variant is chosen for parallel implementation using the MPI standard. The generalization of the method to the case of arbitrary block dimension is described. The numerical experiments show the sequential efficiency and numerical stability of the PSCR method compared to the well-known BLKTRI implementation of the generalized cyclic reduction method. The good scalability properties of the parallel PSCR method are demonstrated in a distributed-memory Cray T3E-750 computer.


Computers & Mathematics With Applications | 2008

Comparison of implementations of the lattice-Boltzmann method

Keijo Mattila; Jari Hyväluoma; Jussi Timonen; Tuomo Rossi

This article proposes a Memetic Differential Evolution (MDE) for designing digital filters which aim at detecting defects of the paper produced during an industrial process. The MDE is an adaptive evolutionary algorithm which combines the powerful explorative features of Differential Evolution (DE) with the exploitative features of two local searchers. The local searchers are adaptively activated by means of a novel control parameter which measures fitness diversity within the population. Numerical results show that the DE framework is efficient for the class of problems under study and employment of exploitative local searchers is helpful in supporting the DE explorative mechanism in avoiding stagnation and thus detecting solutions having a high performance.


Computer Physics Communications | 2007

An efficient swap algorithm for the lattice Boltzmann method

Keijo Mattila; Jari Hyväluoma; Tuomo Rossi; Mats Aspnäs

This paper compares three different fitness diversity adaptations in multimeme algorithms (MmAs). These diversity indexes have been integrated within a MmA present in literature, namely fast adaptive memetic algorithm. Numerical results show that it is not possible to establish a superiority of one of these adaptive schemes over the others and choice of a proper adaptation must be made by considering features of the problem under study. More specifically, one of these adaptations outperforms the others in the presence of plateaus or limited range of variability in fitness values, another adaptation is more proper for landscapes having distant and strong basins of attraction, the third one, in spite of its mediocre average performance can occasionally lead to excellent results.


SIAM Journal on Scientific Computing | 2002

A Parallel Fictitious Domain Method for the Three-Dimensional Helmholtz Equation

Erkki Heikkola; Tuomo Rossi; Jari Toivanen

Simplicity of coding is usually an appealing feature of the lattice-Boltzmann method (LBM). Conventional implementations of LBM are often based on the two-lattice or the two-step algorithm, which however suffer from high memory consumption and poor computational performance, respectively. The aim of this work was to identify implementations of LBM that would achieve high computational performance with low memory consumption. Effects of memory addressing schemes were investigated in particular. Data layouts for velocity distribution values were also considered, and they were found to be related to computational performance. A novel bundle data layout was therefore introduced. Addressing schemes and data layouts were implemented for the Lagrangian, compressed-grid (shift), swap, two-lattice, and two-step algorithms. Implementations were compared for a wide range of fluid volume fractions. Simulation results indicated that indirect addressing implementations yield high computational performance. However, they achieved low memory consumption only for very low fluid volume fractions. Semi-direct addressing implementations could also provide high computational performance. The bundle data layout was found to be competitive, sometimes by a wide margin, in all the cases considered.


SIAM Journal on Matrix Analysis and Applications | 1999

A Nonstandard Cyclic Reduction Method, Its Variants and Stability

Tuomo Rossi; Jari Toivanen

During the last decade, the lattice-Boltzmann method (LBM) as a valuable tool in computational fluid dynamics has been increasingly acknowledged. The widespread application of LBM is partly due to the simplicity of its coding. The most well-known algorithms for the implementation of the standard lattice-Boltzmann equation (LBE) are the two-lattice and two-step algorithms. However, implementations of the two-lattice or the two-step algorithm suffer from high memory consumption or poor computational performance, respectively. Ultimately, the computing resources available decide which of the two disadvantages is more critical. Here we introduce a new algorithm, called the swap algorithm, for the implementation of LBE. Simulation results demonstrate that implementations based on the swap algorithm can achieve high computational performance and have very low memory consumption. Furthermore, we show how the performance of its implementations can be further improved by code optimization.


Journal of Computational Physics | 2007

Controllability method for the Helmholtz equation with higher-order discretizations

Erkki Heikkola; Sanna Mönkölä; Anssi Pennanen; Tuomo Rossi

The application of a fictitious domain (domain embedding) method to the three-dimensional Helmholtz equation with absorbing boundary conditions is considered. The finite element discretization is performed by using locally fitted meshes, and an algebraic fictitious domain method with a separable preconditioner is used in the iterative solution of the resultant linear systems. Such a method is based on embedding the original domain into a larger one with a simple geometry. With this approach, it is possible to realize the GMRES iterations in a low-dimensional subspace and use the partial solution method to solve the linear systems with the preconditioner. An efficient parallel implementation of the iterative algorithm is introduced. Results of numerical experiments demonstrate good scalability properties on distributed-memory parallel computers and the ability to solve high frequency acoustic scattering problems.


Journal of Informetrics | 2016

Expert-based versus citation-based ranking of scholarly and scientific publication channels

Mirka Saarela; Tommi Kärkkäinen; Tommi Lahtonen; Tuomo Rossi

A nonstandard cyclic reduction method is introduced for solving the Poisson equation in rectangular domains. Different ways of solving the arising reduced systems are considered. The partial solution approach leads to the so-called partial solution variant of the cyclic reduction (PSCR) method, while the other variants are obtained by using the matrix rational polynomial factorization technique, including the partial fraction expansions, the fast Fourier transform (FFT) approach, and the combination of Fourier analysis and cyclic reduction (FACR) techniques. Such techniques have originally been considered in the standard cyclic reduction framework. The equivalence of the partial solution and the partial fraction techniques is shown. The computational cost of the considered variants is

Collaboration


Dive into the Tuomo Rossi's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar

Erkki Heikkola

Information Technology University

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Jukka Räbinä

University of Jyväskylä

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Anssi Pennanen

Information Technology University

View shared research outputs
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge