The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Depth recovery is one of the classical problems of computer vision. Many methods have been developed that address this issue. However, each of them has specific behavior depending on the image contents, acquisition system, computation time, etc. The variety of methods is due to the non uniqueness of the matching process involved in depth recovery from a pair of images of a given scene. The presented...
The principal aim of this work is the presentation of a symbolic calculation computer analysis for exploring electromagnetic fields for not inertial observer. Based on Frölicher-Nijenhuis super-Lie -algebra, we developed a learning environment for axiomatic classical electromagnetics and electrodynamics. A collection of programs developed on Mathematical programming environment has...
It is well-known that the classical univariate orthogonal polynomials give rise to highly efficient Gaussian quadrature rules. We show how the classical orthogonal polynomials can be generalized to a multivariate setting and how this generalization leads to Gaussian cubature rules for specific families of multivariate polynomials. The multivariate homogeneous orthogonal functions that we discuss...
In this paper we interpret the Berlekamp-Massey algorithm (BMA) for synthesis of linear feedback shift register (LFSR) as an algorithm computing Pade approximants for Laurent series over arbitrary field. This interpretation of the BMA is based on a iterated procedure for computing of the sequence of polynomials orthogonal to some sequence of polynomial spaces with scalar product depending on the given...
In recent paper [5] a procedure was developed to control a step size for Runge-Kutta methods. Here, we present a new version of that step size selection to make it better in exceptional cases when the old version does not work appropriately.
In recent papers [6]–[10] the technique for local and global errors estimation and the local-global step size control have been presented to solve both ordinary differential equations and semi-explicit index 1 differential-algebraic systems by multistep methods with any automatically obtained reasonable accuracy. Now we describe the object oriented library INTEGRATOR (ver. 1.0) built in C++ for portability...
In this paper, we study the reconstructing of signals based on regular and irregular incremental integral samples in some non-bandlimited space-—spline subspace, and we obtain reconstructing formulas with a new method.
The article presents two approaches to the WZ factorization – specific ones for solving Markov chains – and the results of their vectorization and parallelization.
One of the global approach for solving the two dimensional inverse parabolic problem is the predictor corrector which takes place for evaluating the pair (u,p) and adjusting the evaluation for the desired accuracy. In this work we will present a new parallel algorithm(of non iterative type) for solving two or higher dimensional inverse control problem.
In this paper we present a-posteriori error estimator for the mixed formulation of linear parabolic problem, and we use them in designing an efficient adaptive algorithm. Our space-time discretization consist of lowest order Raviart-Thomas finite element over graded meshes, and discontinuous Galerkin method with varying time-steps.
In this paper we show an analysis of different parallel numerical libraries for solving the linear systems associated to the electron continuity equation from the 3D simulation of the semiconductor devices. We use domain decomposition techniques, such as Additive Schwarz, Multicolor SOR or Schur Complement methods, in order to find the best method of resolution considering the minimization of the...
In the rapidly growing field of computational methods within the discipline of Metabolic Engineering, the simulation of instationary13C labeling experiments is a new research focus. The underlying mathematical model is a high-dimensional cascaded system of differential equations and must be exploited to obtain efficient simulation algorithms. Additionally the sensitivity matrices of the...
The recursive spectral bisection for the k-way graph partition has been underestimated because it tries to balance the bipartition strictly. However, by loosening the balancing constraint, the spectral bisection can identify clusters efficiently. We propose a k-way graph partitioning algorithm based on clustering using recursive spectral bisection. After a graph is divided into a partition, the partition...
We consider the categorical concepts of a ‘network of networks’: (a) each node is a host network (1-network or 1-graph) and super-links are analogous to a graph-functor, i.e. this is (1,1)-network; (b) 2-network where there are 2-links among 1-links. The general notion of network-morphism is proposed.
This paper presents an in-place pseudo linear average case radix sorting algorithm. The proposed algorithm, MSL (Map Shuffle Loop) is a modification of the ARL algorithm. The MSL permutation loop is faster than the ARL counterpart since it searches for the root of the next permutation cycle group by group. The permutation cycle loop maps a key to its target group and shuffles the input array. The...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.