On the Solution of Boundary Value Problems by Using Fast Generalized Approximate Inverse Banded Matrix Techniques

A class of finite difference schemes in conjunction with approximate inverse banded matrix techniques based on the concept of LU-type factorization procedures is introduced for computing fast explicit approximate inverses. Explicit preconditioned iterative schemes in conjunction with approximate inverse matrix techniques are presented for the efficient solution of banded linear systems. A theorem on the rate of convergence and estimates of the computational complexity required to reduce the L-norm of the error is presented. Applications of the method on linear and non-linear systems are discussed and numerical results are given.     

Normalized explicit finite element approximate inverse preconditioning

Normalized explicit approximate inverse matrix techniques for computing explicitly various families of normalized approximate inverses based on normalized approximate factorization procedures for solving sparse linear systems, which are derived from the finite difference and finite element discretization of partial differential equations are presented. Normalized explicit preconditioned conjugate gradient-type schemes in conjunction with normalized approximate inverse matrix techniques are presented for the efficient solution of linear and non-linear systems. Theoretical estimates on the rate of convergence and computational complexity of the normalized explicit preconditioned conjugate gradient method are also presented. Applications of the proposed methods on characteristic linear and non-linear problems are discussed and numerical results are given.     

Design and implementation of parallel approximate inverse classes using OpenMP

A new parallel normalized optimized approximate inverse algorithm, based on the concept of antidiagonal wave pattern, for computing classes of explicitly approximate inverses, is introduced for symmetric multiprocessor systems. The parallel normalized explicit approximate inverses are used in conjunction with parallel normalized explicit preconditioned conjugate gradient schemes for the efficient solution of finite element sparse linear systems. The parallel design and implementation issues of the new algorithm are discussed and the parallel performance is presented using OpenMP. Copyright © 2008 John Wiley & Sons, Ltd.     

Computing the Success Factors in Consistent Acquisition and Recognition of Objects in Color Digital Images by Explicit Preconditioning

The paper studies the factors influencing the consistent acquisition and recognition of object's color and border features in digital imaging. The proposed image acquisition process is utilized by a computer supported imaging system implementing the acquisition and analysis of skin lesion images supporting medical diagnosis. In addition the same approach may be used for several problems requiring reliable color measurement and object identification. Two methodologies are adopted: The Bayesian Networks, which provide an efficient way of reasoning under uncertainty and are used to incorporate the expert judgement into the estimation of the probability of successful operation, and a Markov chain approach, which is generally used for the dynamic modeling of the system behavior. The Markov chain model requires asymptotically the solution of sparse linear systems. Explicit preconditioned methods are used for the efficient solution of the derived sparse linear system, and the parallel implementation of the dominant computational part is exploited.     

Efficient parallelization of the iterative solution of a coupled fluid–structure interaction problem

In this paper we consider the parallelization of the generation and iterative solution of coupled linear systems modelling the interaction of an acoustic field in a fluid medium with an elastic structure immersed in the fluid. The particular case studied is that of a hollow steel sphere in water. The aim of the work is to speed up the generation and solution of the systems. We describe the methods used, which involve special sparse storage arrangements and a novel application of a sparse approximate inverse preconditioning technique, and present results showing that the methods are very effective in terms of speeding up the generation and iterative solution of the systems. Copyright © 2007 John Wiley & Sons, Ltd.     

Parallel,iterative solution of sparse linear systems: Models and architectures

Solving large, sparse, linear systems of equations is a fundamental problems in large scale scientific and engineering computation. A model of a general class of asynchronous, iterative solution methods for linear systems is developed. In the model, the system is solved by creating several cooperating tasks that each compute a portion of the solution vector. A data transfer model predicting both the probability that data must be transferred between two tasks and the amount of data to be transferred is presented. This model is used to derive an execution time model for predicting parallel execution time and an optimal number of tasks given the dimension and sparsity of the coefficient matrix and the costs of computation, synchronization, and communication.The suitability of different parallel architectures for solving randomly sparse linear systems is discussed. Based on the complexity of task scheduling, one parallel architecture, based on a broadcast bus, is presented and analyzed.     

基于MPI和OpenCV遥感植被指数产品的并行计算

遥感传感器和计算机技术的发展,每天都会汇集大量新的地理空间数据。地球科学许多应用要求数据实时或接近实时地处理,发展高性能计算是进行海量数据处理的必然趋势。本文以 TM 影像制备黑河流域归一化指数产品为例,基于高性能集群,实现了植被指数快速提取的并行计算方法,并采用对等并行编程模式,通过 C 语言调用 MPI（Message Passing Interface,消息传递接口）和 OpenCV（Open Source Computer Vision Library,开源计算机视觉库）函数库,实现了 NDVI（Normalized Difference Vegetation Index,归一化植被指数）的并行计算,获得了黑河流域的 NDVI。性能测试表明,并行计算可以显著提高遥感图像处理的速度。文章最后讨论了从原始影像提取植被指数产品的流程。     

数字孪生与平行系统:发展现状、对比及展望

随着物联网、大数据、人工智能（Artificial intelligence,AI）等技术的发展,针对促进新一代信息技术与制造业深度融合、实现制造物理世界与信息世界交互与共融的需要,数字孪生和平行系统技术成为智能制造和复杂系统管理与控制领域研究的热点.本文对数字孪生和平行系统技术的基本概念、技术内涵、相关应用等进行了研究与总结,对比了两者之间的异同,并分析了两者的发展趋势,预期能够给复杂系统管理与控制领域的研究人员提供一定的参考和借鉴.     

Fast and Robust Approximation of Smallest Enclosing Balls in Arbitrary Dimensions

In this paper, an algorithm is introduced that computes an arbitrarily fine approximation of the smallest enclosing ball of a point set in any dimension. This operation is important in, for example, classification, clustering, and data mining. The algorithm is very simple to implement, gives reliable results, and gracefully handles large problem instances in low and high dimensions, as confirmed by both theoretical arguments and empirical evaluation. For example, using a CPU with eight cores, it takes less than two seconds to compute a 1.001‐approximation of the smallest enclosing ball of one million points uniformly distributed in a hypercube in dimension 200. Furthermore, the presented approach extends to a more general class of input objects, such as ball sets.