scholarly journals REACHABILITY PROBLEMS FOR PRODUCTS OF MATRICES IN SEMIRINGS

2006 ◽  
Vol 16 (03) ◽  
pp. 603-627 ◽  
Author(s):  
STÉPHANE GAUBERT ◽  
RICARDO D. KATZ
Keyword(s):  
Matrix Product ◽  
Reachability Problem ◽  
Tropical Semiring ◽  
The Matrix ◽  
Left And Right ◽  
Matrix Vector ◽  
Products Of Matrices

We consider the following matrix reachability problem: given r square matrices with entries in a semiring, is there a product of these matrices which attains a prescribed matrix? Similarly, we define the vector (resp. scalar) reachability problem, by requiring that the matrix product, acting by right multiplication on a prescribed row vector, gives another prescribed row vector (resp. when multiplied on the left and right by prescribed row and column vectors, gives a prescribed scalar). We show that over any semiring, scalar reachability reduces to vector reachability which is equivalent to matrix reachability, and that for any of these problems, the specialization to any r ≥ 2 is equivalent to the specialization to r = 2. As an application of these reductions and of a theorem of Krob, we show that when r = 2, the vector and matrix reachability problems are undecidable over the max-plus semiring (ℤ∪{-∞}, max ,+). These reductions also improve known results concerning the classical zero corner problem. Finally, we show that the matrix, vector, and scalar reachability problems are decidable over semirings whose elements are "positive", like the tropical semiring (ℤ∪{+∞}, min ,+).

scholarly journals Numerical Analysis of Viscoelastic Rotating Beam with Variable Fractional Order Model Using Shifted Bernstein–Legendre Polynomial Collocation Algorithm

2021 ◽  
Vol 5 (1) ◽  
pp. 8
Author(s):  
Cundi Han ◽  
Yiming Chen ◽  
Da-Yan Liu ◽  
Driss Boutat
Keyword(s):  
Numerical Analysis ◽  
Fractional Order ◽  
Governing Equation ◽  
Numerical Solutions ◽  
Bernstein Polynomials ◽  
Matrix Product ◽  
Algebraic Equations ◽  
Rotating Beam ◽  
The Matrix ◽  
The Time Domain

This paper applies a numerical method of polynomial function approximation to the numerical analysis of variable fractional order viscoelastic rotating beam. First, the governing equation of the viscoelastic rotating beam is established based on the variable fractional model of the viscoelastic material. Second, shifted Bernstein polynomials and Legendre polynomials are used as basis functions to approximate the governing equation and the original equation is converted to matrix product form. Based on the configuration method, the matrix equation is further transformed into algebraic equations and numerical solutions of the governing equation are obtained directly in the time domain. Finally, the efficiency of the proposed algorithm is proved by analyzing the numerical solutions of the displacement of rotating beam under different loads.

Selecting optimal SpMV realizations for GPUs via machine learning

2021 ◽  
pp. 109434202199073
Author(s):  
Ernesto Dufrechou ◽  
Pablo Ezzatti ◽  
Enrique S Quintana-Ortí
Keyword(s):  
Machine Learning ◽  
Sparse Matrix ◽  
Machine Learning Techniques ◽  
Optimal Method ◽  
Learning Techniques ◽  
General Rules ◽  
Machine Learning Approach ◽  
The Matrix ◽  
Time And Energy ◽  
Matrix Vector

More than 10 years of research related to the development of efficient GPU routines for the sparse matrix-vector product (SpMV) have led to several realizations, each with its own strengths and weaknesses. In this work, we review some of the most relevant efforts on the subject, evaluate a few prominent routines that are publicly available using more than 3000 matrices from different applications, and apply machine learning techniques to anticipate which SpMV realization will perform best for each sparse matrix on a given parallel platform. Our numerical experiments confirm the methods offer such varied behaviors depending on the matrix structure that the identification of general rules to select the optimal method for a given matrix becomes extremely difficult, though some useful strategies (heuristics) can be defined. Using a machine learning approach, we show that it is possible to obtain unexpensive classifiers that predict the best method for a given sparse matrix with over 80% accuracy, demonstrating that this approach can deliver important reductions in both execution time and energy consumption.

scholarly journals Internet Photogrammetry for Inspection of Seaports

2017 ◽  
Vol 24 (s1) ◽  
pp. 174-181 ◽  
Author(s):  
Zygmunt Paszotta ◽  
Malgorzata Szumilo ◽  
Jakub Szulwic
Keyword(s):  
Fundamental Matrix ◽  
Laser Scanning ◽  
3D Models ◽  
Digital Cameras ◽  
Correct Orientation ◽  
The Matrix ◽  
Transport Safety ◽  
Left And Right ◽  
Value Decomposition ◽  
The Relationship

Abstract This paper intends to point out the possibility of using Internet photogrammetry to construct 3D models from the images obtained by means of UAVs (Unmanned Aerial Vehicles). The solutions may be useful for the inspection of ports as to the content of cargo, transport safety or the assessment of the technical infrastructure of port and quays. The solution can be a complement to measurements made by using laser scanning and traditional surveying methods. In this paper the authors recommend a solution useful for creating 3D models from images acquired by the UAV using non-metric images from digital cameras. The developed algorithms, created and presented software allows to generate 3D models through the Internet in two modes: anaglyph and display in shutter systems. The problem of 3D image generation in photogrammetry is solved by using epipolar images. The appropriate method was presented by Kreiling in 1976. However, it applies to photogrammetric images for which the internal orientation is known. In the case of digital images obtained with non-metric cameras it is required to use another solution based on the fundamental matrix concept, introduced by Luong in 1992. In order to determine the matrix which defines the relationship between left and right digital image it is required to have at least eight homologous points. To determine the solution it is necessary to use the SVD (singular value decomposition). By using the fundamental matrix the epipolar lines are determined, which makes the correct orientation of images making stereo pairs, possible. The appropriate mathematical bases and illustrations are included in the publication.

Application of Spline Collocation Method in Analysis of Beam and Continuous Beam

2003 ◽  
Vol 19 (2) ◽  
pp. 319-326 ◽  
Author(s):  
Lai-Yun Wu ◽  
Yang-Tzung Chen
Keyword(s):  
Collocation Method ◽  
Differential Quadrature Method ◽  
Spline Functions ◽  
Continuous Beam ◽  
Spline Collocation ◽  
Spline Collocation Method ◽  
The Matrix ◽  
Weighting Coefficients ◽  
Matrix Vector ◽  
Excellent Accuracy

ABSTRACTIn this paper, spline collocation method (SCM) is successfully extended to solve the generalized problems of beam structures. The spline functions in SCM are re-formulated by finite difference method in a systematical way that is easily understood by engineers. The manipulation of SCM is further simplified by the introduction of quintic table so that the matrix-vector governing equation can be easily formulated to solve the weighting coefficients. SCM is first examined by the problems of a generalized single-span beam undergoing various types of loadings and boundary conditions, and it is then extended to the problems of continuous beam with multiple spans. By comparing with available analytical results, differential quadrature method (DQM), if any, excellent accuracy in deflection is achieved.

Advanced three-dimensional electromagnetic modeling using a nested integral equation approach

2021 ◽  
Author(s):  
Chaojian Chen ◽  
Mikhail Kruglyakov ◽  
Alexey Kuvshinov
Keyword(s):  
Integral Equation ◽  
Three Dimensional ◽  
Region Of Interest ◽  
Electromagnetic Modeling ◽  
Multi Scale ◽  
Scale Modeling ◽  
Uniform Grids ◽  
The Matrix ◽  
Integral Equation Approach ◽  
Matrix Vector

Summary Most of the existing three-dimensional (3-D) electromagnetic (EM) modeling solvers based on the integral equation (IE) method exploit fast Fourier transform (FFT) to accelerate the matrix-vector multiplications. This in turn requires a laterally-uniform discretization of the modeling domain. However, there is often a need for multi-scale modeling and inversion, for instance, to properly account for the effects of non-uniform distant structures, and at the same time, to accurately model the effects from local anomalies. In such scenarios, the usage of laterally-uniform grids leads to excessive computational loads, both in terms of memory and time. To alleviate this problem, we developed an efficient 3-D EM modeling tool based on a multi-nested IE approach. Within this approach, the IE modeling is first performed at a large domain and on a (laterally-uniform) coarse grid, and then the results are refined in the region of interest by performing modeling at a smaller domain and on a (laterally-uniform) denser grid. At the latter stage, the modeling results obtained at the previous stage are exploited. The lateral uniformity of the grids at each stage allows us to keep using the FFT for the matrix-vector multiplications. An important novelty of the paper is a development of a “rim domain” concept which further improves the performance of the multi-nested IE approach. We verify the developed tool on both idealized and realistic 3-D conductivity models, and demonstrate its efficiency and accuracy.

scholarly journals Improved Generalized Single-Source Tangential Equivalence Principle Algorithm with Contact-Region Modeling Method for Array Structures

2018 ◽  
Vol 2018 ◽  
pp. 1-11
Author(s):  
Yao Han ◽  
Hanru Shao ◽  
Jianfeng Dong
Keyword(s):  
Equivalence Principle ◽  
Contact Region ◽  
Near Field ◽  
Single Source ◽  
Matrix Vector Multiplication ◽  
The Matrix ◽  
Array Structures ◽  
Fast Multipole Algorithm ◽  
Matrix Vector ◽  
Equivalence Principle Algorithm

An improved generalized single-source tangential equivalence principle algorithm (GSST-EPA) is proposed for analyzing array structures with connected elements. In order to use the advantages of GSST-EPA, the connected array elements are decomposed and computed by a contact-region modeling (CRM) method, which makes that each element has the same meshes. The unknowns of elements can be transferred onto the equivalence surfaces by GSST-EPA. The scattering matrix in GSST-EPA needs to be solved and stored only once due to the same meshes for each element. The shift invariant of translation matrices is also used to reduce the computation of near-field interaction. Furthermore, the multilevel fast multipole algorithm (MLFMA) is used to accelerate the matrix-vector multiplication in the GSST-EPA. Numerical results are shown to demonstrate the accuracy and efficiency of the proposed method.

scholarly journals 2D DOA Estimation with a Two-Parallel Array Consisting of Two Uniform Large-Spacing Linear Arrays

2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Sheng Liu ◽  
Jing Zhao ◽  
Yu Zhang
Keyword(s):  
Mutual Coupling ◽  
Elevation Angle ◽  
Doa Estimation ◽  
Matrix Product ◽  
Linear Arrays ◽  
Parallel Array ◽  
Propagator Method ◽  
The Matrix ◽  
2D Doa Estimation ◽  
Estimation Precision

In this paper, an improved propagator method (PM) is proposed by using a two-parallel array consisting of two uniform large-spacing linear arrays. Because of the increase of element spacing, the mutual coupling between two sensors can be reduced. Firstly, two matrices containing elevation angle information are obtained by PM. Then, by performing EVD of the product of the two matrices, the elevation angles of incident signals can be estimated without direction ambiguity. At last, the matrix product is used again to obtain the estimations of azimuth angles. Compared with the existed PM algorithms based on conventional uniform two-parallel linear array, the proposed PM algorithm based on the large-spacing linear arrays has higher estimation precision. Many simulation experiments are presented to verify the effect of proposed scheme in reducing the mutual coupling and improving estimation precision.

Sign in / Sign up

Export Citation Format

Share Document