scholarly journals A note on adaptivity in factorized approximate inverse preconditioning

2020 ◽  
Vol 28 (2) ◽  
pp. 149-159
Author(s):  
Jiří Kopal ◽  
Miroslav Rozložník ◽  
Miroslav Tůma
Keyword(s):  
Large Scale ◽  
Condition Numbers ◽  
Algebraic Equations ◽  
Approximate Factorization ◽  
Approximate Inverse ◽  
Linear Algebraic Equations ◽  
Wide Range ◽  
The Matrix ◽  
Preconditioned Iterative ◽  
Principal Submatrices

AbstractThe problem of solving large-scale systems of linear algebraic equations arises in a wide range of applications. In many cases the preconditioned iterative method is a method of choice. This paper deals with the approximate inverse preconditioning AINV/SAINV based on the incomplete generalized Gram–Schmidt process. This type of the approximate inverse preconditioning has been repeatedly used for matrix diagonalization in computation of electronic structures but approximating inverses is of an interest in parallel computations in general. Our approach uses adaptive dropping of the matrix entries with the control based on the computed intermediate quantities. Strategy has been introduced as a way to solve di cult application problems and it is motivated by recent theoretical results on the loss of orthogonality in the generalized Gram– Schmidt process. Nevertheless, there are more aspects of the approach that need to be better understood. The diagonal pivoting based on a rough estimation of condition numbers of leading principal submatrices can sometimes provide inefficient preconditioners. This short study proposes another type of pivoting, namely the pivoting that exploits incremental condition estimation based on monitoring both direct and inverse factors of the approximate factorization. Such pivoting remains rather cheap and it can provide in many cases more reliable preconditioner. Numerical examples from real-world problems, small enough to enable a full analysis, are used to illustrate the potential gains of the new approach.

scholarly journals A Simple Algorithm for Finding a Non-negative Basic Solution of a System of Linear Algebraic Equations

2021 ◽  
Vol 28 (3) ◽  
pp. 234-237
Author(s):  
Gleb D. Stepanov
Keyword(s):  
Simplex Method ◽  
Gaussian Elimination ◽  
Simple Algorithm ◽  
Basic Solution ◽  
Algebraic Equations ◽  
Linear Algebraic Equations ◽  
The Matrix ◽  
Linear Programming Problems ◽  
Two Stages ◽  
Computational Resources

This article describes an algorithm for obtaining a non-negative basic solution of a system of linear algebraic equations. This problem, which undoubtedly has an independent interest, in particular, is the most time-consuming part of the famous simplex method for solving linear programming problems.Unlike the artificial basis Orden’s method used in the classical simplex method, the proposed algorithm does not attract artificial variables and economically consumes computational resources.The algorithm consists of two stages, each of which is based on Gaussian exceptions. The first stage coincides with the main part of the Gaussian complete exclusion method, in which the matrix of the system is reduced to the form with an identity submatrix. The second stage is an iterative cycle, at each of the iterations of which, according to some rules, a resolving element is selected, and then a Gaussian elimination step is performed, preserving the matrix structure obtained at the first stage. The cycle ends either when the absence of non-negative solutions is established, or when one of them is found.Two rules for choosing a resolving element are given. The more primitive of them allows for ambiguity of choice and does not exclude looping (but in very rare cases). Use of the second rule ensures that there is no looping.

Solving Systems of Linear Algebraic Equations with the Use of an Selective Regularization

2021 ◽  
pp. 11-15
Author(s):  
Vladimir N. Lutay
Keyword(s):  
Diagonal Element ◽  
Decomposition Process ◽  
Algebraic Equations ◽  
Original Matrix ◽  
Triangular Matrices ◽  
First Case ◽  
Linear Algebraic Equations ◽  
The Matrix ◽  
Gauss Method ◽  
Scalar Products

The solution of systems of linear algebraic equations, which matrices can be poorly conditioned or singular is considered. As a solution method, the original matrix is decomposed into triangular components by Gauss or Chole-sky with an additional operation, which consists in increasing the small or zero diagonal terms of triangular matrices during the decomposition process. In the first case, the scalar products calculated during decomposition are divided into two positive numbers such that the first is greater than the second, and their sum is equal to the original one. In further operations, the first number replaces the scalar product, as a result of which the value of the diagonal term increases, and the second number is stored and used after the decomposition process is completed to correct the result of calculations. This operation increases the diagonal elements of triangular matrices and prevents the appearance of very small numbers in the Gauss method and a negative root expression in the Cholesky method. If the matrix is singular, then the calculated diagonal element is zero, and an arbitrary positive number is added to it. This allows you to complete the decomposition process and calculate the pseudo-inverse matrix using the Greville method. The results of computational experiments are presented.

A Linearized Two-Dimensional Theory for High-Speed Hydrofoils Near the Free Surface

1966 ◽  
Vol 10 (01) ◽  
pp. 25-48
Author(s):  
Richard P. Bernicker
Keyword(s):  
Direct Problem ◽  
High Speed ◽  
Two Dimensional ◽  
Algebraic Equations ◽  
Pressure Loading ◽  
Dimensional Theory ◽  
Linear Algebraic Equations ◽  
The Matrix ◽  
Sectional Shape ◽  
Infinite Set

A linearized two-dimensional theory is presented for high-speed hydrofoils near the free surface. The "direct" problem (hydrofoil shape specified) is attacked by replacing the actual foil with vortex and source sheets. The resulting integral equation for the strength of the singularity distribution is recast into an infinite set of linear algebraic equations relating the unknown constants in a Glauert-type vorticity expansion to the boundary condition on the foil. The solution is achieved using a matrix inversion technique and it is found that the matrix relating the known and unknown constants is a function of depth of submergence alone. Inversion of this matrix at each depth allows the vorticity constants to be calculated for any arbitrary foil section by matrix multiplication. The inverted matrices have been calculated for several depth-to-chord ratios and are presented herein. Several examples for specific camber and thickness distributions are given, and results indicate significant effects in the force characteristics at depths less than one chord. In particular, thickness effects cause a loss of lift at shallow submergences which may be an appreciable percentage of the total design lift. The second part treats the "indirect" problem of designing a hydrofoil sectional shape at a given depth to achieve a specified pressure loading. Similar to the "direct" problem treated in the first part, integral equations are derived for the camber and thickness functions by replacing the actual foil by vortex and source sheets. The solution is obtained by recasting these equations into an infinite set of linear algebraic equations relating the constants in a series expansion of the foil geometry to the known pressure boundary conditions. The matrix relating the known and unknown constants is, again, a function of the depth of submergence alone, and inversion techniques allow the sectional shape to be determined for arbitrary design pressure distributions. Several examples indicate the procedure and results are presented for the change in sectional shape for a given pressure loading as the depth of submergence of the foil is decreased.

scholarly journals Diffraction of the field of vertical electric dipole on the spiral conductive sphere in the presence of a cone

2018 ◽  
Keyword(s):  
Hilbert Space ◽  
Electric Dipole ◽  
Infinite System ◽  
Matrix Operator ◽  
Algebraic Equations ◽  
Problem Statement ◽  
Vertical Electric Dipole ◽  
Linear Algebraic Equations ◽  
Method Of Regularization ◽  
The Matrix

The problem of diffraction of a vertical electric dipole field on a spiral conductive sphere and a cone has been solved. By the method of regularization of the matrix operator of the problem, an infinite system of linear algebraic equations of the second kind with a compact matrix operator in Hilbert space $\ell_2$ is obtained. Some limiting variants of the problem statement are considered.

scholarly journals USE OF THE LINK RANKING METHOD TO EVALUATE SCIENTIFIC ACTIVITIES OFSCIENTIFIC SPACE SUBJECTS

2020 ◽  
Author(s):  
A. Biloshchytskyi ◽  
А. Kuchansky ◽  
Yu. Andrashko ◽  
S. Biloshchytska
Keyword(s):  
Higher Education ◽  
Research Process ◽  
Algebraic Equations ◽  
Research Activity ◽  
Structural Units ◽  
Scientific Publications ◽  
Planning Stage ◽  
Research Results ◽  
Linear Algebraic Equations ◽  
The Matrix

A modification of the PageRank method based on link ranking is proposed to evaluate the research results of subjects of the scientific space, taking into account self-citation. The method of reducing the influence of self-citation on the final evaluation of the results of research activity of subjects of the scientific space is described. The evaluation of the results of research is calculated using the modified PR-q method, taking into account self-citation as a solution of a system of linear algebraic equations, matrix of which consists of coefficients determined by the number of citations of publications of one scientist in the publications of another scientist. The described method can be used for the task of evaluating the activity of the components of the scientific space: scientists, higher education institutions and their structural units. For the task of evaluating the research activity of subjects of the scientific space, a method based on link ranking (PageRank method for web pages) and taking into account the self-citation of scientists is proposed. The latter allows for an adequate assessment, taking into account the abuses associated with the authors excessive self-citation. The essence of the constructed method lies in the construction of a system of linear algebraic equations, whose coefficients of the matrix reflect the citations of some scientists by others in the citation network of scientific publications. The value of the coefficients of the matrix of such a system of linear algebraic equations is subject to certain restrictions, which allow to reduce the influence of the factor of excessive self-citation of the author on his overall assessment of research activity. The described method can be used to calculate the complex evaluation of the components of the scientific space: the scientist, the institution of higher education and its separate structural units. Evaluating research results provides an opportunity to verify the relevance of the research process to the goals identified at the planning stage and, if necessary, to adjust the progress of those studies. Also, the calculation of research evaluations of the components (objects and entities) of the scientific space is a powerful tool for managing research projects.

Calculation of the Magnetization of Permanent Magnets, Based on the Method for Solving the Inverse Problem Using Parallel Calculations

2021 ◽  
Vol 64 (1) ◽  
pp. 13-21
Author(s):  
Petr Denisov ◽  
◽  
Anna Balaban ◽  
Keyword(s):  
Inverse Problem ◽  
Permanent Magnets ◽  
Parallel Implementation ◽  
Boundary Integral Equations ◽  
Boundary Integral ◽  
Tikhonov Regularization Method ◽  
Field Pattern ◽  
Algebraic Equations ◽  
Linear Algebraic Equations ◽  
The Matrix

The article proposes the modification of a technique for assessing the magnetization of permanent magnets from the known field pattern. The identification method is based on solving an ill-conditioned system of linear algebraic equations by the Tikhonov regularization method. The method of boundary integral equations based on scalar potentials is used to compile the matrix of coefficients. The article presents the algorithm that uses parallel computations when performing the most time-consuming operations to reduce the time for solving the inverse problem. In order to check the proposed method, a program was developed that allows to simulate the measurement process: to calculate the direct problem and find the magnetic induction at the points of the air gap, then introduce the error into the "measurement results" and solve the inverse problem. The results of nu-merical experiments that allow us to evaluate the advantages of parallel implementation using the capabilities of modern multi-core processors are presented.

Stress Concentration in a Stretched Cylindrical Shell With Two Equal Circular Holes

1975 ◽  
Vol 42 (1) ◽  
pp. 105-109 ◽  
Author(s):  
P. Seide ◽  
A. S. Hafiz
Keyword(s):  
Cylindrical Shell ◽  
Stress Concentration ◽  
Stress Distribution ◽  
Circular Cylindrical Shell ◽  
Algebraic Equations ◽  
Linear Algebraic Equations ◽  
Wide Range ◽  
Circular Holes ◽  
Limiting Case ◽  
Infinite Set

In this investigation, the stress distribution due to uniaxial tension of an infinitely long, thin, circular cylindrical shell with two equal small circular holes located along a generator is obtained. The problem is solved by the superposition of solutions previously obtained for a cylinder with a single circular hole. The satisfaction of boundary conditions on the free surfaces of the holes, together with uniqueness and overall equilibrium conditions, yields an infinite set of linear algebraic equations involving Hankel and Bessel functions of complex argument. The stress distribution along the boundaries of the holes and the interior of the shell is investigated. In particular, the value of the maximum stress is calculated for a wide range of parameters, including the limiting case in which the holes almost touch and the limiting case in which the radius of the cylinder becomes very large. As is the case for a flat plate, the stress-concentration factor is reduced by the presence of another hole.

Ideal Compliant Joints and Integration of Computer Aided Design and Analysis

2014 ◽  
Author(s):  
Ashraf M. Hamed ◽  
Paramsothy Jayakumar ◽  
Michael D. Letherwood ◽  
David J. Gorsich ◽  
Antonio M. Recuero ◽  
...  
Keyword(s):  
Computer Aided Design ◽  
Large Scale ◽  
Algebraic Equations ◽  
B Spline ◽  
Constraint Equations ◽  
Compliant Joints ◽  
Linear Algebraic Equations ◽  
Dependent Variables ◽  
Computer Aided ◽  
Aided Design

This paper discusses fundamental issues related to the integration of computer aided design and analysis (I-CAD-A) by introducing a new class of ideal compliant joints that account for the distributed inertia and elasticity. The absolute nodal coordinate formulation (ANCF) degrees of freedom are used in order to capture modes of deformation that cannot be captured using existing formulations. The ideal compliant joints developed can be formulated, for the most part, using linear algebraic equations, allowing for the elimination of the dependent variables at a preprocessing stage, thereby significantly reducing the problem dimension and array storage needed. Furthermore, the constraint equations are automatically satisfied at the position, velocity, and acceleration levels. When using the proposed approach to model large scale chain systems, differences in computational efficiency between the augmented formulation and the recursive methods are eliminated, and the CPU times resulting from the use of the two formulations become similar regardless of the complexity of the system. The elimination of the joint constraint equations and the associated dependent variables also contribute to the solution of a fundamental singularity problem encountered in the analysis of closed loop chains and mechanisms by eliminating the need to repeatedly change the chain or mechanism independent coordinates. It is shown that the concept of the knot multiplicity used in computational geometry methods, such as B-spline and NURBS (Non-Uniform Rational B-Spline), to control the degree of continuity at the breakpoints is not suited for the formulation of many ideal compliant joints. As explained in this paper, this issue is closely related to the inability of B-spline and NURBS to model structural discontinuities. Another contribution of this paper is demonstrating that large deformation ANCF finite elements can be effective, in some MBS application, in solving small deformation problems. This is demonstrated using a heavily constrained tracked vehicle with flexible link chains. Without using the proposed approach, modeling such a complex system with flexible links can be very challenging. The analysis presented in this paper also demonstrates that adding significant model details does not necessarily imply increasing the complexity of the MBS algorithm.

Parallel Computation of a Mixed Convection Problem Using Fully-Coupled and Segregated Algorithms

2004 ◽  
Author(s):  
Masoud Darbandi ◽  
Araz Banaeizadeh ◽  
Gerry E. Schneider
Keyword(s):  
Mixed Convection ◽  
Parallel Computation ◽  
Large Scale ◽  
Stokes Equations ◽  
Computational Time ◽  
Linear Algebraic Equations ◽  
The Matrix ◽  
Convection Problem ◽  
Run Time ◽  
Fully Coupled

In this work, parallel solution of the Navier-Stokes equations for a mixed convection heat problem is achieved using a finite-element-based finite-volume method in fully coupled and semi coupled algorithms. A major drawback with the implicit methods is the need for solving the huge set of linear algebraic equations in large scale problems. The current parallel computation is developed on distributed memory machines. The matrix decomposition and solution are carried out using PETSc library. In the fully coupled algorithm, there is a 36-diagonal global matrix for the two-dimensional governing equations. In order to reduce the computational time, the matrix is suitably broken in several sub-matrices and they are subsequently solved in a segregated manner. This approach results in four 9-diagonal matrices. Different sparse solver algorithms are utilized to solve a mixed natural-forced convection problem using either fully-coupled or semi-coupled algorithms. The performance of the solvers are then investigated in solving on a distributed computing environment. The study shows that the iteration run time considerably decreases although the overall run time of the fully coupled algorithm still looks better.

Sign in / Sign up

Export Citation Format

Share Document