In general, solving Global Optimization (GO) problems by Branch-and-Bound (B&B) requires a huge computational capacity. Parallel execution is used to speed up the computing time. As in this type of algorithms, the foreseen computational workload (number of nodes in the B&B tree) changes...

The adaptive BDDC method is extended to the selection of face constraints in three dimensions. A new implementation of the BDDC method is presented based on a global formulation without an explicit coarse problem, with massive parallelism provided by a multifrontal solver. Constraints are...

In most recent substructuring methods, a fundamental role is played by the coarse space. For some of these methods (e.g. BDDC and FETI-DP), its definition relies on a ‘minimal’ set of coarse nodes (sometimes called corners) which assures invertibility of local subdomain problems and also of...

This work introduces several improvements in the solution of the Constrained 2D Cutting Problem. Such improvements combine the detection of dominated and duplicated cutting patterns with the implementation of parallel approaches for best-first search methods. The analysis of symmetries and...

A parallel implementation of the Balancing Domain Decomposition based on Constraints (BDDC) method using the frontal solver is employed to solve systems of linear equations from finite element analysis, and incorporated into a standard finite element system for engineering analysis by linear...

The numerical solution of 3D linear elasticity equations is considered. The problem is described by a coupled system of second-order elliptic partial differential equations. This system is discretized by trilinear parallelepipedal finite elements.

The numerical solution of 3D linear elasticity equations is considered. The problem is described by a coupled system of second-order elliptic partial differential equations. This system is discretized by trilinear brick finite elements. The PCG iterative method is used for solving the...

Three Monte Carlo methods for matrix inversion (MI) and finding a solution vector of a system of linear algebraic equations (SLAE) are considered: with absorption, without absorption with uniform transition frequency function, and without absorption with almost optimal transition frequency...